2009 |
27 | EE | Marcus Brazil,
D. A. Thomas,
Benny K. Nielsen,
Pawel Winter,
Christian Wulff-Nilsen,
Martin Zachariasen:
A novel approach to phylogenetic trees: d-Dimensional geometric Steiner trees.
Networks 53(2): 104-111 (2009) |
2008 |
26 | EE | Martin Paluszewski,
Pawel Winter:
Protein Decoy Generation Using Branch and Bound with Efficient Bounding.
WABI 2008: 382-393 |
2007 |
25 | EE | K. Hvam,
L. Reinhardt,
Pawel Winter,
Martin Zachariasen:
Some Structural and Geometric Properties of Two-Connected Steiner Networks.
CATS 2007: 85-90 |
24 | EE | K. Hvam,
L. Reinhardt,
Pawel Winter,
Martin Zachariasen:
Bounding component sizes of two-connected Steiner networks.
Inf. Process. Lett. 104(5): 159-163 (2007) |
2005 |
23 | EE | Jeff Abrahamson,
Ali Shokoufandeh,
Pawel Winter:
Euclidean TSP between two nested convex obstacles.
Inf. Process. Lett. 95(2): 370-375 (2005) |
22 | EE | Marcus Brazil,
Pawel Winter,
Martin Zachariasen:
Flexibility of Steiner trees in uniform orientation metrics.
Networks 46(3): 142-153 (2005) |
21 | EE | Pawel Winter,
Martin Zachariasen:
Two-connected Steiner networks: structural properties.
Oper. Res. Lett. 33(4): 395-402 (2005) |
2004 |
20 | EE | Martin Paluszewski,
Pawel Winter,
Martin Zachariasen:
A new paradigm for general architecture routing.
ACM Great Lakes Symposium on VLSI 2004: 202-207 |
19 | EE | Marcus Brazil,
Pawel Winter,
Martin Zachariasen:
Flexibility of Steiner Trees in Uniform Orientation Metrics.
ISAAC 2004: 196-208 |
18 | EE | Marcus Brazil,
Benny K. Nielsen,
Pawel Winter,
Martin Zachariasen:
Rotationally optimal spanning and Steiner trees in uniform orientation metrics.
Comput. Geom. 29(3): 251-263 (2004) |
2002 |
17 | EE | Benny K. Nielsen,
Pawel Winter,
Martin Zachariasen:
An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem.
ESA 2002: 760-771 |
16 | | Pawel Winter:
Optimal Steiner hull algorithm.
Comput. Geom. 23(2): 163-169 (2002) |
15 | | Pawel Winter,
Martin Zachariasen,
Jens Nielsen:
Short trees in polygons.
Discrete Applied Mathematics 118(1-2): 55-72 (2002) |
14 | EE | Benny K. Nielsen,
Pawel Winter,
Martin Zachariasen:
On the location of Steiner points in uniformly-oriented Steiner trees.
Inf. Process. Lett. 83(5): 237-241 (2002) |
1999 |
13 | EE | Martin Zachariasen,
Pawel Winter:
Obstacle-Avoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm.
ALENEX 1999: 282-295 |
12 | EE | David M. Warme,
Pawel Winter,
Martin Zachariasen:
Exact Solutions to Large-scale Plane Steiner Tree Problems.
SODA 1999: 979-980 |
11 | EE | Martin Zachariasen,
Pawel Winter:
Concatenation-Based Greedy Heuristics for the Euclidean Steiner Tree Problem.
Algorithmica 25(4): 418-437 (1999) |
1997 |
10 | EE | Pawel Winter,
Martin Zachariasen:
Euclidean Steiner minimum trees: An improved exact algorithm.
Networks 30(3): 149-166 (1997) |
1996 |
9 | EE | Andrzej Proskurowski,
Maciej M. Syslo,
Pawel Winter:
Plane Embeddings of 2-trees and Biconnected Partial 2-Trees.
SIAM J. Discrete Math. 9(4): 577-596 (1996) |
1994 |
8 | EE | Pawel Winter,
Maciej M. Syslo:
Maximal Outerplanar Graphs with Perfect Face-independent Vertex Covers.
Discrete Applied Mathematics 54(2-3): 267-280 (1994) |
1993 |
7 | EE | Pawel Winter:
Auclidean Steiner Minimal Trees with Obstacles and Steiner Visibility Graphs.
Discrete Applied Mathematics 47(2): 187-206 (1993) |
1992 |
6 | | Pawel Winter,
J. MacGregor Smith:
Path-Distance Heuristics for the Steiner Problem in Undirected Networks.
Algorithmica 7(2&3): 309-327 (1992) |
1990 |
5 | | Maciej M. Syslo,
Pawel Winter:
In-Trees and Plane Embeddings of Outerplanar Graphs.
BIT 30(1): 83-90 (1990) |
1988 |
4 | | Maciej M. Syslo,
Pawel Winter:
Independent Covers in Outerplanar Graphs.
SWAT 1988: 243-254 |
1986 |
3 | | Pawel Winter:
An Algorithm for the Enumeration of Spanning Trees.
BIT 26(1): 44-62 (1986) |
2 | | Pawel Winter:
Generalized Steiner Problem in Series-Parallel Networks.
J. Algorithms 7(4): 549-566 (1986) |
1985 |
1 | | Pawel Winter:
Generalized Steiner Problems in Outerplanar Networks.
BIT 25(3): 485-496 (1985) |