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

Publications of 2002
zaik2002-444 Triangulating Clustered Graphs (->LINK)
Author(s): Michael Jünger, Sebastian Leipert, Merijam Percan
zaik2002-440 Crossing Minimization for Symmetries (Extended Abstract) (->LINK)
Author(s): Christoph Buchheim, Seok-Hee Hong
zaik2002-439 An Improved Semidefinite Programming Relaxation for the Satisfiability Problem (->LINK)
Author(s): Miguel Anjos
zaik2002-438 Detecting Symmetries by Branch & Cut (Journal Version) (->LINK)
Author(s): Christoph Buchheim, Michael Jünger
zaik2002-437 SCIL - Symbolic Constraints in Integer Linear Programming (->LINK)
Author(s): Ernst Althaus, Alexander Bockmayr, Matthias Elf, Michael Jünger, Thomas Kasper, Kurt Mehlhorn
zaik2002-436 Advances in C-Planarity Testing of Clustered Graphs (->LINK)
Author(s): Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher
zaik2002-435 Subgraph Induced Connectivity Augmentation (->LINK)
Author(s): Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher
zaik2002-433 Simple and Efficient Bilayer Cross Counting (->LINK)
Author(s): Wilhelm Barth, Michael Jünger, Petra Mutzel
zaik2002-431 Improving Walker's Algorithm to Run in Linear Time (->LINK)
Author(s): Christoph Buchheim, Michael Jünger, Sebastian Leipert
zaik2002-428 A New Mathematical Programming Framework for Facility Layout Design (->LINK)
Author(s): Miguel Anjos, Anthony Vannelli
 2009
 2008
 2007
 2006
 2005
 2004
 2003
 2001
 2000
 1999
 1998
 1997
 1996
 1995
 1994
 1993
 1992
 1991
 Complete List