default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndré Berger
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i4]André Berger, Arman Rouhani, Marc Schröder:
An improved bound for the price of anarchy for related machine scheduling. CoRR abs/2401.05740 (2024)- [i3]André Berger, Arman Rouhani, Marc Schröder:
Fixed Order Scheduling with Deadlines. CoRR abs/2412.10760 (2024) - 2020
- [j15]André Berger, László Kozma
, Matthias Mnich, Roland Vincze:
Time- and Space-optimal Algorithm for the Many-visits TSP. ACM Trans. Algorithms 16(3): 35:1-35:22 (2020)
2010 – 2019
- 2019
- [c14]André Berger, László Kozma, Matthias Mnich, Roland Vincze:
A time- and space-optimal algorithm for the many-visits TSP. SODA 2019: 1770-1782 - [i2]Kristóf Bérczi, André Berger, Matthias Mnich, Roland Vincze:
Degree-Bounded Generalized Polymatroids and Approximating the Metric Many-Visits TSP. CoRR abs/1911.09890 (2019) - 2018
- [i1]André Berger, László Kozma, Matthias Mnich, Roland Vincze:
Time- and space-optimal algorithms for the many-visits TSP. CoRR abs/1804.06361 (2018) - 2017
- [j14]André Berger, Alexander Grigoriev, Andrej Winokurow:
An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions. Comput. Optim. Appl. 68(3): 661-669 (2017) - [j13]André Berger, Alexander Grigoriev, Artem A. Panin, Andrej Winokurow:
Location, pricing and the problem of Apollonius. Optim. Lett. 11(8): 1797-1805 (2017) - [j12]André Berger, Rudolf Müller, Seyed Hossein Naeemi:
Characterizing implementable allocation rules in multi-dimensional environments. Soc. Choice Welf. 48(2): 367-383 (2017) - [c13]Peter Danielis, György Dán, James Gross, André Berger:
Dynamic Flow Migration for Delay Constrained Traffic in Software-Defined Networks. GLOBECOM 2017: 1-7 - 2016
- [j11]André Berger, James Gross, Tobias Harks, Simon Tenbusch:
Constrained Resource Assignments: Fast Algorithms and Applications in Wireless Networks. Manag. Sci. 62(7): 2070-2089 (2016) - [c12]André Berger, Alexander Grigoriev, Artem A. Panin, Andrej Winokurow:
Location, Pricing and the Problem of Apollonius. DOOR 2016: 563-569 - [c11]André Berger, Alexander Grigoriev, Andrej Winokurow:
A PTAS for the Cluster Editing Problem on Planar Graphs. WAOA 2016: 27-39 - 2015
- [j10]André Berger, Heiko Röglin, Ruben van der Zwaan:
Internet routing between autonomous systems: Fast algorithms for path trading. Discret. Appl. Math. 185: 8-17 (2015) - [j9]André Berger, Alexander Grigoriev, Ralf Peeters, Natalya Usotskaya:
On Time-Optimal Trajectories in Non-Uniform Mediums. J. Optim. Theory Appl. 165(2): 586-626 (2015) - 2014
- [j8]André Berger, Alexander Grigoriev, Ruben van der Zwaan:
Complexity and approximability of the k-way vertex cut. Networks 63(2): 170-178 (2014) - [j7]André Berger, Alexander Grigoriev, Pinar Heggernes, Ruben van der Zwaan:
Scheduling unit-length jobs with precedence constraints of small height. Oper. Res. Lett. 42(2): 166-172 (2014) - 2012
- [j6]André Berger, Ojas Parekh:
Erratum to: Linear Time Algorithms for Generalized Edge Dominating Set Problems. Algorithmica 62(1-2): 633-634 (2012) - 2011
- [j5]André Berger, Alexander Grigoriev, Joyce van Loon:
Price strategy implementation. Comput. Oper. Res. 38(2): 420-426 (2011) - [j4]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) - [j3]André Berger, Ralf Hoffmann, Ulf Lorenz, Sebastian Stiller:
Online railway delay management: Hardness, simulation and computation. Simul. 87(7): 616-629 (2011) - [c10]Ruben van der Zwaan, André Berger, Alexander Grigoriev:
How to Cut a Graph into Many Pieces. TAMC 2011: 184-194 - [c9]André Berger, Heiko Röglin, Ruben van der Zwaan:
Path Trading: Fast Algorithms, Smoothed Analysis, and Hardness Results. SEA 2011: 43-53 - 2010
- [c8]André Berger, James Gross, Tobias Harks:
The k-Constrained Bipartite Matching Problem: Approximation Algorithms and Applications to Wireless Networks. INFOCOM 2010: 2043-2051
2000 – 2009
- 2009
- [c7]André Berger, Rudolf Müller, Seyed Hossein Naeemi:
Characterizing Incentive Compatibility for Convex Valuations. SAGT 2009: 24-35 - 2008
- [j2]André Berger, Ojas Parekh:
Linear Time Algorithms for Generalized Edge Dominating Set Problems. Algorithmica 50(2): 244-254 (2008) - [c6]André Berger, Vincenzo Bonifaci, Fabrizio Grandoni, Guido Schäfer:
Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle. IPCO 2008: 273-287 - [c5]André Berger, Ralf Hoffmann, Ulf Lorenz, Sebastian Stiller:
TOPSU - RDM a simulation platform for online railway delay management. SimuTools 2008: 20 - 2007
- [j1]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) - [c4]André Berger, Michelangelo Grigni:
Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs. ICALP 2007: 90-101 - 2006
- [c3]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
- [c2]André Berger, Artur Czumaj, Michelangelo Grigni, Hairong Zhao:
Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs. ESA 2005: 472-483 - [c1]André Berger, Ojas Parekh:
Linear Time Algorithms for Generalized Edge Dominating Set Problems. WADS 2005: 233-243
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-22 20:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
