The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "André Berger" ( http://dblp.L3S.de/Authors/André_Berger )

  Author page on DBLP  Author page in RDF  Community of André Berger in ASPL-2

Publication years (Num. hits)
2005-2011 (15) 2012 (1)
Publication types (Num. hits)
article(6) inproceedings(10)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 15 occurrences of 15 keywords

Results
Found 16 publication records. Showing 16 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1André Berger, Ojas Parekh Erratum to: Linear Time Algorithms for Generalized Edge Dominating Set Problems. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1André Berger, Ralf Hoffmann, Ulf Lorenz, Sebastian Stiller Online railway delay management: Hardness, simulation and computation. Search on Bibsonomy Simulation The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1André Berger, Alexander Grigoriev, Joyce van Loon Price strategy implementation. Search on Bibsonomy Computers & OR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1André Berger, Vincenzo Bonifaci, Fabrizio Grandoni, Guido Schäfer Budgeted matching and budgeted matroid intersection via the gasoline puzzle. Search on Bibsonomy Math. Program. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ruben van der Zwaan, André Berger, Alexander Grigoriev How to Cut a Graph into Many Pieces. Search on Bibsonomy TAMC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1André Berger, Heiko Röglin, Ruben van der Zwaan Path Trading: Fast Algorithms, Smoothed Analysis, and Hardness Results. Search on Bibsonomy SEA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Andre Berger, James Gross, Tobias Harks The k-Constrained Bipartite Matching Problem: Approximation Algorithms and Applications to Wireless Networks. Search on Bibsonomy INFOCOM The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1André Berger, Rudolf Müller, Seyed Hossein Naeemi Characterizing Incentive Compatibility for Convex Valuations. Search on Bibsonomy SAGT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Mechanism design, Convexity, Incentive compatibility, Social choice theory
1André Berger, Ojas Parekh Linear Time Algorithms for Generalized Edge Dominating Set Problems. Search on Bibsonomy Algorithmica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Approximation algorithm, Trees, Edge dominating set
1André Berger, Ralf Hoffmann, Ulf Lorenz, Sebastian Stiller TOPSU - RDM a simulation platform for online railway delay management. Search on Bibsonomy SimuTools The full citation details ... 2008 DBLP  DOI  BibTeX  RDF online railway delay management, simulation, heuristics, transportation, stochastic scheduling, PSPACE, experimental algorithms, online optimization, web-based simulation
1André Berger, Vincenzo Bonifaci, Fabrizio Grandoni, Guido Schäfer Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle. Search on Bibsonomy IPCO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1André Berger, Takuro Fukunaga, Hiroshi Nagamochi, Ojas Parekh Approximability of the capacitated b-edge dominating set problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1André Berger, Michelangelo Grigni Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs. Search on Bibsonomy ICALP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1André Berger, Nader Razouk, Greg Angelides Distance- and curvature-constrained shortest paths and an application in mission planning. Search on Bibsonomy ACM Southeast Regional Conference The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1André Berger, Artur Czumaj, Michelangelo Grigni, Hairong Zhao Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs. Search on Bibsonomy ESA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1André Berger, Ojas Parekh Linear Time Algorithms for Generalized Edge Dominating Set Problems. Search on Bibsonomy WADS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #16 of 16 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.