1

The Complexity of Object Association in Multiple Object Tracking
Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Virtual Event, February 2-9, 2021, pages 1388–1396, 2021, AAAI Press.
PDF bib Project Project
The Parameterized Complexity of Clustering Incomplete Data
Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 7296–7304, 2021, AAAI Press.
PDF bib Project Project Project Project
The Parameterized Complexity of Connected Fair Division
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event / Montreal, Canada, 19-27 August 2021 (Zhi-Hua Zhou, ed.), pages 139–145, 2021, ijcai.org.
PDF bib Project Project
Turbocharging Treewidth-Bounded Bayesian Network Structure Learning
Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 3895–3903, 2021, AAAI Press.
PDF bib Project Project
Unit Disk Representations of Embedded Trees, Outerplanar and Multi-Legged Graphs
Graph Drawing and Network Visualization (GD'21) (Helen Purchase, Ignaz Rutter, eds.), volume 12868 of LNCS, pages 304–317, 2021, Springer.
PDF bib DOI
Untangling Circular Drawings: Algorithms and Complexity
Algorithms and Computation (ISAAC'21) (Hee-Kap Ahn, Kunihiko Sadakane, eds.), volume 212 of LIPIcs, pages 19:1–19:17, 2021, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
bib Project DOI
Worbel: Aggregating Point Labels into Word Clouds
Proceedings of the International Conference on Advances in Geographic Information Systems 2021 (ACM SIGSPATIAL 2021), 2021.
PDF bib Project Project
Worbel: Aggregating Point Labels into Word Clouds
Advances in Geographic Information Systems (SIGSPATIAL'21), pages 256–267, 2021, ACM.
PDF bib Project DOI
A Beam Search Approach to the Traveling Tournament Problem
Evolutionary Computation in Combinatorial Optimization – 20th European Conference, EvoCOP 2020 (Luís Paquete, Christine Zarges, eds.), volume 12102 of LNCS, pages 67–82, 2020, Springer.
PDF bib
A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation
Proceedings of LOD 2019 – The 5th International Conference on Machine Learning, Optimization and Data Science (Giuseppe Nicosia, Panos Pardalos, Giovanni Giuffrida, Renato Umeton, Vincenzo Sciacca, eds.), volume 11943 of LNCS, pages 154–167, 2020, Springer.
PDF bib DOI