| Publication | Date of Publication | Type |
|---|
| Exploration of graphs with excluded minors | 2025-01-06 | Paper |
| Incremental maximization via continuization | 2024-11-14 | Paper |
| Breaking the size barrier: universal circuits meet lookup tables | 2024-08-30 | Paper |
| Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows | 2024-02-27 | Paper |
| Unified Greedy Approximability beyond Submodular Maximization | 2024-01-23 | Paper |
| Tight analysis of the lazy algorithm for open online dial-a-ride | 2024-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147300 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059176 | 2023-11-02 | Paper |
| A unified worst case for classical simplex and policy iteration pivot rules | 2023-09-25 | Paper |
| Unified greedy approximability beyond submodular maximization | 2023-08-03 | Paper |
| An improved algorithm for open online dial-a-ride | 2023-07-25 | Paper |
| Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition | 2023-06-20 | Paper |
| An exponential lower bound for Zadeh's pivot rule | 2023-05-02 | Paper |
| Improved bounds for open online dial-a-ride on the line | 2023-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875473 | 2023-02-03 | Paper |
| Fractionally subadditive maximization under an incremental knapsack constraint | 2022-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090461 | 2022-07-18 | Paper |
| General bounds for incremental maximization | 2022-03-22 | Paper |
| Tight Bounds for Online TSP on the Line | 2022-02-08 | Paper |
| Fractionally Subadditive Maximization under an Incremental Knapsack Constraint | 2021-06-28 | Paper |
| Distance-Preserving Graph Contractions | 2021-06-15 | Paper |
| An improved lower bound for competitive graph exploration | 2021-05-10 | Paper |
| Collaborative delivery on a fixed path with homogeneous energy-constrained agents | 2021-05-10 | Paper |
| Travelling on graphs with small highway dimension | 2021-04-19 | Paper |
| Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line | 2020-07-30 | Paper |
| General Bounds for Incremental Maximization | 2020-05-27 | Paper |
| Hiring Secretaries over Time: The Benefit of Concurrent Employment | 2020-04-30 | Paper |
| Evacuating two robots from a disk: a second cut | 2020-03-03 | Paper |
| Collaborative delivery on a fixed path with homogeneous energy-constrained agents | 2020-03-03 | Paper |
| Travelling on graphs with small highway dimension | 2020-02-24 | Paper |
| A general lower bound for collaborative tree exploration | 2020-02-13 | Paper |
| The complexity of computing a robust flow | 2020-02-11 | Paper |
| Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents | 2020-02-11 | Paper |
| Collaborative delivery with energy-constrained mobile robots | 2020-02-06 | Paper |
| On Friedmann's subexponential lower bound for Zadeh's pivot rule | 2020-02-06 | Paper |
| Approximate lumpability for Markovian agent-based models using local symmetries | 2019-10-07 | Paper |
| Distance-Preserving Graph Contractions | 2019-09-06 | Paper |
| Improved Bounds for Open Online Dial-a-Ride on the Line | 2019-07-03 | Paper |
| The Simplex Algorithm Is NP-Mighty | 2019-03-28 | Paper |
| The minimum feasible tileset problem | 2019-03-11 | Paper |
| Scheduling maintenance jobs in networks | 2018-12-04 | Paper |
| Mapping Simple Polygons | 2018-10-30 | Paper |
| Polygon-constrained motion planning problems | 2018-10-17 | Paper |
| Undirected Graph Exploration with ⊝(log log n) Pebbles | 2018-07-16 | Paper |
| Tight Bounds for Online TSP on the Line | 2018-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636607 | 2018-04-19 | Paper |
| Robust and Adaptive Search | 2018-04-19 | Paper |
| A general lower bound for collaborative tree exploration | 2018-04-12 | Paper |
| The Simplex Algorithm Is NP-Mighty | 2017-10-05 | Paper |
| Scheduling maintenance jobs in networks | 2017-07-21 | Paper |
| Packing a Knapsack of Unknown Capacity | 2017-07-14 | Paper |
| Packing a Knapsack of Unknown Capacity | 2017-03-03 | Paper |
| Mapping a Polygon with Holes Using a Compass | 2016-12-19 | Paper |
| Collaborative delivery with energy-constrained mobile robots | 2016-12-01 | Paper |
| Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs | 2016-05-03 | Paper |
| Degree-constrained orientations of embedded graphs | 2016-02-23 | Paper |
| The minimum feasible tileset problem | 2015-11-20 | Paper |
| Scheduling Bidirectional Traffic on a Path | 2015-10-27 | Paper |
| Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods | 2015-10-16 | Paper |
| Fast collaborative graph exploration | 2015-06-09 | Paper |
| Improving the \(H_k\)-bound on the price of stability in undirected Shapley network design games | 2014-12-02 | Paper |
| Mapping a polygon with holes using a compass | 2014-09-18 | Paper |
| Simple agents learn to find their way: an introduction on mapping polygons | 2014-04-16 | Paper |
| Interval Selection with Machine-Dependent Intervals | 2013-08-12 | Paper |
| Fast Collaborative Graph Exploration | 2013-08-07 | Paper |
| Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games | 2013-06-07 | Paper |
| Degree-Constrained Orientations of Embedded Graphs | 2013-03-21 | Paper |
| Mapping simple polygons: how robots benefit from looking back | 2013-03-05 | Paper |
| Reconstructing visibility graphs with simple robots | 2012-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113680 | 2012-01-23 | Paper |
| A polygon is determined by its angles | 2011-08-02 | Paper |
| Reconstructing a Simple Polygon from Its Angles | 2010-06-22 | Paper |
| How Simple Robots Benefit from Looking Back | 2010-05-28 | Paper |
| Reconstructing Visibility Graphs with Simple Robots | 2010-02-24 | Paper |
