A Library of Algorithms for Graph Drawing. - Petra Mutzel; Carsten Gutwenger; Ralf Brockenauer; Sergej Fialko; Gunnar W. Klau; Michael Krüger; Thomas Ziegler 002; Stefan Näher; David Alberts; Dirk Ambras; Gunter Koch; Michael Jünger; et al. (GD, 1998)

A Fast Layout Algorithm for k-Level Graphs. - Christoph Buchheim; Michael Jünger; Sebastian Leipert (GD, 2000)

Improving Walker's Algorithm to Run in Linear Time. - Christoph Buchheim; Michael Jünger; Sebastian Leipert (GD, 2002)

An Integer Programming Approach to Fuzzy Symmetry Detection. - Christoph Buchheim; Michael Jünger (GD, 2003)

Detecting symmetries by branch & cut. - Christoph Buchheim; Michael Jünger (Math. Program., 2003)

An integer programming approach to exact and fuzzy symmetry detection. - Christoph Buchheim (2003)

On the complexity of drawing trees nicely: corrigendum. - Thorsten Akkerman; Christoph Buchheim; Michael Jünger; Daniel Teske (Acta Informatica, 2004)

Exact Crossing Minimization. - Christoph Buchheim; Dietmar Ebner; Michael Jünger; Gunnar W. Klau; Petra Mutzel; René Weiskircher (GD, 2005)

Linear optimization over permutation groups. - Christoph Buchheim; Michael Jünger (Discret. Optim., 2005)

Crossing Minimization for Symmetries. - Christoph Buchheim; Seok-Hee Hong 001 (Theory Comput. Syst., 2005)

Bimodal Crossing Minimization. - Christoph Buchheim; Michael Jünger; Annette Menze; Merijam Percan (COCOON, 2006)

Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem. - Christoph Buchheim; Lanbo Zheng (COCOON, 2006)

On the Subgroup Distance Problem. - Christoph Buchheim; Peter J. Cameron; Taoyang Wu (Electron. Colloquium Comput. Complex., 2006)

Drawing rooted trees in linear time. - Christoph Buchheim; Michael Jünger; Sebastian Leipert (Softw. Pract. Exp., 2006)

A New Exact Algorithm for the Two-Sided Crossing Minimization Problem. - Lanbo Zheng; Christoph Buchheim (COCOA, 2007)

Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case. - Christoph Buchheim; Giovanni Rinaldi (SIAM J. Optim., 2007)

A Basic Toolbox for Constrained Quadratic 0/1 Optimization. - Christoph Buchheim; Frauke Liers; Marcus Oswald (WEA, 2008)

Testing Planarity of Geometric Automorphisms in Linear Time. - Christoph Buchheim; Seok-Hee Hong 001 (Algorithmica, 2008)

A branch-and-cut approach to the crossing number problem. - Christoph Buchheim; Markus Chimani; Dietmar Ebner; Carsten Gutwenger; Michael Jünger; Gunnar W. Klau; Petra Mutzel; René Weiskircher (Discret. Optim., 2008)

Local cuts revisited. - Christoph Buchheim; Frauke Liers; Marcus Oswald (Oper. Res. Lett., 2008)

Terse Integer Linear Programs for Boolean Optimization. - Christoph Buchheim; Giovanni Rinaldi (J. Satisf. Boolean Model. Comput., 2009)

Exact Bipartite Crossing Minimization under Tree Constraints. - Frank Baumann; Christoph Buchheim; Frauke Liers (CTW, 2010)

Practical Solution of Periodic Filtered Approximation as a Convex Quadratic Integer Program. - Federico Bizzarri; Christoph Buchheim; Sergio Callegari; Alberto Caprara; Andrea Lodi 001; Riccardo Rovatti; Gianluca Setti (CSDM, 2010)

Submodular Formulations for Range Assignment Problems. - Frank Baumann; Christoph Buchheim (Electron. Notes Discret. Math., 2010)

Exact Algorithms for the Quadratic Linear Ordering Problem. - Christoph Buchheim; Angelika Wiegele; Lanbo Zheng (INFORMS J. Comput., 2010)

Speeding up IP-based algorithms for constrained quadratic 0-1 optimization. - Christoph Buchheim; Frauke Liers; Marcus Oswald (Math. Program., 2010)

Integer Programming Subject to Monomial Constraints. - Christoph Buchheim; Dennis Michaels; Robert Weismantel (SIAM J. Optim., 2010)

An Exact Algorithm for Robust Network Design. - Christoph Buchheim; Frauke Liers; Laura Sanità (INOC, 2011)

An effective branch-and-bound algorithm for convex quadratic integer programming. - Christoph Buchheim; Alberto Caprara; Andrea Lodi 001 (Math. Program., 2012)

The spanning tree problem with one quadratic term. - Christoph Buchheim; Laura Klein (CTW, 2013)

Quadratic Outer Approximation for Convex Integer Programming with Box Constraints. - Christoph Buchheim; Long Trieu (SEA, 2013)

Separable Non-convex Underestimators for Binary Quadratic Programming. - Christoph Buchheim; Emiliano Traversi (SEA, 2013)

Semidefinite relaxations for non-convex quadratic mixed-integer programming. - Christoph Buchheim; Angelika Wiegele (Math. Program., 2013)

An Exact Algorithm for Nonconvex Quadratic Integer Minimization Using Ellipsoidal Relaxations. - Christoph Buchheim; Marianna De Santis; Laura Palagi; Mauro Piacentini (SIAM J. Optim., 2013)

Crossings and Planarization. - Christoph Buchheim; Markus Chimani; Carsten Gutwenger; Michael Jünger; Petra Mutzel (Handbook of Graph Drawing and Visualization, 2013)

Box-Constrained Mixed-Integer Polynomial Optimization Using Separable Underestimators. - Christoph Buchheim; Claudia D'Ambrosio (IPCO, 2014)

Lagrangean Decomposition for Mean-Variance Combinatorial Optimization. - Frank Baumann; Christoph Buchheim; Anna Ilyina (ISCO, 2014)

Active Set Methods with Reoptimization for Convex Quadratic Integer Programming. - Christoph Buchheim; Long Trieu (ISCO, 2014)

Combinatorial optimization with one quadratic term: Spanning trees and forests. - Christoph Buchheim; Laura Klein (Discret. Appl. Math., 2014)

A procedure for the evaluation and compensation of form errors by means of global isometric registration with subsequent local reoptimization. - Laura Klein; Tobias Wagner 001; Christoph Buchheim; Dirk Biermann (Prod. Eng., 2014)

On the Quadratic Shortest Path Problem. - Borzou Rostami; Federico Malucelli; Davide Frey; Christoph Buchheim (SEA, 2015)

On the separation of split inequalities for non-convex quadratic integer programming. - Christoph Buchheim; Emiliano Traversi (Discret. Optim., 2015)

A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations. - Christoph Buchheim; Marianna De Santis; Laura Palagi (Oper. Res. Lett., 2015)

Ellipsoid Bounds for Convex Quadratic Integer Programming. - Christoph Buchheim; Ruth Hübner; Anita Schöbel (SIAM J. Optim., 2015)

A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs. - Christoph Buchheim; Maribel Montenegro; Angelika Wiegele (ISCO, 2016)

A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity Levels. - Borzou Rostami; Christopher Strothmann; Christoph Buchheim (ISCO, 2016)

Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions. - Christoph Buchheim; Jannis Kurtz (Electron. Notes Discret. Math., 2016)

A Compact Linearisation of Euclidean Single Allocation Hub Location Problems. - J. Fabian Meier; Uwe Clausen; Borzou Rostami; Christoph Buchheim (Electron. Notes Discret. Math., 2016)

Lower Bounding Procedures for the Single Allocation Hub Location Problem. - Borzou Rostami; Christoph Buchheim; J. Fabian Meier; Uwe Clausen (Electron. Notes Discret. Math., 2016)

Robust Critical Node Selection by Benders Decomposition. - Joe Naoum-Sawaya; Christoph Buchheim (INFORMS J. Comput., 2016)

A non-rigid registration method for the efficient analysis of shape deviations in production engineering applications. - Matthias Schweinoch; Renke Schäfer; Alexei Sacharow; Dirk Biermann; Christoph Buchheim (Prod. Eng., 2016)

A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming. - Christoph Buchheim; Marianna De Santis; Stefano Lucidi; Francesco Rinaldi; Long Trieu (SIAM J. Optim., 2016)

Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization. - Christoph Buchheim; Claudia D'Ambrosio (J. Glob. Optim., 2017)

Min-max-min robust combinatorial optimization. - Christoph Buchheim; Jannis Kurtz (Math. Program., 2017)

Combinatorial optimal control of semilinear elliptic PDEs. - Christoph Buchheim; Renke Kuhlmann; Christian Meyer (Comput. Optim. Appl., 2018)

Reliable single allocation hub location problem under hub breakdowns. - Borzou Rostami; Nicolas Kämmerling; Christoph Buchheim; Uwe Clausen (Comput. Oper. Res., 2018)

Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty. - Christoph Buchheim; Jannis Kurtz (Discret. Optim., 2018)

Robust combinatorial optimization under convex and discrete cost uncertainty. - Christoph Buchheim; Jannis Kurtz (EURO J. Comput. Optim., 2018)

The quadratic shortest path problem: complexity, approximability, and solution methods. - Borzou Rostami; André B. Chassein; Michael Hopf; Davide Frey; Christoph Buchheim; Federico Malucelli; Marc Goerigk (Eur. J. Oper. Res., 2018)

Quadratic Combinatorial Optimization Using Separable Underestimators. - Christoph Buchheim; Emiliano Traversi (INFORMS J. Comput., 2018)

A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization. - Christoph Buchheim; Marianna De Santis; Francesco Rinaldi; Long Trieu (J. Glob. Optim., 2018)

Tractable Relaxations for the Cubic One-Spherical Optimization Problem. - Christoph Buchheim; Marcia Fampa; Orlando Sarmiento (WCGO, 2019)

The robust bilevel continuous knapsack problem. - Christoph Buchheim; Dorothee Henke (CoRR, 2019)

Berge-acyclic multilinear 0-1 optimization problems. - Christoph Buchheim; Yves Crama; Elisabeth Rodríguez-Heck (Eur. J. Oper. Res., 2019)

K-adaptability in stochastic combinatorial optimization under objective uncertainty. - Christoph Buchheim; Jonas Pruente (Eur. J. Oper. Res., 2019)

SDP-based branch-and-bound for non-convex quadratic integer optimization. - Christoph Buchheim; Maribel Montenegro; Angelika Wiegele (J. Glob. Optim., 2019)

An active set algorithm for robust combinatorial optimization based on separation oracles. - Christoph Buchheim; Marianna De Santis (Math. Program. Comput., 2019)

A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization. - Christoph Buchheim (Discret. Appl. Math., 2020)

A Robust Approach to the Capacitated Vehicle Routing Problem with Uncertain Costs. - Lars Eufinger; Jannis Kurtz; Christoph Buchheim; Uwe Clausen (INFORMS J. Optim., 2020)

Stochastic single-allocation hub location. - Borzou Rostami; Nicolas Kämmerling; Joe Naoum-Sawaya; Christoph Buchheim; Uwe Clausen (Eur. J. Oper. Res., 2021)

Lower Bounds for Cubic Optimization over the Sphere. - Christoph Buchheim; Marcia Fampa; Orlando Sarmiento (J. Optim. Theory Appl., 2021)

On the complexity of robust bilevel optimization with uncertain follower's objective. - Christoph Buchheim; Dorothee Henke; Felix Hommelsheim (Oper. Res. Lett., 2021)

Bounded Variation in Binary Sequences. - Christoph Buchheim; Maja Hügging (ISCO, 2022)

On the stochastic vehicle routing problem with time windows, correlated travel times, and time dependency. - Federica Bomboi; Christoph Buchheim; Jonas Pruente (4OR, 2022)

The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective. - Christoph Buchheim; Dorothee Henke (J. Glob. Optim., 2022)

The Stochastic Bilevel Continuous Knapsack Problem with Uncertain Follower's Objective. - Christoph Buchheim; Dorothee Henke; Jannik Irmai (J. Optim. Theory Appl., 2022)

On the complexity of the bilevel minimum spanning tree problem. - Christoph Buchheim; Dorothee Henke; Felix Hommelsheim (Networks, 2022)

Convex optimization under combinatorial sparsity constraints. - Christoph Buchheim; Emiliano Traversi (Oper. Res. Lett., 2022)

Optimization at the Second Level (Dagstuhl Seminar 22441). - Luce Brotcorne; Christoph Buchheim; Dick den Hertog; Dorothee Henke (Dagstuhl Reports, 2022)

The polytope of binary sequences with bounded variation. - Christoph Buchheim; Maja Hügging (Discret. Optim., 2023)

Bilevel linear optimization belongs to NP and admits polynomial-size KKT-based reformulations. - Christoph Buchheim (Oper. Res. Lett., 2023)

Parabolic Optimal Control Problems with Combinatorial Switching Constraints, Part I: Convex Relaxations. - Christoph Buchheim; Alexandra Grütering; Christian Meyer (SIAM J. Optim., 2024)

Parabolic Optimal Control Problems with Combinatorial Switching Constraints, Part II: Outer Approximation Algorithm. - Christoph Buchheim; Alexandra Grütering; Christian Meyer (SIAM J. Optim., 2024)

An oracle-based framework for robust combinatorial optimization. - Enrico Bettiol; Christoph Buchheim; Marianna De Santis; Francesco Rinaldi (J. Glob. Optim., 2024)

Parabolic optimal control problems with combinatorial switching constraints, part III: branch-and-bound algorithm. - Christoph Buchheim; Alexandra Grütering; Christian Meyer (Comput. Optim. Appl., 2025)

Extended formulations for binary optimal control problems. - Christoph Buchheim (Math. Program., 2025)