Search the dblp DataBase

Publications of Author

1. Christoph Buchheim, Michael Jünger, Annette Menze, Merijam Percan
   Bimodal Crossing Minimization. [Citation Graph (0, 0)][DBLP]
   COCOON, 2006, pp:497-506 [Conf]
   
2. Christoph Buchheim, Lanbo Zheng
   Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem. [Citation Graph (0, 0)][DBLP]
   COCOON, 2006, pp:507-516 [Conf]
   
3. Christoph Buchheim, Michael Jünger
   Detecting Symmetries by Branch & Cut. [Citation Graph (0, 0)][DBLP]
   Graph Drawing, 2001, pp:178-188 [Conf]
   
4. Christoph Buchheim, Michael Jünger
   An Integer Programming Approach to Fuzzy Symmetry Detection. [Citation Graph (0, 0)][DBLP]
   Graph Drawing, 2003, pp:166-177 [Conf]
   
5. Christoph Buchheim, Michael Jünger, Sebastian Leipert
   A Fast Layout Algorithm for k-Level Graphs. [Citation Graph (0, 0)][DBLP]
   Graph Drawing, 2000, pp:229-240 [Conf]
   
6. Christoph Buchheim, Michael Jünger, Sebastian Leipert
   Improving Walker's Algorithm to Run in Linear Time. [Citation Graph (0, 0)][DBLP]
   Graph Drawing, 2002, pp:344-353 [Conf]
   
7. Christoph Buchheim, Dietmar Ebner, Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher
   Exact Crossing Minimization. [Citation Graph (0, 0)][DBLP]
   Graph Drawing, 2005, pp:37-48 [Conf]
   
8. 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. [Citation Graph (0, 0)][DBLP]
   Graph Drawing, 1998, pp:456-457 [Conf]
   
9. Christoph Buchheim, Seok-Hee Hong
   Crossing Minimization for Symmetries. [Citation Graph (0, 0)][DBLP]
   ISAAC, 2002, pp:563-574 [Conf]
   
10. Thorsten Akkerman, Christoph Buchheim, Michael Jünger, Daniel Teske
    On the complexity of drawing trees nicely: corrigendum. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2004, v:40, n:8, pp:603-607 [Journal]
    
11. Christoph Buchheim, Seok-Hee Hong
    Crossing Minimization for Symmetries. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2005, v:38, n:3, pp:293-311 [Journal]
    
12. Christoph Buchheim, Michael Jünger, Sebastian Leipert
    Drawing rooted trees in linear time. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 2006, v:36, n:6, pp:651-665 [Journal]
    
13. Lanbo Zheng, Christoph Buchheim
    A New Exact Algorithm for the Two-Sided Crossing Minimization Problem. [Citation Graph (0, 0)][DBLP]
    COCOA, 2007, pp:301-310 [Conf]
    
14. 
    An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming. [Citation Graph (, )][DBLP]
    
    
15. 
    Exact Bipartite Crossing Minimization under Tree Constraints. [Citation Graph (, )][DBLP]
    
    
16. 
    A Basic Toolbox for Constrained Quadratic 0/1 Optimization. [Citation Graph (, )][DBLP]
    
    
17. 
    Testing Planarity of Geometric Automorphisms in Linear Time. [Citation Graph (, )][DBLP]
    
    
18. 
    On the subgroup distance problem. [Citation Graph (, )][DBLP]
    
    
19. 
    On the Subgroup Distance Problem. [Citation Graph (, )][DBLP]