Pawel Winter

According to our database, Pawel Winter authored at least 41 papers between 1985 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2018

The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study.

Daniel Juhl, David M. Warme, Pawel Winter, Martin Zachariasen

Math. Program. Comput., 2018

2016

Steiner Tree Heuristic in the Euclidean d-Space Using Bottleneck Distances.

Stephan Sloth Lorenzen, Pawel Winter

Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

2015

Alpha Complexes in Protein Structure Prediction.

Pawel Winter, Rasmus Fonseca

Proceedings of the BIOINFORMATICS 2015, 2015

2012

Adjustable Chain Trees for Proteins.

Pawel Winter, Rasmus Fonseca

J. Comput. Biol., 2012

Bounding Volumes for Proteins: A Comparative Study.

Rasmus Fonseca, Pawel Winter

J. Comput. Biol., 2012

2011

Ranking Beta Sheet Topologies with Applications to Protein Structure Prediction.

Rasmus Fonseca, Glennie Helles, Pawel Winter

J. Math. Model. Algorithms, 2011

Protein Packing Quality Using Delaunay Complexes.

Rasmus Fonseca, Pawel Winter, Kevin Karplus

Proceedings of the Eighth International Symposium on Voronoi Diagrams in Science and Engineering, 2011

2010

Protein Structure Prediction Using Bee Colony Optimization Metaheuristic.

Rasmus Fonseca, Martin Paluszewski, Pawel Winter

J. Math. Model. Algorithms, 2010

2009

A novel approach to phylogenetic trees: <i>d</i>-Dimensional geometric Steiner trees.

Marcus Brazil, Doreen A. Thomas, Benny K. Nielsen, Pawel Winter, Christian Wulff-Nilsen, Martin Zachariasen

Networks, 2009

Alpha Shapes and Proteins.

Pawel Winter, Henrik Sterner, Peter Sterner

Proceedings of the Sixth International Symposium on Voronoi Diagrams, 2009

2008

Protein Decoy Generation Using Branch and Bound with Efficient Bounding.

Martin Paluszewski, Pawel Winter

Proceedings of the Algorithms in Bioinformatics, 8th International Workshop, 2008

2007

Bounding component sizes of two-connected Steiner networks.

Kenneth Hvam, Line Blander Reinhardt, Pawel Winter, Martin Zachariasen

Inf. Process. Lett., 2007

Some Structural and Geometric Properties of Two-Connected Steiner Networks.

Kenneth Hvam, Line Blander Reinhardt, Pawel Winter, Martin Zachariasen

Proceedings of the Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). January 30, 2007

2006

Reconstructing protein structure from solvent exposure using tabu search.

Martin Paluszewski, Thomas Hamelryck, Pawel Winter

Algorithms Mol. Biol., 2006

2005

Two-connected Steiner networks: structural properties.

Pawel Winter, Martin Zachariasen

Oper. Res. Lett., 2005

Flexibility of Steiner trees in uniform orientation metrics.

Marcus Brazil, Pawel Winter, Martin Zachariasen

Networks, 2005

Euclidean TSP between two nested convex obstacles.

Jeff Abrahamson, Ali Shokoufandeh, Pawel Winter

Inf. Process. Lett., 2005

2004

Rotationally optimal spanning and Steiner trees in uniform orientation metrics.

Marcus Brazil, Benny K. Nielsen, Pawel Winter, Martin Zachariasen

Comput. Geom., 2004

A new paradigm for general architecture routing.

Martin Paluszewski, Pawel Winter, Martin Zachariasen

Proceedings of the 14th ACM Great Lakes Symposium on VLSI 2004, 2004

2002

On the location of Steiner points in uniformly-oriented Steiner trees.

Benny K. Nielsen, Pawel Winter, Martin Zachariasen

Inf. Process. Lett., 2002

Short trees in polygons.

Pawel Winter, Martin Zachariasen, Jens Nielsen

Discret. Appl. Math., 2002

Optimal Steiner hull algorithm.

Pawel Winter

Comput. Geom., 2002

An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem.

Benny K. Nielsen, Pawel Winter, Martin Zachariasen

Proceedings of the Algorithms, 2002

1999

Concatenation-Based Greedy Heuristics for the Euclidean Steiner Tree Problem.

Martin Zachariasen, Pawel Winter

Algorithmica, 1999

Exact Solutions to Large-scale Plane Steiner Tree Problems.

David M. Warme, Pawel Winter, Martin Zachariasen

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Obstacle-Avoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm.

Martin Zachariasen, Pawel Winter

Proceedings of the Algorithm Engineering and Experimentation, 1999

1997

Euclidean Steiner minimum trees: An improved exact algorithm.

Pawel Winter, Martin Zachariasen

Networks, 1997

1996

Plane Embeddings of 2-trees and Biconnected Partial 2-Trees.

Andrzej Proskurowski, Maciej M. Syslo, Pawel Winter

SIAM J. Discret. Math., 1996

1995

Reductions for the rectilinear steiner tree problem.

Pawel Winter

Networks, 1995

1994

Maximal Outerplanar Graphs with Perfect Face-independent Vertex Covers.

Pawel Winter, Maciej M. Syslo

Discret. Appl. Math., 1994

1993

Auclidean Steiner Minimal Trees with Obstacles and Steiner Visibility Graphs.

Pawel Winter

Discret. Appl. Math., 1993

1992

Path-Distance Heuristics for the Steiner Problem in Undirected Networks.

Pawel Winter, J. MacGregor Smith

Algorithmica, 1992

1991

Steiner minimal trees for three points with one convex polygonal obstacle.

Pawel Winter, J. MacGregor Smith

Ann. Oper. Res., 1991

1990

In-Trees and Plane Embeddings of Outerplanar Graphs.

Maciej M. Syslo, Pawel Winter

BIT, 1990

1988

Independent Covers in Outerplanar Graphs.

Maciej M. Syslo, Pawel Winter

Proceedings of the SWAT 88, 1988

1987

Steiner problem in networks: A survey.

Pawel Winter

Networks, 1987

Steiner problem in Halin networks.

Pawel Winter

Discret. Appl. Math., 1987

1986

Generalized Steiner Problem in Series-Parallel Networks.

Pawel Winter

J. Algorithms, 1986

An Algorithm for the Enumeration of Spanning Trees.

Pawel Winter

BIT, 1986

1985

An algorithm for the steiner problem in the euclidean plane.

Pawel Winter

Networks, 1985

Generalized Steiner Problems in Outerplanar Networks.

Pawel Winter

BIT, 1985