| Publication | Date of Publication | Type |
|---|
| A (5/3+)-approximation for tricolored non-crossing Euclidean TSP | 2026-05-26 | Paper |
| Bicriterial approximation for the incremental prize-collecting Steiner-tree problem | 2026-05-26 | Paper |
Tight analysis of the lazy algorithm for open online dial-a-ride
SIAM Journal on Discrete Mathematics | 2026-04-01 | Paper |
| Incremental-decremental maximization | 2026-02-10 | Paper |
| An unconditional lower bound for the active-set method on the hypercube | 2025-12-22 | Paper |
Exploration of graphs with excluded minors
Journal of Computer and System Sciences | 2025-12-11 | Paper |
| A unified worst case for classical simplex and policy iteration pivot rules | 2025-07-24 | Paper |
| On sparse hitting sets: from fair vertex cover to highway dimension | 2025-06-23 | Paper |
| 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
SIAM Journal on Discrete Mathematics | 2024-02-27 | Paper |
Unified Greedy Approximability beyond Submodular Maximization
SIAM Journal on Discrete Mathematics | 2024-01-23 | Paper |
Tight analysis of the lazy algorithm for open online dial-a-ride
Lecture Notes in Computer Science | 2024-01-16 | Paper |
scientific article; zbMATH DE number 7788388 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
| scientific article; zbMATH DE number 7759285 (Why is no real title available?) | 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
Lecture Notes in Computer Science | 2023-08-03 | Paper |
An improved algorithm for open online dial-a-ride
Approximation and Online Algorithms | 2023-07-25 | Paper |
Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition
Annals of Operations Research | 2023-06-20 | Paper |
An exponential lower bound for Zadeh's pivot rule
Mathematical Programming. Series A. Series B | 2023-05-02 | Paper |
Improved bounds for open online dial-a-ride on the line
Algorithmica | 2023-04-28 | Paper |
scientific article; zbMATH DE number 7650088 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
Fractionally subadditive maximization under an incremental knapsack constraint
(available as arXiv preprint) | 2022-10-19 | Paper |
| Tight analysis of the Smartstart algorithm for online dial-a-ride on the line | 2022-07-18 | Paper |
General bounds for incremental maximization
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
Tight Bounds for Online TSP on the Line
ACM Transactions on Algorithms | 2022-02-08 | Paper |
Fractionally Subadditive Maximization under an Incremental Knapsack Constraint
(available as arXiv preprint) | 2021-06-28 | Paper |
| Distance-Preserving Graph Contractions | 2021-06-15 | Paper |
An improved lower bound for competitive graph exploration
Theoretical Computer Science | 2021-05-10 | Paper |
Collaborative delivery on a fixed path with homogeneous energy-constrained agents
Theoretical Computer Science | 2021-05-10 | Paper |
Travelling on graphs with small highway dimension
Algorithmica | 2021-04-19 | Paper |
Tight analysis of the Smartstart algorithm for online dial-a-ride on the line
SIAM Journal on Discrete Mathematics | 2020-07-30 | Paper |
General bounds for incremental maximization
(available as arXiv preprint) | 2020-05-27 | Paper |
Hiring secretaries over time: the benefit of concurrent employment
Mathematics of Operations Research | 2020-04-30 | Paper |
Evacuating two robots from a disk: a second cut
(available as arXiv preprint) | 2020-03-03 | Paper |
Collaborative delivery on a fixed path with homogeneous energy-constrained agents
Structural Information and Communication Complexity | 2020-03-03 | Paper |
Travelling on graphs with small highway dimension
Graph-Theoretic Concepts in Computer Science | 2020-02-24 | Paper |
A general lower bound for collaborative tree exploration
Theoretical Computer Science | 2020-02-13 | Paper |
A general lower bound for collaborative tree exploration
Theoretical Computer Science | 2020-02-13 | Paper |
Tight bounds for undirected graph exploration with pebbles and multiple agents
Journal of the ACM | 2020-02-11 | Paper |
The complexity of computing a robust flow
Operations Research Letters | 2020-02-11 | Paper |
| On Friedmann's subexponential lower bound for Zadeh's pivot rule | 2020-02-06 | Paper |
Collaborative delivery with energy-constrained mobile robots
Theoretical Computer Science | 2020-02-06 | Paper |
Approximate lumpability for Markovian agent-based models using local symmetries
Journal of Applied Probability | 2019-10-07 | Paper |
Distance-Preserving Graph Contractions
SIAM Journal on Discrete Mathematics | 2019-09-06 | Paper |
Improved Bounds for Open Online Dial-a-Ride on the Line
(available as arXiv preprint) | 2019-07-03 | Paper |
The simplex algorithm is NP-mighty
ACM Transactions on Algorithms | 2019-03-28 | Paper |
The minimum feasible tileset problem
Algorithmica | 2019-03-11 | Paper |
Scheduling maintenance jobs in networks
Theoretical Computer Science | 2018-12-04 | Paper |
Mapping Simple Polygons
ACM Transactions on Algorithms | 2018-10-30 | Paper |
| Polygon-constrained motion planning problems | 2018-10-17 | Paper |
Tight bounds for online TSP on the line
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Undirected Graph Exploration with ⊝(log log <i>n</i>) Pebbles
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
scientific article; zbMATH DE number 6862102 (Why is no real title available?)
(available as arXiv preprint) | 2018-04-19 | Paper |
Robust and adaptive search
(available as arXiv preprint) | 2018-04-19 | Paper |
A general lower bound for collaborative tree exploration
Structural Information and Communication Complexity | 2018-04-12 | Paper |
The simplex algorithm is NP-mighty
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Scheduling maintenance jobs in networks
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Packing a knapsack of unknown capacity
SIAM Journal on Discrete Mathematics | 2017-07-14 | Paper |
Packing a knapsack of unknown capacity
(available as arXiv preprint) | 2017-03-03 | Paper |
Mapping a Polygon with Holes Using a Compass
Algorithms for Sensor Systems | 2016-12-19 | Paper |
Collaborative delivery with energy-constrained mobile robots
Lecture Notes in Computer Science | 2016-12-01 | Paper |
Scheduling transfers of resources over time: towards car-sharing with flexible drop-offs
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Degree-constrained orientations of embedded graphs
Journal of Combinatorial Optimization | 2016-02-23 | Paper |
The minimum feasible tileset problem
Lecture Notes in Computer Science | 2015-11-20 | Paper |
Scheduling bidirectional traffic on a path
Automata, Languages, and Programming | 2015-10-27 | Paper |
Rectilinear shortest path and rectilinear minimum spanning tree with neighborhoods
Lecture Notes in Computer Science | 2015-10-16 | Paper |
Fast collaborative graph exploration
Information and Computation | 2015-06-09 | Paper |
Improving the \(H_k\)-bound on the price of stability in undirected Shapley network design games
Theoretical Computer Science | 2014-12-02 | Paper |
Mapping a polygon with holes using a compass
Theoretical Computer Science | 2014-09-18 | Paper |
Simple agents learn to find their way: an introduction on mapping polygons
Discrete Applied Mathematics | 2014-04-16 | Paper |
Interval selection with machine-dependent intervals
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Fast collaborative graph exploration
Automata, Languages, and Programming | 2013-08-07 | Paper |
Improving the \(H _{k }\)-bound on the price of stability in undirected Shapley network design games
Lecture Notes in Computer Science | 2013-06-07 | Paper |
Degree-constrained orientations of embedded graphs
Algorithms and Computation | 2013-03-21 | Paper |
Mapping simple polygons: how robots benefit from looking back
Algorithmica | 2013-03-05 | Paper |
Reconstructing visibility graphs with simple robots
Theoretical Computer Science | 2012-08-10 | Paper |
| scientific article; zbMATH DE number 5999543 (Why is no real title available?) | 2012-01-23 | Paper |
A polygon is determined by its angles
Computational Geometry | 2011-08-02 | Paper |
Reconstructing a simple polygon from its angles
Lecture Notes in Computer Science | 2010-06-22 | Paper |
How simple robots benefit from looking back
Lecture Notes in Computer Science | 2010-05-28 | Paper |
Reconstructing visibility graphs with simple robots
Structural Information and Communication Complexity | 2010-02-24 | Paper |
