| [1] | A structural complexity analysis of synchronous dynamical systems Artif. Intell., volume 351, pages 104472, 2026. |
| [2] | From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem Algorithmica, volume 88, number 1, pages 8, 2026. |
| [3] | Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy ACM Transactions on Algorithms, 2026. Note: to appear |
| [4] | Routing few robots in a crowded network J. Comput. Syst. Sci., volume 157, pages 103753, 2026. |
| [5] | The Complexity of Envy-Free Graph Cutting Artificial Intelligence, 2026. Note: to appear |
| [6] | The Complexity of Extending Fair Allocations of Indivisible Goods J. Artif. Intell. Res., volume 86, 2026. |
| [7] | The Parameterized Complexity of Coordinated Motion Planning Discrete and Computational Geometry, 2026. Note: to appear |
| [8] | The Parameterized Complexity Of Extending Stack Layouts Journal of Graph Algorithms and Applications, volume 29, number 3, pages 39–78, 2026. |
| [9] | A Fixed-Parameter Algorithm for Extending Upward Planar Drawings 34th International Symposium on Graph Drawing and Network Visualization, GD 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear |
| [10] | A Parameterized-Complexity Framework for Finding Local Optima 17th Innovations in Theoretical Computer Science Conference, ITCS 2026, Bocconi University, Milan, Italy, January 27-30, 2026 (Shubhangi Saraf, ed.), volume 362 of LIPIcs, pages 66:1–66:20, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [11] | A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs 2026 Symposium on Simplicity in Algorithms, SOSA 2026, Vancouver, BC, Canada, January 12-14, 2026 (Sepehr Assadi, Eva Rotenberg, eds.), pages 65–80, 2026, SIAM. |
| [12] | Bilateral Treewidth for QBF: Where Strategies and Resolution Meet 29th International Conference on Theory and Applications of Satisfiability Testing, SAT 2026, Lisbon, Portugal, July 20-23, 2026 (Alexey Ignatiev, Stefan Szeider, eds.), volume 377 of LIPIcs, pages 16:1–16:20, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [13] | Circle Graph 3-Coloring: Can Simplicity Beat SAT? 34th International Symposium on Graph Drawing and Network Visualization, GD 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear |
| [14] | Computing Twin-Width via Treedepth and Vertex Integrity 43rd International Symposium on Theoretical Aspects of Computer Science, STACS 2026, Grenoble, France, March 9-13, 2026 (Meena Mahajan, Florin Manea, Annabelle McIver, Kim Thang Nguyen, eds.), volume 364 of LIPIcs, pages 42:1–42:20, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [15] | Coordinated Motion Planning Is FPT on Discretized Simple Polygons 53rd International Colloquium on Automata, Languages, and Programming, ICALP 2026, Royal Holloway, University of London, Egham, United Kingdom, July 7-10, 2026 (Sayan Bhattacharya, Danupon Nanongkai, Michael Benedikt, Gabriele Puppis, eds.), volume 374 of LIPIcs, pages 75:1–75:13, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [16] | Fair Correlation Clustering Meets Graph Parameters Proceedings of the 17th Latin American Theoretical Informatics (LATIN 2026), 2026. Note: to appear |
| [17] | Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees 53rd International Colloquium on Automata, Languages, and Programming, ICALP 2026, Royal Holloway, University of London, Egham, United Kingdom, July 7-10, 2026 (Sayan Bhattacharya, Danupon Nanongkai, Michael Benedikt, Gabriele Puppis, eds.), volume 374 of LIPIcs, pages 38:1–38:14, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [18] | Gateways to Tractability for Satisfiability in Pearl’s Causal Hierarchy Proceedings of the 43rd International Conference on Machine Learning, ICML 2026, 2026, PMLR. Note: to appear |
| [19] | Makespan Minimization in Split Learning: From Theory to Practice IEEE INFOCOM 2026 - IEEE Conference on Computer Communications, Tokyo, Japan, May 18-21, 2026, pages 1–10, 2026, IEEE. |
| [20] | Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity Fortieth AAAI Conference on Artificial Intelligence, Thirty-Eighth Conference on Innovative Applications of Artificial Intelligence, Sixteenth Symposium on Educational Advances in Artificial Intelligence, AAAI 2026, Singapore, January 20-27, 2026 (Sven Koenig, Chad Jenkins, Matthew E. Taylor, eds.), pages 19108–19116, 2026, AAAI Press. |
| [21] | Not All Degree Constraints Are Created Equal when Computing Spanning Trees 21st International Symposium on Parameterized and Exact Computation, IPEC 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear |
| [22] | Parameterized Complexity of Efficient Sortation 51st International Symposium on Mathematical Foundations of Computer Science (MFCS 2026), 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear |
| [23] | Perfect Rectangular Tilings with Two Colors 37th International Symposium on Algorithms and Computation, ISAAC 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear |
| [24] | The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern Parameterized and Exact Computation (IPEC'26) (Tuukka Korhonen, Michael Lampis, eds.), 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. |
| [25] | The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern 21st International Symposium on Parameterized and Exact Computation, IPEC 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear |
| [26] | The Peculiarities of Extending Queue Layouts Graph-Theoretic Concepts in Computer Science (WG'25) (Henning Fernau, Philipp Kindermann, eds.), volume 16124 of LNCS, pages 177–191, 2026, Springer. |
| [27] | Tractability via Low Dimensionality: The Parameterized Complexity of Training Quantized Neural Networks The Fourteenth International Conference on Learning Representations, ICLR 2026, 2026, OpenReview.net. Note: to appear |
| [28] | Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithms Graph Drawing and Network Visualization (GD'26) (Maarten Löffler, Silvia Miksch, eds.), volume 396 of LIPIcs, 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. |
| [29] | Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithms 34th International Symposium on Graph Drawing and Network Visualization, GD 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear |
| [1] | Computing Twin-Width Parameterized by the Feedback Edge Number and Vertex Integrity SIAM J. Discret. Math., volume 39, number 4, pages 2102–2141, 2025. |
| [2] | Parameterized Complexity in Machine Learning Computer Science Review, 2025. Note: to appear |
| [3] | Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth ACM Trans. Comput. Theory, volume 17, number 3, pages 18:1–18:42, 2025. |
| [4] | The complexity of optimizing atomic congestion Artif. Intell., volume 338, pages 104241, 2025. |
| [5] | A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robots 41st International Symposium on Computational Geometry, SoCG 2025, June 23-27, 2025, Kanazawa, Japan (Oswin Aichholzer, Haitao Wang, eds.), volume 332 of LIPIcs, pages 44:1–44:15, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [6] | A Structural Complexity Analysis of Hierarchical Task Network Planning Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2025, Montreal, Canada, August 16-22, 2025, pages 4391–4400, 2025, ijcai.org. |
| [7] | Approximate Evaluation of Quantitative Second Order Queries 40th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2025, Singapore, June 23-26, 2025, pages 664–677, 2025, IEEE. |
| [8] | Crossing and Independent Families Among Polygons 19th International Symposium on Algorithms and Data Structures, WADS 2025, August 11-15, 2025, York University, Toronto, Canada (Pat Morin, Eunjin Oh, eds.), volume 349 of LIPIcs, pages 11:1–11:15, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [9] | Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms 33rd Annual European Symposium on Algorithms, ESA 2025, September 15-17, 2025, Warsaw, Poland (Anne Benoit, Haim Kaplan, Sebastian Wild, Grzegorz Herman, eds.), volume 351 of LIPIcs, pages 15:1–15:18, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear |
| [10] | Parameterized Algorithms for Multiagent Pathfinding on Trees Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2025, Detroit, MI, USA, May 19-23, 2025 (Sanmay Das, Ann Nowé, Yevgeniy Vorobeychik, eds.), pages 584–592, 2025, International Foundation for Autonomous Agents and Multiagent Systems / ACM. |
| [11] | Parameterized Complexity of Caching in Networks AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25 - March 4, 2025, Philadelphia, PA, USA (Toby Walsh, Julie Shah, Zico Kolter, eds.), pages 11229–11237, 2025, AAAI Press. |
| [12] | Partial Level Planarity Parameterized by the Size of the Missing Graph European Workshop on Computational Geometry (EuroCG'25) (Jan Kratochvíl, Giuseppe Liotta, eds.), pages 50:1–50:10, 2025. |
| [13] | Pathways to Tractability for Geometric Thickness Theory and Practice of Computer Science (SOFSEM'25) (Rastislav Královic, Vera Kurková, eds.), volume 15538 of LNCS, pages 209–224, 2025, Springer. |
| [14] | Pathways to Tractability for Geometric Thickness (Best Paper Award) SOFSEM 2025: Theory and Practice of Computer Science - 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20-23, 2025, Proceedings, Part I (Rastislav Královic, Vera Kurková, eds.), volume 15538 of Lecture Notes in Computer Science, pages 209–224, 2025, Springer. |
| [15] | Routing Few Robots in a Crowded Network 19th International Symposium on Algorithms and Data Structures, WADS 2025, August 11-15, 2025, York University, Toronto, Canada (Pat Morin, Eunjin Oh, eds.), volume 349 of LIPIcs, pages 20:1–20:15, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [16] | Structural Parameterizations of Simultaneous Planarity 36th International Symposium on Algorithms and Computation, ISAAC 2025, Tainan, Taiwan, December 7-10, 2025 (Ho-Lin Chen, Wing-Kai Hon, Meng-Tsung Tsai, eds.), volume 359 of LIPIcs, pages 25:1–25:17, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [17] | The Complexity of Extending Fair Allocations of Indivisible Goods AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25 - March 4, 2025, Philadelphia, PA, USA (Toby Walsh, Julie Shah, Zico Kolter, eds.), pages 13745–13753, 2025, AAAI Press. |
| [18] | The Computational Complexity of Positive Non-Clashing Teaching in Graphs The Thirteenth International Conference on Learning Representations, ICLR 2025, Singapore, April 24-28, 2025, 2025, OpenReview.net. |
| [19] | The Peculiarities of Extending Queue Layouts Graph-Theoretic Concepts in Computer Science - 51st International Workshop, WG 2025, Otzenhausen, Germany, June 11-13, 2025, Revised Selected Papers (Henning Fernau, Philipp Kindermann, eds.), volume 16124 of Lecture Notes in Computer Science, pages 177–191, 2025, Springer. |
| [20] | Training One-Dimensional Graph Neural Networks is NP-Hard The Thirteenth International Conference on Learning Representations, ICLR 2025, Singapore, April 24-28, 2025, 2025, OpenReview.net. |
| [1] | Bounding and Computing Obstacle Numbers of Graphs SIAM J. Discret. Math., volume 38, number 2, pages 1537–1565, 2024. |
| [2] | Extending Orthogonal Planar Graph Drawings is Fixed-parameter Tractable J. Computational Geometry, volume 15, number 2, pages 3–39, 2024. |
| [3] | Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs J. Graph Algorithms Appl., volume 28, number 2, pages 131–150, 2024. |
| [4] | Graphs with at most two moplexes Journal of Graph Theory, 2024, Wiley Online Library. |
| [5] | Slim Tree-Cut Width Algorithmica, volume 86, number 8, pages 2714–2738, 2024. |
| [6] | The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width ACM Trans. Algorithms, volume 20, number 3, pages 19, 2024. |
| [7] | A Tight Subexponential-Time Algorithm for Two-Page Book Embedding 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia (Karl Bringmann, Martin Grohe, Gabriele Puppis, Ola Svensson, eds.), volume 297 of LIPIcs, pages 68:1–68:18, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [8] | Computing Twin-Width Parameterized by the Feedback Edge Number 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France (Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov, eds.), volume 289 of LIPIcs, pages 7:1–7:19, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [9] | Exact Algorithms for Clustered Planarity with Linear Saturators 35th International Symposium on Algorithms and Computation, ISAAC 2024, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [10] | Minimizing Switches in Cased Graph Drawings Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 43:1–43:3, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: Poster abstract |
| [11] | Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia (Karl Bringmann, Martin Grohe, Gabriele Puppis, Ola Svensson, eds.), volume 297 of LIPIcs, pages 53:1–53:18, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [12] | Revisiting Causal Discovery from a Complexity-Theoretic Perspective Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, IJCAI-24 (Kate Larson, ed.), pages 3377–3385, 8 2024, International Joint Conferences on Artificial Intelligence Organization. Note: Main Track |
| [13] | The Complexity of Optimizing Atomic Congestion Thirty-Eighth AAAI Conference on Artificial Intelligence, AAAI 2024, Thirty-Sixth Conference on Innovative Applications of Artificial Intelligence, IAAI 2024, Fourteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2014, February 20-27, 2024, Vancouver, Canada (Michael J. Wooldridge, Jennifer G. Dy, Sriraam Natarajan, eds.), pages 20044–20052, 2024, AAAI Press. |
| [14] | The Parameterized Complexity Landscape of the Unsplittable Flow Problem Graph-Theoretic Concepts in Computer Science - 50th International Workshop, WG 2024, Gozd Martuljek, Slovenia, June 19-21, 2024, Revised Selected Papers (Daniel Král, Martin Milanic, eds.), volume 14760 of Lecture Notes in Computer Science, pages 220–235, 2024, Springer. |
| [15] | The Parameterized Complexity of Extending Stack Layouts Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 12:1–12:17, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [16] | The Parameterized Complexity Of Extending Stack Layouts 32nd International Symposium on Graph Drawing and Network Visualization, GD 2024, September 18-20, 2024, Vienna, Austria (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 12:1–12:17, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [17] | Twin-Width Meets Feedback Edges and Vertex Integrity 19th International Symposium on Parameterized and Exact Computation, IPEC 2024, September 4-6, 2024, Royal Holloway, University of London, Egham, United Kingdom (Édouard Bonnet, Pawel Rzazewski, eds.), volume 321 of LIPIcs, pages 3:1–3:22, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1] | Group Activity Selection with Few Agent Types Algorithmica, volume 85, number 5, pages 1111–1155, 2023. |
| [2] | Hedonic diversity games: A complexity picture with more than two colors Artif. Intell., volume 325, pages 104017, 2023. |
| [3] | New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162) Dagstuhl Reports, volume 13, number 4, pages 58–97, 2023. |
| [4] | On the parameterized complexity of clustering problems for incomplete data Journal of Computer and System Sciences, volume 134, pages 1–19, 2023. |
| [5] | Parameterized complexity of envy-free resource allocation in social networks Artif. Intell., volume 315, pages 103826, 2023. |
| [6] | Worbel: Aggregating Point Labels into Word Clouds ACM Trans. Spatial Algorithms and Systems, volume 9, number 3, pages 19:1–19:32, 2023. |
| [7] | A Parameterized Theory of PAC Learning Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023 (Brian Williams, Yiling Chen, Jennifer Neville, eds.), pages 6834–6841, 2023, AAAI Press. |
| [8] | A Structural Complexity Analysis of Synchronous Dynamical Systems Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023 (Brian Williams, Yiling Chen, Jennifer Neville, eds.), pages 6313–6321, 2023, AAAI Press. |
| [9] | Consistency Checking Problems: A Gateway to Parameterized Sample Complexity 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands (Neeldhara Misra, Magnus Wahlström, eds.), volume 285 of LIPIcs, pages 18:1–18:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [10] | Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable Computational Geometry (SoCG'23) (Erin W. Chambers, Joachim Gudmundsson, eds.), volume 258 of LIPIcs, pages 18:1–18:16, 2023, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [11] | Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable 39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA (Erin W. Chambers, Joachim Gudmundsson, eds.), volume 258 of LIPIcs, pages 18:1–18:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [12] | Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs Graph Drawing and Network Visualization - 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023, Revised Selected Papers, Part II (Michael A. Bekos, Markus Chimani, eds.), volume 14466 of Lecture Notes in Computer Science, pages 66–81, 2023, Springer. |
| [13] | From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands (Neeldhara Misra, Magnus Wahlström, eds.), volume 285 of LIPIcs, pages 16:1–16:14, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [14] | Maximizing Social Welfare in Score-Based Social Distance Games Proceedings Nineteenth conference on Theoretical Aspects of Rationality and Knowledge, TARK 2023, Oxford, United Kingdom, 28-30th June 2023 (Rineke Verbrugge, ed.), volume 379 of EPTCS, pages 272–286, 2023. |
| [15] | New Complexity-Theoretic Frontiers of Tractability for Neural Network Training Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023, 2023. |
| [16] | Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth 31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands (Inge Li Gørtz, Martin Farach-Colton, Simon J. Puglisi, Grzegorz Herman, eds.), volume 274 of LIPIcs, pages 18:1–18:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [17] | Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF Thirty-Eighth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pages 1–14, 2023. |
| [18] | The Computational Complexity of Concise Hypersphere Classification Proceedings of the 40th International Conference on Machine Learning, ICML 2023, pages 9060–9070, 2023, PMLR. |
| [19] | The Parameterized Complexity of Coordinated Motion Planning 39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA (Erin W. Chambers, Joachim Gudmundsson, eds.), volume 258 of LIPIcs, pages 28:1–28:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [20] | The Parameterized Complexity of Network Microaggregation Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023 (Brian Williams, Yiling Chen, Jennifer Neville, eds.), pages 6262–6270, 2023, AAAI Press. |
| [1] | Algorithmic Applications of Tree-Cut Width SIAM J. Discrete Math., volume 36, number 4, pages 2635–2666, 2022. |
| [2] | An efficient algorithm for counting Markov equivalent DAGs Artificial Intelligence, volume 304, pages 103648, 2022. |
| [3] | On Covering Segments with Unit Intervals SIAM J. Discret. Math., volume 36, number 2, pages 1200–1230, 2022. |
| [4] | Parameterized Algorithms for Queue Layouts J. Graph Algorithms Appl., volume 26, number 3, pages 335–352, 2022. |
| [5] | Parameterized Algorithms for Queue Layouts J. Graph Algorithms Appl., volume 26, number 3, pages 335–352, 2022. |
| [6] | Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria Discr. Appl. Math., volume 312, pages 1–2, 2022. |
| [7] | Sum-of-Products with Default Values: Algorithms and Complexity Results Journal of Artificial Intelligence Research, volume 33, pages 535–552, 2022. |
| [8] | Threshold Treewidth and Hypertree Width Journal of Artificial Intelligence Research, volume 74, pages 1687–1713, 2022. |
| [9] | A Unifying Framework for Characterizing and Computing Width Measures 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [10] | Bounding and Computing Obstacle Numbers of Graphs 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany (Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, Grzegorz Herman, eds.), volume 244 of LIPIcs, pages 11:1–11:13, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [11] | Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Tübingen, Germany, June 22-24, 2022, Revised Selected Papers (Michael A. Bekos, Michael Kaufmann, eds.), volume 13453 of Lecture Notes in Computer Science, pages 98–113, 2022, Springer. |
| [12] | Finding a Cluster in Incomplete Data 30th Annual European Symposium on Algorithms (ESA 2022) (Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, Grzegorz Herman, eds.), volume 244 of Leibniz International Proceedings in Informatics (LIPIcs), pages 47:1–47:14, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [13] | Hedonic Diversity Games: A Complexity Picture with More than Two Colors Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, pages 5034–5042, 2022, AAAI Press. |
| [14] | Parameterized Algorithms for Upward Planarity 38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany (Xavier Goaoc, Michael Kerber, eds.), volume 224 of LIPIcs, pages 26:1–26:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [15] | Preface: 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria, volume 241 of LIPIcs, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [16] | Slim Tree-Cut Width 17th International Symposium on Parameterized and Exact Computation, IPEC 2022, September 7-9, 2022, Potsdam, Germany (Holger Dell, Jesper Nederlof, eds.), volume 249 of LIPIcs, pages 15:1–15:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [17] | Testing Upward Planarity of Partial 2-Trees Graph Drawing and Network Visualization - 30th International Symposium, GD 2022, Tokyo, Japan, September 13-16, 2022, Revised Selected Papers (Patrizio Angelini, Reinhard von Hanxleden, eds.), volume 13764 of Lecture Notes in Computer Science, pages 175–187, 2022, Springer. |
| [18] | The Complexity of Envy-Free Graph Cutting Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23-29 July 2022 (Luc De Raedt, ed.), pages 237–243, 2022, ijcai.org. |
| [19] | The Complexity of k-Means Clustering when Little is Known International Conference on Machine Learning, ICML 2022, 17-23 July 2022, Baltimore, Maryland, USA (Kamalika Chaudhuri, Stefanie Jegelka, Le Song, Csaba Szepesvári, Gang Niu, Sivan Sabato, eds.), volume 162 of Proceedings of Machine Learning Research, pages 6960–6987, 2022, PMLR. |
| [20] | The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France (Mikolaj Bojanczyk, Emanuela Merelli, David P. Woodruff, eds.), volume 229 of LIPIcs, pages 66:1–66:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [21] | Weighted Model Counting with Twin-Width 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel (Kuldeep S. Meel, Ofer Strichman, eds.), volume 236 of LIPIcs, pages 15:1–15:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1] | Measuring what matters: A hybrid approach to dynamic programming with treewidth J. Comput. Syst. Sci., volume 121, pages 57–75, 2021. |
| [2] | New Width Parameters for SAT and Sharp-SAT Artificial Intelligence, volume 295, pages 103460, 2021. |
| [3] | On Strict (Outer-)Confluent Graphs J. Graph Algorithms Appl., 2021. |
| [4] | On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem Algorithmica, volume 83, number 1, pages 297–336, 2021. |
| [5] | On Structural Parameterizations of the Edge Disjoint Paths Problem Algorithmica, volume 83, number 6, pages 1605–1637, 2021. |
| [6] | Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293) Dagstuhl Reports, volume 11, number 6, pages 82–123, 2021. |
| [7] | The complexity landscape of decompositional parameters for ILP: Programs with Few Global Variables and Constraints Artificial Intelligence, 2021. |
| [8] | The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths Algorithmica, volume 83, number 2, pages 726–752, 2021. |
| [9] | Towards a Polynomial Kernel for Directed Feedback Vertex Set Algorithmica, volume 83, number 5, pages 1201–1221, 2021. |
| [10] | Crossing-Optimal Extension of Simple Drawings 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference) (Nikhil Bansal, Emanuela Merelli, James Worrell, eds.), volume 198 of LIPIcs, pages 72:1–72:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [11] | Graphs with two moplexes Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2021, 2021, Elsevier. |
| [12] | The Complexity of Bayesian Network Learning: Revisiting the Superstructure Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual (Marc'Aurelio Ranzato, Alina Beygelzimer, Yann N. Dauphin, Percy Liang, Jennifer Wortman Vaughan, eds.), pages 430–442, 2021. |
| [13] | 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. |
| [14] | 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. |
| [15] | 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. |
| [16] | Worbel: Aggregating Point Labels into Word Clouds Advances in Geographic Information Systems (SIGSPATIAL'21), pages 256–267, 2021, ACM. |
| [17] | Worbel: Aggregating Point Labels into Word Clouds Proceedings of the International Conference on Advances in Geographic Information Systems 2021 (ACM SIGSPATIAL 2021), 2021. |
| [18] | The Parameterized Complexity of Clustering Incomplete Data 2021, Technical report AC-TR-21-007, Algorithms and Complexity Group, TU Wien. |
| [1] | Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada Discr. Appl. Math., volume 278, pages 1–2, 2020. |
| [2] | On Existential MSO and Its Relation to ETH ACM Trans. Comput. Theory, volume 12, number 4, pages 22:1–22:32, 2020. |
| [3] | Parameterized Algorithms for Book Embedding Problems J. Graph Algorithms Appl., volume 24, number 4, pages 603–620, 2020. |
| [4] | Using decomposition-parameters for QBF: Mind the prefix! J. Comput. Syst. Sci., volume 110, pages 1–21, 2020. |
| [5] | An Efficient Algorithm for Counting Markov Equivalent DAGs The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, New York, NY, USA, February 7-12, 2020, pages 10136–10143, 2020, AAAI Press. |
| [6] | Extending Nearly Complete 1-Planar Drawings in Polynomial Time Mathematical Foundations of Computer Science (MFCS'20) (Javier Esparza, Daniel Král', eds.), volume 170 of LIPIcs, pages 31:1–31:16, 2020, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [7] | Extending Nearly Complete 1-Planar Drawings in Polynomial Time 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic (Javier Esparza, Daniel Král', eds.), volume 170 of LIPIcs, pages 31:1–31:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [8] | Extending Partial 1-Planar Drawings Automata, Languages, and Programming (ICALP'20) (Artur Czumaj, Anuj Dawar, Emanuela Merelli, eds.), volume 168 of LIPIcs, pages 43:1–43:19, 2020, Schloss Dagstuhl–Leibniz-Zentrum für Informatik. |
| [9] | Extending Partial 1-Planar Drawings 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference) (Artur Czumaj, Anuj Dawar, Emanuela Merelli, eds.), volume 168 of LIPIcs, pages 43:1–43:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [10] | Fixed-Parameter Tractability of Dependency QBF with Structural Parameters Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, KR 2020 (Diego Calvanese, Esra Erdem, Michael Thielscher, eds.), pages 392–402, 2020. |
| [11] | On Covering Segments with Unit Intervals 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France (Christophe Paul, Markus Bläser, eds.), volume 154 of LIPIcs, pages 13:1–13:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [12] | On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank Proceeding of AAAI-20, the Thirty-Fourth AAAI Conference on Artificial Intelligence, February 7–12, 2020, New York, pages 3906–3913, 2020, AAAI Press. |
| [13] | Parameterized Algorithms for Queue Layouts Graph Drawing and Network Visualization (GD'20) (David Auber, Pavel Valtr, eds.), volume 12590 of LNCS, pages 40–54, 2020, Springer. |
| [14] | Parameterized Algorithms for Queue Layouts Graph Drawing and Network Visualization - 28th International Symposium, GD 2020, Vancouver, BC, Canada, September 16-18, 2020, Revised Selected Papers (David Auber, Pavel Valtr, eds.), volume 12590 of Lecture Notes in Computer Science, pages 40–54, 2020, Springer. |
| [15] | Parameterized Complexity of Envy-Free Resource Allocation in Social Networks The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, New York, NY, USA, February 7-12, 2020, pages 7135–7142, 2020, AAAI Press. |
| [16] | Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020 (Christian Bessiere, ed.), pages 146–152, 2020, ijcai.org. |
| [17] | The Complexity Landscape of Resource-Constrained Scheduling Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020 (Christian Bessiere, ed.), pages 1741–1747, 2020, ijcai.org. |
| [18] | Threshold Treewidth and Hypertree Width Proceeding of IJCAI-PRICAI2020, the 29th International Joint Conference on Artificial Intelligence and the 17th Pacific Rim International Conference on Artificial Intelligence, pages 1898–1904, 2020. |
| [19] | Fixed-Parameter Tractability of Dependency QBF with Structural Parameters 2020, Technical report AC-TR-20-011, Algorithms and Complexity Group, TU Wien. |
| [20] | On the Parameterized Complexity of Clustering 2020, Technical report AC-TR-20-002, Algorithms and Complexity Group, TU Wien. |
| [21] | Threshold Treewidth and Hypertree Width 2020, Technical report AC-TR-20-005, Algorithms and Complexity Group, TU Wien. |
| [1] | Counting linear extensions: Parameterizations by treewidth Algorithmica, 2019. |
| [2] | On the Complexity Landscape of Connected f-Factor Problems Algorithmica, volume 81, number 6, pages 2606–2632, 2019. |
| [3] | Parameterized Complexity of Asynchronous Border Minimization Algorithmica, volume 81, number 1, pages 201–223, 2019. |
| [4] | Shrub-Depth: Capturing Height of Dense Graphs Logical Methods in Computer Science, 2019. |
| [5] | Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey Algorithms, volume 12, number 12, pages 248, 2019. |
| [6] | A Join-Based Hybrid Parameter for Constraint Satisfaction Proceedings of CP 2019, the 25th International Conference on Principles and Practice of Constraint Programming (Thomas Schiex, Simon de Givry, eds.), volume 11802 of Lecture Notes in Computer Science, pages 195–212, 2019, Springer Verlag. |
| [7] | Group Activity Selection with Few Agent Types 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany (Michael A. Bender, Ola Svensson, Grzegorz Herman, eds.), pages 48:1–48:16, 2019. |
| [8] | Integer Programming and Incidence Treedepth Integer Programming and Combinatorial Optimization - 20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings (Andrea Lodi, Viswanath Nagarajan, eds.), volume 11480 of Lecture Notes in Computer Science, pages 194–204, 2019, Springer. |
| [9] | Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany (Peter Rossmanith, Pinar Heggernes, Joost-Pieter Katoen, eds.), pages 42:1–42:15, 2019. |
| [10] | On Strict (Outer-)Confluent Graphs Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 147–161, 2019, Springer. |
| [11] | On Strict (Outer-)Confluent Graphs Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of Lecture Notes in Computer Science, pages 147–161, 2019, Springer. |
| [12] | Parameterized Algorithms for Book Embedding Problems Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 365–378, 2019, Springer. |
| [13] | Parameterized Algorithms for Book Embedding Problems Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of Lecture Notes in Computer Science, pages 365–378, 2019, Springer. |
| [14] | SAT-Encodings for Treecut Width and Treedepth Proceedings of ALENEX 2019, the 21st Workshop on Algorithm Engineering and Experiments (Stephen G. Kobourov, Henning Meyerhenke, eds.), pages 117–129, 2019, SIAM. |
| [15] | 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, Zhi-Hua Zhou, eds.), pages 1477–1484, 2019. |
| [16] | 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. |
| [17] | 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. |
| [18] | A Join-Based Hybrid Parameter for Constraint Satisfaction 2019, Technical report AC-TR-19-006, Algorithms and Complexity Group, TU Wien. |
| [19] | SAT-Encodings for Treecut Width and Treedepth 2019, Technical report AC-TR-19-001, Algorithms and Complexity Group, TU Wien. |
| [20] | The Parameterized Complexity of Cascading Portfolio Scheduling 2019, Technical report AC-TR-19-009, Algorithms and Complexity Group, TU Wien. |
| [1] | A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion Journal of Computer and System Sciences, volume 97, pages 121–146, 2018. |
| [2] | Meta-kernelization using well-structured modulators Discr. Appl. Math., volume 248, pages 153–167, 2018. |
| [3] | On the complexity of rainbow coloring problems Discr. Appl. Math., volume 246, pages 38–48, 2018. |
| [4] | Solving Problems on Graphs of High Rank-Width Algorithmica, volume 80, number 2, pages 742–771, 2018. |
| [5] | The complexity landscape of decompositional parameters for ILP Artificial Intelligence, volume 257, pages 61–71, 2018. |
| [6] | A Structural Approach to Activity Selection Proceedings of IJCAI 2018, the 27th International Joint Conference on Artificial Intelligence, pages 203–209, 2018, ijcai.org. |
| [7] | On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28–March 3, 2018, Caen, France (Rolf Neidermeier, Brigitte Vallée, eds.), volume 96 of LIPIcs, pages 33:1–33:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. |
| [8] | Parameterized Algorithms for the Matrix Completion Problem Proceeding of ICML, the Thirty-fifth International Conference on Machine Learning, Stockholm, July 10–15, 2018, pages 1642–1651, 2018, JMLR.org. Note: ISSN: 1938-7228 |
| [9] | Small Resolution Proofs for QBF using Dependency Treewidth 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28–March 3, 2018, Caen, France (Rolf Neidermeier, Brigitte Vallée, eds.), volume 96 of LIPIcs, pages 28:1–28:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. |
| [10] | Sum-of-Products with Default Values: Algorithms and Complexity Results Proceedings of ICTAI 2018, the 30th IEEE International Conference on Tools with Artificial Intelligence (Lefteri H. Tsoukalas, Éric Grégoire, Miltiadis Alamaniotis, eds.), pages 733–737, 2018, IEEE. |
| [11] | Unary Integer Linear Programming with Structural Restrictions Proceedings of IJCAI 2018, the 27th International Joint Conference on Artificial Intelligence, pages 1284–1290, 2018, ijcai.org. |
| [12] | Sum-of-Products with Default Values: Algorithms and Complexity Results 2018, Technical report AC-TR-18-007, Algorithms and Complexity Group, TU Wien. |
| [1] | Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting ACM Transactions on Algorithms, volume 13, number AC-TR-17-016, pages 29:1–29:32, 2017. |
| [2] | Backdoor Treewidth for SAT Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 20–37, 2017, Springer Verlag. |
| [3] | Combining Treewidth and Backdoors for CSP 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017) (Heribert Vollmer, Vallée, eds.), volume 66 of Leibniz International Proceedings in Informatics (LIPIcs), pages 36:1–36:17, 2017, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. |
| [4] | Going Beyond Primal Treewidth for (M)ILP Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA., pages 815–821, 2017. |
| [5] | New Width Parameters for Model Counting Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 38–52, 2017, Springer Verlag. |
| [6] | On Structural Parameterizations of the Edge Disjoint Paths Problem 28th International Symposium on Algorithms and Computation, ISAAC 2017, December 9-12, 2017, Phuket, Thailand (Yoshio Okamoto, Takeshi Tokuyama, eds.), volume 92 of LIPIcs, pages 36:1–36:13, 2017, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. |
| [7] | Solving Integer Linear Programs with a Small Number of Global Variables and Constraints Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017 (Carles Sierra, ed.), pages 607–613, 2017, ijcai.org. |
| [8] | Towards a Polynomial Kernel for Directed Feedback Vertex Set 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark (Kim G. Larsen, Hans L. Bodlaender, Jean-François Raskin, eds.), volume 83 of LIPIcs, pages 36:1–36:15, 2017, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. |
| [9] | Backdoor Treewidth for SAT 2017, Technical report AC-TR-17-014, Algorithms and Complexity Group, TU Wien. |
| [10] | New Width Parameters for Model Counting 2017, Technical report AC-TR-17-013, Algorithms and Complexity Group, TU Wien. |
| [1] | Are There Any Good Digraph Measures? Journal of Combinatorial Theory, Series B, volume 116, pages 250–286, 2016. |
| [2] | FO Model Checking of Interval Graphs Logical Methods in Computer Science, volume 11, number 4, 2016. |
| [3] | Meta-Kernelization with Structural Parameters Journal of Computer and System Sciences, volume 82, number 2, pages 333–346, 2016. |
| [4] | Model Checking Existential Logic on Partially Ordered Sets ACM Transactions on Computational Logic, volume 17, number 2, 2016. |
| [5] | Quantified Conjunctive Queries on Partially Ordered Sets Theoretical Computer Science, volume 618, pages 72–84, 2016. |
| [6] | A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion Mathematical Foundations of Computer Science 2016 - 41st International Symposium, MFCS 2016 (Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier, eds.), volume 58 of LIPIcs, pages 34:1–34:14, 2016, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. |
| [7] | Backdoors to Tractable Valued CSP Principles and Practice of Constraint Programming - 22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings (Michel Rueher, ed.), volume 9892 of Lecture Notes in Computer Science, pages 233–250, 2016, Springer Verlag. |
| [8] | Counting Linear Extensions: Parameterizations by Treewidth 24th European Symposium of Algorithms, ESA 2016, volume 57 of LIPIcs, pages 39:1–39:18, 2016, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. |
| [9] | Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, pages 1670–1681, 2016. |
| [10] | On Existential MSO and its Relation to ETH 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) (Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier, eds.), volume 58 of Leibniz International Proceedings in Informatics (LIPIcs), pages 42:1–42:14, 2016, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. |
| [11] | On the Complexity Landscape of Connected f-factor Problems Mathematical Foundations of Computer Science 2016 - 41st International Symposium, MFCS 2016 (Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier, eds.), pages 41:1–41:14, 2016, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. |
| [12] | Polynomial-Time Construction of Optimal MPI Derived Datatype Trees 2016 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2016, Chicago, IL, USA, May 23-27, 2016, pages 638–647, 2016, IEEE Computer Society. |
| [13] | The Complexity Landscape of Decompositional Parameters for ILP Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (Dale Schuurmans, Michael P. Wellman, eds.), pages 710–716, 2016, AAAI Press. |
| [14] | Using Decomposition-Parameters for QBF: Mind the Prefix! Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (Dale Schuurmans, Michael P. Wellman, eds.), pages 964–970, 2016, AAAI Press. |
| [1] | Improving Vertex Cover as a Graph Parameter Discrete Mathematics \& Theoretical Computer Science, volume 17, number 2, pages 77–100, 2015. |
| [2] | Algorithmic Applications of Tree-Cut Width Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II, volume 9235 of Lecture Notes in Computer Science, pages 348–360, 2015, Springer Verlag. |
| [3] | Community Structure Inspired Algorithms for SAT and \#SAT 18th International Conference on Theory and Applications of Satisfiability Testing (SAT 2015), September 24-27, 2015, Austin, Texas (Marijn Heule, Sean Weaver, eds.), pages 223-237, 2015, Springer Verlag. |
| [4] | Meta-Kernelization using Well-Structured Modulators Parameterized and Exact Computation - 10th International Symposium, IPEC 2014, Patras, Greece, September 16-18, 2015. Revised Selected Papers (Thore Husfeldt, Iyad A. Kanj, eds.), volume 43 of LIPIcs, pages 114–126, 2015. |
| [5] | On the Complexity of Rainbow Coloring Problems Combinatorial Algorithms - 26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, Revised Selected Papers (Zsuzsanna Lipták, William F. Smyth, eds.), pages 209–220, 2015. |
| [6] | Parameterized Complexity of Asynchronous Border Minimization Theory and Applications of Models of Computation - 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015, Proceedings (Rahul Jain, Sanjay Jain, Frank Stephan, eds.), volume 9076 of Lecture Notes in Computer Science, pages 428–440, 2015, Springer. |
| [7] | Solving Problems on Graphs of High Rank-Width Algorithms and Data Structures Symposium (WADS 2015), August 5-7, 2015, University of Victoria, BC, Canada, pages 314–326, 2015, Springer Verlag. |
| [1] | Digraph width measures in parameterized algorithmics Discrete Applied Mathematics, volume 168, pages 88–107, 2014. |
| [2] | Lower bounds on the complexity of MSO1 model-checking J. Comput. Syst. Sci., volume 80, number 1, pages 180–194, 2014. |
| [3] | Model checking existential logic on partially ordered sets Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, Vienna, Austria, July 14 - 18, 2014 (Thomas A. Henzinger, Dale Miller, eds.), pages 21:1–21:10, 2014, ACM. |
| [4] | Quantified Conjunctive Queries on Partially Ordered Sets Parameterized and Exact Computation - 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers (Marek Cygan, Pinar Heggernes, eds.), volume 8894 of Lecture Notes in Computer Science, pages 122–134, 2014, Springer Verlag. |
| [1] | A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width Eur. J. Comb., volume 34, number 3, pages 680–701, 2013. |
| [2] | Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width Fundam. Inform., volume 123, number 1, pages 59–76, 2013. |
| [3] | Cops-and-robbers: remarks and problems Journal of Combinatorial Mathematics and Combinatorial Computing, volume 85, pages 141–159, 2013. |
| [4] | Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes Combinatorial Algorithms - 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013, Revised Selected Papers, volume 8288 of Lecture Notes in Computer Science, pages 164–177, 2013, Springer. |
| [5] | FO Model Checking of Interval Graphs Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II, volume 7966 of Lecture Notes in Computer Science, pages 250–262, 2013, Springer. |
| [6] | Meta-kernelization with Structural Parameters Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings (Krishnendu Chatterjee, Jiri Sgall, eds.), volume 8087 of Lecture Notes in Computer Science, pages 457-468, 2013, Springer Verlag. |
| [1] | Lower Bounds on the Complexity of MSO1 Model-Checking 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, volume 14 of LIPIcs, pages 326–337, 2012, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. |
| [2] | When Trees Grow Low: Shrubs and Fast MSO1 Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings, volume 7464 of Lecture Notes in Computer Science, pages 419–430, 2012, Springer. |
| [1] | Clique-width: When Hard Does Not Mean Impossible 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, volume 9 of LIPIcs, pages 404–415, 2011, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. |
| [2] | New Results on the Complexity of the Max- and Min-Rep Problems SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 22-28, 2011. Proceedings, volume 6543 of Lecture Notes in Computer Science, pages 238–247, 2011, Springer. |
| [3] | Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics Parameterized and Exact Computation - 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers, volume 7112 of Lecture Notes in Computer Science, pages 259–271, 2011, Springer. |
| [1] | On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width Discrete Applied Mathematics, volume 158, number 7, pages 851–867, 2010. |
| [2] | Are There Any Good Digraph Width Measures? Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, volume 6478 of Lecture Notes in Computer Science, pages 135–146, 2010, Springer. |
| [3] | Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, volume 8 of LIPIcs, pages 73–83, 2010, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. |
| [4] | New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes SOFSEM 2010: Theory and Practice of Computer Science, 36th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 23-29, 2010. Proceedings, volume 5901 of Lecture Notes in Computer Science, pages 428–439, 2010, Springer. |
| [5] | Thread Graphs, Linear Rank-Width and Their Algorithmic Applications Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers, volume 6460 of Lecture Notes in Computer Science, pages 38–42, 2010, Springer. |
| [1] | Better Polynomial Algorithms on Graphs of Bounded Rank-Width Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28-July 2, 2009, Revised Selected Papers, pages 266–277, 2009, Springer. |
| [2] | On Digraph Width Measures in Parameterized Algorithmics Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers, volume 5917 of Lecture Notes in Computer Science, pages 185–197, 2009, Springer. |
| [3] | The Parameterized Complexity of Oriented Colouring Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, MEMICS 2009, November 13-15, 2009, Prestige Hotel, Znojmo, Czech Republic, 2009, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany. |
| [1] | Automata approach to graphs of bounded rank-width Proceedings of the 19th International Workshop on Combinatorial Algorithms, IWOCA 2008, September 13-15, 2008, Nagoya, Japan, pages 4–15, 2008, College Publications. |
| [1] | $F^2$Stories: A Modular Framework for Multi-Objective Optimization of Storylines with a Focus on Fairness IEEE Trans. Vis. Comput. Graph., volume 32, number 1, pages 747–757, 2026. |
| [2] | ARCOL: Aspect Ratio Constrained Orthogonal Layout Comput. Graph. Forum, 2026. |
| [3] | The Story(line) So Far: A Survey on Storyline Visualization Comput. Graph. Forum, volume 45, number 3, 2026. |
| [1] | Optimizing Staircase Motifs in Biofabric Network Layouts Comput. Graph. Forum, pages e70139, 2025. |
| [2] | F2Stories: A Modular Framework for Multi-Objective Optimization of Storylines with a Focus on Fairness 2025, Technical report AC-TR-25-001, Algorithms and Complexity Group, TU Wien. |
| [1] | The Parameterized Complexity Of Extending Stack Layouts Journal of Graph Algorithms and Applications, volume 29, number 3, pages 39–78, 2026. |
| [2] | The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern Parameterized and Exact Computation (IPEC'26) (Tuukka Korhonen, Michael Lampis, eds.), 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. |
| [3] | The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern 21st International Symposium on Parameterized and Exact Computation, IPEC 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear |
| [4] | The Peculiarities of Extending Queue Layouts Graph-Theoretic Concepts in Computer Science (WG'25) (Henning Fernau, Philipp Kindermann, eds.), volume 16124 of LNCS, pages 177–191, 2026, Springer. |
| [1] | Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms 33rd Annual European Symposium on Algorithms, ESA 2025, September 15-17, 2025, Warsaw, Poland (Anne Benoit, Haim Kaplan, Sebastian Wild, Grzegorz Herman, eds.), volume 351 of LIPIcs, pages 15:1–15:18, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear |
| [2] | PACE Solver Description: Bad Dominating Set Maker 20th International Symposium on Parameterized and Exact Computation, IPEC 2025, Warsaw, Poland, September 17-19, 2025 (Akanksha Agrawal, Erik Jan van Leeuwen, eds.), pages 35:1–35:5, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [3] | Partial Level Planarity Parameterized by the Size of the Missing Graph European Workshop on Computational Geometry (EuroCG'25) (Jan Kratochvíl, Giuseppe Liotta, eds.), pages 50:1–50:10, 2025. |
| [4] | Pathways to Tractability for Geometric Thickness Theory and Practice of Computer Science (SOFSEM'25) (Rastislav Královic, Vera Kurková, eds.), volume 15538 of LNCS, pages 209–224, 2025, Springer. |
| [5] | Pathways to Tractability for Geometric Thickness (Best Paper Award) SOFSEM 2025: Theory and Practice of Computer Science - 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20-23, 2025, Proceedings, Part I (Rastislav Královic, Vera Kurková, eds.), volume 15538 of Lecture Notes in Computer Science, pages 209–224, 2025, Springer. |
| [6] | Structural Parameterizations of Simultaneous Planarity 36th International Symposium on Algorithms and Computation, ISAAC 2025, Tainan, Taiwan, December 7-10, 2025 (Ho-Lin Chen, Wing-Kai Hon, Meng-Tsung Tsai, eds.), volume 359 of LIPIcs, pages 25:1–25:17, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [7] | The Peculiarities of Extending Queue Layouts Graph-Theoretic Concepts in Computer Science - 51st International Workshop, WG 2025, Otzenhausen, Germany, June 11-13, 2025, Revised Selected Papers (Henning Fernau, Philipp Kindermann, eds.), volume 16124 of Lecture Notes in Computer Science, pages 177–191, 2025, Springer. |
| [1] | The Parameterized Complexity of Extending Stack Layouts Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 12:1–12:17, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [2] | The Parameterized Complexity Of Extending Stack Layouts 32nd International Symposium on Graph Drawing and Network Visualization, GD 2024, September 18-20, 2024, Vienna, Austria (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 12:1–12:17, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1] | Many-to-One Boundary Labeling with Backbones J. Graph Algorithms Appl., volume 19, number 3, pages 779–816, 2015. |
| [1] | Drawing Metro Maps using Bézier Curves Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 463–474, 2013, Springer Berlin Heidelberg. |
| [2] | Many-to-One Boundary Labeling with Backbones Graph Drawing (GD'13) (Stephen Wismath, Alexander Wolff, eds.), volume 8242 of LNCS, pages 244–255, 2013, Springer Berlin Heidelberg. |
| [1] | Fair Correlation Clustering Meets Graph Parameters Proceedings of the 17th Latin American Theoretical Informatics (LATIN 2026), 2026. Note: to appear |
| [2] | Gateways to Tractability for Satisfiability in Pearl’s Causal Hierarchy Proceedings of the 43rd International Conference on Machine Learning, ICML 2026, 2026, PMLR. Note: to appear |
| [3] | Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity Fortieth AAAI Conference on Artificial Intelligence, Thirty-Eighth Conference on Innovative Applications of Artificial Intelligence, Sixteenth Symposium on Educational Advances in Artificial Intelligence, AAAI 2026, Singapore, January 20-27, 2026 (Sven Koenig, Chad Jenkins, Matthew E. Taylor, eds.), pages 19108–19116, 2026, AAAI Press. |
| [4] | Parameterized Complexity of Efficient Sortation 51st International Symposium on Mathematical Foundations of Computer Science (MFCS 2026), 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear |
| [1] | A Structural Complexity Analysis of Hierarchical Task Network Planning Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2025, Montreal, Canada, August 16-22, 2025, pages 4391–4400, 2025, ijcai.org. |
| [2] | Hot off the Press: Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2025, NH Malaga Hotel, Malaga, Spain, July 14-18, 2025 (Bogdan Filipic, ed.), pages 85–86, 2025, ACM. |
| [3] | Training One-Dimensional Graph Neural Networks is NP-Hard The Thirteenth International Conference on Learning Representations, ICLR 2025, Singapore, April 24-28, 2025, 2025, OpenReview.net. |
| [1] | Hot off the Press: The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2024, Melbourne, VIC, Australia, July 14-18, 2024 (Xiaodong Li, Julia Handl, eds.), pages 27–28, 2024, ACM. |
| [2] | Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms Parallel Problem Solving from Nature - PPSN XVIII - 18th International Conference, PPSN 2024, Hagenberg, Austria, September 14-18, 2024, Proceedings, Part IV (Michael Affenzeller, Stephan M. Winkler, Anna V. Kononova, Heike Trautmann, Tea Tusar, Penousal Machado, Thomas Bäck, eds.), volume 15151 of Lecture Notes in Computer Science, pages 153–168, 2024, Springer. |
| [1] | A General Theoretical Framework for Learning Smallest Interpretable Models Artificial Intelligence, volume 350, pages 104441, 2026. |
| [2] | Backdoors to Satisfaction Continued Computer Science Review, volume 60, pages 100868, 2026. |
| [3] | From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem Algorithmica, volume 88, number 1, pages 8, 2026. |
| [4] | OBDDs, SDDs, and Circuits of Bounded Width: Completeness Matters Artificial Intelligence, volume 351, pages 104458, 2026. |
| [5] | Agentic Neurosymbolic Collaboration for Mathematical Discovery: A Case Study in Combinatorial Design Proceedings of the 20th Conference on Neurosymbolic Learning and Reasoning (NeSy 2026), 2026. Note: To appear; preprint: CoRR abs/2603.08322, https://arxiv.org/abs/2603.08322 |
| [6] | Algorithm Selection with Zero Domain Knowledge via Text Embeddings Proceedings of the International Conference on Automated Machine Learning, AutoML 2026, September 28 – October 1, 2026, Ljubljana, Slovenia, 2026. Note: To appear; preprint: CoRR abs/2604.19753, https://arxiv.org/abs/2604.19753 |
| [7] | ASP-Bench: From Natural Language to Logic Programs Proceedings of the 2nd IEEE/ACM International Workshop on Neuro-Symbolic Software Engineering (NSE '26), pages 1–8, 2026, ACM. Note: Preprint: CoRR abs/2602.01171, https://arxiv.org/abs/2602.01171. Extended abstract in Proceedings 42nd International Conference on Logic Programming, ICLP 2026, EPTCS 450, pages 104–118, https://doi.org/10.4204/EPTCS.450.10 |
| [8] | Computing Probabilistic Explanations for ML Models: Fixed-Parameter Algorithms Fortieth AAAI Conference on Artificial Intelligence, Thirty-Eighth Conference on Innovative Applications of Artificial Intelligence, Sixteenth Symposium on Educational Advances in Artificial Intelligence, AAAI 2026, Singapore, January 20-27, 2026 (Sven Koenig, Chad Jenkins, Matthew E. Taylor, eds.), pages 24622–24629, 2026, AAAI Press. |
| [9] | ContReAct: A Feedback-Based Architecture for Continuous Agentic Operation Proceedings of the 2026 International Workshop on Agentic Engineering (AGENT '26), pages 56–62, 2026, ACM. |
| [10] | CP-Agent: Agentic Constraint Programming Proceedings of the 3rd International Workshop on Large Language Models for Code (LLM4Code '26), pages 6–13, 2026, ACM. Note: Preprint: CoRR abs/2508.07468, https://arxiv.org/abs/2508.07468 |
| [11] | Formally Verified Graph Generation with SAT Modulo Symmetries and Lean Automated Reasoning - 13th International Joint Conference, IJCAR 2026, Lisbon, Portugal, July 26–29, 2026, Proceedings, Part I (Armin Biere, Carsten Lutz, Sara Negri, eds.), volume 16688 of Lecture Notes in Computer Science, pages 117–135, 2026, Springer. |
| [12] | Graph Choosability via SAT: Beyond the Nullstellensatz Fortieth AAAI Conference on Artificial Intelligence, Thirty-Eighth Conference on Innovative Applications of Artificial Intelligence, Sixteenth Symposium on Educational Advances in Artificial Intelligence, AAAI 2026, Singapore, January 20-27, 2026 (Sven Koenig, Chad Jenkins, Matthew E. Taylor, eds.), pages 14269–14277, 2026, AAAI Press. |
| [13] | LLM-Guided Graph Generation for Structure-Based Local Improvement Methods Proceedings of the 20th Conference on Neurosymbolic Learning and Reasoning (NeSy 2026), 2026. Note: To appear; preprint: CoRR abs/2608.13333, https://arxiv.org/abs/2608.13333 |
| [14] | LLM-Guided Semantic Vtrees for SDD Compilation Proceedings of the 20th Conference on Neurosymbolic Learning and Reasoning (NeSy 2026), 2026. Note: To appear |
| [15] | MaxSAT-Based Compression for Tsetlin Machines Proceedings of the 43rd International Conference on Machine Learning, ICML 2026, July 6–11, 2026, Seoul, South Korea, 2026. Note: To appear |
| [16] | Neurosymbolic Discovery of Algebraic Graph Constructions Proceedings of the 20th Conference on Neurosymbolic Learning and Reasoning (NeSy 2026), 2026. Note: To appear; preprint: CoRR abs/2608.08118, https://arxiv.org/abs/2608.08118 |
| [17] | Smart Cubing for Graph Search: A Comparative Study 32nd International Conference on Principles and Practice of Constraint Programming, CP 2026, July 20–23, 2026, Lisbon, Portugal, volume 379 of LIPIcs, pages 33:1–33:19, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: Preprint: CoRR abs/2501.17201, https://arxiv.org/abs/2501.17201 |
| [18] | Streamliners for Answer Set Programming Proceedings 42nd International Conference on Logic Programming, ICLP 2026, Lisbon, Portugal, 20-23rd July 2026 (Wolfgang Faber, Laura Giordano, Ricardo Rocha, Vítor Santos Costa, eds.), volume 450 of EPTCS, pages 236–255, 2026. Note: Preprint: CoRR abs/2604.19251, https://arxiv.org/abs/2604.19251 |
| [19] | Synthesizing Feature Extractors: An Agentic Approach for Algorithm Selection Proceedings of the International Conference on Automated Machine Learning, AutoML 2026, September 28 – October 1, 2026, Ljubljana, Slovenia, 2026. Note: To appear; preprint: CoRR abs/2608.17170, https://arxiv.org/abs/2608.17170 |
| [20] | VIPR Certificate Construction from Black-Box ILP Solvers 32nd International Conference on Principles and Practice of Constraint Programming, CP 2026, July 20–23, 2026, Lisbon, Portugal, volume 379 of LIPIcs, pages 52:1–52:14, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1] | Generating Streamlining Constraints with Large Language Models Journal of Artificial Intelligence Research, volume 84, pages 16:1–16:19, 2025. Note: Abstract reprint in AAAI 2026, page 39900 |
| [2] | Analyzing Reformulation Performance in Core-Guided MaxSAT Solving 28th International Conference on Theory and Applications of Satisfiability Testing, SAT 2025, August 12-15, 2025, Glasgow, Scotland (Jeremias Berg, Jakob Nordström, eds.), volume 341 of LIPIcs, pages 26:1–26:18, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [3] | Balancing Latin Rectangles with LLM-Generated Streamliners 31st International Conference on Principles and Practice of Constraint Programming, CP 2025, August 10-15, 2025, Glasgow, Scotland (Maria Garcia de la Banda, ed.), volume 340 of LIPIcs, pages 36:1–36:17, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [4] | Breaking Symmetries in Quantified Graph Search: A Comparative Study AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25 - March 4, 2025, Philadelphia, PA, USA (Toby Walsh, Julie Shah, Zico Kolter, eds.), pages 11246–11254, 2025, AAAI Press. |
| [5] | Bridging Language Models and Symbolic Solvers via the Model Context Protocol 28th International Conference on Theory and Applications of Satisfiability Testing, SAT 2025, August 12-15, 2025, Glasgow, Scotland (Jeremias Berg, Jakob Nordström, eds.), volume 341 of LIPIcs, pages 30:1–30:12, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [6] | Extracting Problem Structure with LLMs for Optimized SAT Local Search SOCS 2025, The 18th International Symposium on Combinatorial Search. August 12-15, 2025. University of Glasgow, Scotland, United Kingdom, 2025. |
| [7] | Large and Parallel Human Sorting Networks Creative Mathematical Sciences Communication (Henning Fernau, Inge Schwank, Jacqueline Staub, eds.), pages 194–204, 2025, Springer Nature Switzerland. |
| [8] | Optimal Decision Tree Pruning Revisited: Algorithms and Complexity Forty-second International Conference on Machine Learning, ICML 2025, Vancouver, BC, Canada, July 13-19, 2025, 2025, OpenReview.net. |
| [9] | SAT Modulo Symmetries: A Survey Satisfiability Checking and Symbolic Computation, 10th International Workshop, SC-Square 2025, Stuttgart, Germany, August 2, 2025, co-located with CADE 2025, volume 4116 of CEUR Workshop Proceedings, pages 1–11, 2025, CEUR-WS.org. |
| [10] | StreamLLM: Enhancing Constraint Programming with Large Language Model-Generated Streamliners 2025 IEEE/ACM 1st International Workshop on Neuro-Symbolic Software Engineering (NSE), pages 17-22, 5 2025, IEEE. |
| [11] | The 3-Decomposition Conjecture: A SAT-Based Approach with Specialized Propagators 31st International Conference on Principles and Practice of Constraint Programming, CP 2025, August 10-15, 2025, Glasgow, Scotland (Maria Garcia de la Banda, ed.), volume 340 of LIPIcs, pages 39:1–39:19, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [12] | Uncovering and Verifying Optimal Community Structure in Complex Networks: A MaxSAT Approach Computational Science - ICCS 2025 - 25th International Conference, Singapore, July 7-9, 2025, Proceedings, Part II (Michael H. Lees, Wentong Cai, Siew Ann Cheong, Yi Su, David Abramson, Jack J. Dongarra, Peter M. A. Sloot, eds.), volume 15904 of Lecture Notes in Computer Science, pages 35–49, 2025, Springer. |
| [1] | Backdoor DNFs Journal of Computer and System Sciences, volume 144, pages 103547, 2024. |
| [2] | SAT backdoors: Depth beats size Journal of Computer and System Sciences, volume 142, pages 103520, 2024. |
| [3] | SAT Modulo Symmetries for Graph Generation and Enumeration ACM Transactions on Computational Logic, volume 25, number 3, 2024. |
| [4] | SAT-based Decision Tree Learning for Large Data Sets Journal of Artificial Intelligence Research, volume 80, pages 875–918, 2024. |
| [5] | Satisfiability Modulo User Propagators Journal of Artificial Intelligence Research, volume 81, pages 989–1017, 2024. |
| [6] | A General Theoretical Framework for Learning Smallest Interpretable Models AAAI'24, the Thirty-Eighth AAAI Conference on Artificial Intelligence, February 20-27, Vancouver, Canada (Jennifer Dy, Sriraam Natarajan, eds.), pages 10662–10669, 2024, AAAI Press. |
| [7] | ASP-QRAT: A Conditionally Optimal Dual Proof System for ASP Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning, pages 253–263, 8 2024. |
| [8] | Compilation and Fast Model Counting beyond CNF Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, IJCAI-24 (Kate Larson, ed.), pages 3315–3323, 8 2024, International Joint Conferences on Artificial Intelligence Organization. Note: Main Track |
| [9] | Computing small Rainbow Cycle Numbers with SAT modulo Symmetries The 30th International Conference on Principles and Practice of Constraint Programming, CP 2024 (Paul Shaw, ed.), 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [10] | eSLIM: Circuit Minimization with SAT Based Local Improvement 27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024) (Supratik Chakraborty, Jie-Hong Roland Jiang, eds.), volume 305 of Leibniz International Proceedings in Informatics (LIPIcs), pages 23:1–23:14, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [11] | Explaining Decisions in ML Models: A Parameterized Complexity Analysis Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning, pages 563–573, 8 2024. |
| [12] | Hardness of Random Reordered Encodings of Parity for Resolution and CDCL AAAI'24, the Thirty-Eighth AAAI Conference on Artificial Intelligence, February 20-27, Vancouver, Canada (Jennifer Dy, Sriraam Natarajan, eds.), pages 7978–7986, 2024, AAAI Press. |
| [13] | Learning Small Decision Trees for Data of Low Rank-Width AAAI'24, the Thirty-Eighth AAAI Conference on Artificial Intelligence, February 20-27, Vancouver, Canada (Jennifer Dy, Sriraam Natarajan, eds.), pages 10476–10483, 2024, AAAI Press. |
| [14] | Revisiting Causal Discovery from a Complexity-Theoretic Perspective Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, IJCAI-24 (Kate Larson, ed.), pages 3377–3385, 8 2024, International Joint Conferences on Artificial Intelligence Organization. Note: Main Track |
| [15] | SAT-Based Tree Decomposition with Iterative Cascading Policy Selection AAAI'24, the Thirty-Eighth AAAI Conference on Artificial Intelligence, February 20-27, Vancouver, Canada (Jennifer Dy, Sriraam Natarajan, eds.), pages 8191–8199, 2024, AAAI Press. |
| [16] | Small unsatisfiable k-CNFs with bounded literal occurrence 27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024) (Supratik Chakraborty, Jie-Hong Roland Jiang, eds.), volume 305 of Leibniz International Proceedings in Informatics (LIPIcs), pages 31:1–31:22, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [17] | Structure-guided Local Improvement for Maximum Satisfiability The 30th International Conference on Principles and Practice of Constraint Programming, CP 2024 (Paul Shaw, ed.), 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [18] | The Power of Collaboration: Learning Large Bayesian Networks at Scale 2024 IEEE 36th International Conference on Tools with Artificial Intelligence (ICTAI), pages 371-378, 2024. |
| [19] | Improved Circuit Minimization with Exact Synthesis 2024, Technical report AC-TR-24-001, Algorithms and Complexity Group, TU Wien. |
| [1] | Are Hitting Formulas Hard for Resolution? Discr. Appl. Math., volume 337, pages 173–184, 2023. |
| [2] | Computing optimal hypertree decompositions with SAT Artificial Intelligence, volume 325, pages 104015, 2023. |
| [3] | CSP beyond tractable constraint languages Constraints, volume 28, number 3, pages 450–471, 2023. |
| [4] | On the parameterized complexity of clustering problems for incomplete data Journal of Computer and System Sciences, volume 134, pages 1–19, 2023. |
| [5] | SAT-Boosted Tabu Search for Coloring Massive Graphs J. Exp. Algorithmics, volume 2825, number 1.5, pages 1–19, 2023. |
| [6] | The Silent (R)evolution of SAT Communications of the ACM, volume 66, number 6, pages 64–72, June 2023. |
| [7] | A SAT Solver's Opinion on the Erdős-Faber-Lovász Conjecture 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy (Meena Mahajan, Friedrich Slivovsky, eds.), volume 271 of LIPIcs, pages 13:1–13:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [8] | Circuit Minimization with Exact Synthesis: From QBF Back to SAT Proceedings of the 32nd International Workshop on Logic \& Synthesis (IWLS), 2023. |
| [9] | Circuit Minimization with QBF-Based Exact Synthesis Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023 (Brian Williams, Yiling Chen, Jennifer Neville, eds.), pages 4087–4094, 2023, AAAI Press. |
| [10] | Co-Certificate Learning with SAT Modulo Symmetries Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China, pages 1944–1953, 2023, ijcai.org. Note: Main Track |
| [11] | Computing twin-width with SAT and branch \& bound The 32nd International Joint Conference on Artificial Intelligence (IJCAI-23), August 19–25, 2023, Macao, S.A.R. (Edith Elkind, ed.), pages 2013–2021, 2023, International Joint Conferences on Artificial Intelligence Organization. Note: Main Track |
| [12] | From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands (Neeldhara Misra, Magnus Wahlström, eds.), volume 285 of LIPIcs, pages 16:1–16:14, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [13] | Inconsistent Cores for ASP: The Perks and Perils of Non-Monotonicity Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023 (Brian Williams, Yiling Chen, Jennifer Neville, eds.), pages 6363–6371, 2023, AAAI Press. |
| [14] | IPASIR-UP: User Propagators for CDCL The 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023), July 04-08, 2023, Alghero, Italy (Meena Mahajan, Friedrich Slivovsky, eds.), volume 271 of LIPIcs, pages 8:1–8:13, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [15] | Learning Small Decision Trees with Large Domain The 32nd International Joint Conference on Artificial Intelligence (IJCAI-23), August 19–25, 2023, Macao, S.A.R. (Edith Elkind, ed.), pages 3184–3192, 2023, International Joint Conferences on Artificial Intelligence Organization. Note: Main Track |
| [16] | Proven optimally-balanced Latin rectangles with SAT Proceedings of CP 2023, the 29th International Conference on Principles and Practice of Constraint Programming (Roland Yap, ed.), volume 280 of LIPIcs, pages 48:1–48:10, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [17] | SAT-Based Generation of Planar Graphs The 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023), July 04-08, 2023, Alghero, Italy (Meena Mahajan, Friedrich Slivovsky, eds.), volume 271 of LIPIcs, pages 14:1–14:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [18] | Searching for smallest universal graphs and tournaments with SAT Proceedings of CP 2023, the 29th International Conference on Principles and Practice of Constraint Programming (Roland Yap, ed.), volume 280 of LIPIcs, pages 39:1–39:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [19] | The Computational Complexity of Concise Hypersphere Classification Proceedings of the 40th International Conference on Machine Learning, ICML 2023, pages 9060–9070, 2023, PMLR. |
| [20] | The Parameterized Complexity of Finding Concise Local Explanations Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China, pages 3312–3320, 2023, ijcai.org. |
| [1] | Algorithmic Applications of Tree-Cut Width SIAM J. Discrete Math., volume 36, number 4, pages 2635–2666, 2022. |
| [2] | Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria Discr. Appl. Math., volume 312, pages 1–2, 2022. |
| [3] | Sum-of-Products with Default Values: Algorithms and Complexity Results Journal of Artificial Intelligence Research, volume 33, pages 535–552, 2022. |
| [4] | Threshold Treewidth and Hypertree Width Journal of Artificial Intelligence Research, volume 74, pages 1687–1713, 2022. |
| [5] | A SAT Approach to Twin-Width Proceedings of ALENEX 2022, the 24nd SIAM Symposium on Algorithm Engineering and Experiments (Cynthia A. Phillips, Bettina Speckmann, eds.), pages 67–77, 2022, SIAM. |
| [6] | A SAT Attack on Rota’s Basis Conjecture 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel (Kuldeep S. Meel, Ofer Strichman, eds.), volume 236 of LIPIcs, pages 4:1–4:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [7] | CSP Beyond Tractable Constraint Languages 28th International Conference on Principles and Practice of Constraint Programming, CP 2022, July 31 to August 8, 2022, Haifa, Israel (Christine Solnon, ed.), volume 235 of LIPIcs, pages 20:1–20:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [8] | Finding a Cluster in Incomplete Data 30th Annual European Symposium on Algorithms (ESA 2022) (Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, Grzegorz Herman, eds.), volume 244 of Leibniz International Proceedings in Informatics (LIPIcs), pages 47:1–47:14, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [9] | Learning Large Bayesian Networks with Expert Constraints 38th Conference on Uncertainty in Artificial Intelligence (UAI 2022), Eindhoven, Netherlands, August 1–5, 2022 (James Cussens, Kun Zhang, eds.), pages 180:1592–1601, 2022. |
| [10] | Preface: 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria, volume 241 of LIPIcs, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [11] | SAT Backdoors: Depth Beats Size 30th Annual European Symposium on Algorithms (ESA 2022) (Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, Grzegorz Herman, eds.), volume 244 of Leibniz International Proceedings in Informatics (LIPIcs), pages 46:1–46:18, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [12] | Tractable Abstract Argumentation via Backdoor-Treewidth Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, IAAI 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, EAAI 2022 Virtual Event, February 22 - March 1, 2022, pages 5608–5615, 2022, AAAI Press. |
| [13] | Weighted Model Counting with Twin-Width 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel (Kuldeep S. Meel, Ofer Strichman, eds.), volume 236 of LIPIcs, pages 15:1–15:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1] | Finding the Hardest Formulas for Resolution Journal of Artificial Intelligence Research, volume 72, pages 69–97, 2021. Note: Conference Award Track, best paper CP 2020 |
| [2] | New Width Parameters for SAT and Sharp-SAT Artificial Intelligence, volume 295, pages 103460, 2021. |
| [3] | Backdoor DNFs Proceeding of IJCAI-2021, the 30th International Joint Conference on Artificial Intelligence (Zhi-Hua Zhou, ed.), pages 1403–1409, 2021. |
| [4] | Certified DQBF Solving by Definition Extraction Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings (Chu-Min Li, Felip Manyà, eds.), volume 12831 of Lecture Notes in Computer Science, pages 499–517, 2021, Springer. |
| [5] | Computing Optimal Hypertree Decompositions with SAT Proceeding of IJCAI-21, the 30th International Joint Conference on Artificial Intelligence (Zhi-Hua Zhou, ed.), 2021. |
| [6] | Finding the Hardest Formulas for Resolution (Extended Abstract) Proceeding of IJCAI-21, the 30th International Joint Conference on Artificial Intelligence (Zhi-Hua Zhou, ed.), pages 4814–4818, 2021. Note: Sister Conferences Best Papers |
| [7] | Learning fast-inference Bayesian networks Proceedings of NeurIPS 2021, the Thirty-fifth Conference on Neural Information Processing Systems (M. Ranzato, A. Beygelzimer, K. Nguyen, P.S. Liang, J.W. Vaughan, Y. Dauphin, eds.), pages 17852–17863, 2021. |
| [8] | Parameterized Complexity of Small Decision Tree Learning Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 6454–6462, 2021, AAAI Press. |
| [9] | SAT Modulo Symmetries for Graph Generation Proceeings of CP 2021, the 27th International Conference on Principles and Practice of Constraint Programming (Laurent D. Michel, ed.), pages 39:1–-39:17, 2021, Dagstuhl Publishing. |
| [10] | SAT-based Decision Tree Learning for Large Data Sets Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 3904–3912, 2021, AAAI Press. |
| [11] | 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. |
| [12] | 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. |
| [13] | Backdoor DNFs 2021, Technical report AC-TR-21-001, Algorithms and Complexity Group, TU Wien. |
| [14] | Certified DQBF Solving by Definition Extraction 2021, Technical report AC-TR-21-010, Algorithms and Complexity Group, TU Wien. |
| [15] | Fixed-Parameter Tractability Chapter in Handbook of Satisfiability, 2nd Edition (Armin Biere, Marijn Heule, Hans van Maaren, Toby Walsh, eds.), pages 693–736, 2021, IOS Press. |
| [16] | Fixed-Parameter Tractability 2021, Technical report AC-TR-21-004, Algorithms and Complexity Group, TU Wien. Note: Chapter 17, Handbook of Satisfiability, 2nd Edition, 2021 |
| [17] | Parameterized Complexity of Small Decision Tree Learning 2021, Technical report AC-TR-21-002, Algorithms and Complexity Group, TU Wien. |
| [18] | SAT-based Decision Tree Learning for Large Data Sets 2021, Technical report AC-TR-21-003, Algorithms and Complexity Group, TU Wien. |
| [19] | The Parameterized Complexity of Clustering Incomplete Data 2021, Technical report AC-TR-21-007, Algorithms and Complexity Group, TU Wien. |
| [1] | On Existential MSO and Its Relation to ETH ACM Trans. Comput. Theory, volume 12, number 4, pages 22:1–22:32, 2020. |
| [2] | 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, Martina Seidl, eds.), volume 12178 of Lecture Notes in Computer Science, pages 267–276, 2020, Springer Verlag. |
| [3] | A Time Leap Challenge for SAT-Solving Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming (Helmut Simonis, ed.), volume 12333 of Lecture Notes in Computer Science, pages 267–285, 2020, Springer Verlag. |
| [4] | Breaking Symmetries with RootClique and LexTopsort Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming (Helmut Simonis, ed.), volume 12333 of Lecture Notes in Computer Science, pages 286–303, 2020, Springer Verlag. |
| [5] | Computing Optimal Hypertree Decompositions Proceedings of ALENEX 2020, the 22nd SIAM Symposium on Algorithm Engineering and Experiments (Guy Blelloch, Irene Finocchi, eds.), pages 1–11, 2020, SIAM. |
| [6] | Finding the Hardest Formulas for Resolution Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming (Helmut Simonis, ed.), volume 12333 of Lecture Notes in Computer Science, pages 514–530, 2020, Springer Verlag. Note: Best Paper Award |
| [7] | Fixed-Parameter Tractability of Dependency QBF with Structural Parameters Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, KR 2020 (Diego Calvanese, Esra Erdem, Michael Thielscher, eds.), pages 392–402, 2020. |
| [8] | Formalizing Graph Trail Properties in Isabelle/HOL Intelligent Computer Mathematics - 13th International Conference, CICM 2020, Bertinoro, Italy, July 26-31, 2020, Proceedings (Christoph Benzmüller, Bruce R. Miller, eds.), volume 12236 of Lecture Notes in Computer Science, pages 190–205, 2020, Springer Verlag. |
| [9] | MaxSAT-Based Postprocessing for Treedepth Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming (Helmut Simonis, ed.), volume 12333 of Lecture Notes in Computer Science, pages 478–495, 2020, Springer Verlag. |
| [10] | On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank Proceeding of AAAI-20, the Thirty-Fourth AAAI Conference on Artificial Intelligence, February 7–12, 2020, New York, pages 3906–3913, 2020, AAAI Press. |
| [11] | Short Q-Resolution Proofs with Homomorphisms Proceedings of SAT 2020, The 23rd International Conference on Theory and Applications of Satisfiability Testing (Luca Pulina, Martina Seidl, eds.), volume 12178 of Lecture Notes in Computer Science, pages 412–428, 2020, Springer Verlag. |
| [12] | Threshold Treewidth and Hypertree Width Proceeding of IJCAI-PRICAI2020, the 29th International Joint Conference on Artificial Intelligence and the 17th Pacific Rim International Conference on Artificial Intelligence, pages 1898–1904, 2020. |
| [13] | A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth 2020, Technical report AC-TR-20-006, Algorithms and Complexity Group, TU Wien. |
| [14] | Breaking Symmetries with RootClique and LexTopsort 2020, Technical report AC-TR-20-010, Algorithms and Complexity Group, TU Wien. |
| [15] | Computing Optimal Hypertree Decompositions 2020, Technical report AC-TR-20-001, Algorithms and Complexity Group, TU Wien. |
| [16] | Finding the Hardest Formulas for Resolution 2020, Technical report AC-TR-20-008, Algorithms and Complexity Group, TU Wien. |
| [17] | Fixed-Parameter Tractability of Dependency QBF with Structural Parameters 2020, Technical report AC-TR-20-011, Algorithms and Complexity Group, TU Wien. |
| [18] | Formalizing Graph Trail Properties in Isabelle/HOL 2020, Technical report AC-TR-20-012, Algorithms and Complexity Group, TU Wien. |
| [19] | MaxSAT-Based Postprocessing for Treedepth 2020, Technical report AC-TR-20-009, Algorithms and Complexity Group, TU Wien. |
| [20] | On the Parameterized Complexity of Clustering 2020, Technical report AC-TR-20-002, Algorithms and Complexity Group, TU Wien. |
| [21] | Short Q-Resolution Proofs with Homomorphisms 2020, Technical report AC-TR-20-007, Algorithms and Complexity Group, TU Wien. |
| [22] | Threshold Treewidth and Hypertree Width 2020, Technical report AC-TR-20-005, Algorithms and Complexity Group, TU Wien. |
| [1] | A SAT Approach to Branchwidth ACM Transactions on Computational Logic, volume 20, number 3, pages 15:1–15:24, 2019. |
| [2] | Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy MDPI Algorithms, volume 12, number 9, pages 1–28, 2019. |
| [3] | Dependency Learning for QBF Journal of Artificial Intelligence Research, volume 65, pages 180–208, 2019. |
| [4] | Long-Distance Q-Resolution with Dependency Schemes Journal of Automated Reasoning, volume 63, number 1, pages 127–155, 2019. |
| [5] | On the Parameterized Complexity of (k,s)-SAT Information Processing Letters, volume 143, pages 34–36, 2019. |
| [6] | A Join-Based Hybrid Parameter for Constraint Satisfaction Proceedings of CP 2019, the 25th International Conference on Principles and Practice of Constraint Programming (Thomas Schiex, Simon de Givry, eds.), volume 11802 of Lecture Notes in Computer Science, pages 195–212, 2019, Springer Verlag. |
| [7] | Combining Resolution-Path Dependencies with Dependency Learning Proceedings of SAT 2019, the 22nd International Conference on Theory and Applications of Satisfiability Testing, July 7–12, 2019, Lisbon, Portugal (Mikoláš Janota, Inês Lynce, eds.), volume 11628 of Lecture Notes in Computer Science, pages 306–318, 2019, Springer Verlag. |
| [8] | 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áš Janota, Inês Lynce, eds.), volume 11628 of Lecture Notes in Computer Science, pages 319–335, 2019, Springer Verlag. |
| [9] | SAT-Encodings for Treecut Width and Treedepth Proceedings of ALENEX 2019, the 21st Workshop on Algorithm Engineering and Experiments (Stephen G. Kobourov, Henning Meyerhenke, eds.), pages 117–129, 2019, SIAM. |
| [10] | 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. |
| [11] | A Join-Based Hybrid Parameter for Constraint Satisfaction 2019, Technical report AC-TR-19-006, Algorithms and Complexity Group, TU Wien. |
| [12] | A SAT Approach to Branchwidth 2019, Technical report AC-TR-19-010, Algorithms and Complexity Group, TU Wien. |
| [13] | Combining Resolution-Path Dependencies with Dependency Learning 2019, Technical report AC-TR-19-005, Algorithms and Complexity Group, TU Wien. |
| [14] | Proof Complexity of Fragments of Long-Distance Q-resolution 2019, Technical report AC-TR-19-004, Algorithms and Complexity Group, TU Wien. |
| [15] | SAT-Encodings for Treecut Width and Treedepth 2019, Technical report AC-TR-19-001, Algorithms and Complexity Group, TU Wien. |
| [16] | The Parameterized Complexity of Cascading Portfolio Scheduling 2019, Technical report AC-TR-19-009, Algorithms and Complexity Group, TU Wien. |
| [1] | Meta-kernelization using well-structured modulators Discr. Appl. Math., volume 248, pages 153–167, 2018. |
| [2] | Solving Problems on Graphs of High Rank-Width Algorithmica, volume 80, number 2, pages 742–771, 2018. |
| [3] | 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. |
| [4] | Parameterized Algorithms for the Matrix Completion Problem Proceeding of ICML, the Thirty-fifth International Conference on Machine Learning, Stockholm, July 10–15, 2018, pages 1642–1651, 2018, JMLR.org. Note: ISSN: 1938-7228 |
| [5] | Polynomial-Time Validation of QCDCL Certificates Proceedings of SAT 2018, the 21st International Conference on Theory and Applications of Satisfiability Testing, Part of FLoC 2018, July 9–12, 2018, Oxford, UK (Olaf Beyersdorff, Christoph M. Wintersteiger, eds.), volume 10929 of Lecture Notes in Computer Science, pages 253–269, 2018, Springer Verlag. |
| [6] | Portfolio-Based Algorithm Selection for Circuit QBFs 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 195–209, 2018, Springer Verlag. |
| [7] | Portfolio-Based Algorithm Selection for Circuit QBFs QBF Workshop, 2018. |
| [8] | Sum-of-Products with Default Values: Algorithms and Complexity Results Proceedings of ICTAI 2018, the 30th IEEE International Conference on Tools with Artificial Intelligence (Lefteri H. Tsoukalas, Éric Grégoire, Miltiadis Alamaniotis, eds.), pages 733–737, 2018, IEEE. |
| [9] | An SMT Approach to Fractional Hypertree Width 2018, Technical report AC-TR-18-006, Algorithms and Complexity Group, TU Wien. |
| [10] | On the Parameterized Complexity of (k,s)-SAT 2018, Technical report AC-TR-18-008, Algorithms and Complexity Group, TU Wien. |
| [11] | Polynomial-Time Validation of QCDCL Certificates 2018, Technical report AC-TR-18-003, Algorithms and Complexity Group, TU Wien. |
| [12] | Portfolio Solvers for QDIMACS and QCIR 2018. Note: QBF Evaluation at SAT |
| [13] | Portfolio-Based Algorithm Selection for Circuit QBFs 2018, Technical report AC-TR-18-004, Algorithms and Complexity Group, TU Wien. |
| [14] | Sum-of-Products with Default Values: Algorithms and Complexity Results 2018, Technical report AC-TR-18-007, Algorithms and Complexity Group, TU Wien. |
| [1] | Backdoors into heterogeneous classes of SAT and CSP Journal of Computer and System Sciences, volume 85, pages 38–56, 2017. |
| [2] | Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting ACM Transactions on Algorithms, volume 13, number AC-TR-17-016, pages 29:1–29:32, 2017. |
| [3] | On the parameterized complexity of finding small unsatisfiable subsets of CNF formulas and CSP instances ACM Transactions on Computational Logic, volume 18, number 3, pages Art. 21, 46, 2017. |
| [4] | Parameterized Complexity Classes Beyond Para-NP Journal of Computer and System Sciences, volume 87, number AC-TR-17-004, pages 16–57, 2017. |
| [5] | The Treewidth of Proofs Information and Computation, volume 255, pages 147–164, 2017. |
| [6] | A SAT Approach to Branchwidth Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017 (Carles Sierra, ed.), pages 4894–4898, 2017, ijcai.org. Note: Sister Conference Best Paper Track |
| [7] | Backdoor Trees for Answer Set Programming Proceedings of the 10th Workshop on Answer Set Programming and Other Computing Paradigms co-located with the 14th International Conference on Logic Programming and Nonmonotonic Reasoning, ASPOCP@LPNMR 2017, Espoo, Finland, July 3, 2017. (Bart Bogaerts, Amelia Harrison, eds.), volume 1868 of CEUR Workshop Proceedings, 2017, CEUR-WS.org. |
| [8] | Backdoor Treewidth for SAT Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 20–37, 2017, Springer Verlag. |
| [9] | Circuit Treewidth, Sentential Decision, and Query Compilation Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017, Chicago, IL, USA, May 14-19, 2017 (Emanuel Sallinger, Jan Van den Bussche, Floris Geerts, eds.), pages 233–246, 2017, ACM. |
| [10] | Combining Treewidth and Backdoors for CSP 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017) (Heribert Vollmer, Vallée, eds.), volume 66 of Leibniz International Proceedings in Informatics (LIPIcs), pages 36:1–36:17, 2017, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. |
| [11] | Long-Distance Q-Resolution with Dependency Schemes Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 298–313, 2017, Springer Verlag. |
| [12] | New Width Parameters for Model Counting Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 38–52, 2017, Springer Verlag. |
| [13] | Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA, pages 3929–3935, 2017. |
| [14] | SAT-Based Local Improvement for Finding Tree Decompositions of Small Width Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 401–411, 2017, Springer Verlag. |
| [15] | SAT-Encodings for Special Treewidth and Pathwidth Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 429–445, 2017, Springer Verlag. |
| [16] | Backdoor Sets for CSP Chapter in The Constraint Satisfaction Problem: Complexity and Approximability (Andrei A. Krokhin, Stanislav Zivny, eds.), volume 7 of Dagstuhl Follow-Ups, pages 137–157, 2017, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. |
| [17] | Backdoor Treewidth for SAT 2017, Technical report AC-TR-17-014, Algorithms and Complexity Group, TU Wien. |
| [18] | Dependency Learning for QBF 2017, Technical report AC-TR-17-011, Algorithms and Complexity Group, TU Wien. |
| [19] | New Width Parameters for Model Counting 2017, Technical report AC-TR-17-013, Algorithms and Complexity Group, TU Wien. |
| [20] | On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances 2017, Technical report AC-TR-17-009, Algorithms and Complexity Group, TU Wien. |
| [21] | SAT-Based Local Improvement for Finding Tree Decompositions of Small Width 2017, Technical report AC-TR-17-015, Algorithms and Complexity Group, TU Wien. |
| [22] | SAT-Encodings for Special Treewidth and Pathwidth 2017, Technical report AC-TR-17-012, Algorithms and Complexity Group, TU Wien. |
| [23] | The Treewidth of Proofs 2017, Technical report AC-TR-17-010, Algorithms and Complexity Group, TU Wien. |
| [1] | Backdoors to q-Horn Algorithmica, volume 74, number 1, pages 540–557, 2016. |
| [2] | Meta-Kernelization with Structural Parameters Journal of Computer and System Sciences, volume 82, number 2, pages 333–346, 2016. |
| [3] | Model Checking Existential Logic on Partially Ordered Sets ACM Transactions on Computational Logic, volume 17, number 2, 2016. |
| [4] | Model Counting for CNF Formulas of Bounded Modular Treewidth Algorithmica, volume 76, number 1, pages 168–194, 2016. |
| [5] | Quantified Conjunctive Queries on Partially Ordered Sets Theoretical Computer Science, volume 618, pages 72–84, 2016. |
| [6] | Quantifier reordering for QBF Journal of Automated Reasoning, volume 56, number 4, pages 459–477, 2016. |
| [7] | Soundness of Q-resolution with dependency schemes Theoretical Computer Science, volume 612, pages 83–101, 2016. |
| [8] | A SAT Approach to Branchwidth Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings (Nadia Creignou, Daniel Le Berre, eds.), volume 9710 of Lecture Notes in Computer Science, pages 179–195, 2016, Springer Verlag. |
| [9] | Backdoors to Tractable Valued CSP Principles and Practice of Constraint Programming - 22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings (Michel Rueher, ed.), volume 9892 of Lecture Notes in Computer Science, pages 233–250, 2016, Springer Verlag. |
| [10] | Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, pages 1670–1681, 2016. |
| [11] | Long Distance Q-Resolution with Dependency Schemes Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings (Nadia Creignou, Daniel Le Berre, eds.), volume 9710 of Lecture Notes in Computer Science, pages 500–518, 2016, Springer Verlag. |
| [12] | On Existential MSO and its Relation to ETH 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) (Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier, eds.), volume 58 of Leibniz International Proceedings in Informatics (LIPIcs), pages 42:1–42:14, 2016, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. |
| [13] | Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics Proceedings of KR 2016, the Fifteenth International Conference on Principles of Knowledge Representation and Reasoning, Cape Town, South Africa, April 25-29, 2016 (Chitta Baral, James P. Delgrande, Frank Wolter, eds.), pages 453–462, 2016, AAAI Press. |
| [14] | Polynomial-Time Construction of Optimal MPI Derived Datatype Trees 2016 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2016, Chicago, IL, USA, May 23-27, 2016, pages 638–647, 2016, IEEE Computer Society. |
| [15] | Parameterized Complexity Results for Agenda Safety in Judgment Aggregation 2016, Technical report AC-TR-16-005, Algorithms and Complexity Group, TU Wien. |
| [16] | Positive and Negative Results for Parameterized Compilability 2016, Technical report AC-TR-16-003, Algorithms and Complexity Group, TU Wien. |
| [1] | A complete parameterized complexity analysis of bounded planning Journal of Computer and System Sciences, volume 81, number 7, pages 1311–1332, 2015. |
| [2] | A SAT Approach to Clique-Width ACM Transactions on Computational Logic, volume 16, number 3, pages 24, 2015. |
| [3] | Backdoors to Normality for Disjunctive Logic Programs ACM Transactions on Computational Logic, volume 17, number 1, 2015. |
| [4] | Backdoors to Tractable Answer Set Programming Artificial Intelligence, volume 220, pages 64–103, 3 2015. |
| [5] | On finding optimal polytrees Theoretical Computer Science, volume 592, pages 49–58, 2015. |
| [6] | On the Subexponential-Time Complexity of CSP Journal of Artificial Intelligence Research, volume 52, pages 203–234, 2015. |
| [7] | Parameterized and subexponential-time complexity of satisfiability problems and applications Theoretical Computer Science, volume 607, pages 282–295, 2015. |
| [8] | Algorithmic Applications of Tree-Cut Width Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II, volume 9235 of Lecture Notes in Computer Science, pages 348–360, 2015, Springer Verlag. |
| [9] | Community Structure Inspired Algorithms for SAT and \#SAT 18th International Conference on Theory and Applications of Satisfiability Testing (SAT 2015), September 24-27, 2015, Austin, Texas (Marijn Heule, Sean Weaver, eds.), pages 223-237, 2015, Springer Verlag. |
| [10] | Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP SOFSEM 2015: Theory and Practice of Computer Science - 41st International Conference on Current Trends in Theory and Practice of Computer Science, Pec pod Sněžkou, Czech Republic, January 24-29, 2015. Proceedings, volume 8939 of Lecture Notes in Computer Science, pages 217–229, 1 2015, Springer Verlag. |
| [11] | Meta-Kernelization using Well-Structured Modulators Parameterized and Exact Computation - 10th International Symposium, IPEC 2014, Patras, Greece, September 16-18, 2015. Revised Selected Papers (Thore Husfeldt, Iyad A. Kanj, eds.), volume 43 of LIPIcs, pages 114–126, 2015. |
| [12] | Parameterized Complexity Results for Agenda Safety in Judgment Aggregation Proceedings of AAMAS 2015, the 14th International Conference on Autonomous Agents and Multiagent Systems (Gerhard Weiss, Pinar Yolum, Rafael H. Bordini, Edith Elkind, eds.), pages 127–136, 2015, IFAAMAS/ACM. |
| [13] | Solving Problems on Graphs of High Rank-Width Algorithms and Data Structures Symposium (WADS 2015), August 5-7, 2015, University of Victoria, BC, Canada, pages 314–326, 2015, Springer Verlag. |
| [14] | Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP 2015, Technical report AC-TR-15-009, Algorithms and Complexity Group, TU Wien. |
| [15] | Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics 2015, Technical report AC-TR-15-002, Algorithms and Complexity Group, TU Wien. |
| [1] | Guarantees and limits of preprocessing in constraint satisfaction and reasoning Artificial Intelligence, volume 216, pages 1-19, 2014. |
| [2] | Tractable answer-set programming with weight constraints: bounded treewidth is not enough Theory Pract. Log. Program., volume 14, number 2, pages 141-164, 2014. |
| [3] | Backdoors into Heterogeneous Classes of SAT and CSP Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, July 27-31, 2014, Québec City, Québec, Canada. (Carla E. Brodley, Peter Stone, eds.), pages 2652-2658, 2014, AAAI Press. |
| [4] | Fixed-Parameter Tractable Reductions to SAT Theory and Applications of Satisfiability Testing - SAT 2014 - 17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings (Uwe Egly, Carsten Sinz, eds.), volume 8561 of Lecture Notes in Computer Science, pages 85-102, 2014, Springer Verlag. |
| [5] | Model checking existential logic on partially ordered sets Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, Vienna, Austria, July 14 - 18, 2014 (Thomas A. Henzinger, Dale Miller, eds.), pages 21:1–21:10, 2014, ACM. |
| [6] | Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications Combinatorial Optimization and Applications - 8th International Conference, COCOA 2014, Wailea, Maui, HI, USA, December 19-21, 2014, Proceedings (Zhao Zhang, Lidong Wu, Wen Xu, Ding-Zhu Du, eds.), volume 8881 of Lecture Notes in Computer Science, pages 637–651, 2014, Springer Verlag. |
| [7] | Parameterized Complexity Results for Agenda Safety in Judgment Aggregation Proceedings of ComSoc'14, Fifth International Workshop on Computational Social Choice Pittsburgh, Pennsylvania, June 23-25, 2014, pages 127–136, 2014. |
| [8] | Quantified Conjunctive Queries on Partially Ordered Sets Parameterized and Exact Computation - 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers (Marek Cygan, Pinar Heggernes, eds.), volume 8894 of Lecture Notes in Computer Science, pages 122–134, 2014, Springer Verlag. |
| [9] | Small Unsatisfiable Subsets in Constraint Satisfaction 26th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2014, Limassol, Cyprus, November 10-12, 2014, pages 429–436, 2014, IEEE. |
| [10] | Subexponential Time Complexity of CSP with Global Constraints Principles and Practice of Constraint Programming - 20th International Conference, CP 2014, Lyon, France, September 8-12, 2014. Proceedings (Barry O'Sullivan, ed.), volume 8656 of Lecture Notes in Computer Science, pages 272-288, 2014, Springer Verlag. |
| [11] | The Parameterized Complexity of Reasoning Problems Beyond NP Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, KR 2014, Vienna, Austria, July 20-24, 2014 (Chitta Baral, Giuseppe De Giacomo, Thomas Eiter, eds.), pages 82–91, 2014, AAAI Press. |
| [12] | Variable Dependencies and Q-Resolution Theory and Applications of Satisfiability Testing - SAT 2014 - 17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings (Carsten Sinz, Uwe Egly, eds.), volume 8561 of Lecture Notes in Computer Science, pages 269–284, 2014, Springer Verlag. |
| [13] | Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy 2014, Technical report TR14-143, Electronic Colloquium on Computational Complexity (ECCC). |
| [1] | Parameterized Complexity Results for Exact Bayesian Network Structure Learning Journal of Artificial Intelligence Research, volume 46, pages 263-302, 2013. |
| [2] | Satisfiability of acyclic and almost acyclic CNF formulas Theoretical Computer Science, volume 481, pages 85-99, 2013. |
| [3] | A SAT Approach to Clique-Width Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings (Matti Järvisalo, Allen Van Gelder, eds.), volume 7962 of Lecture Notes in Computer Science, pages 318-334, 2013, Springer Verlag. |
| [4] | Backdoors to Abduction Proceedings of IJCAI 2013, the 23th International Joint Conference on Artificial Intelligence, August 3-9, 2013, Beijing, China, 2013. |
| [5] | Backdoors to Normality for Disjunctive Logic Programs Proceedings of AAAI 2013, the 27th AAAI Conference on Artificial Intelligence, July 14-18, 2013, Bellevue, Washington, USA (Marie des Jardins, Michael L. Littman, eds.), pages 320-337, 2013, The AAAI Press. |
| [6] | Backdoors to q-Horn 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany (Natacha Portier, Thomas Wilke, eds.), volume 20 of LIPIcs, pages 67-79, 2013, Leibniz-Zentrum fuer Informatik. |
| [7] | Capturing Structure in Hard Combinatorial Problems 2013 IEEE 25th International Conference on Tools with Artificial Intelligence, Herndon, VA, USA, November 4-6, 2013, pages 897-898, 2013. Note: invited keynote talk |
| [8] | Local Backbones Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings (Matti Järvisalo, Allen Van Gelder, eds.), volume 7962 of Lecture Notes in Computer Science, pages 377-393, 2013, Springer Verlag. |
| [9] | Meta-kernelization with Structural Parameters Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings (Krishnendu Chatterjee, Jiri Sgall, eds.), volume 8087 of Lecture Notes in Computer Science, pages 457-468, 2013, Springer Verlag. |
| [10] | Model Counting for CNF Formulas of Bounded Modular Treewidth 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany (Natacha Portier, Thomas Wilke, eds.), volume 20 of LIPIcs, pages 55-66, 2013, Leibniz-Zentrum fuer Informatik. |
| [11] | Model Counting for Formulas of Bounded Clique-Width Algorithms and Computation - 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings (Leizhen Cai, Siu-Wing Cheng, Tak Wah Lam, eds.), volume 8283 of Lecture Notes in Computer Science, pages 677-687, 2013, Springer Verlag. |
| [12] | On the Subexponential Time Complexity of CSP Proceedings of AAAI 2013, the 27th AAAI Conference on Artificial Intelligence, July 14-18, 2013, Bellevue, Washington, USA (Marie des Jardins, Michael L. Littman, eds.), pages 459-465, 2013, The AAAI Press. |
| [13] | Parameterized Complexity and Kernel Bounds for Hard Planning Problems Algorithms and Complexity, 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings (Paul G. Spirakis, Maria J. Serna, eds.), volume 7878 of Lecture Notes in Computer Science, pages 13-24, 2013, Springer Verlag. |
| [14] | Parameterized Complexity Results for Plan Reuse Proceedings of AAAI 2013, the 27th AAAI Conference on Artificial Intelligence, July 14-18, 2013, Bellevue, Washington, USA (Marie des Jardins, Michael L. Littman, eds.), pages 224-231, 2013, The AAAI Press. |
| [15] | Revisiting Space in Proof Complexity: Treewidth and Pathwidth Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings (Krishnendu Chatterjee, Jiri Sgall, eds.), volume 8087 of Lecture Notes in Computer Science, pages 704-716, 2013, Springer Verlag. |
| [16] | Strong Backdoors to Bounded Treewidth SAT 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA, pages 489-498, 2013, IEEE Computer Society. |
| [17] | The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation Theory and Applications of Formal Argumentation - Second International Workshop, TAFA 2013, Beijing, China, August 3-5, 2013, Revised Selected papers (Elizabeth Black, Sanjay Modgil, Nir Oren, eds.), volume 8306 of Lecture Notes in Computer Science, pages 158-175, 2013, Springer Verlag. |
| [18] | The Parameterized Complexity of Constraint Satisfaction and Reasoning Applications of Declarative Programming and Knowledge Management - 19th International Conference, INAP 2011, and 25th Workshop on Logic Programming, WLP 2011, Vienna, Austria, September 28-30, 2011, Revised Selected Papers (Hans Tompits, Salvador Abreu, Johannes Oetsch, Jörg Pührer, Dietmar Seipel, Masanobu Umeda, Armin Wolf, eds.), volume 7773 of Lecture Notes in Computer Science, pages 27-37, 2013, Springer Verlag. |
| [19] | Upper and Lower Bounds for Weak Backdoor Set Detection Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings (Matti Järvisalo, Allen Van Gelder, eds.), volume 7962 of Lecture Notes in Computer Science, pages 394-402, 2013, Springer Verlag. |
| [1] | Augmenting tractable fragments of abstract argumentation Artificial Intelligence, volume 186, pages 157-173, 2012. |
| [2] | Editing graphs to satisfy degree constraints: a parameterized approach Journal of Computer and System Sciences, volume 78, number 1, pages 179-191, 2012. |
| [3] | On graph contractions and induced minors Discr. Appl. Math., volume 160, number 6, pages 799-809, 2012. |
| [4] | Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming Algorithmica, volume 64, number 1, pages 112-125, 2012. |
| [5] | Abstract Argumentation via Monadic Second Order Logic Scalable Uncertainty Management - 6th International Conference, SUM 2012, Marburg, Germany, September 17-19, 2012. Proceedings (Eyke Hüllermeier, Sebastian Link, Thomas Fober, Bernhard Seeger, eds.), volume 7520 of Lecture Notes in Computer Science, pages 85-98, 2012, Springer Verlag. |
| [6] | Backdoors to Acyclic SAT Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I (Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts, Roger Wattenhofer, eds.), volume 7391 of Lecture Notes in Computer Science, pages 363-374, 2012, Springer Verlag. |
| [7] | Backdoors to Satisfaction The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday (Hans L. Bodlaender, Rod Downey, Fedor V. Fomin, Dániel Marx, eds.), volume 7370 of Lecture Notes in Computer Science, pages 287-317, 2012, Springer Verlag. |
| [8] | Computing Resolution-Path Dependencies in Linear Time Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings (Alessandro Cimatti, Roberto Sebastiani, eds.), volume 7317 of Lecture Notes in Computer Science, pages 58-71, 2012, Springer Verlag. |
| [9] | Don't Be Strict in Local Search! Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada (Jörg Hoffmann, Bart Selman, eds.), 2012, AAAI Press. |
| [10] | k-Gap Interval Graphs LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings (David Fernández-Baca, ed.), volume 7256 of Lecture Notes in Computer Science, pages 350-361, 2012, Springer Verlag. |
| [11] | On Finding Optimal Polytrees Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada (Jörg Hoffmann, Bart Selman, eds.), 2012, AAAI Press. |
| [12] | Strong Backdoors to Nested Satisfiability Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings (Alessandro Cimatti, Roberto Sebastiani, eds.), volume 7317 of Lecture Notes in Computer Science, pages 72-85, 2012, Springer Verlag. |
| [13] | The Complexity of Planning Revisited - A Parameterized Analysis Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada (Jörg Hoffmann, Bart Selman, eds.), 2012, AAAI Press. |
| [14] | Backdoors to Tractable Answer-Set Programming 2012, Technical report 1104.2788, Arxiv.org. Note: Extended and updated version of a paper that appeared in the proceedings of IJCAI 2011, the 22nd International Joint Conference on Artificial Intelligence |
| [1] | A probabilistic approach to problems parameterized above or below tight bounds Journal of Computer and System Sciences, volume 77, number 2, pages 422-429, 2011. |
| [2] | Algorithms and Complexity Results for Persuasive Argumentation Artificial Intelligence, volume 175, pages 1722-1736, 2011. |
| [3] | Monadic Second Order Logic on Graphs with Local Cardinality Constraints ACM Transactions on Computational Logic, volume 12, number 2, pages article 12, 2011. |
| [4] | On the complexity of some colorful problems parameterized by treewidth Information and Computation, volume 209, number 2, pages 143-153, 2011. |
| [5] | Parameterized Proof Complexity Computational Complexity, volume 20, number 1, pages 51-85, 2011. |
| [6] | Solving MAX-r-SAT above a tight lower bound Algorithmica, volume 61, number 3, pages 638-655, 2011. |
| [7] | The parameterized complexity of k-flip local search for SAT and MAX SAT Discrete Optim., volume 8, number 1, pages 139-145, 2011. |
| [8] | Tractable cases of the extended global cardinality constraint Constraints, volume 16, number 1, pages 1-24, 2011. |
| [9] | Augmenting Tractable Fragments of Abstract Argumentation Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011 (Toby Walsh, ed.), pages 1033-1038, 2011, AAAI Press/IJCAI. |
| [10] | Backdoors to Tractable Answer-Set Programming Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011 (Toby Walsh, ed.), pages 863-868, 2011, AAAI Press/IJCAI. |
| [11] | Kernels for Global Constraints IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011 (Toby Walsh, ed.), pages 540-545, 2011, IJCAI/AAAI. |
| [12] | Limits of Preprocessing Proceedings of the Twenty-Fifth Conference on Artificial Intelligence, AAAI 2011, pages 93-98, 2011, AAAI Press, Menlo Park, California. |
| [13] | Satisfiability of Acyclic and almost Acyclic CNF Formulas (II) Theory and Applications of Satisfiability Testing - SAT 2011 - 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings (Karem A. Sakallah, Laurent Simon, eds.), volume 6695 of Lecture Notes in Computer Science, pages 47-60, 2011, Springer Verlag. |
| [14] | The Parameterized Complexity of Local Consistency Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming (CP 2011) (Jimmy Ho-Man Lee, ed.), volume 6876 of Lecture Notes in Computer Science, pages 302-316, 2011, Springer Verlag. |
| [15] | Backdoors to Acyclic SAT 10 2011, Technical report 1110.6384, Arxiv.org. |
| [16] | Backdoors to Satisfaction 10 2011, Technical report 1110.6387, Arxiv.org. |
| [1] | Algorithms for propositional model counting J. Discrete Algorithms, volume 8, number 1, pages 50-64, 2010. |
| [2] | Constraint satisfaction with bounded treewidth revisited Journal of Computer and System Sciences, volume 76, number 2, pages 103-114, 2010. |
| [3] | Algorithms and Complexity Results for Exact Bayesian Structure Learning Proceedings of UAI 2010, The 26th Conference on Uncertainty in Artificial Intelligence, Catalina Island, California, USA, July 8-11, 2010 (Peter Grünwald, Peter Spirtes, eds.), 2010, AUAI Press, Corvallis, Oregon. |
| [4] | Algorithms and Complexity Results for Persuasive Argumentation Computational Models of Argumentation, Proceedings of COMMA 2010 (Pietro Baroni, Federico Cerutti, Massimiliano Giacomin, Guillermo R. Simari, eds.), volume 216 of Frontiers in Artificial Intelligence and Applications, pages 311-322, 2010. |
| [5] | On Contracting Graphs to Fixed Pattern Graphs SOFSEM 2010: Theory and Practice of Computer Science, 36th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 23-29, 2010. Proceedings (Jan van Leeuwen, Anca Muscholl, David Peleg, Jaroslav Pokorný, Bernhard Rumpe, eds.), volume 5901 of Lecture Notes in Computer Science, pages 503-514, 2010, Springer Verlag. |
| [6] | Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings (Venkatesh Raman, Saket Saurabh, eds.), volume 6478 of Lecture Notes in Computer Science, pages 158-169, 2010, Springer Verlag. |
| [7] | Reasoning in Argumentation Frameworks of Bounded Clique-Width Computational Models of Argumentation, Proceedings of COMMA 2010 (Pietro Baroni, Federico Cerutti, Massimiliano Giacomin, Guillermo R. Simari, eds.), volume 216 of Frontiers in Artificial Intelligence and Applications, pages 219-230, 2010. |
| [8] | Satisfiability of Acyclic and Almost Acyclic CNF Formulas IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India (Kamal Lodaya, Meena Mahajan, eds.), volume 8 of LIPIcs, pages 84-95, 2010, Leibniz-Zentrum fuer Informatik. |
| [9] | Solving MAX-r-SAT Above a Tight Lower Bound Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010 (Moses Charikar, ed.), pages 511-517, 2010, SIAM. |
| [10] | Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, KR 2010, Toronto, Ontario, Canada, May 9-13, 2010 (Fangzhen Lin, Ulrike Sattler, Miroslaw Truszczynski, eds.), 2010, AAAI Press. |
| [1] | Backdoor sets of quantified Boolean formulas Journal of Automated Reasoning, volume 42, number 1, pages 77–97, 2009. |
| [2] | Clique-width is NP-complete SIAM J. Discrete Math., volume 23, number 2, pages 909-939, 2009. |
| [3] | Covering graphs with few complete bipartite subgraphs Theoretical Computer Science, volume 410, number 21-23, pages 2045-2053, 2009. |
| [4] | Matched Formulas and Backdoor Sets J on Satisfiability, Boolean Modeling and Computation, volume 6, pages 1-12, 2009. |
| [5] | A Probabilistic Approach to Problems Parameterized above or below Tight Bounds Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers (Jianer Chen, Fedor V. Fomin, eds.), volume 5917 of Lecture Notes in Computer Science, pages 234-245, 2009, Springer Verlag. |
| [6] | The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings (Oliver Kullmann, ed.), volume 5584 of Lecture Notes in Computer Science, pages 276-283, 2009, Springer Verlag. |
| [1] | Fixed-parameter algorithms for artificial intelligence, constraint satisfaction, and database problems The Computer Journal, volume 51, number 3, pages 303-325, 2008. Note: Survey paper |
| [2] | Fixed-parameter complexity of minimum profile problems Algorithmica, volume 52, number 2, pages 133-152, 2008. |
| [3] | Backdoor Trees AAAI 08, Twenty-Third Conference on Artificial Intelligence, Chicago, Illinois, July 13-17, 2008, pages 363-368, 2008, AAAI Press. |
| [4] | Monadic Second Order Logic on Graphs with Local Cardinality Constraints Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings, volume 5162 of Lecture Notes in Computer Science, pages 601-612, 2008, Springer Verlag. |
| [5] | Not So Easy Problems For Tree Decomposable Graphs (invited talk) ICDM 2008, International Conference on Discrete Mathematics, June 6-10, 2008, Mysore, India, Proceedings, pages 161-171, 2008. |
| [6] | Parameterized Graph Editing with Chosen Vertex Degrees Combinatorial Optimization and Applications, Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008. Proceedings (Boting Yang, Ding-Zhu Du, Cao An Wang, eds.), volume 5165 of Lecture Notes in Computer Science, pages 13-22, 2008, Springer Verlag. |
| [7] | The Parameterized Complexity of Regular Subgraph Problems and Generalizations Proceedings of CATS 2008, Computing: The Australasian Theory Symposium, University of Wollongong, New South Wales, Australia, January 22-25, 2008 (J. Harland, P. Manyem, eds.), volume 77 of Conferences in Research and Practice in Information Technology, pages 79-86, 2008, Australian Computer Society. |
| [8] | Tractable Cases of the Extended Global Cardinality Constraint Proceedings of CATS 2008, Computing: The Australasian Theory Symposium, University of Wollongong, New South Wales, Australia, January 22-25, 2008 (J. Harland, P. Manyem, eds.), volume 77 of Conferences in Research and Practice in Information Technology, pages 67-74, 2008, Australian Computer Society. |
| [9] | Parameterized SAT Chapter in Encyclopedia of Algorithms (Ming-Yang Kao, ed.), 2008, Springer Verlag. |
| [1] | Solving \#SAT using Vertex Covers Acta Informatica, volume 44, number 7-8, pages 509-523, 2007. |
| [2] | The Linear Arrangement Problem Parameterized Above Guaranteed Value Theory Comput. Syst., volume 41, pages 521-538, 2007. |
| [3] | Algorithms for Propositional Model Counting Proceedings of LPAR 2007, 14th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, October 15-19, 2007 Yerevan, Armenia, volume 4790 of Lecture Notes in Computer Science, pages 484-498, 2007, Springer Verlag. |
| [4] | Backdoor Sets of Quantified Boolean Formulas Proceedings of SAT 2007, Tenth International Conference on Theory and Applications of Satisfiability Testing, May 28-31, 2007, Lisbon, Portugal, (J. Marques-Silva, K. A. Sakallah, eds.), volume 4501 of Lecture Notes in Computer Science, pages 230–243, 2007. |
| [5] | Covering Graphs with Few Complete Bipartite Subgraphs FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings (Vikraman Arvind, Sanjiva Prasad, eds.), volume 4855 of Lecture Notes in Computer Science, pages 340-351, 2007, Springer Verlag. |
| [6] | Matched Formulas and Backdoor Sets Proceedings of SAT 2007, Tenth International Conference on Theory and Applications of Satisfiability Testing, May 28-31, 2007, Lisbon, Portugal, (J. Marques-Silva, K. A. Sakallah, eds.), volume 4501 of Lecture Notes in Computer Science, pages 94-99, 2007. |
| [7] | On the Complexity of Some Colorful Problems Parameterized by Treewidth Proceedings of COCOA 2007, Combinatorial Optimization and Applications, First International Conference, Xi'an, China, August 14-16, 2007, volume 4616 of Lecture Notes in Computer Science, pages 366-377, 2007, Springer Verlag. |
| [8] | Parameterized Proof Complexity Proceedings of the 48th Annual Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, pages 150-160, 2007, IEEE Press. |
| [9] | Without Loss of Generality - Symmetric Reasoning for Resolution Systems (Invited Talk) Proceedings of SymCon'07, Seventh International Workshop on Symmetry and Constraint Satisfaction Problems, satellite workshop of CP 2007, September 23, 2007, Providence, RI, USA (B. Benhamou, ed.), pages 5-8, 2007. |
| [1] | A note on unsatisfiable k-CNF formulas with few occurrences per variable SIAM J. Discrete Math., volume 20, number 2, pages 523-528, 2006. |
| [2] | On Finding Short Resolution Refutations and Small Unsatisfiable Subsets Theoretical Computer Science, volume 351, number 3, pages 351-359, 2006. |
| [3] | Clique-width Minimization is NP-hard Proceedings of STOC 2006; the 38th ACM Symposium on Theory of Computing, Seattle, Washington, USA, pages 354–362, 2006, ACM. |
| [4] | Constraint satisfaction with bounded treewidth revisited Proceedings of CP 2006 , Twelfth International Conference on Principles and Practice of Constraint Programming, September 24-29, 2006, Nantes, France, volume 4204 of Lecture Notes in Computer Science, pages 499-513, 2006. Note: Full version appeared in Constraints |
| [5] | Fixed-Parameter Complexity of Minimum Profile Problems Proceedings of IWPEC 2006, 2nd International Workshop on Parameterized and Exact Computation, volume 4169 of Lecture Notes in Computer Science, pages 60-71, 2006, Springer Verlag. |
| [6] | Solving \#SAT using Vertex Covers Proceedings of SAT 2006, Ninth International Conference on Theory and Applications of Satisfiability Testing, August 12-15, 2006, Seattle, Washington, USA, volume 4121 of Lecture Notes in Computer Science, pages 396-409, 2006. |
| [7] | The Linear Arrangement Problem Parameterized Above Guaranteed Value Algorithms and Complexity, 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings (Tiziana Calamoneri, Irene Finocchi, Giuseppe F. Italiano, eds.), volume 3998 of Lecture Notes in Computer Science, pages 356-367, 2006, Springer Verlag. |
| [1] | Backdoor Sets for DLL Subsolvers Journal of Automated Reasoning, volume 35, number 1-3, pages 73-88, 2005. Note: Reprinted as Chapter 4 of the book SAT 2005 - Satisfiability Research in the Year 2005, edited by E. Giunchiglia and T. Walsh, Springer Verlag, 2006 |
| [2] | Computing unsatisfiable k-SAT instances with few occurrences per variable Theoretical Computer Science, volume 337, number 1-3, pages 347-359, 2005. Note: Supplementary material is available at https://www.ac.tuwien.ac.at/files/pub/HoorySzeider05.tar.gz |
| [3] | Generalizations of matched CNF formulas Ann. Math. Artif. Intell., volume 43, number 1-4, pages 223-238, 2005. |
| [4] | On Edge-Colored Graphs Covered by Properly Colored Cycles Graphs and Combinatorics, volume 21, number 3, pages 301-206, 2005. |
| [5] | The Complexity of Resolution with Generalized Symmetry Rules Theory Comput. Syst., volume 38, number 2, pages 171-188, 2005. |
| [1] | Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable Journal of Computer and System Sciences, volume 69, number 4, pages 656-674, 2004. |
| [2] | On Theorems Equivalent with Kotzig's Result on Graphs with Unique 1-Factors Ars Combinatoria, volume 73, pages 53-64, 2004. |
| [3] | Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable SAT 2004 - The Seventh International Conference on Theory and Applications of Satisfiability Testing, 10-13 May 2004, Vancouver, BC, Canada, Online Proceedings, 2004. |
| [4] | Detecting Backdoor Sets with Respect to Horn and Binary Clauses Proceedings of SAT 2004 (Seventh International Conference on Theory and Applications of Satisfiability Testing, 10-13 May, 2004, Vancouver, BC, Canada), pages 96-103, 2004. |
| [5] | On Finding Short Resolution Refutations and Small Unsatisfiable Subsets 1st International Workshop on Parameterized and Exact Computation (IWPEC 2004) (Rod Downey, Michael Fellows, Frank Dehne, eds.), volume 3162 of Lecture Notes in Computer Science, pages 223-234, 2004, Springer. |
| [6] | On fixed-parameter tractable parameterizations of SAT Theory and Applications of Satisfiability, 6th International Conference, SAT 2003, Selected and Revised Papers (Enrico Giunchiglia, Armando Tacchella, eds.), volume 2919 of Lecture Notes in Computer Science, pages 188-202, 2004, Springer Verlag. |
| [7] | The Parameterized Complexity of SAT Backdoors Computing: The Australasian Theory Symposium (CATS 2004) (Mike Atkinson, ed.), pages 252-261, 2004. Note: Informal Proceedings |
| [1] | Finding paths in graphs avoiding forbidden transitions Discr. Appl. Math., volume 126, number 2-3, pages 239-251, 2003. |
| [2] | Homomorphisms of Conjunctive Normal Forms Discr. Appl. Math., volume 130, number 2, pages 351-365, 2003. |
| [3] | Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable Proceedings of the 9th International Computing and Combinatorics Conference (COCOON'03) (T. Warnow, B. Zhu, eds.), volume 2697 of Lecture Notes in Computer Science, pages 548-558, 2003, Springer Verlag. |
| [4] | The complexity of resolution with generalized symmetry rules Proceedings of the 20th International Symposium on Theoretical Aspects of Computer Science (STACS'03) (Helmut Alt, Michel Habib, eds.), volume 2607 of Lecture Notes in Computer Science, pages 475-486, 2003. |
| [5] | Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable 2003, Technical report TR03-002, Revision~1, Electronic Colloquium on Computational Complexity (ECCC). |
| [1] | Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference Theoretical Computer Science, volume 289, number 1, pages 503-516, 2002. |
| [2] | Generalizations of matched CNF formulas Proceedings of the Fifth International Symposium on the Theory and Applications of Satisfiability Testing (SAT 2002) Cincinnati, Ohio, USA, May 6-9, 2002 (John Franco, ed.), pages 292-307, 5 2002. |
| [1] | NP-Completeness of Refutability by Literal-Once Resolution IJCAR 2001, Proceedings of the International Joint Conference on Automated Reasoning (R. Goré, A. Leitsch, T. Nipkow, eds.), volume 2083 of Lecture Notes in Artificial Intelligence, pages 168-181, 2001, Springer Verlag. |
| [2] | Conjunctive Normal Forms with Bounded Deficiency 9 2001, PhD thesis, University of Vienna. |
| [1] | The Parameterized Complexity Of Extending Stack Layouts Journal of Graph Algorithms and Applications, volume 29, number 3, pages 39–78, 2026. |
| [2] | Visualizing Treewidth J. Graph Algorithms Appl., volume 30, number 2, pages 199–235, 2026. |
| [3] | On the Recognition of Outerplanar Graphs with Queue Number 1 Graph Drawing and Network Visualization (GD'26) (Maarten Löffler, Silvia Miksch, eds.), volume 396 of LIPIcs, 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. |
| [4] | Paged Geophylogenies: A Coloring Approach to External Labeling with Tree Constraints Graph Drawing and Network Visualization (GD'26) (Maarten Löffler, Silvia Miksch, eds.), volume 396 of LIPIcs, 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. |
| [5] | Point Set Embeddability with List Constraints Graph Drawing and Network Visualization (GD'26) (Maarten Löffler, Silvia Miksch, eds.), volume 396 of LIPIcs, 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. |
| [6] | Realizing Planar Linkages in Polygonal Domains International Workshop on Combinatorial Algorithms (IWOCA'26) (F. Foucaud, A. Parreau, eds.), volume 16587 of LNCS, pages 251–265, 2026, Springer. |
| [7] | Revisiting Graph Modification via Disk Scaling: From One Radius to Interval-Based Radii European Symposium on Algorithms (ESA'26) (Seth Pettie, Philip Bille, Sabine Storandt, eds.), volume 396 of LIPIcs, 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. |
| [8] | The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern Parameterized and Exact Computation (IPEC'26) (Tuukka Korhonen, Michael Lampis, eds.), 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. |
| [9] | The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern 21st International Symposium on Parameterized and Exact Computation, IPEC 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear |
| [10] | The Peculiarities of Extending Queue Layouts Graph-Theoretic Concepts in Computer Science (WG'25) (Henning Fernau, Philipp Kindermann, eds.), volume 16124 of LNCS, pages 177–191, 2026, Springer. |
| [1] | Constrained Boundary Labeling Comput. Geom. Theory Appl., volume 129, pages 102191, 2025. |
| [2] | Transitions in Dynamic Point Labeling Cartography and Geographic Information Science, pages 1–26, 2025. |
| [3] | Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms 33rd Annual European Symposium on Algorithms, ESA 2025, September 15-17, 2025, Warsaw, Poland (Anne Benoit, Haim Kaplan, Sebastian Wild, Grzegorz Herman, eds.), volume 351 of LIPIcs, pages 15:1–15:18, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear |
| [4] | On Planar Unit-Length Linear Linkages in Polygonal Domains European Workshop on Computational Geometry (EuroCG'25) (Jan Kratochvíl, Giuseppe Liotta, eds.), pages 55:1–55:9, 2025. |
| [5] | Partial Level Planarity Parameterized by the Size of the Missing Graph European Workshop on Computational Geometry (EuroCG'25) (Jan Kratochvíl, Giuseppe Liotta, eds.), pages 50:1–50:10, 2025. |
| [6] | Pathways to Tractability for Geometric Thickness Theory and Practice of Computer Science (SOFSEM'25) (Rastislav Královic, Vera Kurková, eds.), volume 15538 of LNCS, pages 209–224, 2025, Springer. |
| [7] | Pathways to Tractability for Geometric Thickness (Best Paper Award) SOFSEM 2025: Theory and Practice of Computer Science - 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20-23, 2025, Proceedings, Part I (Rastislav Královic, Vera Kurková, eds.), volume 15538 of Lecture Notes in Computer Science, pages 209–224, 2025, Springer. |
| [8] | Structural Parameterizations of Simultaneous Planarity 36th International Symposium on Algorithms and Computation, ISAAC 2025, Tainan, Taiwan, December 7-10, 2025 (Ho-Lin Chen, Wing-Kai Hon, Meng-Tsung Tsai, eds.), volume 359 of LIPIcs, pages 25:1–25:17, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [9] | The Peculiarities of Extending Queue Layouts Graph-Theoretic Concepts in Computer Science - 51st International Workshop, WG 2025, Otzenhausen, Germany, June 11-13, 2025, Revised Selected Papers (Henning Fernau, Philipp Kindermann, eds.), volume 16124 of Lecture Notes in Computer Science, pages 177–191, 2025, Springer. |
| [10] | Visualizing Treewidth Graph Drawing and Network Visualization (GD'25) (Vida Dujmović, Fabrizio Montecchiani, eds.), volume 357 of LIPIcs, pages 17:1–17:20, 2025, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [11] | Network Navigation with Online Delays is PSPACE-complete Chapter in Studierendenkonferenz Informatik (SKILL 2023), pages 195–206, 2025, Gesellschaft für Informatik e.V.. |
| [1] | Constrained Boundary Labeling Algorithms and Computation (ISAAC'24) (Julian Mestre, Anthony Wirth, eds.), volume 322 of LIPIcs, pages 26:1–26:16, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [2] | Minimizing Corners in Colored Rectilinear Grids Algorithms and Computation (WALCOM'24) (Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen, eds.), volume 14549 of LNCS, pages 134–148, 2024, Springer. |
| [3] | The Parameterized Complexity of Extending Stack Layouts Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 12:1–12:17, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [4] | The Parameterized Complexity Of Extending Stack Layouts 32nd International Symposium on Graph Drawing and Network Visualization, GD 2024, September 18-20, 2024, Vienna, Austria (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 12:1–12:17, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1] | Transitions in Dynamic Point Labeling Geographic Information Science (GIScience'23) (Roger Beecham, Jed A. Long, Dianna Smith, Qunshan Zhao, Sarah Wise, eds.), volume 277 of LIPIcs, pages 2:1–2:19, 2023, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [1] | Genetic Programming Hyper-Heuristic for the Dynamic Electric Dial-a-Ride Problem 2025 IEEE Congress on Evolutionary Computation (CEC), pages 1-8, 2025, IEEE. |
| [2] | The 3-Decomposition Conjecture: A SAT-Based Approach with Specialized Propagators 31st International Conference on Principles and Practice of Constraint Programming, CP 2025, August 10-15, 2025, Glasgow, Scotland (Maria Garcia de la Banda, ed.), volume 340 of LIPIcs, pages 39:1–39:19, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1] | Compilation and Fast Model Counting beyond CNF Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, IJCAI-24 (Kate Larson, ed.), pages 3315–3323, 8 2024, International Joint Conferences on Artificial Intelligence Organization. Note: Main Track |
| [2] | Small unsatisfiable k-CNFs with bounded literal occurrence 27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024) (Supratik Chakraborty, Jie-Hong Roland Jiang, eds.), volume 305 of Leibniz International Proceedings in Informatics (LIPIcs), pages 31:1–31:22, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [1] | Searching for smallest universal graphs and tournaments with SAT Proceedings of CP 2023, the 29th International Conference on Principles and Practice of Constraint Programming (Roland Yap, ed.), volume 280 of LIPIcs, pages 39:1–39:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1] | Graph Choosability via SAT: Beyond the Nullstellensatz Fortieth AAAI Conference on Artificial Intelligence, Thirty-Eighth Conference on Innovative Applications of Artificial Intelligence, Sixteenth Symposium on Educational Advances in Artificial Intelligence, AAAI 2026, Singapore, January 20-27, 2026 (Sven Koenig, Chad Jenkins, Matthew E. Taylor, eds.), pages 14269–14277, 2026, AAAI Press. |
| [2] | Smart Cubing for Graph Search: A Comparative Study 32nd International Conference on Principles and Practice of Constraint Programming, CP 2026, July 20–23, 2026, Lisbon, Portugal, volume 379 of LIPIcs, pages 33:1–33:19, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: Preprint: CoRR abs/2501.17201, https://arxiv.org/abs/2501.17201 |
| [3] | Strong (D)QBF Dependency Schemes via Pure Paths with Applications to Proof Checking 29th International Conference on Theory and Applications of Satisfiability Testing, SAT 2026, Lisbon, Portugal, July 20-23, 2026 (Alexey Ignatiev, Stefan Szeider, eds.), volume 377 of LIPIcs, pages 11:1–11:20, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1] | Better Extension Variables in DQBF via Independence 28th International Conference on Theory and Applications of Satisfiability Testing, SAT 2025, Glasgow, Scotland, August 12-15, 2025 (Jeremias Berg, Jakob Nordström, eds.), volume 341 of LIPIcs, pages 11:1–11:24, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [2] | Breaking Symmetries in Quantified Graph Search: A Comparative Study AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25 - March 4, 2025, Philadelphia, PA, USA (Toby Walsh, Julie Shah, Zico Kolter, eds.), pages 11246–11254, 2025, AAAI Press. |
| [1] | Hard QBFs for Merge Resolution ACM Trans. Comput. Theory, volume 16, number 2, pages 6:1–6:24, 2024. |
| [2] | QCDCL with cube learning or pure literal elimination - What is best? Artif. Intell., volume 336, pages 104194, 2024. |
| [3] | Should Decisions in QCDCL Follow Prefix Order? J. Autom. Reason., volume 68, number 1, pages 5, 2024. |
| [4] | Small unsatisfiable k-CNFs with bounded literal occurrence 27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024) (Supratik Chakraborty, Jie-Hong Roland Jiang, eds.), volume 305 of Leibniz International Proceedings in Informatics (LIPIcs), pages 31:1–31:22, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [1] | Are Hitting Formulas Hard for Resolution? Discr. Appl. Math., volume 337, pages 173–184, 2023. |
| [2] | A SAT Solver's Opinion on the Erdős-Faber-Lovász Conjecture 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy (Meena Mahajan, Friedrich Slivovsky, eds.), volume 271 of LIPIcs, pages 13:1–13:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [3] | Co-Certificate Learning with SAT Modulo Symmetries Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China, pages 1944–1953, 2023, ijcai.org. Note: Main Track |
| [1] | Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution ACM Transactions on Computational Logic, sep 2022, Association for Computing Machinery. |
| [2] | QCDCL with Cube Learning or Pure Literal Elimination - What is Best? Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23-29 July 2022 (Luc De Raedt, ed.), pages 1781–1787, 2022, ijcai.org. Note: Distinguished Paper Award |
| [3] | Should Decisions in QCDCL Follow Prefix Order? 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel (Kuldeep S. Meel, Ofer Strichman, eds.), volume 236 of LIPIcs, pages 11:1–11:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1] | Finding the Hardest Formulas for Resolution Journal of Artificial Intelligence Research, volume 72, pages 69–97, 2021. Note: Conference Award Track, best paper CP 2020 |
| [2] | Strong (D)QBF Dependency Schemes via Implication-free Resolution Paths Electron. Colloquium Comput. Complex., pages 135, 2021. |
| [3] | Davis and Putnam Meet Henkin: Solving DQBF with Resolution Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings (Chu-Min Li, Felip Manyà, eds.), volume 12831 of Lecture Notes in Computer Science, pages 30–46, 2021, Springer. |
| [4] | Finding the Hardest Formulas for Resolution (Extended Abstract) Proceeding of IJCAI-21, the 30th International Joint Conference on Artificial Intelligence (Zhi-Hua Zhou, ed.), pages 4814–4818, 2021. Note: Sister Conferences Best Papers |
| [5] | Davis and Putnam Meet Henkin: Solving DQBF with Resolution 2021, Technical report AC-TR-21-012, Algorithms and Complexity Group, TU Wien. |
| [1] | Finding the Hardest Formulas for Resolution Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming (Helmut Simonis, ed.), volume 12333 of Lecture Notes in Computer Science, pages 514–530, 2020, Springer Verlag. Note: Best Paper Award |
| [2] | Fixed-Parameter Tractability of Dependency QBF with Structural Parameters Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, KR 2020 (Diego Calvanese, Esra Erdem, Michael Thielscher, eds.), pages 392–402, 2020. |
| [3] | Hard QBFs for Merge Resolution 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2020, December 14-18, 2020, BITS Pilani, K K Birla Goa Campus, Goa, India (Virtual Conference) (Nitin Saxena, Sunil Simon, eds.), volume 182 of LIPIcs, pages 12:1–12:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [4] | Strong (D)QBF Dependency Schemes via Tautology-free Resolution Paths Proceedings of SAT 2020, The 23rd International Conference on Theory and Applications of Satisfiability Testing (Luca Pulina, Martina Seidl, eds.), volume 12178 of Lecture Notes in Computer Science, pages 394–411, 2020, Springer Verlag. |
| [5] | Finding the Hardest Formulas for Resolution 2020, Technical report AC-TR-20-008, Algorithms and Complexity Group, TU Wien. |
| [6] | Fixed-Parameter Tractability of Dependency QBF with Structural Parameters 2020, Technical report AC-TR-20-011, Algorithms and Complexity Group, TU Wien. |
| [1] | Dependency Learning for QBF Journal of Artificial Intelligence Research, volume 65, pages 180–208, 2019. |
| [2] | Long-Distance Q-Resolution with Dependency Schemes Journal of Automated Reasoning, volume 63, number 1, pages 127–155, 2019. |
| [3] | Combining Resolution-Path Dependencies with Dependency Learning Proceedings of SAT 2019, the 22nd International Conference on Theory and Applications of Satisfiability Testing, July 7–12, 2019, Lisbon, Portugal (Mikoláš Janota, Inês Lynce, eds.), volume 11628 of Lecture Notes in Computer Science, pages 306–318, 2019, Springer Verlag. |
| [4] | 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áš Janota, Inês Lynce, eds.), volume 11628 of Lecture Notes in Computer Science, pages 319–335, 2019, Springer Verlag. |
| [5] | Combining Resolution-Path Dependencies with Dependency Learning 2019, Technical report AC-TR-19-005, Algorithms and Complexity Group, TU Wien. |
| [6] | Proof Complexity of Fragments of Long-Distance Q-resolution 2019, Technical report AC-TR-19-004, Algorithms and Complexity Group, TU Wien. |
| [1] | Polynomial-Time Validation of QCDCL Certificates Proceedings of SAT 2018, the 21st International Conference on Theory and Applications of Satisfiability Testing, Part of FLoC 2018, July 9–12, 2018, Oxford, UK (Olaf Beyersdorff, Christoph M. Wintersteiger, eds.), volume 10929 of Lecture Notes in Computer Science, pages 253–269, 2018, Springer Verlag. |
| [2] | Portfolio-Based Algorithm Selection for Circuit QBFs 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 195–209, 2018, Springer Verlag. |
| [3] | Portfolio-Based Algorithm Selection for Circuit QBFs QBF Workshop, 2018. |
| [4] | Polynomial-Time Validation of QCDCL Certificates 2018, Technical report AC-TR-18-003, Algorithms and Complexity Group, TU Wien. |
| [5] | Portfolio Solvers for QDIMACS and QCIR 2018. Note: QBF Evaluation at SAT |
| [6] | Portfolio-Based Algorithm Selection for Circuit QBFs 2018, Technical report AC-TR-18-004, Algorithms and Complexity Group, TU Wien. |
| [7] | QBF Encodings of Chess Problems 2018, Technical report AC-TR-18-013, Algorithms and Complexity Group, TU Wien. |
| [1] | Long-Distance Q-Resolution with Dependency Schemes Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 298–313, 2017, Springer Verlag. |
| [2] | Dependency Learning for QBF 2017, Technical report AC-TR-17-011, Algorithms and Complexity Group, TU Wien. |
| [1] | Long Distance Q-Resolution with Dependency Schemes Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings (Nadia Creignou, Daniel Le Berre, eds.), volume 9710 of Lecture Notes in Computer Science, pages 500–518, 2016, Springer Verlag. |