Publications: Robert Ganian

⬅️ Zurück zum Profil

2026

• A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs (Best Paper Award) Ajaykrishnan E S, Robert Ganian, Daniel Lokshtanov, Vaishali Surianarayanan. 2026 Symposium on Simplicity in Algorithms, SOSA 2026
  📄 Details

• Fair Correlation Clustering Meets Graph Parameters Johannes Blaha, Robert Ganian, Katharina Gillig, Jonathan Højlev, Simon Wietheger. Proceedings of the 17th Latin American Theoretical Informatics (LATIN 2026)
  📄 Details

• Routing Few Robots in a Crowded Network Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, Dominik Leko, M. S. Ramanujan. Journal of Computer and System Sciences
  📄 Details

• The Peculiarities of Extending Queue Layouts Depian, Thomas, Fink, Simon D., Ganian, Robert, Nöllenburg, Martin. Graph-Theoretic Concepts in Computer Science (WG'25)
  📄 Details

• From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider. Algorithmica
  📄 Details

• A Structural Complexity Analysis of Synchronous Dynamical Systems Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna. Artificial Intelligence
  📄 Details

• Makespan Minimization in Split Learning: From Theory to Practice Robert Ganian, Fionn Mc Inerney, Dimitra Tsigkari. IEEE INFOCOM 2026 - IEEE Conference on Computer Communications
  📄 Details

• Computing Twin-Width via Treedepth and Vertex Integrity Robert Ganian, Mathis Rocton. 43rd International Symposium on Theoretical Aspects of Computer Science, STACS 2026
  📄 Details

2025

• Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen. ACM Trans. Comput. Theory
  📄 Details

• Crossing and Independent Families Among Polygons Anna Brötzner, Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada. 19th International Symposium on Algorithms and Data Structures, WADS 2025, August 11-15, 2025, York University, Toronto, Canada
  📄 Details

• A Structural Complexity Analysis of Hierarchical Task Network Planning Cornelius Brand, Robert Ganian, Fionn Mc Inerney, Simon Wietheger. Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2025, Montreal, Canada, August 16-22, 2025
  📄 Details

• Computing Twin-Width Parameterized by the Feedback Edge Number and Vertex Integrity Jakub Balabán, Robert Ganian, Mathis Rocton. SIAM J. Discret. Math.
  📄 Details

• The complexity of optimizing atomic congestion Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram, Fionn Mc Inerney. Artif. Intell.
  📄 Details

• The Complexity of Extending Fair Allocations of Indivisible Goods Argyrios Deligkas, Eduard Eiben, Robert Ganian, Tiger-Lily Goldsmith, Stavros D. Ioannidis. AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25 - March 4, 2025, Philadelphia, PA, USA
  📄 Details

• Routing Few Robots in a Crowded Network Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, Dominik Leko, M. S. Ramanujan. 19th International Symposium on Algorithms and Data Structures, WADS 2025, August 11-15, 2025, York University, Toronto, Canada
  📄 Details

• Parameterized Algorithms for Multiagent Pathfinding on Trees Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan. Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2025, Detroit, MI, USA, May 19-23, 2025
  📄 Details

• Pathways to Tractability for Geometric Thickness Depian, Thomas, Fink, Simon D., Firbas, Alexander, Ganian, Robert, Nöllenburg, Martin. Theory and Practice of Computer Science (SOFSEM'25)
  📄 Details

• Structural Parameterizations of Simultaneous Planarity Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Matthias Pfretzschner, Ignaz Rutter. 36th International Symposium on Algorithms and Computation, ISAAC 2025
  📄 Details

• The Peculiarities of Extending Queue Layouts Thomas Depian, Simon Dominik Fink, Robert Ganian, Martin Nöllenburg. Graph-Theoretic Concepts in Computer Science - 51st International Workshop, WG 2025
  📄 Details

• Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Thomas Depian, Simon D. Fink, Robert Ganian, Vaishali Surianarayanan. 33rd Annual European Symposium on Algorithms, ESA 2025, September 15-17, 2025, Warsaw, Poland
  📄 Details

• Partial Level Planarity Parameterized by the Size of the Missing Graph Depian, Thomas, Fink, Simon D., Klemz, Boris, Ganian, Robert, Nöllenburg, Martin, Sieper, Marie Diana. European Workshop on Computational Geometry (EuroCG'25)
  📄 Details

• Approximate Evaluation of Quantitative Second Order Queries Dreier, Jan, Ganian, Robert, Hamm, Thekla. 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  📄 Details

• A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robots Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan. 41st International Symposium on Computational Geometry, SoCG 2025, June 23-27, 2025, Kanazawa, Japan
  📄 Details

• Parameterized Complexity in Machine Learning Robert Ganian. Computer Science Review
  📄 Details

• Parameterized Complexity of Caching in Networks Robert Ganian, Fionn Mc Inerney, Dimitra Tsigkari. AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25 - March 4, 2025, Philadelphia, PA, USA
  📄 Details

2024

• Computing Twin-Width Parameterized by the Feedback Edge Number Jakub Balabán, Robert Ganian, Mathis Rocton. 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France
  📄 Details

• Extending Orthogonal Planar Graph Drawings is Fixed-parameter Tractable Bhore, Sujoy, Ganian, Robert, Khazaliya, Liana, Montecchiani, Fabrizio, Nöllenburg, Martin. J. Computational Geometry
  📄 Details

• The Complexity of Optimizing Atomic Congestion Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram, Fionn Mc~Inerney. 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
  📄 Details

• Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs Cornelius Brand, Robert Ganian, Sebastian Röder, Florian Schager. J. Graph Algorithms Appl.
  📄 Details

• Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan. 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia
  📄 Details

• The Parameterized Complexity of Extending Stack Layouts Depian, Thomas, Fink, Simon D., Ganian, Robert, Nöllenburg, Martin. 32nd International Symposium on Graph Drawing and Network Visualization, GD 2024, September 18-20, 2024, Vienna, Austria
  📄 Details

• Exact Algorithms for Clustered Planarity with Linear Saturators Da Lozzo, Giordano, Ganian, Robert, Gupta, Siddharth, Mohar, Bojan, Ordyniak, Sebastian, Zehavi, Meirav. 35th International Symposium on Algorithms and Computation, ISAAC 2024
  📄 Details

• The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov. ACM Trans. Algorithms
  📄 Details

• Slim Tree-Cut Width Robert Ganian, Viktoriia Korchemna. Algorithmica
  📄 Details

• Revisiting Causal Discovery from a Complexity-Theoretic Perspective Robert Ganian, Viktoriia Korchemna, Stefan Szeider. Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, IJCAI-24
  📄 Details

• A Tight Subexponential-Time Algorithm for Two-Page Book Embedding Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki. 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia
  📄 Details

• Minimizing Switches in Cased Graph Drawings Ganian, Robert, Nöllenburg, Martin, Röder, Sebastian. Graph Drawing and Network Visualization (GD'24)
  📄 Details

• Bounding and Computing Obstacle Numbers of Graphs Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff. SIAM J. Discret. Math.
  📄 Details

2023

• Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable Bhore, Sujoy, Ganian, Robert, Khazaliya, Liana, Montecchiani, Fabrizio, Nöllenburg, Martin. 39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA
  📄 Details

• The Parameterized Complexity of Network Microaggregation Václav Blazej, Robert Ganian, Dusan Knop, Jan Pokorný, Simon Schierreich, Kirill Simonov. 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
  📄 Details

• Worbel: Aggregating Point Labels into Word Clouds Bhore, Sujoy, Ganian, Robert, Li, Guangping, Nöllenburg, Martin, Wulms, Jules. ACM Trans. Spatial Algorithms and Systems
  📄 Details

• Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs Cornelius Brand, Robert Ganian, Sebastian Röder, Florian Schager. Graph Drawing and Network Visualization - 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023, Revised Selected Papers, Part II
  📄 Details

• A Parameterized Theory of PAC Learning Cornelius Brand, Robert Ganian, Kirill Simonov. 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
  📄 Details

• The Parameterized Complexity of Coordinated Motion Planning Eduard Eiben, Robert Ganian, Iyad Kanj. 39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA
  📄 Details

• From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider. 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands
  📄 Details

• A Structural Complexity Analysis of Synchronous Dynamical Systems Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna. 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
  📄 Details

• Parameterized complexity of envy-free resource allocation in social networks Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak. Artif. Intell.
  📄 Details

• On the parameterized complexity of clustering problems for incomplete data Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider. Journal of Computer and System Sciences
  📄 Details

• The Computational Complexity of Concise Hypersphere Classification Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider. Proceedings of the 40th International Conference on Machine Learning, ICML 2023
  📄 Details

• Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF Johannes Klaus Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky, Sebastian Ordyniak. Thirty-Eighth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  📄 Details

• Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michał Pilipczuk, Erik Jan van Leeuwen. 31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands
  📄 Details

• Group Activity Selection with Few Agent Types Robert Ganian, Sebastian Ordyniak, C. S. Rahul. Algorithmica
  📄 Details

• Hedonic diversity games: A complexity picture with more than two colors Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchy. Artif. Intell.
  📄 Details

• New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162) Ganian, Robert, Montecchiani, Fabrizio, Nöllenburg, Martin, Zehavi, Meirav, Khazaliya, Liana. Dagstuhl Reports
  📄 Details

• Maximizing Social Welfare in Score-Based Social Distance Games Robert Ganian, Thekla Hamm, Dusan Knop, Sanjukta Roy, Simon Schierreich, Ondrej Suchý. Proceedings Nineteenth conference on Theoretical Aspects of Rationality and Knowledge, TARK 2023, Oxford, United Kingdom, 28-30th June 2023
  📄 Details

2022

• Bounding and Computing Obstacle Numbers of Graphs Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff. 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany
  📄 Details

• On Covering Segments with Unit Intervals Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj. SIAM J. Discret. Math.
  📄 Details

• Parameterized Algorithms for Queue Layouts Bhore, Sujoy, Ganian, Robert, Montecchiani, Fabrizio, Nöllenburg, Martin. J. Graph Algorithms Appl.
  📄 Details

• Parameterized Algorithms for Upward Planarity Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov. 38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany
  📄 Details

• Testing Upward Planarity of Partial 2-Trees Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov. Graph Drawing and Network Visualization - 30th International Symposium, GD 2022, Tokyo, Japan, September 13-16, 2022, Revised Selected Papers
  📄 Details

• The Complexity of Envy-Free Graph Cutting Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak. Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23-29 July 2022
  📄 Details

• Finding a Cluster in Incomplete Data Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider. 30th Annual European Symposium on Algorithms (ESA 2022)
  📄 Details

• A Unifying Framework for Characterizing and Computing Width Measures Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, O-joung Kwon. 13th Innovations in Theoretical Computer Science Conference, ITCS 2022
  📄 Details

• The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov. 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France
  📄 Details

• The Complexity of k-Means Clustering when Little is Known Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov. International Conference on Machine Learning, ICML 2022, 17-23 July 2022, Baltimore, Maryland, USA
  📄 Details

• Hedonic Diversity Games: A Complexity Picture with More than Two Colors Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchý. Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022
  📄 Details

• Sum-of-Products with Default Values: Algorithms and Complexity Results Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider. Journal of Artificial Intelligence Research
  📄 Details

• Algorithmic Applications of Tree-Cut Width Robert Ganian, Eun Jung Kim, Stefan Szeider. SIAM J. Discrete Math.
  📄 Details

• Slim Tree-Cut Width Robert Ganian, Viktoriia Korchemna. 17th International Symposium on Parameterized and Exact Computation, IPEC 2022, September 7-9, 2022, Potsdam, Germany
  📄 Details

• Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria Robert Ganian, Jan Kratochvíl, Stefan Szeider. Discr. Appl. Math.
  📄 Details

• Threshold Treewidth and Hypertree Width Robert Ganian, Andre Schidler, Manuel Sorge, Stefan Szeider. Journal of Artificial Intelligence Research
  📄 Details

• Weighted Model Counting with Twin-Width Robert Ganian, Filip Pokr ́yvka, Andre Schidler, Kirill Simonov, Stefan Szeider. 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel
  📄 Details

• An efficient algorithm for counting Markov equivalent DAGs Robert Ganian, Thekla Hamm, Topi Talvitie. Artificial Intelligence
  📄 Details

• Preface: 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria Stefan Szeider, Robert Ganian, Alexandra Silva. 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria
  📄 Details

2021

• Towards a Polynomial Kernel for Directed Feedback Vertex Set Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan. Algorithmica
  📄 Details

• Worbel: Aggregating Point Labels into Word Clouds Bhore, Sujoy, Ganian, Robert, Li, Guangping, Nöllenburg, Martin, Wulms, Jules. Proceedings of the International Conference on Advances in Geographic Information Systems 2021 (ACM SIGSPATIAL 2021)
  📄 Details

• The complexity landscape of decompositional parameters for ILP: Programs with Few Global Variables and Constraints Pavel Dvořák, Eduard Eiben, Robert Ganian, Dušan Knop, Sebastian Ordyniak. Artificial Intelligence
  📄 Details

• The Parameterized Complexity of Connected Fair Division Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak. Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event / Montreal, Canada, 19-27 August 2021
  📄 Details

• Graphs with two moplexes Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic. Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2021
  📄 Details

• Graphs with at most two moplexes Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic. Journal of Graph Theory
  📄 Details

• Measuring what matters: A hybrid approach to dynamic programming with treewidth Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon. J. Comput. Syst. Sci.
  📄 Details

• The Parameterized Complexity of Clustering Incomplete Data Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider. Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence
  📄 Details

• On Strict (Outer-)Confluent Graphs Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg. J. Graph Algorithms Appl.
  📄 Details

• The Complexity of Object Association in Multiple Object Tracking Robert Ganian, Thekla Hamm, Sebastian Ordyniak. Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Virtual Event, February 2-9, 2021
  📄 Details

• On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem Robert Ganian, Fabian Klute, Sebastian Ordyniak. Algorithmica
  📄 Details

• The Complexity of Bayesian Network Learning: Revisiting the Superstructure Robert Ganian, Viktoriia Korchemna. Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual
  📄 Details

• The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths Robert Ganian, Sebastian Ordyniak. Algorithmica
  📄 Details

• On Structural Parameterizations of the Edge Disjoint Paths Problem Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan. Algorithmica
  📄 Details

• New Width Parameters for SAT and Sharp-SAT Ganian, Robert, Szeider, Stefan. Artificial Intelligence
  📄 Details

• Crossing-Optimal Extension of Simple Drawings Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, Birgit Vogtenhuber. 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)
  📄 Details

• Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293) Ganian, Robert, Montecchiani, Fabrizio, Nöllenburg, Martin, Zehavi, Meirav. Dagstuhl Reports
  📄 Details

2020

• On Covering Segments with Unit Intervals Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj. 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France
  📄 Details

• Parameterized Algorithms for Book Embedding Problems Bhore, Sujoy, Ganian, Robert, Montecchiani, Fabrizio, Nöllenburg, Martin. J. Graph Algorithms Appl.
  📄 Details

• Parameterized Algorithms for Queue Layouts Bhore, Sujoy, Ganian, Robert, Montecchiani, Fabrizio, Nöllenburg, Martin. Graph Drawing and Network Visualization - 28th International Symposium, GD 2020, Vancouver, BC, Canada, September 16-18, 2020, Revised Selected Papers
  📄 Details

• Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada Derek G. Corneil, Robert Ganian, Andrzej Proskurowski. Discr. Appl. Math.
  📄 Details

• On Existential MSO and Its Relation to ETH Robert Ganian, Ronald de Haan, Iyad Kanj, Stefan Szeider. ACM Trans. Comput. Theory
  📄 Details

• Extending Nearly Complete 1-Planar Drawings in Polynomial Time Eiben, Eduard, Ganian, Robert, Hamm, Thekla, Klute, Fabian, Nöllenburg, Martin. 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic
  📄 Details

• Extending Partial 1-Planar Drawings Eiben, Eduard, Ganian, Robert, Hamm, Thekla, Klute, Fabian, Nöllenburg, Martin. 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)
  📄 Details

• Parameterized Complexity of Envy-Free Resource Allocation in Social Networks Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak. The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, New York, NY, USA, February 7-12, 2020
  📄 Details

• Using decomposition-parameters for QBF: Mind the prefix! Eduard Eiben, Robert Ganian, Sebastian Ordyniak. J. Comput. Syst. Sci.
  📄 Details

• The Complexity Landscape of Resource-Constrained Scheduling Robert Ganian, Thekla Hamm, Guillaume Mescoff. Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020
  📄 Details

• An Efficient Algorithm for Counting Markov Equivalent DAGs Robert Ganian, Thekla Hamm, Topi Talvitie. The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, New York, NY, USA, February 7-12, 2020
  📄 Details

• On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider. Proceeding of AAAI-20, the Thirty-Fourth AAAI Conference on Artificial Intelligence, February 7–12, 2020, New York
  📄 Details

• On the Parameterized Complexity of Clustering Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider.
  📄 Details

• Fixed-Parameter Tractability of Dependency QBF with Structural Parameters Robert Ganian, Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider. Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, KR 2020
  📄 Details

• Threshold Treewidth and Hypertree Width Robert Ganian, Andre Schidler, Manuel Sorge, Stefan Szeider. Proceeding of IJCAI-PRICAI2020, the 29th International Joint Conference on Artificial Intelligence and the 17th Pacific Rim International Conference on Artificial Intelligence
  📄 Details

2019

• Parameterized Algorithms for Book Embedding Problems Bhore, Sujoy, Ganian, Robert, Montecchiani, Fabrizio, Nöllenburg, Martin. Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings
  📄 Details

• Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon. 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany
  📄 Details

• The Parameterized Complexity of Cascading Portfolio Scheduling Eduard Eiben, Robert Ganian, Iyad Kanj, Stefan Szeider. Proceedings of NeurIPS 2019, the Thirty-third Conference on Neural Information Processing Systems
  📄 Details

• Solving integer quadratic programming via explicit and structural restrictions Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak. The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, Honolulu, Hawaii, USA, January 27 - February 1, 2019
  📄 Details

• Counting linear extensions: Parameterizations by treewidth Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak. Algorithmica
  📄 Details

• Integer Programming and Incidence Treedepth Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna. Integer Programming and Combinatorial Optimization - 20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings
  📄 Details

• On Strict (Outer-)Confluent Graphs Förster, Henry, Ganian, Robert, Klute, Fabian, Nöllenburg, Martin. Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings
  📄 Details

• Shrub-Depth: Capturing Height of Dense Graphs Robert Ganian, Petr Hlinen ́y, Jaroslav Nesetril, Jan Obdrz\ĺek, Patrice Ossona de Mendez. Logical Methods in Computer Science
  📄 Details

• SAT-Encodings for Treecut Width and Treedepth Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider. Proceedings of ALENEX 2019, the 21st Workshop on Algorithm Engineering and Experiments
  📄 Details

• On the Complexity Landscape of Connected f-Factor Problems Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan. Algorithmica
  📄 Details

• The Power of Cut-Based Parameters for Computing Edge Disjoint Paths Robert Ganian, Sebastian Ordyniak. Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19-21, 2019, Revised Papers
  📄 Details

• Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey Robert Ganian, Sebastian Ordyniak. Algorithms
  📄 Details

• A Join-Based Hybrid Parameter for Constraint Satisfaction Robert Ganian, Sebastian Ordyniak, Stefan Szeider. Proceedings of CP 2019, the 25th International Conference on Principles and Practice of Constraint Programming
  📄 Details

• Group Activity Selection with Few Agent Types Robert Ganian, Sebastian Ordyniak, C. S. Rahul. 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany
  📄 Details

2018

• A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion Eduard Eiben, Robert Ganian, O-joung Kwon. Journal of Computer and System Sciences
  📄 Details

• On the complexity of rainbow coloring problems Eduard Eiben, Robert Ganian, Juho Lauri. Discr. Appl. Math.
  📄 Details

• Small Resolution Proofs for QBF using Dependency Treewidth Eduard Eiben, Robert Ganian, Sebastian Ordyniak. 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28–March 3, 2018, Caen, France
  📄 Details

• Solving Problems on Graphs of High Rank-Width Eduard Eiben, Robert Ganian, Stefan Szeider. Algorithmica
  📄 Details

• Meta-kernelization using well-structured modulators Eduard Eiben, Robert Ganian, Stefan Szeider. Discr. Appl. Math.
  📄 Details

• Unary Integer Linear Programming with Structural Restrictions Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak. Proceedings of IJCAI 2018, the 27th International Joint Conference on Artificial Intelligence
  📄 Details

• A Structural Approach to Activity Selection Eduard Eiben, Robert Ganian, Sebastian Ordyniak. Proceedings of IJCAI 2018, the 27th International Joint Conference on Artificial Intelligence
  📄 Details

• Parameterized Algorithms for the Matrix Completion Problem Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider. Proceeding of ICML, the Thirty-fifth International Conference on Machine Learning, Stockholm, July 10–15, 2018
  📄 Details

• Sum-of-Products with Default Values: Algorithms and Complexity Results Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider. Proceedings of ICTAI 2018, the 30th IEEE International Conference on Tools with Artificial Intelligence
  📄 Details

• On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem Robert Ganian, Fabian Klute, Sebastian Ordyniak. 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28–March 3, 2018, Caen, France
  📄 Details

• The complexity landscape of decompositional parameters for ILP Robert Ganian, Sebastian Ordyniak. Artificial Intelligence
  📄 Details

2017

• Towards a Polynomial Kernel for Directed Feedback Vertex Set Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan. 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark
  📄 Details

• Going Beyond Primal Treewidth for (M)ILP Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan. Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA.
  📄 Details

• Solving Integer Linear Programs with a Small Number of Global Variables and Constraints Pavel Dvořák, Eduard Eiben, Robert Ganian, Dušan Knop, Sebastian Ordyniak. Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017
  📄 Details

• On Structural Parameterizations of the Edge Disjoint Paths Problem Robert Ganian, Sebastian Ordyniak, Ramanujan Sridharan. 28th International Symposium on Algorithms and Computation, ISAAC 2017, December 9-12, 2017, Phuket, Thailand
  📄 Details

• Combining Treewidth and Backdoors for CSP Robert Ganian, M. S. Ramanujan, Stefan Szeider. 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)
  📄 Details

• Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting Robert Ganian, M. S. Ramanujan, Stefan Szeider. ACM Transactions on Algorithms
  📄 Details

• Backdoor Treewidth for SAT Robert Ganian, M. S. Ramanujan, Stefan Szeider. Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings
  📄 Details

• New Width Parameters for Model Counting Robert Ganian, Stefan Szeider. Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings
  📄 Details

2016

• Model Checking Existential Logic on Partially Ordered Sets Simone Bova, Robert Ganian, Stefan Szeider. ACM Transactions on Computational Logic
  📄 Details

• Quantified Conjunctive Queries on Partially Ordered Sets Simone Bova, Robert Ganian, Stefan Szeider. Theoretical Computer Science
  📄 Details

• A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion Eduard Eiben, Robert Ganian, O-joung Kwon. Mathematical Foundations of Computer Science 2016 - 41st International Symposium, MFCS 2016
  📄 Details

• Using Decomposition-Parameters for QBF: Mind the Prefix! Eduard Eiben, Robert Ganian, Sebastian Ordyniak. Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence
  📄 Details

• Counting Linear Extensions: Parameterizations by Treewidth Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak. 24th European Symposium of Algorithms, ESA 2016
  📄 Details

• On Existential MSO and its Relation to ETH Robert Ganian, Ronald de Haan, Iyad Kanj, Stefan Szeider. 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
  📄 Details

• Are There Any Good Digraph Measures? Robert Ganian, Petr Hlinen ́y, Joachim Kneis, Daniel Meister, Jan Obdrz\ĺek, Peter Rossmanith, Somnath Sikdar. Journal of Combinatorial Theory, Series B
  📄 Details

• FO Model Checking of Interval Graphs Robert Ganian, Petr Hlinen ́y, Daniel Kr\ál, Jan Obdrz'ék, Jarett Schwartz, Jakub Teska. Logical Methods in Computer Science
  📄 Details

• Polynomial-Time Construction of Optimal MPI Derived Datatype Trees Robert Ganian, Martin Kalany, Stefan Szeider, Jesper Larsson Träff. 2016 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2016, Chicago, IL, USA, May 23-27, 2016
  📄 Details

• The Complexity Landscape of Decompositional Parameters for ILP Robert Ganian, Sebastian Ordyniak. Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence
  📄 Details

• Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting Robert Ganian, M. S. Ramanujan, Stefan Szeider. Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016
  📄 Details

• Backdoors to Tractable Valued CSP Robert Ganian, M.S. Ramanujan, Stefan Szeider. Principles and Practice of Constraint Programming - 22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings
  📄 Details

• Meta-Kernelization with Structural Parameters Robert Ganian, Friedrich Slivovsky, Stefan Szeider. Journal of Computer and System Sciences
  📄 Details

• On the Complexity Landscape of Connected f-factor Problems Robert Ganian, N.S. Narayanaswamy, Sebastian Ordyniak, C.S. Rahul, Ramanujan M. S.. Mathematical Foundations of Computer Science 2016 - 41st International Symposium, MFCS 2016
  📄 Details

2015

• On the Complexity of Rainbow Coloring Problems Eduard Eiben, Robert Ganian, Juho Lauri. Combinatorial Algorithms - 26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, Revised Selected Papers
  📄 Details

• Solving Problems on Graphs of High Rank-Width Eduard Eiben, Robert Ganian, Stefan Szeider. Algorithms and Data Structures Symposium (WADS 2015), August 5-7, 2015, University of Victoria, BC, Canada
  📄 Details

• Meta-Kernelization using Well-Structured Modulators Eduard Eiben, Robert Ganian, Stefan Szeider. Parameterized and Exact Computation - 10th International Symposium, IPEC 2014, Patras, Greece, September 16-18, 2015. Revised Selected Papers
  📄 Details

• Improving Vertex Cover as a Graph Parameter Robert Ganian. Discrete Mathematics & Theoretical Computer Science
  📄 Details

• Algorithmic Applications of Tree-Cut Width Robert Ganian, Eun Jung Kim, Stefan Szeider. Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II
  📄 Details

• Community Structure Inspired Algorithms for SAT and #SAT Robert Ganian, Stefan Szeider. 18th International Conference on Theory and Applications of Satisfiability Testing (SAT 2015), September 24-27, 2015, Austin, Texas
  📄 Details

2014

• Model checking existential logic on partially ordered sets Simone Bova, Robert Ganian, Stefan Szeider. 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
  📄 Details

• Quantified Conjunctive Queries on Partially Ordered Sets Simone Bova, Robert Ganian, Stefan Szeider. Parameterized and Exact Computation - 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers
  📄 Details

• Digraph width measures in parameterized algorithmics Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith. Discrete Applied Mathematics
  📄 Details

• Lower bounds on the complexity of MSO1 model-checking Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar. J. Comput. Syst. Sci.
  📄 Details

2013

• Cops-and-robbers: remarks and problems Michel Boyer, Sif El Harti, Amal El Ouarari, Robert Ganian, Tomas Gavenciak, Gena Hahn, Carsten Moldenauer, Ignaz Rutter, Benoit Theriault, Martin Vatshelle. Journal of Combinatorial Mathematics and Combinatorial Computing
  📄 Details

• FO Model Checking of Interval Graphs Robert Ganian, Petr Hlinený, Daniel Král’, Jan Obdrzálek, Jarett Schwartz, Jakub Teska. Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II
  📄 Details

• Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width Robert Ganian, Petr Hlinený, Jan Obdrzálek. Fundam. Inform.
  📄 Details

• A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width Robert Ganian, Petr Hlinený, Jan Obdrzálek. Eur. J. Comb.
  📄 Details

• Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes Robert Ganian, Jan Obdrzálek. Combinatorial Algorithms - 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013, Revised Selected Papers
  📄 Details

• Meta-kernelization with Structural Parameters Robert Ganian, Friedrich Slivovsky, Stefan Szeider. Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings
  📄 Details

2012

• Lower Bounds on the Complexity of MSO1 Model-Checking Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar. 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France
  📄 Details

• When Trees Grow Low: Shrubs and Fast MSO1 Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez, Reshma Ramadurai. Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings
  📄 Details

2011

• New Results on the Complexity of the Max- and Min-Rep Problems Robert Ganian. 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
  📄 Details

• Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics Robert Ganian. Parameterized and Exact Computation - 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers
  📄 Details

• Clique-width: When Hard Does Not Mean Impossible Robert Ganian, Petr Hlinený, Jan Obdrzálek. 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany
  📄 Details

2010

• Thread Graphs, Linear Rank-Width and Their Algorithmic Applications Robert Ganian. Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers
  📄 Details

• Are There Any Good Digraph Width Measures? Robert Ganian, Petr Hliněný, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar. Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings
  📄 Details

• New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes Robert Ganian, Petr Hlinený. 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
  📄 Details

• On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width Robert Ganian, Petr Hlinený. Discrete Applied Mathematics
  📄 Details

• Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width Robert Ganian, Petr Hlinený, Jan Obdrzálek. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India
  📄 Details

2009

• The Parameterized Complexity of Oriented Colouring Robert Ganian. Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, MEMICS 2009, November 13-15, 2009, Prestige Hotel, Znojmo, Czech Republic
  📄 Details

• On Digraph Width Measures in Parameterized Algorithmics Robert Ganian, Petr Hliněný, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith. Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers
  📄 Details

• Better Polynomial Algorithms on Graphs of Bounded Rank-Width Robert Ganian, Petr Hliněný. Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28-July 2, 2009, Revised Selected Papers
  📄 Details

2008

• Automata approach to graphs of bounded rank-width Robert Ganian, Petr Hlinený. Proceedings of the 19th International Workshop on Combinatorial Algorithms, IWOCA 2008, September 13-15, 2008, Nagoya, Japan
  📄 Details