25 citations · 57 across the 24 of their papers we have counts for
5 papers · 1 filter
An Exponential Lower Bound for Zadeh's pivot rule
Yann Disser, Oliver Friedmann, Alexander V. Hopp
The question whether the Simplex Algorithm admits an efficient pivot rule remains one of the most important open questions in discrete optimization. While many natural, determinist…
Improved Bounds for Open Online Dial-a-Ride on the Line
Alexander Birx, Yann Disser, Kevin Schewior
We consider the open, non-preemptive online Dial-a-Ride problem on the real line, where transportation requests appear over time and need to be served by a single server. We give a…
Evacuating Two Robots from a Disk: A Second Cut
Yann Disser, Sören Schmitt
We present an improved algorithm for the problem of evacuating two robots from the unit disk via an unknown exit on the boundary. Robots start at the center of the disk, move at un…
Travelling on Graphs with Small Highway Dimension
Yann Disser, Andreas Emil Feldmann, Max Klimm +1
We study the Travelling Salesperson (TSP) and the Steiner Tree problem (STP) in graphs of low highway dimension. This graph parameter was introduced by Abraham et al. [SODA 2010] a…
Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line
Alexander Birx, Yann Disser
The online Dial-a-Ride problem is a fundamental online problem in a metric space, where transportation requests appear over time and may be served in any order by a single server w…