default search action
Pawel Winter
Person information
- affiliation: University of Copenhagen, Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j30]Daniel Juhl, David M. Warme, Pawel Winter, Martin Zachariasen
:
The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study. Math. Program. Comput. 10(4): 487-532 (2018) - 2016
- [c12]Stephan Sloth Lorenzen
Steiner Tree Heuristic in the Euclidean d-Space Using Bottleneck Distances. SEA 2016: 217-230 - 2015
- [c11]Pawel Winter, Rasmus Fonseca:
Alpha Complexes in Protein Structure Prediction. BIOINFORMATICS 2015: 178-182 - 2012
- [j29]Pawel Winter
Adjustable Chain Trees for Proteins. J. Comput. Biol. 19(1): 83-99 (2012) - [j28]Rasmus Fonseca
Bounding Volumes for Proteins: A Comparative Study. J. Comput. Biol. 19(10): 1203-1213 (2012) - 2011
- [j27]Rasmus Fonseca
Ranking Beta Sheet Topologies with Applications to Protein Structure Prediction. J. Math. Model. Algorithms 10(4): 357-369 (2011) - [c10]Rasmus Fonseca
Protein Packing Quality Using Delaunay Complexes. ISVD 2011: 117-122 - 2010
- [j26]Rasmus Fonseca
Protein Structure Prediction Using Bee Colony Optimization Metaheuristic. J. Math. Model. Algorithms 9(2): 181-194 (2010)
2000 – 2009
- 2009
- [j25]Marcus Brazil
A novel approach to phylogenetic trees: d-Dimensional geometric Steiner trees. Networks 53(2): 104-111 (2009) - [c9]Pawel Winter
Alpha Shapes and Proteins. ISVD 2009: 217-224 - 2008
- [c8]Martin Paluszewski, Pawel Winter
Protein Decoy Generation Using Branch and Bound with Efficient Bounding. WABI 2008: 382-393 - 2007
- [j24]Kenneth Hvam, Line Blander Reinhardt
Bounding component sizes of two-connected Steiner networks. Inf. Process. Lett. 104(5): 159-163 (2007) - [c7]Kenneth Hvam, Line Blander Reinhardt, Pawel Winter, Martin Zachariasen:
Some Structural and Geometric Properties of Two-Connected Steiner Networks. CATS 2007: 85-90 - 2006
- [j23]Martin Paluszewski, Thomas Hamelryck
Reconstructing protein structure from solvent exposure using tabu search. Algorithms Mol. Biol. 1 (2006) - 2005
- [j22]Jeff Abrahamson, Ali Shokoufandeh, Pawel Winter:
Euclidean TSP between two nested convex obstacles. Inf. Process. Lett. 95(2): 370-375 (2005) - [j21]Marcus Brazil
Flexibility of Steiner trees in uniform orientation metrics. Networks 46(3): 142-153 (2005) - [j20]Pawel Winter, Martin Zachariasen
Two-connected Steiner networks: structural properties. Oper. Res. Lett. 33(4): 395-402 (2005) - 2004
- [j19]Marcus Brazil
Rotationally optimal spanning and Steiner trees in uniform orientation metrics. Comput. Geom. 29(3): 251-263 (2004) - [c6]Martin Paluszewski, Pawel Winter, Martin Zachariasen
A new paradigm for general architecture routing. ACM Great Lakes Symposium on VLSI 2004: 202-207 - [c5]Marcus Brazil, Pawel Winter, Martin Zachariasen
Flexibility of Steiner Trees in Uniform Orientation Metrics. ISAAC 2004: 196-208 - 2002
- [j18]Pawel Winter:
Optimal Steiner hull algorithm. Comput. Geom. 23(2): 163-169 (2002) - [j17]Pawel Winter, Martin Zachariasen
Short trees in polygons. Discret. Appl. Math. 118(1-2): 55-72 (2002) - [j16]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) - [c4]Benny K. Nielsen, Pawel Winter, Martin Zachariasen
An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem. ESA 2002: 760-771
1990 – 1999
- 1999
- [j15]Martin Zachariasen
Concatenation-Based Greedy Heuristics for the Euclidean Steiner Tree Problem. Algorithmica 25(4): 418-437 (1999) - [c3]Martin Zachariasen, Pawel Winter:
Obstacle-Avoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm. ALENEX 1999: 282-295 - [c2]David M. Warme, Pawel Winter, Martin Zachariasen:
Exact Solutions to Large-scale Plane Steiner Tree Problems. SODA 1999: 979-980 - 1997
- [j14]Pawel Winter, Martin Zachariasen:
Euclidean Steiner minimum trees: An improved exact algorithm. Networks 30(3): 149-166 (1997) - 1996
- [j13]Andrzej Proskurowski, Maciej M. Syslo, Pawel Winter:
Plane Embeddings of 2-trees and Biconnected Partial 2-Trees. SIAM J. Discret. Math. 9(4): 577-596 (1996) - 1995
- [j12]Pawel Winter:
Reductions for the rectilinear steiner tree problem. Networks 26(4): 187-198 (1995) - 1994
- [j11]Pawel Winter, Maciej M. Syslo:
Maximal Outerplanar Graphs with Perfect Face-independent Vertex Covers. Discret. Appl. Math. 54(2-3): 267-280 (1994) - 1993
- [j10]Pawel Winter:
Auclidean Steiner Minimal Trees with Obstacles and Steiner Visibility Graphs. Discret. Appl. Math. 47(2): 187-206 (1993) - 1992
- [j9]Pawel Winter, J. MacGregor Smith:
Path-Distance Heuristics for the Steiner Problem in Undirected Networks. Algorithmica 7(2&3): 309-327 (1992) - 1991
- [j8]Pawel Winter, J. MacGregor Smith:
Steiner minimal trees for three points with one convex polygonal obstacle. Ann. Oper. Res. 33(7): 577-599 (1991) - 1990
- [j7]Maciej M. Syslo, Pawel Winter:
In-Trees and Plane Embeddings of Outerplanar Graphs. BIT 30(1): 83-90 (1990)
1980 – 1989
- 1988
- [c1]Maciej M. Syslo, Pawel Winter:
Independent Covers in Outerplanar Graphs. SWAT 1988: 243-254 - 1987
- [j6]Pawel Winter:
Steiner problem in Halin networks. Discret. Appl. Math. 17(3): 281-294 (1987) - [j5]Pawel Winter:
Steiner problem in networks: A survey. Networks 17(2): 129-167 (1987) - 1986
- [j4]Pawel Winter:
An Algorithm for the Enumeration of Spanning Trees. BIT 26(1): 44-62 (1986) - [j3]Pawel Winter:
Generalized Steiner Problem in Series-Parallel Networks. J. Algorithms 7(4): 549-566 (1986) - 1985
- [j2]Pawel Winter:
Generalized Steiner Problems in Outerplanar Networks. BIT 25(3): 485-496 (1985) - [j1]Pawel Winter:
An algorithm for the steiner problem in the euclidean plane. Networks 15(3): 323-345 (1985)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: