Pawel Winter

Research output

Research output per year 1991 1992 1999 2002 2004 2005 2008 2018

• 22 Journal article
• 14 Article in proceedings
• 10 Report
• 4 Book chapter
• 11 More
  • 4 Paper
  • 2 Book
  • 2 Poster
  • 1 Report chapter
  • 1 Conference abstract in journal
  • 1 Working paper

Research output per year

Research output per year

Search results

• 1996

  Distance-based classification methods

  Winter, P., Ekin, O., Hammer, P. L. & Kogan, A., 1996, Rutgers: Rutgers University.

  Research output: Book/Report › Report › Research

• Large Euclidean Steiner minimum trees in an hour

  Winter, P. & Zachariasen, M., 1996, Datalogisk Institut, Københavns Universitet.

  Research output: Book/Report › Report › Research
• 1994

  Maximal outerplanar graphs with perfect faceindependent vertex covers

  Winter, P. & Syslo, M. M., 1994, In: Discrete Applied Mathematics. 54, p. 267-280

  Research output: Contribution to journal › Journal article › Research › peer-review

  1 Citation (Scopus)
• 1993

  Euclidean Steiner minimal trees with obsacles and Steiner visibility graphs

  Winter, P., 1993, In: Discrete Applied Mathematics. 47, p. 187-206

  Research output: Contribution to journal › Journal article › Research › peer-review

  14 Citations (Scopus)

• Outerplanar graphs with perfect face-independent vertex covers

  Winter, P., Proskurowski, A. & Syslo, M. M., 1993, Dept. of Computer and Inf.Science. 25 p.

  Research output: Book/Report › Report › Research
• 1992

  Computational geometry and topological network design

  Winter, P. & Smith, J. M., 1992, Computing in Euclidian Geometry. Singapore, p. 287-385

  Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research

• Euclidian Steiner minimal trees with obstacles and Steiner visibility graphs: Extended Abstract

  Winter, P., 1992, publisher. Springer, p. 313-315

  Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

• Path-distance heuristics for the Steiner problem in undirected networks

  Winter, P. & Smith, J. M., 1992, In: Algorithmica. 7, p. 309-327

  Research output: Contribution to journal › Journal article › Research › peer-review

  5 Citations (Scopus)

• The Steiner Tree Problem

  Winter, P., Hwang, F. K. & Richard, D. S., 1992, Amsterdam, North Holland. 339 p.

  Research output: Book/Report › Book › Research
• 1991

  Steiner Minimal Trees for Three Points with one Conrex Polygonal Obstacle

  Winter, P. & Smith, J. M., 1991, In: Annals of Operations Research. 33, p. 577-599

  Research output: Contribution to journal › Journal article › Research › peer-review

  9 Citations (Scopus)

• Topological Network Design, Proceedings of the NATO Advanced Research Workshop, Copenhagen 1989, Annals of Operations Research 33

  Smith, J. M. & Winter, P., 1991, Basel, Switzerland: J.C. Baltzer AG. 612 p.

  Research output: Book/Report › Book › Research