| No. |
Title |
Author |
Year |
| 1 |
Exploration of Graphs with Excluded Minors |
Baligács, Júlia et al. |
2023 |
| 2 |
Incremental Maximization via Continuization |
Disser, Yann et al. |
2023 |
| 3 |
On Sparse Hitting Sets: From Fair Vertex Cover to Highway Dimension |
Blum, Johannes et al. |
2022 |
| 4 |
Recoloring Interval Graphs with Limited Recourse Budget |
Bosek, Bartłomiej et al. |
2020 |
| 5 |
Improved Bounds for Open Online Dial-a-Ride on the Line |
Birx, Alexander et al. |
2019 |
| 6 |
Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line |
Birx, Alexander et al. |
2019 |
| 7 |
Distance-Preserving Graph Contractions |
Bernstein, Aaron et al. |
2018 |
| 8 |
Energy-Efficient Delivery by Heterogeneous Mobile Agents |
Bärtschi, Andreas et al. |
2017 |
| 9 |
General Bounds for Incremental Maximization |
Bernstein, Aaron et al. |
2017 |
| 10 |
Robust and Adaptive Search |
Disser, Yann et al. |
2017 |
| 11 |
Packing a Knapsack of Unknown Capacity |
Disser, Yann et al. |
2014 |
| 12 |
Telling convex from reflex allows to map a polygon |
Chalopin, Jeremie et al. |
2011 |
