UNI KÖln
ZAIK
INFORMATIK
IMPRESSUM
Lehrstuhl
|
Prof. Dr. Michael Jünger
Home
People
>
Staff
>
Students
>
Alumni
Publications
>
Articles
>
Books
Teaching (german)
>
Lehrveranstaltungen
>
Kolloquien
Research
Where to find us
Publications of Christoph Buchheim
zaik2009-592
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
(->LINK)
Author(s):
Christoph Buchheim, Alberto Caprara, Andrea Lodi
zaik2009-591
Integer Programming Subject to Monomial Constraints
(->LINK)
Author(s):
Christoph Buchheim, Dennis Michaels, Robert Weismantel
zaik2009-582
Compact and Extended Formulations for Range Assignment Problems
(->LINK)
Author(s):
Frank Baumann, Christoph Buchheim
zaik2009-581
Exact Crossing Minimization in General Tanglegrams
(->LINK)
Author(s):
Frank Baumann, Christoph Buchheim, Frauke Liers
zaik2008-578
Speeding up IP-based Algorithms for Constrained Quadratic 0–1 Optimization
(->LINK)
Author(s):
Christoph Buchheim, Frauke Liers, Marcus Oswald
zaik2007-566
Planarization With Fixed Subgraph Embedding
(->LINK)
Author(s):
Christoph Buchheim, Michael Jünger, Maria Kandyba, Merijam Percan, Michael Schulz
zaik2007-561
A Basic Toolbox for Constrained Quadratic 0/1 Optimization
(->LINK)
Author(s):
Christoph Buchheim, Frauke Liers, Marcus Oswald
zaik2007-560
Exact Algorithms for the Quadratic Linear Ordering Problem
(->LINK)
Author(s):
Christoph Buchheim, Angelika Wiegele, Lanbo Zheng
zaik2007-559
Drawing cycles in networks
(->LINK)
Author(s):
Christoph Buchheim, Michael Jünger, Merijam Percan, Michael Schulz, Christina Thelen
zaik2007-558
Terse Integer Linear Programs for Boolean Optimization
(->LINK)
Author(s):
Christoph Buchheim, Giovanni Rinaldi
zaik2007-540
A New Exact Algorithm for the Two-Sided Crossing Minimization Problem
(->LINK)
Author(s):
Lanbo Zheng, Christoph Buchheim
zaik2007-535
Local Cuts Revisited
(->LINK)
Author(s):
Christoph Buchheim, Frauke Liers, Marcus Oswald
zaik2006-529
On the Subgroup Distance Problem
(->LINK)
Author(s):
Christoph Buchheim, Peter J. Cameron, Taoyang Wu
zaik2006-522
Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
(->LINK)
Author(s):
Christoph Buchheim, Lanbo Zheng
zaik2006-517
Testing Planarity of Geometric Automorphisms in Linear Time
(->LINK)
Author(s):
Christoph Buchheim, Seok-Hee Hong
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
zaik2005-503
Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
(->LINK)
Author(s):
Christoph Buchheim, Giovanni Rinaldi
zaik2005-502
Exact Crossing Minimization
(->LINK)
Author(s):
Christoph Buchheim, Dietmar Ebner, Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher
zaik2005-493
Bimodal Crossing Minimization
(->LINK)
Author(s):
Christoph Buchheim, Michael Jünger, Annette Menze, Merijam Percan
zaik2005-484
Crossing Minimization for Symmetries (Journal Version)
(->LINK)
Author(s):
Christoph Buchheim, Seok-Hee Hong
zaik2005-483
Drawing Rooted Trees in Linear Time
(->LINK)
Author(s):
Christoph Buchheim, Michael Jünger, Sebastian Leipert
zaik2004-470
Linear Optimization over Permutation Groups
(->LINK)
Author(s):
Christoph Buchheim, Michael Jünger
zaik2004-465
On the Complexity of Drawing Trees Nicely: Corrigendum
(->LINK)
Author(s):
Thorsten Akkerman, Christoph Buchheim, Michael Jünger, Daniel Teske
zaik2003-455
An Integer Programming Approach to Fuzzy Symmetry Detection
(->LINK)
Author(s):
Christoph Buchheim, Michael Jünger
zaik2002-440
Crossing Minimization for Symmetries (Extended Abstract)
(->LINK)
Author(s):
Christoph Buchheim, Seok-Hee Hong
zaik2002-438
Detecting Symmetries by Branch & Cut (Journal Version)
(->LINK)
Author(s):
Christoph Buchheim, Michael Jünger
zaik2002-431
Improving Walker's Algorithm to Run in Linear Time
(->LINK)
Author(s):
Christoph Buchheim, Michael Jünger, Sebastian Leipert
zaik2001-422
Detecting Symmetries by Branch & Cut (Extended Abstract)
(->LINK)
Author(s):
Christoph Buchheim, Michael Jünger
zaik1999-368
A Fast Layout Algorithm for k-Level Graphs
(->LINK)
Author(s):
Christoph Buchheim, Michael Jünger, Sebastian Leipert