Publications: Robert Ganian
2026
| [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 |
2025
| [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. |
2024
| [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. |
2023
| [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. |
2022
| [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. |
2021
| [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. |
2020
| [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. |
2019
| [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. |
2018
| [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. |
2017
| [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. |
2016
| [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. |
2015
| [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. |
2014
| [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. |
2013
| [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. |
2012
| [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. |
2011
| [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. |
2010
| [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. |
2009
| [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. |
2008
| [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. |
AC Admin
Website maintainer