Pawel Winter - RankMe

42 papers A* 1A 2B 2C 1Journal 30Unranked 6

Year	Rank	Type	Title / Venue / Authors
2018	J	`jnl`	The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study. Math. Program. Comput. Daniel Juhl, David M. Warme, Pawel Winter, Martin Zachariasen
2016	B	`conf`	Steiner Tree Heuristic in the Euclidean d-Space Using Bottleneck Distances. SEA Stephan Sloth Lorenzen, Pawel Winter
2015	—	`conf`	Alpha Complexes in Protein Structure Prediction. BIOINFORMATICS Pawel Winter, Rasmus Fonseca
2012	J	`jnl`	Adjustable Chain Trees for Proteins. J. Comput. Biol. Pawel Winter, Rasmus Fonseca
2012	J	`jnl`	Bounding Volumes for Proteins: A Comparative Study. J. Comput. Biol. Rasmus Fonseca, Pawel Winter
2011	—	`conf`	Protein Packing Quality Using Delaunay Complexes. ISVD Rasmus Fonseca, Pawel Winter, Kevin Karplus
2011	J	`jnl`	Ranking Beta Sheet Topologies with Applications to Protein Structure Prediction. J. Math. Model. Algorithms Rasmus Fonseca, Glennie Helles, Pawel Winter
2010	J	`jnl`	Protein Structure Prediction Using Bee Colony Optimization Metaheuristic. J. Math. Model. Algorithms Rasmus Fonseca, Martin Paluszewski, Pawel Winter
2009	J	`jnl`	A novel approach to phylogenetic trees: Networks Marcus Brazil, Doreen A. Thomas, Benny K. Nielsen, Pawel Winter, Christian Wulff-Nilsen, Martin Zachariasen
2009	—	`conf`	Alpha Shapes and Proteins. ISVD Pawel Winter, Henrik Sterner, Peter Sterner
2008	C	`conf`	Protein Decoy Generation Using Branch and Bound with Efficient Bounding. WABI Martin Paluszewski, Pawel Winter
2007	J	`jnl`	Bounding component sizes of two-connected Steiner networks. Inf. Process. Lett. Kenneth Hvam, Line Blander Reinhardt, Pawel Winter, Martin Zachariasen
2007	—	`conf`	Some Structural and Geometric Properties of Two-Connected Steiner Networks. CATS Kenneth Hvam, Line Blander Reinhardt, Pawel Winter, Martin Zachariasen
2006	J	`jnl`	Reconstructing protein structure from solvent exposure using tabu search. Algorithms Mol. Biol. Martin Paluszewski, Thomas Hamelryck, Pawel Winter
2005	J	`jnl`	Euclidean TSP between two nested convex obstacles. Inf. Process. Lett. Jeff Abrahamson, Ali Shokoufandeh, Pawel Winter
2005	J	`jnl`	Flexibility of Steiner trees in uniform orientation metrics. Networks Marcus Brazil, Pawel Winter, Martin Zachariasen
2005	J	`jnl`	Two-connected Steiner networks: structural properties. Oper. Res. Lett. Pawel Winter, Martin Zachariasen
2004	—	`conf`	A new paradigm for general architecture routing. ACM Great Lakes Symposium on VLSI Martin Paluszewski, Pawel Winter, Martin Zachariasen
2004	B	`conf`	Flexibility of Steiner Trees in Uniform Orientation Metrics. ISAAC Marcus Brazil, Pawel Winter, Martin Zachariasen
2004	J	`jnl`	Rotationally optimal spanning and Steiner trees in uniform orientation metrics. Comput. Geom. Marcus Brazil, Benny K. Nielsen, Pawel Winter, Martin Zachariasen
2002	A	`conf`	An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem. ESA Benny K. Nielsen, Pawel Winter, Martin Zachariasen
2002	J	`jnl`	On the location of Steiner points in uniformly-oriented Steiner trees. Inf. Process. Lett. Benny K. Nielsen, Pawel Winter, Martin Zachariasen
2002	J	`jnl`	Optimal Steiner hull algorithm. Comput. Geom. Pawel Winter
2002	J	`jnl`	Short trees in polygons. Discret. Appl. Math. Pawel Winter, Martin Zachariasen, Jens Nielsen
1999	J	`jnl`	Concatenation-Based Greedy Heuristics for the Euclidean Steiner Tree Problem. Algorithmica Martin Zachariasen, Pawel Winter
1999	A*	`conf`	Exact Solutions to Large-scale Plane Steiner Tree Problems. SODA David M. Warme, Pawel Winter, Martin Zachariasen
1999	A	`conf`	Obstacle-Avoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm. ALENEX Martin Zachariasen, Pawel Winter
1997	J	`jnl`	Euclidean Steiner minimum trees: An improved exact algorithm. Networks Pawel Winter, Martin Zachariasen
1996	J	`jnl`	Plane Embeddings of 2-trees and Biconnected Partial 2-Trees. SIAM J. Discret. Math. Andrzej Proskurowski, Maciej M. Syslo, Pawel Winter
1995	J	`jnl`	Reductions for the rectilinear steiner tree problem. Networks Pawel Winter
1994	J	`jnl`	Maximal Outerplanar Graphs with Perfect Face-independent Vertex Covers. Discret. Appl. Math. Pawel Winter, Maciej M. Syslo
1993	J	`jnl`	Auclidean Steiner Minimal Trees with Obstacles and Steiner Visibility Graphs. Discret. Appl. Math. Pawel Winter
1992	J	`jnl`	Path-Distance Heuristics for the Steiner Problem in Undirected Networks. Algorithmica Pawel Winter, J. MacGregor Smith
1991	J	`jnl`	Steiner minimal trees for three points with one convex polygonal obstacle. Ann. Oper. Res. Pawel Winter, J. MacGregor Smith
1990	J	`jnl`	In-Trees and Plane Embeddings of Outerplanar Graphs. BIT Maciej M. Syslo, Pawel Winter
1988	—	`conf`	Independent Covers in Outerplanar Graphs. SWAT Maciej M. Syslo, Pawel Winter
1987	J	`jnl`	Steiner problem in Halin networks. Discret. Appl. Math. Pawel Winter
1987	J	`jnl`	Steiner problem in networks: A survey. Networks Pawel Winter
1986	J	`jnl`	An Algorithm for the Enumeration of Spanning Trees. BIT Pawel Winter
1986	J	`jnl`	Generalized Steiner Problem in Series-Parallel Networks. J. Algorithms Pawel Winter
1985	J	`jnl`	An algorithm for the steiner problem in the euclidean plane. Networks Pawel Winter
1985	J	`jnl`	Generalized Steiner Problems in Outerplanar Networks. BIT Pawel Winter