Budgeted matching and budgeted matroid intersection via the gasoline puzzle A Berger, V Bonifaci, F Grandoni, G Schäfer Mathematical Programming 128, 355-372, 2011 | 79 | 2011 |

Complexity and approximability of the *k*‐way vertex cutA Berger, A Grigoriev, R van der Zwaan Networks 63 (2), 170-178, 2014 | 39* | 2014 |

Online railway delay management: Hardness, simulation and computation A Berger, R Hoffmann, U Lorenz, S Stiller Simulation 87 (7), 616-629, 2011 | 38 | 2011 |

Budgeted matching and budgeted matroid intersection via the gasoline puzzle A Berger, V Bonifaci, F Grandoni, G Schäfer International Conference on Integer Programming and Combinatorial …, 2008 | 35 | 2008 |

Path-monotonicity and incentive compatibility A Berger, RJ Müller, SH Naeemi | 33* | 2010 |

Linear time algorithms for generalized edge dominating set problems A Berger, O Parekh Algorithmica 50, 244-254, 2008 | 28 | 2008 |

Minimum weight 2-edge-connected spanning subgraphs in planar graphs A Berger, M Grigni International Colloquium on Automata, Languages, and Programming, 90-101, 2007 | 27 | 2007 |

Approximation schemes for minimum 2-connected spanning subgraphs in weighted planar graphs A Berger, A Czumaj, M Grigni, H Zhao Algorithms–ESA 2005: 13th Annual European Symposium, Palma de Mallorca …, 2005 | 27* | 2005 |

Characterizing incentive compatibility for convex valuations A Berger, R Müller, SH Naeemi Algorithmic Game Theory: Second International Symposium, SAGT 2009, Paphos …, 2009 | 25 | 2009 |

Approximability of the capacitated b-edge dominating set problem A Berger, T Fukunaga, H Nagamochi, O Parekh Theoretical computer science 385 (1-3), 202-213, 2007 | 17 | 2007 |

TOPSU-RDM a simulation platform for online railway delay management A Berger, R Hoffmann, U Lorenz, S Stiller 1st International ICST Conference on Simulation Tools and Techniques for …, 2010 | 16* | 2010 |

Dynamic flow migration for delay constrained traffic in software-defined networks P Danielis, G Dán, J Gross, A Berger GLOBECOM 2017-2017 IEEE Global Communications Conference, 1-7, 2017 | 13 | 2017 |

Time-and space-optimal algorithm for the many-visits TSP A Berger, L Kozma, M Mnich, R Vincze ACM Transactions on Algorithms (TALG) 16 (3), 1-22, 2020 | 12 | 2020 |

Location, pricing and the problem of Apollonius A Berger, A Grigoriev, A Panin, A Winokurow Optimization Letters 11, 1797-1805, 2017 | 9 | 2017 |

A time-and space-optimal algorithm for the many-visits TSP A Berger, L Kozma, M Mnich, R Vincze Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 8 | 2019 |

An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions A Berger, A Grigoriev, A Winokurow Computational Optimization and Applications 68 (3), 661-669, 2017 | 8 | 2017 |

Constrained resource assignments: Fast algorithms and applications in wireless networks A Berger, J Gross, T Harks, S Tenbusch Management Science 62 (7), 2070-2089, 2016 | 8 | 2016 |

Price strategy implementation A Berger, A Grigoriev, J Van Loon Computers & operations research 38 (2), 420-426, 2011 | 8 | 2011 |

Erratum to: linear time algorithms for generalized edge dominating set problems A Berger, O Parekh Algorithmica 62, 633-634, 2012 | 7 | 2012 |

The k-constrained bipartite matching problem: Approximation algorithms and applications to wireless networks A Berger, J Gross, T Harks 2010 Proceedings IEEE INFOCOM, 1-9, 2010 | 7 | 2010 |