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