Publications by Pawel Winter

• Classified by Publication Type • Sorted by Year • Classified by Author •

Classified by Author

• Nielsen, B. K. • Paluszewski, M. • Winter, P. • Zachariasen, M. •

Nielsen, B. K.

• B. K. Nielsen, S. Lindgren, P. Winter, and M. Zachariasen. Deferred Path Heuristic for Phylogenetic Trees Revisited. In Proceedings of Algorithms and Computational Methods for Biochemical and Evolutionary Networks (CompBioNets05), 2005.   [BibTeX]   [pdf] 
• M. Brazil, B. K. Nielsen, P. Winter, and M. Zachariasen. Rotationally Optimal Spanning and Steiner Trees in Uniform Orientation Metrics. Computational Geometry: Theory and Applications, 29:251–263, 2004.   [BibTeX]   [doi] 
• B. K. Nielsen, P. Winter, and M. Zachariasen. On the Location of Steiner Points in Uniformly-Oriented Steiner Trees. Information Processing Letters, 83:237–241, 2002.   [BibTeX]   [doi] 
• B. K. Nielsen, P. Winter, and M. Zachariasen. Rectilinear Trees under Rotation and Related Problems. In Proceedings of the 18th European Workshop on Computational Geometry, pp. 18–22, 2002.   [BibTeX]   [ps] 
• B. K. Nielsen, P. Winter, and M. Zachariasen. An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem. In Proceedings of the 10th European Symposium on Algorithms, Lecture Notes in Computer Science, pp. 760–772, Springer, 2002.   [BibTeX]   [html] 

Paluszewski, M.

• M. Paluszewski, T. Hamelryck, and P. Winter. Reconstructing protein structure from solvent exposure using tabu search. Algorithms for Molecular Biology, 1:20, 2006.   [BibTeX]   [html] [doi] 
• M. Paluszewski, P. Winter, and M. Zachariasen. A New Paradigm for General Architecture Routing. In Proceedings of the 14th ACM Great Lakes symposium on VLSI (GLSVLSI), pp. 202–207, 2004.   [BibTeX]   [doi] 

Winter, P.

• K. Hvam, L. Reinhardt, P. Winter, and M. Zachariasen. Bounding component sizes of two-connected Steiner networks. Information Processing Letters, 104:159–163, 2007.   [BibTeX]   [doi] 
• M. Paluszewski, T. Hamelryck, and P. Winter. Reconstructing protein structure from solvent exposure using tabu search. Algorithms for Molecular Biology, 1:20, 2006.   [BibTeX]   [html] [doi] 
• J. Abrahamson, A. Shokoufandeh, and P. Winter. Touring vertices of a 2-dimensional closed convex channel. Information Processing Letters, 95:370–375, 2005.   [BibTeX]   [doi] 
• M. Brazil, P. Winter, and M. Zachariasen. Flexibility of Steiner Trees in Uniform Orientation Metrics. Networks, 46:142–153, 2005.   [BibTeX]   [doi] 
• B. K. Nielsen, S. Lindgren, P. Winter, and M. Zachariasen. Deferred Path Heuristic for Phylogenetic Trees Revisited. In Proceedings of Algorithms and Computational Methods for Biochemical and Evolutionary Networks (CompBioNets05), 2005.   [BibTeX]   [pdf] 
• P. Winter and M. Zachariasen. Two-Connected Steiner Networks: Structural Properties. Operations Research Letters, 33:395–402, 2005.   [BibTeX]   [doi] 
• M. Brazil, P. Winter, and M. Zachariasen. Flexibility of Steiner Trees in Uniform Orientation Metrics. Technical Report 04-09, DIKU, Department of Computer Science, University of Copenhagen, 2004.   [BibTeX]   [pdf] 
• M. Brazil, B. K. Nielsen, P. Winter, and M. Zachariasen. Rotationally Optimal Spanning and Steiner Trees in Uniform Orientation Metrics. Computational Geometry: Theory and Applications, 29:251–263, 2004.   [BibTeX]   [doi] 
• M. Paluszewski, P. Winter, and M. Zachariasen. A New Paradigm for General Architecture Routing. In Proceedings of the 14th ACM Great Lakes symposium on VLSI (GLSVLSI), pp. 202–207, 2004.   [BibTeX]   [doi] 
• B. K. Nielsen, P. Winter, and M. Zachariasen. On the Location of Steiner Points in Uniformly-Oriented Steiner Trees. Information Processing Letters, 83:237–241, 2002.   [BibTeX]   [doi] 
• B. K. Nielsen, P. Winter, and M. Zachariasen. Rectilinear Trees under Rotation and Related Problems. In Proceedings of the 18th European Workshop on Computational Geometry, pp. 18–22, 2002.   [BibTeX]   [ps] 
• B. K. Nielsen, P. Winter, and M. Zachariasen. An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem. In Proceedings of the 10th European Symposium on Algorithms, Lecture Notes in Computer Science, pp. 760–772, Springer, 2002.   [BibTeX]   [html] 
• P. Winter, M. Zachariasen, and J. Nielsen. Short Trees in Polygons. Discrete Applied Mathematics, 118:55–72, 2002.   [BibTeX]   [doi] 
• P. Winter and M. Zachariasen. Geometric Steiner Tree Problems. In Proceedings of 4th ALIO/EURO Workshop on Applied Combinatorial Optimization, pp. 137–140, 2002.   [BibTeX]   
• D. M. Warme, P. Winter, and M. Zachariasen. GeoSteiner 3.1. Department of Computer Science, University of Copenhagen (DIKU), http://www.diku.dk/geosteiner/, 2001.   [BibTeX]   [html] 
• D. M. Warme, P. Winter, and M. Zachariasen. Exact Algorithms for Plane Steiner Tree Problems: A Computational Study. In D.-Z. Du, J. M. Smith, and J. H. Rubinstein, editors, Advances in Steiner Trees, pp. 81–116, Kluwer Academic Publishers, Boston, 2000.   [BibTeX]   [html] 
• P. Winter, M. Zachariasen, and J. Nielsen. Short Trees in Polygons. Technical Report 2000/02, DIKU, Department of Computer Science, University of Copenhagen, 2000.   [BibTeX]   [ps] 
• O. Ekin, P.L. Hammer, A. Kogan, and P. Winter. Distance-based classification methods. INFOR, 37:337–352, 1999.   [BibTeX]   
• D. M. Warme, P. Winter, and M. Zachariasen. Exact Solutions to Large-Scale Plane Steiner Tree Problems. In Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 979–980, 1999.   [BibTeX]   [html] 
• M. Zachariasen and P. Winter. Concatenation-Based Greedy Heuristics for the Euclidean Steiner Tree Problem. Algorithmica, 25:418–437, 1999.   [BibTeX]   [doi] 
• M. Zachariasen and P. Winter. Obstacle-Avoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm. In Workshop on Algorithm Engineering and Experimentation (ALENEX), Lecture Notes in Computer Science 1619, pp. 282–295, Springer, 1999.   [BibTeX]   [ps] 
• M. Zachariasen and P. Winter. Concatenation-Based Greedy Heuristics for the Euclidean Steiner Tree Problem: Extended Abstract. In Proceedings of Algorithms and Experiments (ALEX98), pp. 144–153, 1998.   [BibTeX]   [ps] 
• P. Winter and M. Zachariasen. Euclidean Steiner Minimum Trees: An Improved Exact Algorithm. Networks, 30:149–166, 1997.   [BibTeX]   [html] 
• M. Zachariasen and P. Winter. Concatenation-Based Greedy Heuristics for the Euclidean Steiner Tree Problem. Technical Report 97/20, DIKU, Department of Computer Science, University of Copenhagen, 1997.   [BibTeX]   [ps] 
• A. Proskurowski, M.M. Syslo, and P. Winter. Plane embeddings of 2-trees and biconnected partial 2-trees. SIAM J. on Discr. Math, 9:277–296, 1996.   [BibTeX]   
• P. Winter and M. Zachariasen. Large Euclidean Steiner Minimum Trees in an Hour. Technical Report 96/34, DIKU, Department of Computer Science, University of Copenhagen, 1996.   [BibTeX]   [ps] 
• P. Winter. Steiner minimal trees in simple polygons. Technical Report Tech. Report 95-43, DIMACS, Rutgers Univ., 1995.   [BibTeX]   
• P. Winter. Reductions for the rectilinear Steiner tree problem. Networks, 26:187–198, 1995.   [BibTeX]   
• P. Winter. Euclidean Steiner minimal trees for 3 terminals in simple polygons. In Proc. of the 7-th Canadian Conference on Computational Geometry, pp. 247–253, Quebec City, Quebec, Canada, 1995.   [BibTeX]   
• M.M. Syslo and P. Winter. Maximal outerplanar graphs with perfect face-independent vertex covers. Discrete Applied Mathematics, 54:267–280, 1994.   [BibTeX]   
• P. Winter. Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs. Discrete Applied Mathematics, 47:187–206, 1993.   [BibTeX]   
• F.K. Hwang, D.S. Richards, and P. Winter. The Steiner Tree Problems, Annals of Discrete Mathematics, North-Holland, 1992.   [BibTeX]   
• J. MacGregor Smith and P. Winter. Computing in Euclidean Geometry. In D.Z. Du and F.K. Hwang, editors, Computational geometry and topological network design, pp. 287–385, World Scientific Publishing Co., 1992.   [BibTeX]   
• J. MacGregor Smith and P. Winter. Path-distance heuristics for the Steiner problem in undirected networks. Algorithmica, 7:309–327, 1992.   [BibTeX]   
• P. Winter. Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs: Extended abstract. In Combinatorial Optimization: New Frontiers in the Theory and Practice, pp. 313–315, Springer-Verlag, Berlin, 1992.   [BibTeX]   
• J. MacGregor Smith and P. Winter. Steiner minimal trees for three points and one convex polygonal obstacle. Annals of Operations Research, pp. 577–599, 1991.   [BibTeX]   
• J. MacGregor Smith and P. Winter. NO TITLE. In Proceedings of NATO Advanced Research Workshop on Topological Network Design: Analysis and Synthesis, Copenhagen, June 1991.   [BibTeX]   
• M.M. Syslo and P. Winter. In-trees and plane embeddings of outerplanar graphs. BIT, 30:83–90, 1990.   [BibTeX]   
• P. Winter. Topological network synthesis. In Combinatorial Optimization, pp. 282–303, Springer-Verlag, Berlin-Heidelberg, Como, Italy, 1989.   [BibTeX]   
• P. Winter. Independent covers in outerplanar graphs. In SWAT 88: Proceedings of the 1-st Scandinavian Workshop on Algorithm Theory, pp. 243–254, Halmstad, Sweden, July 1988.   [BibTeX]   
• P. Winter. Steiner problem in Halin networks. Discrete Applied Mathematics, 17:281–294, 1987.   [BibTeX]   
• P. Winter. Steiner problem in networks - A survey. Networks, 17:129–167, 1987.   [BibTeX]   
• P. Winter. An algorithm for the enumeration of spanning trees. BIT, 26:46–55, 1986.   [BibTeX]   
• P. Winter. Generalized Steiner problem in series-parallel networks. J. of Algorithms, 7:549–566, 1986.   [BibTeX]   
• P. Winter. An algorithm of the Steiner problem in the Euclidean plane. Networks, 15:323–345, 1985.   [BibTeX]   
• P. Winter. Generalized Steiner problem in outerplanar networks. BIT, 25:485–496, 1985.   [BibTeX]   

Zachariasen, M.

• K. Hvam, L. Reinhardt, P. Winter, and M. Zachariasen. Bounding component sizes of two-connected Steiner networks. Information Processing Letters, 104:159–163, 2007.   [BibTeX]   [doi] 
• M. Brazil, P. Winter, and M. Zachariasen. Flexibility of Steiner Trees in Uniform Orientation Metrics. Networks, 46:142–153, 2005.   [BibTeX]   [doi] 
• B. K. Nielsen, S. Lindgren, P. Winter, and M. Zachariasen. Deferred Path Heuristic for Phylogenetic Trees Revisited. In Proceedings of Algorithms and Computational Methods for Biochemical and Evolutionary Networks (CompBioNets05), 2005.   [BibTeX]   [pdf] 
• P. Winter and M. Zachariasen. Two-Connected Steiner Networks: Structural Properties. Operations Research Letters, 33:395–402, 2005.   [BibTeX]   [doi] 
• M. Brazil, P. Winter, and M. Zachariasen. Flexibility of Steiner Trees in Uniform Orientation Metrics. Technical Report 04-09, DIKU, Department of Computer Science, University of Copenhagen, 2004.   [BibTeX]   [pdf] 
• M. Brazil, B. K. Nielsen, P. Winter, and M. Zachariasen. Rotationally Optimal Spanning and Steiner Trees in Uniform Orientation Metrics. Computational Geometry: Theory and Applications, 29:251–263, 2004.   [BibTeX]   [doi] 
• M. Paluszewski, P. Winter, and M. Zachariasen. A New Paradigm for General Architecture Routing. In Proceedings of the 14th ACM Great Lakes symposium on VLSI (GLSVLSI), pp. 202–207, 2004.   [BibTeX]   [doi] 
• B. K. Nielsen, P. Winter, and M. Zachariasen. On the Location of Steiner Points in Uniformly-Oriented Steiner Trees. Information Processing Letters, 83:237–241, 2002.   [BibTeX]   [doi] 
• B. K. Nielsen, P. Winter, and M. Zachariasen. Rectilinear Trees under Rotation and Related Problems. In Proceedings of the 18th European Workshop on Computational Geometry, pp. 18–22, 2002.   [BibTeX]   [ps] 
• B. K. Nielsen, P. Winter, and M. Zachariasen. An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem. In Proceedings of the 10th European Symposium on Algorithms, Lecture Notes in Computer Science, pp. 760–772, Springer, 2002.   [BibTeX]   [html] 
• P. Winter, M. Zachariasen, and J. Nielsen. Short Trees in Polygons. Discrete Applied Mathematics, 118:55–72, 2002.   [BibTeX]   [doi] 
• P. Winter and M. Zachariasen. Geometric Steiner Tree Problems. In Proceedings of 4th ALIO/EURO Workshop on Applied Combinatorial Optimization, pp. 137–140, 2002.   [BibTeX]   
• D. M. Warme, P. Winter, and M. Zachariasen. GeoSteiner 3.1. Department of Computer Science, University of Copenhagen (DIKU), http://www.diku.dk/geosteiner/, 2001.   [BibTeX]   [html] 
• D. M. Warme, P. Winter, and M. Zachariasen. Exact Algorithms for Plane Steiner Tree Problems: A Computational Study. In D.-Z. Du, J. M. Smith, and J. H. Rubinstein, editors, Advances in Steiner Trees, pp. 81–116, Kluwer Academic Publishers, Boston, 2000.   [BibTeX]   [html] 
• P. Winter, M. Zachariasen, and J. Nielsen. Short Trees in Polygons. Technical Report 2000/02, DIKU, Department of Computer Science, University of Copenhagen, 2000.   [BibTeX]   [ps] 
• D. M. Warme, P. Winter, and M. Zachariasen. Exact Solutions to Large-Scale Plane Steiner Tree Problems. In Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 979–980, 1999.   [BibTeX]   [html] 
• M. Zachariasen and P. Winter. Concatenation-Based Greedy Heuristics for the Euclidean Steiner Tree Problem. Algorithmica, 25:418–437, 1999.   [BibTeX]   [doi] 
• M. Zachariasen and P. Winter. Obstacle-Avoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm. In Workshop on Algorithm Engineering and Experimentation (ALENEX), Lecture Notes in Computer Science 1619, pp. 282–295, Springer, 1999.   [BibTeX]   [ps] 
• M. Zachariasen and P. Winter. Concatenation-Based Greedy Heuristics for the Euclidean Steiner Tree Problem: Extended Abstract. In Proceedings of Algorithms and Experiments (ALEX98), pp. 144–153, 1998.   [BibTeX]   [ps] 
• P. Winter and M. Zachariasen. Euclidean Steiner Minimum Trees: An Improved Exact Algorithm. Networks, 30:149–166, 1997.   [BibTeX]   [html] 
• M. Zachariasen and P. Winter. Concatenation-Based Greedy Heuristics for the Euclidean Steiner Tree Problem. Technical Report 97/20, DIKU, Department of Computer Science, University of Copenhagen, 1997.   [BibTeX]   [ps] 
• P. Winter and M. Zachariasen. Large Euclidean Steiner Minimum Trees in an Hour. Technical Report 96/34, DIKU, Department of Computer Science, University of Copenhagen, 1996.   [BibTeX]   [ps] 

Generated by bib2html.pl (written by Patrick Riley ) on Thu Aug 30, 2007 17:09:47