Dominik Krupke

Available identifiers

Publication	Date of Publication	Type
The lawn mowing problem: from algebra to algorithms	2025-01-06	Paper
What goes around comes around: covering tours and cycle covers with turn costs	2024-11-12	Paper
Minimum partition into plane subgraphs: the CG:SHOP challenge 2022	2024-07-26	Paper
Near-optimal coverage path planning with turn costs	2024-05-29	Paper
A closer cut: computing near-optimal lawn mowing tours	2024-05-24	Paper
Minimum Scan Cover and Variants: Theory and Experiments	2024-04-14	Paper
Edge sparsification for geometric tour problems	2024-04-02	Paper
https://portal.mardi4nfdi.de/entity/Q6059993	2023-11-02	Paper
Minimum scan cover and variants -- theory and experiments	2023-06-23	Paper
Probing a set of trajectories to maximize captured information	2023-02-07	Paper
Area-optimal simple polygonalizations: the CG challenge 2019	2022-09-06	Paper
Computing coordinated motion plans for robot swarms: the CG:SHOP challenge 2021	2022-09-06	Paper
Minimum scan cover with angular transition costs	2021-06-28	Paper
Tilt assembly: algorithms for micro-factories that build objects with uniform external forces	2020-11-25	Paper
Tilt assembly: algorithms for micro-factories that build objects with uniform external forces	2020-04-09	Paper
Covering tours and cycle covers with turn costs: hardness and approximation	2020-02-06	Paper
Practical methods for computing large covering tours and cycle covers with turn cost	2019-09-13	Paper

This page was built for person: Dominik Krupke