| 2019 | SODA | A time- and space-optimal algorithm for the many-visits TSP. | Andr Berger, Lszl Kozma, Matthias Mnich, Roland Vincze |
| 2017 | GLOBECOM | Dynamic Flow Migration for Delay Constrained Traffic in Software-Defined Networks. | Peter Danielis, Gyrgy Dn, James Gross, Andr Berger |
| 2016 | WAOA | A PTAS for the Cluster Editing Problem on Planar Graphs. | Andr Berger, Alexander Grigoriev, Andrej Winokurow |
| 2011 | TAMC | How to Cut a Graph into Many Pieces. | Ruben van der Zwaan, Andr Berger, Alexander Grigoriev |
| 2010 | INFOCOM | The k-Constrained Bipartite Matching Problem: Approximation Algorithms and Applications to Wireless Networks. | Andr Berger, James Gross, Tobias Harks |
| 2009 | SAGT | Characterizing Incentive Compatibility for Convex Valuations. | Andr Berger, Rudolf Mller, Seyed Hossein Naeemi |
| 2008 | IPCO | Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle. | Andr Berger, Vincenzo Bonifaci, Fabrizio Grandoni, Guido Schfer |
| 2007 | ICALP | Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs. | Andr Berger, Michelangelo Grigni |
| 2005 | ESA | Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs. | Andr Berger, Artur Czumaj, Michelangelo Grigni, Hairong Zhao |
| 2005 | WADS | Linear Time Algorithms for Generalized Edge Dominating Set Problems. | Andr Berger, Ojas Parekh |