Robert Ganian
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
108
Venues
26
Active years
2008–2026
Best venue rank
A*
Where they publish
- A*AAAI17 papers
- BMFCS10 papers
- A*IJCAI10 papers
- A*ICALP8 papers
- ASTACS8 papers
- AGD8 papers
- AESA6 papers
- ASAT5 papers
- CIWOCA5 papers
- BWG4 papers
- BISAAC3 papers
- BSOFSEM3 papers
- BWADS3 papers
- A*ICML3 papers
- A*ICLR2 papers
- A*LICS2 papers
- ACP2 papers
- A*INFOCOM1 paper
- CLAGOS1 paper
- A*KR1 paper
- AALENEX1 paper
- BIPCO1 paper
- BICTAI1 paper
- A*SODA1 paper
- CTAMC1 paper
- BCSL1 paper
Papers
108 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | AAAI | Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity. | Robert Ganian, Hung P. Hoang, Simon Wietheger |
| 2026 | ICALP | Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees. | Narek Bojikian, Alexander Firbas, Robert Ganian, Hung P. Hoang, Krisztina Szilgyi |
| 2026 | ICALP | Coordinated Motion Planning Is FPT on Discretized Simple Polygons. | Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj |
| 2026 | INFOCOM | Makespan Minimization in Split Learning: From Theory to Practice. | Robert Ganian, Fionn Mc Inerney, Dimitra Tsigkari |
| 2026 | MFCS | Parameterized Complexity of Efficient Sortation. | Robert Ganian, Hung P. Hoang, Simon Wietheger |
| 2026 | STACS | Computing Twin-Width via Treedepth and Vertex Integrity. | Robert Ganian, Mathis Rocton |
| 2026 | SAT | Bilateral Treewidth for QBF: Where Strategies and Resolution Meet. | Robert Ganian, Marlene Grndel |
| 2025 | AAAI | The Complexity of Extending Fair Allocations of Indivisible Goods. | Argyrios Deligkas, Eduard Eiben, Robert Ganian, Tiger-Lily Goldsmith, Stavros D. Ioannidis |
| 2025 | AAAI | Parameterized Complexity of Caching in Networks. | Robert Ganian, Fionn Mc Inerney, Dimitra Tsigkari |
| 2025 | ESA | Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms. | Thomas Depian, Simon D. Fink, Robert Ganian, Vaishali Surianarayanan |
| 2025 | GD | Graph Tiles (Poster Abstract). | Oswin Aichholzer, Robert Ganian, Phillip Keldenich, Maarten Lffler, Gert G. T. Meijer, Alexandra Weinberger, Carola Wenk |
| 2025 | ICLR | The Computational Complexity of Positive Non-Clashing Teaching in Graphs. | Robert Ganian, Liana Khazaliya, Fionn Mc Inerney, Mathis Rocton |
| 2025 | ICLR | Training One-Dimensional Graph Neural Networks is NP-Hard. | Robert Ganian, Mathis Rocton, Simon Wietheger |
| 2025 | IJCAI | A Structural Complexity Analysis of Hierarchical Task Network Planning. | Cornelius Brand, Robert Ganian, Fionn Mc Inerney, Simon Wietheger |
| 2025 | ISAAC | Structural Parameterizations of Simultaneous Planarity. | Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Matthias Pfretzschner, Ignaz Rutter |
| 2025 | LICS | Approximate Evaluation of Quantitative Second Order Queries. | Jan Dreier, Robert Ganian, Thekla Hamm |
| 2025 | SOFSEM | Pathways to Tractability for Geometric Thickness. | Thomas Depian, Simon Dominik Fink, Alexander Firbas, Robert Ganian, Martin Nllenburg |
| 2025 | WADS | Crossing and Independent Families Among Polygons. | Anna Brtzner, Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada |
| 2025 | WADS | Routing Few Robots in a Crowded Network. | Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, Dominik Leko, M. S. Ramanujan |
| 2025 | WG | The Peculiarities of Extending Queue Layouts. | Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nllenburg |
| 2024 | AAAI | The Complexity of Optimizing Atomic Congestion. | Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram, Fionn Mc Inerney |
| 2024 | GD | The Parameterized Complexity Of Extending Stack Layouts. | Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nllenburg |
| 2024 | GD | Minimizing Switches in Cased Graph Drawings (Poster Abstract). | Robert Ganian, Martin Nllenburg, Sebastian Rder |
| 2024 | ICALP | Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. | Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan |
| 2024 | ICALP | A Tight Subexponential-Time Algorithm for Two-Page Book Embedding. | Robert Ganian, Haiko Mller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki |
| 2024 | IJCAI | Revisiting Causal Discovery from a Complexity-Theoretic Perspective. | Robert Ganian, Viktoriia Korchemna, Stefan Szeider |
| 2024 | ISAAC | Exact Algorithms for Clustered Planarity with Linear Saturators. | Giordano Da Lozzo, Robert Ganian, Siddharth Gupta, Bojan Mohar, Sebastian Ordyniak, Meirav Zehavi |
| 2024 | STACS | Computing Twin-Width Parameterized by the Feedback Edge Number. | Jakub Balabn, Robert Ganian, Mathis Rocton |
| 2024 | WG | The Parameterized Complexity Landscape of the Unsplittable Flow Problem. | Robert Ganian, Mathis Rocton, Daniel Unterberger |
| 2023 | AAAI | The Parameterized Complexity of Network Microaggregation. | Vclav Blazej, Robert Ganian, Dusan Knop, Jan Pokorn, Simon Schierreich, Kirill Simonov |
| 2023 | AAAI | A Parameterized Theory of PAC Learning. | Cornelius Brand, Robert Ganian, Kirill Simonov |
| 2023 | AAAI | A Structural Complexity Analysis of Synchronous Dynamical Systems. | Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna |
| 2023 | ESA | 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 |
| 2023 | GD | Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs. | Cornelius Brand, Robert Ganian, Sebastian Rder, Florian Schager |
| 2023 | ICML | The Computational Complexity of Concise Hypersphere Classification. | Eduard Eiben, Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider |
| 2023 | LICS | Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF. | Johannes Klaus Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky, Sebastian Ordyniak |
| 2022 | AAAI | Hedonic Diversity Games: A Complexity Picture with More than Two Colors. | Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Such |
| 2022 | ESA | Bounding and Computing Obstacle Numbers of Graphs. | Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff |
| 2022 | ESA | Finding a Cluster in Incomplete Data. | Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider |
| 2022 | GD | Testing Upward Planarity of Partial 2-Trees. | Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov |
| 2022 | ICALP | The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. | Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov |
| 2022 | ICML | The Complexity of k-Means Clustering when Little is Known. | Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov |
| 2022 | IJCAI | The Complexity of Envy-Free Graph Cutting. | Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak |
| 2022 | SAT | Weighted Model Counting with Twin-Width. | Robert Ganian, Filip Pokrvka, Andr Schidler, Kirill Simonov, Stefan Szeider |
| 2022 | WG | Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts. | Cornelius Brand, Esra Ceylan, Robert Ganian, Christian Hatschka, Viktoriia Korchemna |
| 2021 | AAAI | The Parameterized Complexity of Clustering Incomplete Data. | Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider |
| 2021 | AAAI | The Complexity of Object Association in Multiple Object Tracking. | Robert Ganian, Thekla Hamm, Sebastian Ordyniak |
| 2021 | ICALP | Crossing-Optimal Extension of Simple Drawings. | Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, Birgit Vogtenhuber |
| 2021 | IJCAI | The Parameterized Complexity of Connected Fair Division. | Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak |
| 2021 | LAGOS | Graphs with Two Moplexes. | Clment Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic |
| 2020 | AAAI | Parameterized Complexity of Envy-Free Resource Allocation in Social Networks. | Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak |
| 2020 | AAAI | An Efficient Algorithm for Counting Markov Equivalent DAGs. | Robert Ganian, Thekla Hamm, Topi Talvitie |
| 2020 | AAAI | On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank. | Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider |
| 2020 | GD | Parameterized Algorithms for Queue Layouts. | Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nllenburg |
| 2020 | ICALP | Extending Partial 1-Planar Drawings. | Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nllenburg |
| 2020 | IJCAI | Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP. | Jiehua Chen, Robert Ganian, Thekla Hamm |
| 2020 | IJCAI | The Complexity Landscape of Resource-Constrained Scheduling. | Robert Ganian, Thekla Hamm, Guillaume Mescoff |
| 2020 | IJCAI | Threshold Treewidth and Hypertree Width. | Robert Ganian, Andr Schidler, Manuel Sorge, Stefan Szeider |
| 2020 | KR | Fixed-Parameter Tractability of Dependency QBF with Structural Parameters. | Robert Ganian, Toms Peitl, Friedrich Slivovsky, Stefan Szeider |
| 2020 | MFCS | Extending Nearly Complete 1-Planar Drawings in Polynomial Time. | Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nllenburg |
| 2020 | STACS | On Covering Segments with Unit Intervals. | Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj |
| 2019 | AAAI | Solving Integer Quadratic Programming via Explicit and Structural Restrictions. | Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak |
| 2019 | ALENEX | SAT-Encodings for Treecut Width and Treedepth. | Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider |
| 2019 | CP | A Join-Based Hybrid Parameter for Constraint Satisfaction. | Robert Ganian, Sebastian Ordyniak, Stefan Szeider |
| 2019 | ESA | Group Activity Selection with Few Agent Types. | Robert Ganian, Sebastian Ordyniak, C. S. Rahul |
| 2019 | GD | Parameterized Algorithms for Book Embedding Problems. | Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nllenburg |
| 2019 | GD | On Strict (Outer-)Confluent Graphs. | Henry Frster, Robert Ganian, Fabian Klute, Martin Nllenburg |
| 2019 | IPCO | Integer Programming and Incidence Treedepth. | Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna |
| 2019 | MFCS | Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. | Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon |
| 2019 | WG | The Power of Cut-Based Parameters for Computing Edge Disjoint Paths. | Robert Ganian, Sebastian Ordyniak |
| 2018 | ICML | Parameterized Algorithms for the Matrix Completion Problem. | Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider |
| 2018 | IJCAI | Unary Integer Linear Programming with Structural Restrictions. | Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak |
| 2018 | IJCAI | A Structural Approach to Activity Selection. | Eduard Eiben, Robert Ganian, Sebastian Ordyniak |
| 2018 | ICTAI | Sum-of-Products with Default Values: Algorithms and Complexity Results. | Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider |
| 2018 | STACS | Small Resolution Proofs for QBF using Dependency Treewidth. | Eduard Eiben, Robert Ganian, Sebastian Ordyniak |
| 2018 | STACS | On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem. | Robert Ganian, Fabian Klute, Sebastian Ordyniak |
| 2017 | AAAI | Going Beyond Primal Treewidth for (M)ILP. | Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan |
| 2017 | IJCAI | Solving Integer Linear Programs with a Small Number of Global Variables and Constraints. | Pavel Dvork, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak |
| 2017 | ISAAC | On Structural Parameterizations of the Edge Disjoint Paths Problem. | Robert Ganian, Sebastian Ordyniak, Ramanujan Sridharan |
| 2017 | MFCS | Towards a Polynomial Kernel for Directed Feedback Vertex Set. | Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan |
| 2017 | STACS | Combining Treewidth and Backdoors for CSP. | Robert Ganian, M. S. Ramanujan, Stefan Szeider |
| 2017 | SAT | Backdoor Treewidth for SAT. | Robert Ganian, M. S. Ramanujan, Stefan Szeider |
| 2017 | SAT | New Width Parameters for Model Counting. | Robert Ganian, Stefan Szeider |
| 2016 | AAAI | Using Decomposition-Parameters for QBF: Mind the Prefix! | Eduard Eiben, Robert Ganian, Sebastian Ordyniak |
| 2016 | AAAI | The Complexity Landscape of Decompositional Parameters for ILP. | Robert Ganian, Sebastian Ordyniak |
| 2016 | CP | Backdoors to Tractable Valued CSP. | Robert Ganian, M. S. Ramanujan, Stefan Szeider |
| 2016 | ESA | Counting Linear Extensions: Parameterizations by Treewidth. | Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak |
| 2016 | MFCS | A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion. | Eduard Eiben, Robert Ganian, O-joung Kwon |
| 2016 | MFCS | On Existential MSO and its Relation to ETH. | Robert Ganian, Ronald de Haan, Iyad A. Kanj, Stefan Szeider |
| 2016 | MFCS | On the Complexity Landscape of Connected f-Factor Problems. | Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan |
| 2016 | SODA | Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. | Robert Ganian, M. S. Ramanujan, Stefan Szeider |
| 2015 | IWOCA | On the Complexity of Rainbow Coloring Problems. | Eduard Eiben, Robert Ganian, Juho Lauri |
| 2015 | MFCS | Algorithmic Applications of Tree-Cut Width. | Robert Ganian, Eun Jung Kim, Stefan Szeider |
| 2015 | SAT | Community Structure Inspired Algorithms for SAT and #SAT. | Robert Ganian, Stefan Szeider |
| 2015 | TAMC | Parameterized Complexity of Asynchronous Border Minimization. | Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa |
| 2015 | WADS | Solving Problems on Graphs of High Rank-Width. | Eduard Eiben, Robert Ganian, Stefan Szeider |
| 2014 | CSL | Model checking existential logic on partially ordered sets. | Simone Bova, Robert Ganian, Stefan Szeider |
| 2013 | ICALP | FO Model Checking of Interval Graphs. | Robert Ganian, Petr Hlinen, Daniel Krl', Jan Obdrzlek, Jarett Schwartz, Jakub Teska |
| 2013 | IWOCA | Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes. | Robert Ganian, Jan Obdrzlek |
| 2013 | MFCS | Meta-kernelization with Structural Parameters. | Robert Ganian, Friedrich Slivovsky, Stefan Szeider |
| 2012 | MFCS | When Trees Grow Low: Shrubs and Fast MSO1. | Robert Ganian, Petr Hlinen, Jaroslav Nesetril, Jan Obdrzlek, Patrice Ossona de Mendez, Reshma Ramadurai |
| 2012 | STACS | Lower Bounds on the Complexity of MSO_1 Model-Checking. | Robert Ganian, Petr Hlinen, Alexander Langer, Jan Obdrzlek, Peter Rossmanith, Somnath Sikdar |
| 2011 | STACS | Clique-width: When Hard Does Not Mean Impossible. | Robert Ganian, Petr Hlinen, Jan Obdrzlek |
| 2011 | SOFSEM | New Results on the Complexity of the Max- and Min-Rep Problems. | Robert Ganian |
| 2010 | IWOCA | Thread Graphs, Linear Rank-Width and Their Algorithmic Applications. | Robert Ganian |
| 2010 | SOFSEM | New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes. | Robert Ganian, Petr Hlinen |
| 2009 | IWOCA | Better Polynomial Algorithms on Graphs of Bounded Rank-Width. | Robert Ganian, Petr Hlinen |
| 2008 | IWOCA | Automata approach to graphs of bounded rank-width. | Petr Hlinen, Robert Ganian |