 | 2009 |
|---|
| 8 |       | André Berger,
Rudolf Müller,
Seyed Hossein Naeemi:
Characterizing Incentive Compatibility for Convex Valuations.
SAGT 2009: 24-35 |
| 2008 |
|---|
| 7 | | André Berger,
Vincenzo Bonifaci,
Fabrizio Grandoni,
Guido Schäfer:
Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle.
IPCO 2008: 273-287 |
| 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 |
