2008 |
19 | EE | Christoph Buchheim,
Frauke Liers,
Marcus Oswald:
A Basic Toolbox for Constrained Quadratic 0/1 Optimization.
WEA 2008: 249-262 |
18 | EE | Christoph Buchheim,
Seok-Hee Hong:
Testing Planarity of Geometric Automorphisms in Linear Time.
Algorithmica 52(4): 448-465 (2008) |
17 | EE | Christoph Buchheim,
Markus Chimani,
Dietmar Ebner,
Carsten Gutwenger,
Michael Jünger,
Gunnar W. Klau,
Petra Mutzel,
René Weiskircher:
A branch-and-cut approach to the crossing number problem.
Discrete Optimization 5(2): 373-388 (2008) |
16 | EE | Christoph Buchheim,
Frauke Liers,
Marcus Oswald:
Local cuts revisited.
Oper. Res. Lett. 36(4): 430-433 (2008) |
2007 |
15 | EE | Lanbo Zheng,
Christoph Buchheim:
A New Exact Algorithm for the Two-Sided Crossing Minimization Problem.
COCOA 2007: 301-310 |
2006 |
14 | EE | Christoph Buchheim,
Michael Jünger,
Annette Menze,
Merijam Percan:
Bimodal Crossing Minimization.
COCOON 2006: 497-506 |
13 | EE | Christoph Buchheim,
Lanbo Zheng:
Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem.
COCOON 2006: 507-516 |
12 | EE | Christoph Buchheim,
Peter J. Cameron,
Taoyang Wu:
On the Subgroup Distance Problem.
Electronic Colloquium on Computational Complexity (ECCC) 13(146): (2006) |
11 | EE | Christoph Buchheim,
Michael Jünger,
Sebastian Leipert:
Drawing rooted trees in linear time.
Softw., Pract. Exper. 36(6): 651-665 (2006) |
2005 |
10 | EE | Christoph Buchheim,
Dietmar Ebner,
Michael Jünger,
Gunnar W. Klau,
Petra Mutzel,
René Weiskircher:
Exact Crossing Minimization.
Graph Drawing 2005: 37-48 |
9 | EE | Christoph Buchheim,
Michael Jünger:
Linear optimization over permutation groups.
Discrete Optimization 2(4): 308-319 (2005) |
8 | EE | Christoph Buchheim,
Seok-Hee Hong:
Crossing Minimization for Symmetries.
Theory Comput. Syst. 38(3): 293-311 (2005) |
2004 |
7 | EE | Thorsten Akkerman,
Christoph Buchheim,
Michael Jünger,
Daniel Teske:
On the complexity of drawing trees nicely: corrigendum.
Acta Inf. 40(8): 603-607 (2004) |
2003 |
6 | EE | Christoph Buchheim,
Michael Jünger:
An Integer Programming Approach to Fuzzy Symmetry Detection.
Graph Drawing 2003: 166-177 |
2002 |
5 | EE | Christoph Buchheim,
Michael Jünger,
Sebastian Leipert:
Improving Walker's Algorithm to Run in Linear Time.
Graph Drawing 2002: 344-353 |
4 | EE | Christoph Buchheim,
Seok-Hee Hong:
Crossing Minimization for Symmetries.
ISAAC 2002: 563-574 |
2001 |
3 | EE | Christoph Buchheim,
Michael Jünger:
Detecting Symmetries by Branch & Cut.
Graph Drawing 2001: 178-188 |
2000 |
2 | EE | Christoph Buchheim,
Michael Jünger,
Sebastian Leipert:
A Fast Layout Algorithm for k-Level Graphs.
Graph Drawing 2000: 229-240 |
1998 |
1 | EE | Petra Mutzel,
Carsten Gutwenger,
Ralf Brockenauer,
Sergej Fialko,
Gunnar W. Klau,
Michael Krüger,
Thomas Ziegler,
Stefan Näher,
David Alberts,
Dirk Ambras,
Gunter Koch,
Michael Jünger,
Christoph Buchheim,
Sebastian Leipert:
A Library of Algorithms for Graph Drawing.
Graph Drawing 1998: 456-457 |