1

The Complexity of Packing Edge-Disjoint Paths
14th International Symposium on Parameterized and Exact Computation (IPEC 2019), volume 148 of Leibniz International Proceedings in Informatics (LIPIcs), pages 10:1–10:16, 2019, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
PDF bib DOI
The Parameterized Complexity of Cascading Portfolio Scheduling
Proceedings of NeurIPS 2019, the Thirty-third Conference on Neural Information Processing Systems (Hanna M. Wallach, Hugo Larochelle, Alina Beygelzimer, Florence d’Alché-Buc, Emily B. Fox, Roman Garnett, eds.), pages 7666–7676, 2019.
PDF bib Project
The Power of Cut-Based Parameters for Computing Edge Disjoint Paths
Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19-21, 2019, Revised Papers (Ignasi Sau, Dimitrios M. Thilikos, eds.), pages 190–204, 2019.
PDF bib Project
Towards Improving Merging Heuristics for Binary Decision Diagrams
Learning and Intelligent Optimization – 13th International Conference, LION 13 (Nikolaos F. Matsatsinis, Yannis Marinakis, Panos Pardalos, eds.), volume 11968 of LNCS, pages 30–45, 2019, Springer.
PDF bib
A Structural Approach to Activity Selection
Proceedings of IJCAI 2018, the 27th International Joint Conference on Artificial Intelligence, pages 203–209, 2018, ijcai.org.
PDF bib
A Visual Comparison of Hand-Drawn and Machine-Generated Human Metabolic Pathways
Eurographics Conference on Visualization (EuroVis'18) – Posters (Anna Puig, Renata Raidou, eds.), pages 57–59, 2018.
bib Project DOI
An A* Algorithm for Solving a Prize-Collecting Sequencing Problem with One Common and Multiple Secondary Resources and Time Windows
PATAT 2018: Proceedings of the 12th International Conference of the Practice and Theory of Automated Timetabling, pages 235–256, 2018.
PDF bib
An SMT Approach to Fractional Hypertree Width
Proceedings of CP 2018, the 24rd International Conference on Principles and Practice of Constraint Programming (John N. Hooker, ed.), volume 11008 of Lecture Notes in Computer Science, pages 109–127, 2018, Springer Verlag.
bib DOI
Experimental Evaluation of Book Drawing Algorithms
Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 224–238, 2018, Springer.
PDF bib DOI
Finding Smooth Graphs with Small Independence Numbers
MOD~2017: Machine Learning, Optimization, and Big Data – Third International Conference (Giovanni Giuffrida, Giuseppe Nicosia, Panos Pardalos, Renato Umeton, eds.), volume 10710 of LNCS, pages 527-539, 2018, Springer.
PDF bib