Christoph Buchheim

	2011
32		Christoph Buchheim, Frauke Liers, Laura Sanità: An Exact Algorithm for Robust Network Design. INOC 2011: 7-17
	2010
31		Federico Bizzarri, Christoph Buchheim, Sergio Callegari, Alberto Caprara, Andrea Lodi, Riccardo Rovatti, Gianluca Setti: Practical Solution of Periodic Filtered Approximation as a Convex Quadratic Integer Program. CSDM 2010: 149-160
30		Frank Baumann, Christoph Buchheim, Frauke Liers: Exact Bipartite Crossing Minimization under Tree Constraints. CTW 2010: 17-20
29		Christoph Buchheim, Alberto Caprara, Andrea Lodi: An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming. IPCO 2010: 285-298
28		Frank Baumann, Christoph Buchheim, Frauke Liers: Exact Bipartite Crossing Minimization under Tree Constraints. SEA 2010: 118-128
27		Frank Baumann, Christoph Buchheim: Submodular Formulations for Range Assignment Problems. Electronic Notes in Discrete Mathematics 36: 239-246 (2010)
26		Christoph Buchheim, Angelika Wiegele, Lanbo Zheng: Exact Algorithms for the Quadratic Linear Ordering Problem. INFORMS Journal on Computing 22(1): 168-177 (2010)
25		Christoph Buchheim, Frauke Liers, Marcus Oswald: Speeding up IP-based algorithms for constrained quadratic 0-1 optimization. Math. Program. 124(1-2): 513-535 (2010)
24		Christoph Buchheim, Dennis Michaels, Robert Weismantel: Integer Programming Subject to Monomial Constraints. SIAM Journal on Optimization 20(6): 3297-3311 (2010)
	2009
23		Christoph Buchheim, Peter J. Cameron, Taoyang Wu: On the subgroup distance problem. Discrete Mathematics 309(4): 962-968 (2009)
22		Christoph Buchheim, Giovanni Rinaldi: Terse Integer Linear Programs for Boolean Optimization. JSAT 6(1-3): 121-139 (2009)
	2008
21		Christoph Buchheim, Frauke Liers, Marcus Oswald: A Basic Toolbox for Constrained Quadratic 0/1 Optimization. WEA 2008: 249-262
20		Christoph Buchheim, Seok-Hee Hong: Testing Planarity of Geometric Automorphisms in Linear Time. Algorithmica 52(4): 448-465 (2008)
19		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)
18		Christoph Buchheim, Frauke Liers, Marcus Oswald: Local cuts revisited. Oper. Res. Lett. 36(4): 430-433 (2008)
	2007
17		Lanbo Zheng, Christoph Buchheim: A New Exact Algorithm for the Two-Sided Crossing Minimization Problem. COCOA 2007: 301-310
16		Christoph Buchheim, Giovanni Rinaldi: Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case. SIAM Journal on Optimization 18(4): 1398-1413 (2007)
	2006
15		Christoph Buchheim, Michael Jünger, Annette Menze, Merijam Percan: Bimodal Crossing Minimization. COCOON 2006: 497-506
14		Christoph Buchheim, Lanbo Zheng: Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem. COCOON 2006: 507-516
13		Christoph Buchheim, Peter J. Cameron, Taoyang Wu: On the Subgroup Distance Problem. Electronic Colloquium on Computational Complexity (ECCC) 13(146): (2006)
12		Christoph Buchheim, Michael Jünger, Sebastian Leipert: Drawing rooted trees in linear time. Softw., Pract. Exper. 36(6): 651-665 (2006)
	2005
11		Christoph Buchheim, Dietmar Ebner, Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher: Exact Crossing Minimization. Graph Drawing 2005: 37-48
10		Christoph Buchheim, Michael Jünger: Linear optimization over permutation groups. Discrete Optimization 2(4): 308-319 (2005)
9		Christoph Buchheim, Seok-Hee Hong: Crossing Minimization for Symmetries. Theory Comput. Syst. 38(3): 293-311 (2005)
	2004
8		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
7		Christoph Buchheim, Michael Jünger: An Integer Programming Approach to Fuzzy Symmetry Detection. Graph Drawing 2003: 166-177
6		Christoph Buchheim, Michael Jünger: Detecting symmetries by branch & cut. Math. Program. 98(1-3): 369-384 (2003)
	2002
5		Christoph Buchheim, Michael Jünger, Sebastian Leipert: Improving Walker's Algorithm to Run in Linear Time. Graph Drawing 2002: 344-353
4		Christoph Buchheim, Seok-Hee Hong: Crossing Minimization for Symmetries. ISAAC 2002: 563-574
	2001
3		Christoph Buchheim, Michael Jünger: Detecting Symmetries by Branch & Cut. Graph Drawing 2001: 178-188
	2000
2		Christoph Buchheim, Michael Jünger, Sebastian Leipert: A Fast Layout Algorithm for k-Level Graphs. Graph Drawing 2000: 229-240
	1998
1		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

Coauthor Index

1	Thorsten Akkerman	[8]
2	David Alberts	[1]
3	Dirk Ambras	[1]
4	Frank Baumann	[27] [28] [30]
5	Federico Bizzarri	[31]
6	Ralf Brockenauer	[1]
7	Sergio Callegari	[31]
8	Peter J. Cameron	[13] [23]
9	Alberto Caprara	[29] [31]
10	Markus Chimani	[19]
11	Dietmar Ebner	[11] [19]
12	Sergej Fialko	[1]
13	Carsten Gutwenger	[1] [19]
14	Seok-Hee Hong	[4] [9] [20]
15	Michael Jünger	[1] [2] [3] [5] [6] [7] [8] [10] [11] [12] [15] [19]
16	Gunnar W. Klau	[1] [11] [19]
17	Gunter Koch	[1]
18	Michael Krüger	[1]
19	Sebastian Leipert	[1] [2] [5] [12]
20	Frauke Liers	[18] [21] [25] [28] [30] [32]
21	Andrea Lodi	[29] [31]
22	Annette Menze	[15]
23	Dennis Michaels	[24]
24	Petra Mutzel	[1] [11] [19]
25	Stefan Näher	[1]
26	Marcus Oswald	[18] [21] [25]
27	Merijam Percan	[15]
28	Giovanni Rinaldi	[16] [22]
29	Riccardo Rovatti	[31]
30	Laura Sanità	[32]
31	Gianluca Setti	[31]
32	Daniel Teske	[8]
33	René Weiskircher	[11] [19]
34	Robert Weismantel	[24]
35	Angelika Wiegele	[26]
36	Taoyang Wu	[13] [23]
37	Lanbo Zheng	[14] [17] [26]
38	Thomas Ziegler	[1]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page