The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Pawel Winter: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  25. Some Structural and Geometric Properties of Two-Connected Steiner Networks. [Citation Graph (, )][DBLP]


  26. Protein Decoy Generation Using Branch and Bound with Efficient Bounding. [Citation Graph (, )][DBLP]


  27. Alpha Shapes and Proteins. [Citation Graph (, )][DBLP]


Search in 0.086secs, Finished in 0.088secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002