Pawel Winter

Pawel Winter

Professor

ORCID: 0000-0003-2669-0524

Publication year:
All
11 - 20 out of 61Page size: 10
Sort by: Title
  1. Published

    Concatenation-Based Greedy Heuristic for the Euclidean Steiner Tree Problem

    Zachariasen, M. & Winter, Pawel, 1999, In: Algorithmica. Vol.25, p. 418-437

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

  2. Published

    Concatenation-Based Greedy Heuristics for the Euclidean Steiner Tree Problem

    Zachariasen, M. & Winter, Pawel, 1998, publisher. p. 144-153

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

  3. Published

    Deferred path heuristic for phylogenetic trees revisited

    Nielsen, B. K., Lindgren, S., Winter, Pawel & Zachariasen, M., 2005, Proceedings Of CompBioNets05: Algorithms and Computional Methods for Biochemical and Evolutionary Networks. King's College Publications, p. 75-92 18 p.

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

  4. Published

    Distance-based Classification Methods

    Ekin, O., Hammer, P. L., Kogan, A. & Winter, Pawel, 1999, In: INFOR, Canadian OR Society. Vol.37, p. 337-352

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

  5. Published

    Distance-based classification methods

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

    Research output: Book/Report › Report › Research

  6. Published

    EBBA: Efficient Branch and Bound Algorithm for Protein Decoy Generation

    Martin, P. & Winter, Pawel, 2008, Dept. of Computer Science, Univ. of Copenhagen. 24 p.

    Research output: Book/Report › Report › Research

  7. Published

    Euclidean Steiner Minimum Trees: An Improved Exact Algorithm

    Winter, Pawel & Zachariasen, M., 1997, In: NETWORKS. 30, p. 149-166

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

  8. Published

    Euclidean Steiner minimal trees with obsacles and Steiner visibility graphs

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

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

  9. Published

    Euclidean TSP between two nested convex obstacles

    Abrahamsen, J., Shokoufandeh, A. & Winter, Pawel, 2005, In: Information Processing Letters. 95, p. 370-375

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

  10. Published

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

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

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

Previous 1 2 3 4 5 6 7 Next

ID: 6886