André Berger

Arman Rouhani

Marc Schröder

CoRR, 2024

2020

Time- and Space-optimal Algorithm for the Many-visits TSP.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

2019

Degree-Bounded Generalized Polymatroids and Approximating the Metric Many-Visits TSP.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Time- and space-optimal algorithms for the many-visits TSP.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Characterizing implementable allocation rules in multi-dimensional environments.

[BibT_eX]

[DOI]

Rudolf Müller

Seyed Hossein Naeemi

Soc. Choice Welf., 2017

Location, pricing and the problem of Apollonius.

[BibT_eX]

[DOI]

Optim. Lett., 2017

An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions.

[BibT_eX]

[DOI]

Andrej Winokurow

Comput. Optim. Appl., 2017

Dynamic Flow Migration for Delay Constrained Traffic in Software-Defined Networks.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Global Communications Conference, 2017

2016

Constrained Resource Assignments: Fast Algorithms and Applications in Wireless Networks.

[BibT_eX]

[DOI]

Manag. Sci., 2016

A PTAS for the Cluster Editing Problem on Planar Graphs.

[BibT_eX]

[DOI]

Andrej Winokurow

Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

2015

On Time-Optimal Trajectories in Non-Uniform Mediums.

[BibT_eX]

[DOI]

J. Optim. Theory Appl., 2015

Internet routing between autonomous systems: Fast algorithms for path trading.

[BibT_eX]

[DOI]

Heiko Röglin

Discret. Appl. Math., 2015

2014

Scheduling unit-length jobs with precedence constraints of small height.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2014

Complexity and approximability of the <i>k</i>-way vertex cut.

[BibT_eX]

[DOI]

Networks, 2014

2012

Erratum to: Linear Time Algorithms for Generalized Edge Dominating Set Problems.

[BibT_eX]

[DOI]

Ojas Parekh

Algorithmica, 2012

2011

Online railway delay management: Hardness, simulation and computation.

[BibT_eX]

[DOI]

Simul., 2011

Budgeted matching and budgeted matroid intersection via the gasoline puzzle.

[BibT_eX]

[DOI]

Math. Program., 2011

Price strategy implementation.

[BibT_eX]

[DOI]

Joyce van Loon

Comput. Oper. Res., 2011

Path Trading: Fast Algorithms, Smoothed Analysis, and Hardness Results.

[BibT_eX]

[DOI]

Heiko Röglin

Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

How to Cut a Graph into Many Pieces.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2011

2010

The k-Constrained Bipartite Matching Problem: Approximation Algorithms and Applications to Wireless Networks.

[BibT_eX]

[DOI]

James Gross

Tobias Harks

Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

2009

Characterizing Incentive Compatibility for Convex Valuations.

[BibT_eX]

[DOI]

Rudolf Müller

Seyed Hossein Naeemi

Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

2008

Linear Time Algorithms for Generalized Edge Dominating Set Problems.

[BibT_eX]

[DOI]

Ojas Parekh

Algorithmica, 2008

TOPSU - RDM a simulation platform for online railway delay management.

[BibT_eX]

[DOI]

Proceedings of the 1st International Conference on Simulation Tools and Techniques for Communications, 2008

2007

Approximability of the capacitated b-edge dominating set problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs.

[BibT_eX]

[DOI]

Michelangelo Grigni

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006

Distance- and curvature-constrained shortest paths and an application in mission planning.

[BibT_eX]

[DOI]