UNI KÖln
ZAIK
INFORMATIK
IMPRESSUM
Lehrstuhl | Prof. Dr. Michael Jünger
Research
Where to find us

Publications of 1994
zpr94-174 Computing Delaunay-Triangulations in Manhatten and Maximum Metric (->LINK)
Author(s): Michael Jünger, Volker Kaibel, Stefan Thienel
zpr94-168 The Thickness of Graphs without K5-Minors (->LINK)
Author(s): Michael Jünger, Petra Mutzel, Thomas Odenthal, Mark Scharbrodt
zpr94-165 The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems (->LINK)
Author(s): Michael Jünger, Petra Mutzel
zpr94-163 An Implementation of the Hopcroft and Tarjan Planarity Test and Embedding Algorithm (->LINK)
Author(s): Kurt Mehlhorn, Petra Mutzel, Stefan Näher
zpr94-162 On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm (->LINK)
Author(s): Kurt Mehlhorn, Petra Mutzel
zpr94-161 s-Chorded Cycle Graphs and their Relation to the Planar Subgraph Polytope (->LINK)
Author(s): Petra Mutzel
zpr94-158 A Practical Method for Computing Correct Delaunay Triangulations in the Euclidian Metric (->LINK)
Author(s): Michael Jünger, Volker Kaibel, Stefan Thienel
zpr94-156 Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization (->LINK)
Author(s): Michael Jünger, Gerhard Reinelt, Stefan Thienel
zpr94-153 The Circuit Polytope: Facets (->LINK)
Author(s): Petra Bauer
 2009
 2008
 2007
 2006
 2005
 2004
 2003
 2002
 2001
 2000
 1999
 1998
 1997
 1996
 1995
 1993
 1992
 1991
 Complete List