| Publication | Date of Publication | Type |
|---|
| Pareto sums of Pareto sets | 2025-01-06 | Paper |
| Algorithms for landmark hub labeling | 2024-09-11 | Paper |
| On the multi-kind BahnCard problem | 2024-08-13 | Paper |
| Exact and approximate hierarchical hub labeling | 2024-07-19 | Paper |
| Lossy reduction rules for the directed feedback vertex set problem | 2024-05-24 | Paper |
Simplification of Polyline Bundles
(available as arXiv preprint) | 2023-11-02 | Paper |
Mind the gap: edge facility location problems in theory and practice
Algorithms and Discrete Applied Mathematics | 2023-08-17 | Paper |
Customizable hub labeling: properties and algorithms
Lecture Notes in Computer Science | 2023-08-10 | Paper |
Fission: Practical algorithms for computing minimum balanced node separators
Discrete Mathematics, Algorithms and Applications | 2023-07-13 | Paper |
Bounds and algorithms for geodetic hulls
Algorithms and Discrete Applied Mathematics | 2023-05-08 | Paper |
Consistent simplification of polyline tree bundles
(available as arXiv preprint) | 2023-03-30 | Paper |
| FISSION: a practical algorithm for computing minimum balanced node separators | 2023-03-21 | Paper |
| scientific article; zbMATH DE number 7651159 (Why is no real title available?) | 2023-02-07 | Paper |
Sublinear search spaces for shortest path planning in grid and road networks
Journal of Combinatorial Optimization | 2021-09-28 | Paper |
Puzzling Grid Embeddings
2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
| Parametrized runtimes for label tournaments | 2020-05-13 | Paper |
Alternative multicriteria routes
2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-13 | Paper |
Concatenated \(k\)-path covers
2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-13 | Paper |
Polynomial-time construction of contraction hierarchies for multi-criteria objectives
2013 Proceedings of the Fifteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Computing a consensus of multilabeled trees
2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Growing balls in \(\mathbb{R}^d\)
2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Algorithms for matching and predicting trajectories
2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Scalable transfer patterns
2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
| Computation and growth of road network dimensions | 2018-10-04 | Paper |
| Minimum polygons for fixed visibility VC-dimension | 2018-09-06 | Paper |
| Personal routes with high-dimensional costs and dynamic approximation guarantees | 2018-08-13 | Paper |
Crushing disks efficiently
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Provable efficiency of contraction hierarchies with randomized preprocessing
Algorithms and Computation | 2016-01-11 | Paper |
Approximation algorithms in the successive hitting set model
Algorithms and Computation | 2016-01-11 | Paper |
Placement of loading stations for electric vehicles: no detours necessary!
Journal of Artificial Intelligence Research | 2015-08-25 | Paper |
| Delay-robustness of transfer patterns in public transportation route planning | 2014-02-24 | Paper |
| Result diversity for multi-modal route planning | 2014-02-24 | Paper |
