Yann Disser

David Weckbecker

SIAM J. Discret. Math., March, 2024

Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., March, 2024

Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

A (5/3+ε)-Approximation for Tricolored Non-Crossing Euclidean TSP.

[BibT_eX]

[DOI]

Júlia Baligács

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023

An exponential lower bound for Zadeh's pivot rule.

[BibT_eX]

[DOI]

Oliver Friedmann

Alexander V. Hopp

Math. Program., May, 2023

Improved Bounds for Open Online Dial-a-Ride on the Line.

[BibT_eX]

[DOI]

Alexander Birx

Kevin Schewior

Algorithmica, May, 2023

Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition.

[BibT_eX]

[DOI]

Simon Emde

Shohre Zehtabian

Ann. Oper. Res., March, 2023

Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

A Unified Worst Case for Classical Simplex and Policy Iteration Pivot Rules.

[BibT_eX]

[DOI]

Nils Mosis

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Incremental Maximization via Continuization.

[BibT_eX]

[DOI]

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Exploration of Graphs with Excluded Minors.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Breaking the Size Barrier: Universal Circuits Meet Lookup Tables.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2023, 2023

2022

General bounds for incremental maximization.

[BibT_eX]

[DOI]

Math. Program., 2022

Improved Universal Circuits using Lookup Tables.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Tight analysis of lazy: an improved algorithm for open online dial-a-ride.

[BibT_eX]

[DOI]

Júlia Baligács

David Weckbecker

CoRR, 2022

An Improved Algorithm for Open Online Dial-a-Ride.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 20th International Workshop, 2022

On Sparse Hitting Sets: From Fair Vertex Cover to Highway Dimension.

[BibT_eX]

[DOI]

Johannes Blum

Siddharth Gupta

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

The Space Complexity of Undirected Graph Exploration.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Big Data - DFG Priority Program 1736, 2022

2021

Collaborative delivery on a fixed path with homogeneous energy-constrained agents.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

An improved lower bound for competitive graph exploration.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Tight Bounds for Online TSP on the Line.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2021

Travelling on Graphs with Small Highway Dimension.

[BibT_eX]

[DOI]

Jochen Könemann

Algorithmica, 2021

Fractionally Subadditive Maximization Under an Incremental Knapsack Constraint.

[BibT_eX]

[DOI]

David Weckbecker

Proceedings of the Approximation and Online Algorithms - 19th International Workshop, 2021

Efficient fully dynamic elimination forests with applications to detecting long paths and cycles.

[BibT_eX]

[DOI]

Jiehua Chen

Wojciech Czerwinski

Bartlomiej Wróblewski

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

A general lower bound for collaborative tree exploration.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Collaborative delivery with energy-constrained mobile robots.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line.

[BibT_eX]

[DOI]

Alexander Birx

SIAM J. Discret. Math., 2020

The complexity of computing a robust flow.

[BibT_eX]

[DOI]

Jannik Matuschke

Oper. Res. Lett., 2020

Hiring Secretaries over Time: The Benefit of Concurrent Employment.

[BibT_eX]

[DOI]

Math. Oper. Res., 2020

On Dynamic Parameterized k-Path.

[BibT_eX]

[DOI]

Jiehua Chen

Wojciech Czerwinski

Bartlomiej Wróblewski

CoRR, 2020

Improved Lower Bound for Competitive Graph Exploration.

[BibT_eX]

[DOI]

CoRR, 2020

Recoloring Interval Graphs with Limited Recourse Budget.

[BibT_eX]

[DOI]

Bartlomiej Bosek

Jakub Pawlewicz

Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

2019

Scheduling maintenance jobs in networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

The Simplex Algorithm Is NP-Mighty.

[BibT_eX]

[DOI]

Martin Skutella

ACM Trans. Algorithms, 2019

Distance-Preserving Graph Contractions.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Approximate lumpability for Markovian agent-based models using local symmetries.

[BibT_eX]

[DOI]

Wasiur R. KhudaBukhsh

Arnab Auddy

Heinz Koeppl

J. Appl. Probab., 2019

Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents.

[BibT_eX]

[DOI]

Jan Hackfeld

J. ACM, 2019

The Minimum Feasible Tileset Problem.

[BibT_eX]

[DOI]

Stefan Kratsch

Manuel Sorge

Algorithmica, 2019

Evacuating Two Robots from a Disk: A Second Cut.

[BibT_eX]

[DOI]

Sören Schmitt

Proceedings of the Structural Information and Communication Complexity, 2019

On Friedmann's Subexponential Lower Bound for Zadeh's Pivot Rule.

[BibT_eX]

[DOI]

Alexander V. Hopp

Proceedings of the Integer Programming and Combinatorial Optimization, 2019

2017

Packing a Knapsack of Unknown Capacity.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

Distance-preserving graph contractions.

[BibT_eX]

[DOI]

CoRR, 2017

Robust and Adaptive Search.

[BibT_eX]

[DOI]

Stefan Kratsch

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Energy-Efficient Delivery by Heterogeneous Mobile Agents.

[BibT_eX]

[DOI]

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

General Bounds for Incremental Maximization.

[BibT_eX]

[DOI]

Aaron Bernstein

Martin Groß

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

Degree-constrained orientations of embedded graphs.

[BibT_eX]

[DOI]

Jannik Matuschke

J. Comb. Optim., 2016

Undirected Graph Exploration with ⊝(log log n) Pebbles.

[BibT_eX]

[DOI]

Jan Hackfeld

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015

Improving the Hk-bound on the price of stability in undirected Shapley network design games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Mapping Simple Polygons: The Power of Telling Convex from Reflex.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2015

Fast collaborative graph exploration.

[BibT_eX]

[DOI]

Inf. Comput., 2015

Scheduling Bidirectional Traffic on a Path.

[BibT_eX]

[DOI]

Elisabeth Lübbecke

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

Mapping a polygon with holes using a compass.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2013

Simple agents learn to find their way: An introduction on mapping polygons.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

In defense of the Simplex Algorithm's worst-case behavior.

[BibT_eX]

[DOI]

Martin Skutella

CoRR, 2013

Mapping Simple Polygons: How Robots Benefit from Looking Back.

[BibT_eX]

[DOI]

Algorithmica, 2013

Interval Selection with Machine-Dependent Intervals.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

Polygon-Constrained Motion Planning Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2013

2012

Reconstructing visibility graphs with simple robots.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Improving the $H_k$-Bound on the Price of Stability in Undirected Shapley Network Design Games

[BibT_eX]

[DOI]

CoRR, 2012

Mapping Polygons with Agents That Measure Angles.

[BibT_eX]

[DOI]

Peter Widmayer

Proceedings of the Algorithmic Foundations of Robotics X, 2012

2011

Mapping Polygons.

[BibT_eX]

[DOI]

PhD thesis, 2011

A polygon is determined by its angles.

[BibT_eX]

[DOI]

Peter Widmayer

Comput. Geom., 2011

Telling convex from reflex allows to map a polygon.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

2010

Reconstructing a Simple Polygon from Its Angles.

[BibT_eX]

[DOI]

Peter Widmayer

Proceedings of the Algorithm Theory, 2010

How Simple Robots Benefit from Looking Back.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2008

Multi-criteria Shortest Paths in Time-Dependent Train Networks.

[BibT_eX]

[DOI]