In: 35th International Symposium on Computational Geometry, SoCG 2019 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Dagstuhl, pp. 27:1-27:16.
Almost tight lower bounds for hard cutting problems in embedded graphs
In: Proceedings of the Pannonian Conference on Advances in Information Technology (PCIT'2019) University of Pannonia, Faculty of Information Technology, Veszprém, pp. 90-97.
An optimization based algorithm for conflict-free navigation of autonomous guided vehicles