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

Publications of 2006
zaik2006-529 On the Subgroup Distance Problem (->LINK)
Author(s): Christoph Buchheim, Peter J. Cameron, Taoyang Wu
zaik2006-525 Maximum Planar Subgraph on Graphs not Contractive to K5 or K3,3 (->LINK)
Author(s): Elisabeth Gassner, Merijam Percan
zaik2006-523 Simultaneous Geometric Graph Embeddings (->LINK)
Author(s): Alejandro Estrella-Balderrama, Elisabeth Gassner, Michael Jünger, Merijam Percan, Marcus Schaefer, Michael Schulz
zaik2006-522 Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem (->LINK)
Author(s): Christoph Buchheim, Lanbo Zheng
zaik2006-518 A Provably Fast Multipole Method (->LINK)
Author(s): Stefan Hachul, Michael Jünger
zaik2006-517 Testing Planarity of Geometric Automorphisms in Linear Time (->LINK)
Author(s): Christoph Buchheim, Seok-Hee Hong
zaik2006-510 Large-Graph Layout Algorithms at Work: An Experimental Study (->LINK)
Author(s): Stefan Hachul, Michael Jünger
zaik2006-509 Large-Graph Layout with the Fast Multipole Multilevel Method (->LINK)
Author(s): Stefan Hachul, Michael Jünger
zaik2006-508 A Branch-and-Cut Approach to the Crossing Number Problem (->LINK)
Author(s): Christoph Buchheim, Markus Chimani, Dietmar Ebner, Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher
zaik2006-507 Simultaneous Graph Embeddings with Fixed Edges (->LINK)
Author(s): Elisabeth Gassner, Michael Jünger, Merijam Percan, Marcus Schaefer, Michael Schulz
 2009
 2008
 2007
 2005
 2004
 2003
 2002
 2001
 2000
 1999
 1998
 1997
 1996
 1995
 1994
 1993
 1992
 1991
 Complete List