Hauptinhalt

Artikel in Konferenzbänden

• An Exact Algorithm for Robust Network Design
  International Network Optimization Conference – INOC 2011, LNCS 6701, pp 7–17 (2011)
  (with F. Liers and L. Sanità)


• Practical Solution of Periodic Filtered Approximation as a Convex Quadratic Integer Program
  Complex Systems Design & Management (CSDM) 2010, pp 149–160 (2010)
  (with F. Bizzarri, S. Callegari, A. Caprara, A. Lodi, R. Rovatti, and G. Setti)


• Exact Bipartite Crossing Minimization under Tree Constraints
  9th International Symposium on Experimental Algorithms – SEA 2010, LNCS 6049, pp 118–128 (2010)
  (with F. Baumann and F. Liers)


• Submodular Formulations for Range Assignment Problems
  International Symposium on Combinatorial Optimization – ISCO 2010, Electronic Notes in Discrete Mathematics 36, pp 239–246 (2010)
  (with F. Baumann)


• An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
  Integer Programming and Combinatorial Optimization – IPCO 2010, LNCS 6080, pp 285–298 (2010)
  (with A. Caprara and A. Lodi)


• A Basic Toolbox for Constrained Quadratic 0/1 Optimization
  WEA 2008: Workshop on Experimental Algorithms, LNCS 5038, pp 249–262 (2008)
  (with F. Liers and M. Oswald)


• A New Exact Algorithm for the Two-Sided Crossing Minimization Problem
  Combinatorial Optimization and Applications – COCOA 2007, LNCS 4616, pp 301–310 (2007)
  (with L. Zheng)


• Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
  Computing and Combinatorics – COCOON 2006, LNCS 4112, pp 507–516 (2006)
  (with L. Zheng)


• Bimodal Crossing Minimization
  Computing and Combinatorics – COCOON 2006, LNCS 4112, pp 497–506 (2006)
  (with M. Jünger, A. Menze, and M. Percan)


• Exact Crossing Minimization
  Graph Drawing 2005, LNCS 3843, pp 37–48 (2006)
  (with D. Ebner, M. Jünger, G. W. Klau, P. Mutzel, and R. Weiskircher)


• An Integer Programming Approach to Fuzzy Symmetry Detection
  Graph Drawing 2003, LNCS 2912, pp 166–177 (2004)
  (with M. Jünger)


• Improving Walker's Algorithm to Run in Linear Time
  Graph Drawing 2002, LNCS 2528, pp 344–353 (2002)
  (with M. Jünger and S. Leipert)


• Crossing Minimization for Symmetries
  ISAAC 2002, LNCS 2518, pp 563–574 (2002)
  (with S. Hong)


• Detecting Symmetries by Branch & Cut
  Graph Drawing 2001, LNCS 2265, pp 178–188 (2002)
  (with M. Jünger)


• A Fast Layout Algorithm for k-Level Graphs
  Graph Drawing 2000, LNCS 1984, pp 229–240 (2000)
  (with M. Jünger and S. Leipert)