|
Search the dblp DataBase
André Berger:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- André Berger, Nader Razouk, Greg Angelides
Distance- and curvature-constrained shortest paths and an application in mission planning. [Citation Graph (0, 0)][DBLP] ACM Southeast Regional Conference, 2006, pp:766-767 [Conf]
- André Berger, Artur Czumaj, Michelangelo Grigni, Hairong Zhao
Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs. [Citation Graph (0, 0)][DBLP] ESA, 2005, pp:472-483 [Conf]
- André Berger, Ojas Parekh
Linear Time Algorithms for Generalized Edge Dominating Set Problems. [Citation Graph (0, 0)][DBLP] WADS, 2005, pp:233-243 [Conf]
- André Berger, Michelangelo Grigni
Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs. [Citation Graph (0, 0)][DBLP] ICALP, 2007, pp:90-101 [Conf]
- André Berger, Takuro Fukunaga, Hiroshi Nagamochi, Ojas Parekh
Approximability of the capacitated b-edge dominating set problem. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:385, n:1-3, pp:202-213 [Journal]
Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle. [Citation Graph (, )][DBLP]
Characterizing Incentive Compatibility for Convex Valuations. [Citation Graph (, )][DBLP]
Linear Time Algorithms for Generalized Edge Dominating Set Problems. [Citation Graph (, )][DBLP]
Price strategy implementation. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs
|