1

Proof Complexity of Fragments of Long-Distance Q-resolution
Proceedings of SAT 2019, the 22nd International Conference on Theory and Applications of Satisfiability Testing, July 7–12, 2019, Lisbon, Portugal (Mikol'a\vs Janota and In^es Lynce), volume 11628 of Lecture Notes in Computer Science, pages 319-335, 2019, Springer Verlag.
bib DOI
Refined Complexity of PCA with Outliers
Proceedings of the 36th International Conference on Machine Learning, ICML 2019, 9-15 June 2019, Long Beach, California, USA (Kamalika Chaudhuri and Ruslan Salakhutdinov), volume 97 of Proceedings of Machine Learning Research, pages 5818-5826, 2019, PMLR.
PDF bib
SAT-Encodings for Treecut Width and Treedepth
Proceedings of ALENEX 2019, the 21st Workshop on Algorithm Engineering and Experiments (Stephen G. Kobourov and Henning Meyerhenke), pages 117-129, 2019, SIAM.
PDF bib Project DOI
Solving integer quadratic programming via explicit and structural restrictions
The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, Honolulu, Hawaii, USA, January 27 - February 1, 2019 (Pascal Van Hentenryck and Zhi-Hua Zhou), pages 1477-1484, 2019.
PDF bib Project
Strategies for Iteratively Refining Layered Graph Models
Hybrid Metaheuristics: 11th International Workshop, HM 2019 (Blesa Aguilera, M. J. and Blum, C. and Gambini Santos, H. and Pinacho-Davidson, P. and Godoy del Campo, J.), volume 11299 of LNCS, pages 46-62, 2019, Springer.
bib DOI
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 and Hugo Larochelle and Alina Beygelzimer and Florence d’Alch'e-Buc and Emily B. Fox and Roman Garnett), 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'uria, Spain, June 19-21, 2019, Revised Papers (Ignasi Sau and Dimitrios M. Thilikos), 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 and Yannis Marinakis and Panos Pardalos), 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