1

Untangling Circular Drawings: Algorithms and Complexity
Algorithms and Computation (ISAAC'21) (Ahn, Hee-Kap and Sadakane, Kunihiko), 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'is Paquete and Christine Zarges), 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 (Nicosia, Giuseppe and Pardalos, Panos and Giuffrida, Giovanni and Umeton, Renato and Sciacca, Vincenzo), volume 11943 of LNCS, pages 154-167, 2020, Springer.
PDF bib DOI
A Double-Horizon Approach to a Purely Dynamic and Stochastic Vehicle Routing Problem with Delivery Deadlines and Shift Flexibility
Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling - PATAT 2020: Volume I (Patrick De Causmaecker and Ender Özcan and Greet Vanden Berghe), 2020.
PDF bib
A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth
Proceedings of SAT 2020, The 23rd International Conference on Theory and Applications of Satisfiability Testing (Luca Pulina and Martina Seidl), volume 12178 of Lecture Notes in Computer Science, pages 267-276, 2020, Springer Verlag.
bib Project Project Project
A Time Leap Challenge for SAT-Solving
Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming (Helmut Simonis), volume 12333 of Lecture Notes in Computer Science, pages 267-285, 2020, Springer Verlag.
bib Project Project
A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem
Proceedings of PPSN XVI: Parallel Problem Solving from Nature (Bäck, Thomas and Preuss, Mike and Deutz, Andr'e and Wang, Hao and Doerr, Carola and Emmerich, Michael and Trautmann, Heike), volume 12270 of LNCS, pages 385-398, 2020, Springer.
bib DOI
An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling
Algorithms (ESA'20) (Grandoni, Fabrizio and Sanders, Peter and Herman, Grzegorz), volume 173 of LIPIcs, pages 19:1-19:24, 2020, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
PDF bib Project DOI