André Berger

	2012
15		André Berger, Ojas Parekh: Erratum to: Linear Time Algorithms for Generalized Edge Dominating Set Problems. Algorithmica 62(1-2): 633-634 (2012)
	2011
14		André Berger, Heiko Röglin, Ruben van der Zwaan: Path Trading: Fast Algorithms, Smoothed Analysis, and Hardness Results. SEA 2011: 43-53
13		Ruben van der Zwaan, André Berger, Alexander Grigoriev: How to Cut a Graph into Many Pieces. TAMC 2011: 184-194
12		André Berger, Alexander Grigoriev, Joyce van Loon: Price strategy implementation. Computers & OR 38(2): 420-426 (2011)
11		André Berger, Vincenzo Bonifaci, Fabrizio Grandoni, Guido Schäfer: Budgeted matching and budgeted matroid intersection via the gasoline puzzle. Math. Program. 128(1-2): 355-372 (2011)
10		André Berger, Ralf Hoffmann, Ulf Lorenz, Sebastian Stiller: Online railway delay management: Hardness, simulation and computation. Simulation 87(7): 616-629 (2011)
	2009
9		André Berger, Rudolf Müller, Seyed Hossein Naeemi: Characterizing Incentive Compatibility for Convex Valuations. SAGT 2009: 24-35
	2008
8		André Berger, Vincenzo Bonifaci, Fabrizio Grandoni, Guido Schäfer: Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle. IPCO 2008: 273-287
7		André Berger, Ralf Hoffmann, Ulf Lorenz, Sebastian Stiller: TOPSU - RDM a simulation platform for online railway delay management. SimuTools 2008: 20
6		André Berger, Ojas Parekh: Linear Time Algorithms for Generalized Edge Dominating Set Problems. Algorithmica 50(2): 244-254 (2008)
	2007
5		André Berger, Michelangelo Grigni: Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs. ICALP 2007: 90-101
4		André Berger, Takuro Fukunaga, Hiroshi Nagamochi, Ojas Parekh: Approximability of the capacitated b-edge dominating set problem. Theor. Comput. Sci. 385(1-3): 202-213 (2007)
	2006
3		André Berger, Nader Razouk, Greg Angelides: Distance- and curvature-constrained shortest paths and an application in mission planning. ACM Southeast Regional Conference 2006: 766-767
	2005
2		André Berger, Artur Czumaj, Michelangelo Grigni, Hairong Zhao: Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs. ESA 2005: 472-483
1		André Berger, Ojas Parekh: Linear Time Algorithms for Generalized Edge Dominating Set Problems. WADS 2005: 233-243

Coauthor Index

1	Greg Angelides	[3]
2	Vincenzo Bonifaci	[8] [11]
3	Artur Czumaj	[2]
4	Takuro Fukunaga	[4]
5	Fabrizio Grandoni	[8] [11]
6	Michelangelo Grigni	[2] [5]
7	Alexander Grigoriev	[12] [13]
8	Ralf Hoffmann	[7] [10]
9	Joyce van Loon	[12]
10	Ulf Lorenz	[7] [10]
11	Rudolf Müller	[9]
12	Seyed Hossein Naeemi	[9]
13	Hiroshi Nagamochi	[4]
14	Ojas Parekh	[1] [4] [6] [15]
15	Nader Razouk	[3]
16	Heiko Röglin (Heiko Roeglin)	[14]
17	Guido Schäfer	[8] [11]
18	Sebastian Stiller	[7] [10]
19	Hairong Zhao	[2]
20	Ruben van der Zwaan	[13] [14]

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