Universität zu Köln

Journal Article

Buchheim, Christoph ORCID: 0000-0001-9974-404X, Michaels, Dennis and Weismantel, Robert (2010). Integer Programming Subject to Monomial Constraints. SIAM journal on optimization : a publication of the Society for Industrial and Applied Mathematics, 20 (6). pp. 3297-3311. SIAM.

Buchheim, Christoph ORCID: 0000-0001-9974-404X, Liers, Frauke and Oswald, Marcus (2010). Speeding up IP-based Algorithms for Constrained Quadratic 0-1 Optimization. Mathematical Programming B, 124 (1-2). pp. 513-535. Springer.

Buchheim, Christoph ORCID: 0000-0001-9974-404X, Cameron, Peter J. and Wu, Taoyang (2009). On the Subgroup Distance Problem. Discrete Mathematics, 309 (4). pp. 962-968. Elsevier Science.

Buchheim, Christoph ORCID: 0000-0001-9974-404X and Rinaldi, Giovanni ORCID: 0000-0003-0148-2470 (2009). Terse Integer Linear Programs for Boolean Optimization. Journal on Satisfiability, Boolean Modeling and Computation, 6. pp. 121-139.

Buchheim, Christoph ORCID: 0000-0001-9974-404X and Hong, Seok-Hee (2008). Testing Planarity of Geometric Automorphisms in Linear Time. Algorithmica, 52 (4). pp. 448-465. Springer.

Buchheim, Christoph ORCID: 0000-0001-9974-404X, Chimani, Markus, Ebner, Dietmar, Gutwenger, Carsten, Klau, Gunnar W., Mutzel, Petra ORCID: 0000-0001-7621-971X and Weiskircher, René (2008). A branch-and-cut approach to the crossing number problem. Discrete optimization, 5 (2). pp. 373-388. Elsevier.

Buchheim, Christoph ORCID: 0000-0001-9974-404X, Wiegele, Angelika ORCID: 0000-0003-1670-7951 and Zheng, Lanbo (2007). Exact Algorithms for the Quadratic Linear Ordering Problem. INFORMS Journal on Computing, 22 (1). pp. 168-177. Informs.

Buchheim, Christoph ORCID: 0000-0001-9974-404X and Jünger, Michael (2005). Linear Optimization over Permutation Groups. Discrete Optimization, 2 (4). pp. 308-319. Springer.

Akkerman, Thorsten, Buchheim, Christoph ORCID: 0000-0001-9974-404X, Jünger, Michael and Teske, Daniel (2004). On the Complexity of Drawing Trees Nicely: Corrigendum. Acta Informatica, 40 (8). pp. 603-607. Springer.

Book Section, Proceedings Item or annotation in a legal commentary

Baumann, Frank, Buchheim, Christoph ORCID: 0000-0001-9974-404X and Liers, Frauke (2010). Exact Bipartite Crossing Minimization under Tree Constraints. In: 9th International Symposium on Experimental Algorithms SEA 2010, pp. 118-128. Springer Verlag.

Buchheim, Christoph ORCID: 0000-0001-9974-404X and Zheng, Lanbo (2006). Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem. In: Computing and combinatorics : 12th annual international conference, COCOON 2006, Taipei, Taiwan, August 15 - 18, 2006 ; proceedings, pp. 507-516. Springer.

Buchheim, Christoph ORCID: 0000-0001-9974-404X and Jünger, Michael (2004). An Integer Programming Approach to Fuzzy Symmetry Detection. In: Graph drawing 11th International Symposium, GD 2003, Perugia, Italy, September 21 - 24, 2003 ; revised papers, pp. 166-177. Springer.

Buchheim, Christoph ORCID: 0000-0001-9974-404X and Hong, Seok-Hee (2002). Crossing Minimization for Symmetries (Extended Abstract). In: Algorithms and Computation : 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002 ; proceedings, pp. 137-152. Springer.

Preprints, Working Papers or Reports

Baumann, Frank and Buchheim, Christoph ORCID: 0000-0001-9974-404X (2009). Compact and Extended Formulations for Range Assignment Problems. Working Paper.

Buchheim, Christoph ORCID: 0000-0001-9974-404X, Jünger, Michael, Percan, Merijam, Schulz, Michael and Thelen, Christina (2007). Drawing cycles in networks. Working Paper.

Buchheim, Christoph ORCID: 0000-0001-9974-404X, Jünger, Michael, Kandyba, Maria, Percan, Merijam and Schulz, Michael (2007). Planarization With Fixed Subgraph Embedding. Working Paper.

Other

Buchheim, Christoph ORCID: 0000-0001-9974-404X, Jünger, Michael and Leipert, Sebastian (2001). A Fast Layout Algorithm for k-Level Graphs. Springer.