Robert Ganian

280 papers A* 48A 32B 32C 7Journal 151Unranked 10
YearRankTypeTitle / Venue / Authors
2026 A conf
A Parameterized-Complexity Framework for Finding Local Optima.
ITCS
Robert Ganian, Hung P. Hoang, Christian Komusiewicz, Nils Morawietz
2026 J jnl
A Parameterized-Complexity Framework for Finding Local Optima.
CoRR
Robert Ganian, Hung P. Hoang, Christian Komusiewicz, Nils Morawietz
2026 — conf
A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs.
SOSA
Ajaykrishnan E. S., Robert Ganian, Daniel Lokshtanov, Vaishali Surianarayanan
2026 J jnl
A structural complexity analysis of synchronous dynamical systems.
Artif. Intell.
Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna
2026 A conf
Computing Twin-Width via Treedepth and Vertex Integrity.
STACS
Robert Ganian, Mathis Rocton
2026 J jnl
Fair Correlation Clustering Meets Graph Parameters.
CoRR
Johannes Blaha, Robert Ganian, Katharina Gillig, Jonathan S. Højlev, Simon Wietheger
2026 J jnl
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem.
Algorithmica
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2026 J jnl
Makespan Minimization in Split Learning: From Theory to Practice.
CoRR
Robert Ganian, Fionn Mc Inerney, Dimitra Tsigkari
2026 A* conf
Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity.
AAAI
Robert Ganian, Hung P. Hoang, Simon Wietheger
2026 J jnl
Parameterized Complexity in Machine Learning.
Comput. Sci. Rev.
Robert Ganian
2026 J jnl
Routing few robots in a crowded network.
J. Comput. Syst. Sci.
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, Dominik Leko, M. S. Ramanujan
2026 J jnl
The Complexity of Bayesian Network Learning: Revisiting the Superstructure.
CoRR
Robert Ganian, Viktoriia Korchemna
2025 A* conf
A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robots.
SoCG
Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan
2025 J jnl
A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robots.
CoRR
Eduard Eiben, Robert Ganian, Iyad Kanj, Ramanujan Maadapuzhi Sridharan
2025 J jnl
A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs.
CoRR
Ajaykrishnan E. S., Robert Ganian, Daniel Lokshtanov, Vaishali Surianarayanan
2025 A* conf
A Structural Complexity Analysis of Hierarchical Task Network Planning.
IJCAI
Cornelius Brand, Robert Ganian, Fionn Mc Inerney, Simon Wietheger
2025 A* conf
Approximate Evaluation of Quantitative Second Order Queries.
LICS
Jan Dreier, Robert Ganian, Thekla Hamm
2025 J jnl
Computing Twin-Width Parameterized by the Feedback Edge Number and Vertex Integrity.
SIAM J. Discret. Math.
Jakub Balabán, Robert Ganian, Mathis Rocton
2025 B conf
Crossing and Independent Families Among Polygons.
WADS
Anna Brötzner, Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada
2025 J jnl
Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees.
CoRR
Narek Bojikian, Alexander Firbas, Robert Ganian, Hung P. Hoang, Krisztina Szilágyi
2025 J jnl
Gateways to Tractability for Satisfiability in Pearl's Causal Hierarchy.
CoRR
Robert Ganian, Marlene Gründel, Simon Wietheger
2025 A conf
Graph Tiles (Poster Abstract).
GD
Oswin Aichholzer, Robert Ganian, Phillip Keldenich, Maarten Löffler, Gert G. T. Meijer, Alexandra Weinberger, Carola Wenk
2025 A conf
Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms.
ESA
Thomas Depian, Simon D. Fink, Robert Ganian, Vaishali Surianarayanan
2025 J jnl
Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms.
CoRR
Thomas Depian, Simon D. Fink, Robert Ganian, Vaishali Surianarayanan
2025 J jnl
Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity.
CoRR
Robert Ganian, Hung P. Hoang, Simon Wietheger
2025 A conf
Parameterized Algorithms for Multiagent Pathfinding on Trees.
AAMAS
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan
2025 A* conf
Parameterized Complexity of Caching in Networks.
AAAI
Robert Ganian, Fionn Mc Inerney, Dimitra Tsigkari
2025 — conf
Pathways to Tractability for Geometric Thickness.
SOFSEM (1)
Thomas Depian, Simon Dominik Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg
2025 B conf
Routing Few Robots in a Crowded Network.
WADS
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, Dominik Leko, M. S. Ramanujan
2025 J jnl
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth.
ACM Trans. Comput. Theory
Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen
2025 B conf
Structural Parameterizations of Simultaneous Planarity.
ISAAC
Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Matthias Pfretzschner, Ignaz Rutter
2025 A* conf
The Complexity of Extending Fair Allocations of Indivisible Goods.
AAAI
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Tiger-Lily Goldsmith, Stavros D. Ioannidis
2025 J jnl
The Complexity of Extending Fair Allocations of Indivisible Goods.
CoRR
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Tiger-Lily Goldsmith, Stavros D. Ioannidis
2025 A* conf
The Computational Complexity of Positive Non-Clashing Teaching in Graphs.
ICLR
Robert Ganian, Liana Khazaliya, Fionn Mc Inerney, Mathis Rocton
2025 J jnl
The Computational Complexity of Positive Non-Clashing Teaching in Graphs.
CoRR
Robert Ganian, Liana Khazaliya, Fionn Mc Inerney, Mathis Rocton
2025 B conf
The Peculiarities of Extending Queue Layouts.
WG
Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg
2025 J jnl
The Peculiarities of Extending Queue Layouts.
CoRR
Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg
2025 J jnl
The complexity of optimizing atomic congestion.
Artif. Intell.
Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram, Fionn Mc Inerney
2025 A* conf
Training One-Dimensional Graph Neural Networks is NP-Hard.
ICLR
Robert Ganian, Mathis Rocton, Simon Wietheger
2024 A* conf
A Tight Subexponential-Time Algorithm for Two-Page Book Embedding.
ICALP
Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki
2024 J jnl
A Tight Subexponential-time Algorithm for Two-Page Book Embedding.
CoRR
Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki
2024 J jnl
Bounding and Computing Obstacle Numbers of Graphs.
SIAM J. Discret. Math.
Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff
2024 A conf
Computing Twin-Width Parameterized by the Feedback Edge Number.
STACS
Jakub Balabán, Robert Ganian, Mathis Rocton
2024 B conf
Exact Algorithms for Clustered Planarity with Linear Saturators.
ISAAC
Giordano Da Lozzo, Robert Ganian, Siddharth Gupta, Bojan Mohar, Sebastian Ordyniak, Meirav Zehavi
2024 J jnl
Exact Algorithms for Clustered Planarity with Linear Saturators.
CoRR
Giordano Da Lozzo, Robert Ganian, Siddharth Gupta, Bojan Mohar, Sebastian Ordyniak, Meirav Zehavi
2024 J jnl
Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs.
J. Graph Algorithms Appl.
Cornelius Brand, Robert Ganian, Sebastian Röder, Florian Schager
2024 J jnl
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem.
CoRR
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2024 J jnl
Graphs with at most two moplexes.
J. Graph Theory
Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic
2024 A conf
Minimizing Switches in Cased Graph Drawings (Poster Abstract).
GD
Robert Ganian, Martin Nöllenburg, Sebastian Röder
2024 A* conf
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy.
ICALP
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan
2024 J jnl
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy.
CoRR
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan
2024 J jnl
Parameterized Complexity of Caching in Networks.
CoRR
Robert Ganian, Fionn Mc Inerney, Dimitra Tsigkari
2024 J jnl
Parameterized Complexity of Efficient Sortation.
CoRR
Robert Ganian, Hung P. Hoang, Simon Wietheger
2024 J jnl
Pathways to Tractability for Geometric Thickness.
CoRR
Thomas Depian, Simon Dominik Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg
2024 A* conf
Revisiting Causal Discovery from a Complexity-Theoretic Perspective.
IJCAI
Robert Ganian, Viktoriia Korchemna, Stefan Szeider
2024 J jnl
Slim Tree-Cut Width.
Algorithmica
Robert Ganian, Viktoriia Korchemna
2024 J jnl
The Boundaries of Tractability in Hierarchical Task Network Planning.
CoRR
Cornelius Brand, Robert Ganian, Fionn Mc Inerney, Simon Wietheger
2024 A* conf
The Complexity of Optimizing Atomic Congestion.
AAAI
Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram, Fionn Mc Inerney
2024 J jnl
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width.
ACM Trans. Algorithms
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
2024 B conf
The Parameterized Complexity Landscape of the Unsplittable Flow Problem.
WG
Robert Ganian, Mathis Rocton, Daniel Unterberger
2024 J jnl
The Parameterized Complexity Landscape of the Unsplittable Flow Problem.
CoRR
Robert Ganian, Mathis Rocton, Daniel Unterberger
2024 A conf
The Parameterized Complexity Of Extending Stack Layouts.
GD
Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg
2024 J jnl
The Parameterized Complexity of Extending Stack Layouts.
CoRR
Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg
2024 B conf
Twin-Width Meets Feedback Edges and Vertex Integrity.
IPEC
Jakub Balabán, Robert Ganian, Mathis Rocton
2024 J jnl
Twin-Width Meets Feedback Edges and Vertex Integrity.
CoRR
Jakub Balabán, Robert Ganian, Mathis Rocton
2023 A* conf
A Parameterized Theory of PAC Learning.
AAAI
Cornelius Brand, Robert Ganian, Kirill Simonov
2023 J jnl
A Parameterized Theory of PAC Learning.
CoRR
Cornelius Brand, Robert Ganian, Kirill Simonov
2023 A* conf
A Structural Complexity Analysis of Synchronous Dynamical Systems.
AAAI
Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna
2023 J jnl
A Structural Complexity Analysis of Synchronous Dynamical Systems.
CoRR
Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna
2023 J jnl
Approximate Evaluation of Quantitative Second Order Queries.
CoRR
Jan Dreier, Robert Ganian, Thekla Hamm
2023 J jnl
Computing Twin-Width Parameterized by the Feedback Edge Number.
CoRR
Jakub Balabán, Robert Ganian, Mathis Rocton
2023 B conf
Consistency Checking Problems: A Gateway to Parameterized Sample Complexity.
IPEC
Robert Ganian, Liana Khazaliya, Kirill Simonov
2023 J jnl
Consistency-Checking Problems: A Gateway to Parameterized Sample Complexity.
CoRR
Robert Ganian, Liana Khazaliya, Kirill Simonov
2023 A* conf
Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable.
SoCG
Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg
2023 J jnl
Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable.
CoRR
Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg
2023 J jnl
Extending orthogonal planar graph drawings is fixed-parameter tractable.
J. Comput. Geom.
Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg
2023 J jnl
Finding a Cluster in Incomplete Data.
CoRR
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2023 — conf
Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs.
GD (2)
Cornelius Brand, Robert Ganian, Sebastian Röder, Florian Schager
2023 J jnl
Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs.
CoRR
Cornelius Brand, Robert Ganian, Sebastian Röder, Florian Schager
2023 B conf
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem.
IPEC
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2023 J jnl
Group Activity Selection with Few Agent Types.
Algorithmica
Robert Ganian, Sebastian Ordyniak, C. S. Rahul
2023 J jnl
Hedonic diversity games: A complexity picture with more than two colors.
Artif. Intell.
Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchý
2023 B conf
Maximizing Social Welfare in Score-Based Social Distance Games.
TARK
Robert Ganian, Thekla Hamm, Dusan Knop, Sanjukta Roy, Simon Schierreich, Ondrej Suchý
2023 J jnl
Maximizing Social Welfare in Score-Based Social Distance Games.
CoRR
Robert Ganian, Thekla Hamm, Dusan Knop, Sanjukta Roy, Simon Schierreich, Ondrej Suchý
2023 A* conf
New Complexity-Theoretic Frontiers of Tractability for Neural Network Training.
NeurIPS
Cornelius Brand, Robert Ganian, Mathis Rocton
2023 J jnl
New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162).
Dagstuhl Reports
Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi, Liana Khazaliya
2023 J jnl
On the parameterized complexity of clustering problems for incomplete data.
J. Comput. Syst. Sci.
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2023 J jnl
Parameterized complexity of envy-free resource allocation in social networks.
Artif. Intell.
Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
2023 A conf
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth.
ESA
Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen
2023 J jnl
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth.
CoRR
Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen
2023 A* conf
Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF.
LICS
Johannes Klaus Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky, Sebastian Ordyniak
2023 J jnl
Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF.
CoRR
Johannes Klaus Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky, Sebastian Ordyniak
2023 J jnl
The Complexity of Envy-Free Graph Cutting.
CoRR
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
2023 J jnl
The Complexity of Optimizing Atomic Congestion.
CoRR
Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram, Fionn Mc Inerney
2023 A* conf
The Computational Complexity of Concise Hypersphere Classification.
ICML
Eduard Eiben, Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider
2023 J jnl
The Computational Complexity of Concise Hypersphere Classification.
CoRR
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2023 A* conf
The Parameterized Complexity of Coordinated Motion Planning.
SoCG
Eduard Eiben, Robert Ganian, Iyad Kanj
2023 J jnl
The Parameterized Complexity of Coordinated Motion Planning.
CoRR
Eduard Eiben, Robert Ganian, Iyad Kanj
2023 A* conf
The Parameterized Complexity of Network Microaggregation.
AAAI
Václav Blazej, Robert Ganian, Dusan Knop, Jan Pokorný, Simon Schierreich, Kirill Simonov
2023 J jnl
Worbel: Aggregating Point Labels into Word Clouds.
ACM Trans. Spatial Algorithms Syst.
Sujoy Bhore, Robert Ganian, Guangping Li, Martin Nöllenburg, Jules Wulms
2022 B ed.
47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, Vienna, Austria, August 22-26, 2022
MFCS
Stefan Szeider, Robert Ganian, Alexandra Silva
2022 A conf
A Unifying Framework for Characterizing and Computing Width Measures.
ITCS
Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, O-joung Kwon
2022 J jnl
Algorithmic Applications of Tree-Cut Width.
CoRR
Robert Ganian, Eun Jung Kim, Stefan Szeider
2022 J jnl
Algorithmic Applications of Tree-Cut Width.
SIAM J. Discret. Math.
Robert Ganian, Eun Jung Kim, Stefan Szeider
2022 J jnl
An efficient algorithm for counting Markov equivalent DAGs.
Artif. Intell.
Robert Ganian, Thekla Hamm, Topi Talvitie
2022 A conf
Bounding and Computing Obstacle Numbers of Graphs.
ESA
Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff
2022 J jnl
Bounding and computing obstacle numbers of graphs.
CoRR
Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff
2022 B conf
Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts.
WG
Cornelius Brand, Esra Ceylan, Robert Ganian, Christian Hatschka, Viktoriia Korchemna
2022 J jnl
Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts.
CoRR
Cornelius Brand, Esra Ceylan, Christian Hatschka, Robert Ganian, Viktoriia Korchemna
2022 A conf
Finding a Cluster in Incomplete Data.
ESA
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2022 A* conf
Hedonic Diversity Games: A Complexity Picture with More than Two Colors.
AAAI
Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchý
2022 J jnl
Hedonic Diversity Games: A Complexity Picture with More than Two Colors.
CoRR
Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchý
2022 J jnl
On Covering Segments with Unit Intervals.
SIAM J. Discret. Math.
Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj
2022 J jnl
Parameterized Algorithms for Queue Layouts.
J. Graph Algorithms Appl.
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
2022 A* conf
Parameterized Algorithms for Upward Planarity.
SoCG
Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov
2022 J jnl
Parameterized Algorithms for Upward Planarity.
CoRR
Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov
2022 J jnl
Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria.
Discret. Appl. Math.
Robert Ganian, Jan Kratochvíl, Stefan Szeider
2022 B conf
Slim Tree-Cut Width.
IPEC
Robert Ganian, Viktoriia Korchemna
2022 J jnl
Slim Tree-Cut Width.
CoRR
Robert Ganian, Viktoriia Korchemna
2022 J jnl
Sum-of-Products with Default Values: Algorithms and Complexity Results.
J. Artif. Intell. Res.
Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider
2022 A conf
Testing Upward Planarity of Partial 2-Trees.
GD
Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov
2022 J jnl
Testing Upward Planarity of Partial 2-Trees.
CoRR
Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov
2022 A* conf
The Complexity of Envy-Free Graph Cutting.
IJCAI
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
2022 A* conf
The Complexity of k-Means Clustering when Little is Known.
ICML
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
2022 A* conf
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width.
ICALP
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
2022 J jnl
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width.
CoRR
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
2022 J jnl
Threshold Treewidth and Hypertree Width.
CoRR
André Schidler, Robert Ganian, Manuel Sorge, Stefan Szeider
2022 J jnl
Threshold Treewidth and Hypertree Width.
J. Artif. Intell. Res.
Robert Ganian, André Schidler, Manuel Sorge, Stefan Szeider
2022 A conf
Weighted Model Counting with Twin-Width.
SAT
Robert Ganian, Filip Pokrývka, André Schidler, Kirill Simonov, Stefan Szeider
2022 J jnl
Weighted Model Counting with Twin-Width.
CoRR
Robert Ganian, Filip Pokrývka, André Schidler, Kirill Simonov, Stefan Szeider
2021 J jnl
A Unifying Framework for Characterizing and Computing Width Measures.
CoRR
Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, O-joung Kwon
2021 A* conf
Crossing-Optimal Extension of Simple Drawings.
ICALP
Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, Birgit Vogtenhuber
2021 C conf
Graphs with Two Moplexes.
LAGOS
Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic
2021 J jnl
Graphs with at most two moplexes.
CoRR
Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic
2021 J jnl
Measuring what matters: A hybrid approach to dynamic programming with treewidth.
J. Comput. Syst. Sci.
Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon
2021 J jnl
New width parameters for SAT and #SAT.
Artif. Intell.
Robert Ganian, Stefan Szeider
2021 J jnl
On Strict (Outer-)Confluent Graphs.
J. Graph Algorithms Appl.
Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg
2021 J jnl
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem.
Algorithmica
Robert Ganian, Fabian Klute, Sebastian Ordyniak
2021 J jnl
On Structural Parameterizations of the Edge Disjoint Paths Problem.
Algorithmica
Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
2021 J jnl
Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293).
Dagstuhl Reports
Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi
2021 A* conf
The Complexity of Bayesian Network Learning: Revisiting the Superstructure.
NeurIPS
Robert Ganian, Viktoriia Korchemna
2021 A* conf
The Complexity of Object Association in Multiple Object Tracking.
AAAI
Robert Ganian, Thekla Hamm, Sebastian Ordyniak
2021 A* conf
The Parameterized Complexity of Clustering Incomplete Data.
AAAI
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2021 A* conf
The Parameterized Complexity of Connected Fair Division.
IJCAI
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
2021 J jnl
The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths.
Algorithmica
Robert Ganian, Sebastian Ordyniak
2021 J jnl
The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints.
Artif. Intell.
Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
2021 J jnl
Towards a Polynomial Kernel for Directed Feedback Vertex Set.
Algorithmica
Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
2021 — conf
Worbel: Aggregating Point Labels into Word Clouds.
SIGSPATIAL/GIS
Sujoy Bhore, Robert Ganian, Guangping Li, Martin Nöllenburg, Jules Wulms
2021 J jnl
Worbel: Aggregating Point Labels into Word Clouds.
CoRR
Sujoy Bhore, Robert Ganian, Guangping Li, Martin Nöllenburg, Jules Wulms
2020 A* conf
An Efficient Algorithm for Counting Markov Equivalent DAGs.
AAAI
Robert Ganian, Thekla Hamm, Topi Talvitie
2020 J jnl
Crossing-Optimal Extension of Simple Drawings.
CoRR
Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, Birgit Vogtenhuber
2020 B conf
Extending Nearly Complete 1-Planar Drawings in Polynomial Time.
MFCS
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
2020 J jnl
Extending Nearly Complete 1-Planar Drawings in Polynomial Time.
CoRR
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
2020 A* conf
Extending Partial 1-Planar Drawings.
ICALP
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
2020 J jnl
Extending Partial 1-Planar Drawings.
CoRR
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
2020 A* conf
Fixed-Parameter Tractability of Dependency QBF with Structural Parameters.
KR
Robert Ganian, Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
2020 J jnl
Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada.
Discret. Appl. Math.
Derek G. Corneil, Robert Ganian, Andrzej Proskurowski
2020 J jnl
Integer Programming and Incidence Treedepth.
CoRR
Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna
2020 A conf
On Covering Segments with Unit Intervals.
STACS
Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj
2020 J jnl
On Existential MSO and Its Relation to ETH.
ACM Trans. Comput. Theory
Robert Ganian, Ronald de Haan, Iyad Kanj, Stefan Szeider
2020 A* conf
On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank.
AAAI
Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2020 J jnl
Parameterized Algorithms for Book Embedding Problems.
J. Graph Algorithms Appl.
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
2020 A conf
Parameterized Algorithms for Queue Layouts.
GD
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
2020 J jnl
Parameterized Algorithms for Queue Layouts.
CoRR
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
2020 A* conf
Parameterized Complexity of Envy-Free Resource Allocation in Social Networks.
AAAI
Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
2020 A* conf
Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP.
IJCAI
Jiehua Chen, Robert Ganian, Thekla Hamm
2020 J jnl
Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP.
CoRR
Jiehua Chen, Robert Ganian, Thekla Hamm
2020 A* conf
The Complexity Landscape of Resource-Constrained Scheduling.
IJCAI
Robert Ganian, Thekla Hamm, Guillaume Mescoff
2020 A* conf
Threshold Treewidth and Hypertree Width.
IJCAI
Robert Ganian, André Schidler, Manuel Sorge, Stefan Szeider
2020 J jnl
Using decomposition-parameters for QBF: Mind the prefix!
J. Comput. Syst. Sci.
Eduard Eiben, Robert Ganian, Sebastian Ordyniak
2019 A conf
A Join-Based Hybrid Parameter for Constraint Satisfaction.
CP
Robert Ganian, Sebastian Ordyniak, Stefan Szeider
2019 J jnl
A Join-Based Hybrid Parameter for Constraint Satisfaction.
CoRR
Robert Ganian, Sebastian Ordyniak, Stefan Szeider
2019 J jnl
Counting Linear Extensions: Parameterizations by Treewidth.
Algorithmica
Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak
2019 A conf
Group Activity Selection with Few Agent Types.
ESA
Robert Ganian, Sebastian Ordyniak, C. S. Rahul
2019 B conf
Integer Programming and Incidence Treedepth.
IPCO
Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna
2019 B conf
Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth.
MFCS
Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon
2019 J jnl
Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth.
CoRR
Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon
2019 J jnl
On Clustering Incomplete Data.
CoRR
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2019 A conf
On Strict (Outer-)Confluent Graphs.
GD
Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg
2019 J jnl
On Strict (Outer-)Confluent Graphs.
CoRR
Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg
2019 J jnl
On the Complexity Landscape of Connected f-Factor Problems.
Algorithmica
Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan
2019 A conf
Parameterized Algorithms for Book Embedding Problems.
GD
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
2019 J jnl
Parameterized Algorithms for Book Embedding Problems.
CoRR
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
2019 J jnl
Parameterized Complexity of Asynchronous Border Minimization.
Algorithmica
Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa
2019 A conf
SAT-Encodings for Treecut Width and Treedepth.
ALENEX
Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider
2019 J jnl
SAT-Encodings for Treecut Width and Treedepth.
CoRR
Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider
2019 J jnl
Shrub-depth: Capturing Height of Dense Graphs.
Log. Methods Comput. Sci.
Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez
2019 J jnl
Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey.
Algorithms
Robert Ganian, Sebastian Ordyniak
2019 A* conf
Solving Integer Quadratic Programming via Explicit and Structural Restrictions.
AAAI
Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
2019 A* conf
The Parameterized Complexity of Cascading Portfolio Scheduling.
NeurIPS
Eduard Eiben, Robert Ganian, Iyad Kanj, Stefan Szeider
2019 B conf
The Power of Cut-Based Parameters for Computing Edge Disjoint Paths.
WG
Robert Ganian, Sebastian Ordyniak
2018 A* conf
A Structural Approach to Activity Selection.
IJCAI
Eduard Eiben, Robert Ganian, Sebastian Ordyniak
2018 J jnl
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion.
J. Comput. Syst. Sci.
Eduard Eiben, Robert Ganian, O-joung Kwon
2018 J jnl
Group Activity Selection with Few Agent Types.
CoRR
Robert Ganian, Sebastian Ordyniak, C. S. Rahul
2018 J jnl
Meta-kernelization using well-structured modulators.
Discret. Appl. Math.
Eduard Eiben, Robert Ganian, Stefan Szeider
2018 A conf
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem.
STACS
Robert Ganian, Fabian Klute, Sebastian Ordyniak
2018 J jnl
On the Complexity Landscape of Connected f -Factor Problems.
CoRR
Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan
2018 J jnl
On the complexity of rainbow coloring problems.
Discret. Appl. Math.
Eduard Eiben, Robert Ganian, Juho Lauri
2018 A* conf
Parameterized Algorithms for the Matrix Completion Problem.
ICML
Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider
2018 J jnl
Parameterized Algorithms for the Matrix Completion Problem.
CoRR
Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider
2018 A conf
Small Resolution Proofs for QBF using Dependency Treewidth.
STACS
Eduard Eiben, Robert Ganian, Sebastian Ordyniak
2018 J jnl
Solving Problems on Graphs of High Rank-Width.
Algorithmica
Eduard Eiben, Robert Ganian, Stefan Szeider
2018 B conf
Sum-of-Products with Default Values: Algorithms and Complexity Results.
ICTAI
Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider
2018 J jnl
The Complexity Landscape of Decompositional Parameters for ILP.
CoRR
Robert Ganian, Sebastian Ordyniak
2018 J jnl
The Power of Cut-Based Parameters for Computing Edge Disjoint Paths.
CoRR
Robert Ganian, Sebastian Ordyniak
2018 J jnl
The complexity landscape of decompositional parameters for ILP.
Artif. Intell.
Robert Ganian, Sebastian Ordyniak
2018 A* conf
Unary Integer Linear Programming with Structural Restrictions.
IJCAI
Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
2017 A conf
Backdoor Treewidth for SAT.
SAT
Robert Ganian, M. S. Ramanujan, Stefan Szeider
2017 A conf
Combining Treewidth and Backdoors for CSP.
STACS
Robert Ganian, M. S. Ramanujan, Stefan Szeider
2017 J jnl
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting.
ACM Trans. Algorithms
Robert Ganian, M. S. Ramanujan, Stefan Szeider
2017 A* conf
Going Beyond Primal Treewidth for (M)ILP.
AAAI
Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
2017 A conf
New Width Parameters for Model Counting.
SAT
Robert Ganian, Stefan Szeider
2017 B conf
On Structural Parameterizations of the Edge Disjoint Paths Problem.
ISAAC
Robert Ganian, Sebastian Ordyniak, Ramanujan Sridharan
2017 J jnl
On Structural Parameterizations of the Edge Disjoint Paths Problem.
CoRR
Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
2017 J jnl
Shrub-depth: Capturing Height of Dense Graphs.
CoRR
Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez
2017 J jnl
Small Resolution Proofs for QBF using Dependency Treewidth.
CoRR
Eduard Eiben, Robert Ganian, Sebastian Ordyniak
2017 A* conf
Solving Integer Linear Programs with a Small Number of Global Variables and Constraints.
IJCAI
Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
2017 J jnl
Solving Integer Linear Programs with a Small Number of Global Variables and Constraints.
CoRR
Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
2017 B conf
Towards a Polynomial Kernel for Directed Feedback Vertex Set.
MFCS
Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
2016 B conf
A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion.
MFCS
Eduard Eiben, Robert Ganian, O-joung Kwon
2016 J jnl
A single-exponential fixed-parameter algorithm for Distance-Hereditary Vertex Deletion.
CoRR
Eduard Eiben, Robert Ganian, O-joung Kwon
2016 J jnl
Are there any good digraph width measures?
J. Comb. Theory B
Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
2016 A conf
Backdoors to Tractable Valued CSP.
CP
Robert Ganian, M. S. Ramanujan, Stefan Szeider
2016 J jnl
Backdoors to Tractable Valued CSP.
CoRR
Robert Ganian, M. S. Ramanujan, Stefan Szeider
2016 J jnl
Combining Treewidth and Backdoors for CSP.
CoRR
Robert Ganian, M. S. Ramanujan, Stefan Szeider
2016 A conf
Counting Linear Extensions: Parameterizations by Treewidth.
ESA
Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak
2016 A* conf
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting.
SODA
Robert Ganian, M. S. Ramanujan, Stefan Szeider
2016 J jnl
Meta-kernelization with structural parameters.
J. Comput. Syst. Sci.
Robert Ganian, Friedrich Slivovsky, Stefan Szeider
2016 J jnl
Model Checking Existential Logic on Partially Ordered Sets.
ACM Trans. Comput. Log.
Simone Bova, Robert Ganian, Stefan Szeider
2016 B conf
On Existential MSO and its Relation to ETH.
MFCS
Robert Ganian, Ronald de Haan, Iyad A. Kanj, Stefan Szeider
2016 B conf
On the Complexity Landscape of Connected f-Factor Problems.
MFCS
Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan
2016 A conf
Polynomial-Time Construction of Optimal MPI Derived Datatype Trees.
IPDPS
Robert Ganian, Martin Kalany, Stefan Szeider, Jesper Larsson Träff
2016 J jnl
Quantified conjunctive queries on partially ordered sets.
Theor. Comput. Sci.
Simone Bova, Robert Ganian, Stefan Szeider
2016 A* conf
The Complexity Landscape of Decompositional Parameters for ILP.
AAAI
Robert Ganian, Sebastian Ordyniak
2016 A* conf
Using Decomposition-Parameters for QBF: Mind the Prefix!
AAAI
Eduard Eiben, Robert Ganian, Sebastian Ordyniak
2015 — conf
Algorithmic Applications of Tree-Cut Width.
MFCS (2)
Robert Ganian, Eun Jung Kim, Stefan Szeider
2015 A conf
Community Structure Inspired Algorithms for SAT and #SAT.
SAT
Robert Ganian, Stefan Szeider
2015 J jnl
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting.
CoRR
Robert Ganian, M. S. Ramanujan, Stefan Szeider
2015 J jnl
FO Model Checking of Interval Graphs
Log. Methods Comput. Sci.
Robert Ganian, Petr Hlinený, Daniel Král, Jan Obdrzálek, Jarett Schwartz, Jakub Teska
2015 J jnl
Improving Vertex Cover as a Graph Parameter.
Discret. Math. Theor. Comput. Sci.
Robert Ganian
2015 J jnl
Meta-Kernelization using Well-Structured Modulators.
CoRR
Eduard Eiben, Robert Ganian, Stefan Szeider
2015 B conf
Meta-kernelization using Well-structured Modulators.
IPEC
Eduard Eiben, Robert Ganian, Stefan Szeider
2015 C conf
On the Complexity of Rainbow Coloring Problems.
IWOCA
Eduard Eiben, Robert Ganian, Juho Lauri
2015 J jnl
On the Complexity of Rainbow Coloring Problems.
CoRR
Eduard Eiben, Robert Ganian, Juho Lauri
2015 C conf
Parameterized Complexity of Asynchronous Border Minimization.
TAMC
Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa
2015 J jnl
Parameterized Complexity of Asynchronous Border Minimization.
CoRR
Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa
2015 J jnl
Polynomial-time Construction of Optimal Tree-structured Communication Data Layout Descriptions.
CoRR
Robert Ganian, Martin Kalany, Stefan Szeider, Jesper Larsson Träff
2015 B conf
Solving Problems on Graphs of High Rank-Width.
WADS
Eduard Eiben, Robert Ganian, Stefan Szeider
2015 J jnl
Solving Problems on Graphs of High Rank-Width.
CoRR
Eduard Eiben, Robert Ganian, Stefan Szeider
2014 J jnl
Digraph width measures in parameterized algorithmics.
Discret. Appl. Math.
Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith
2014 J jnl
Lower bounds on the complexity of MSO
J. Comput. Syst. Sci.
Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
2014 J jnl
Model Checking Existential Logic on Partially Ordered Sets.
CoRR
Simone Bova, Robert Ganian, Stefan Szeider
2014 — conf
Model checking existential logic on partially ordered sets.
CSL-LICS
Simone Bova, Robert Ganian, Stefan Szeider
2014 B conf
Quantified Conjunctive Queries on Partially Ordered Sets.
IPEC
Simone Bova, Robert Ganian, Stefan Szeider
2014 J jnl
Quantified Conjunctive Queries on Partially Ordered Sets.
CoRR
Simone Bova, Robert Ganian, Stefan Szeider
2013 J jnl
A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width.
Eur. J. Comb.
Robert Ganian, Petr Hlinený, Jan Obdrzálek
2013 J jnl
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width.
Fundam. Informaticae
Robert Ganian, Petr Hlinený, Jan Obdrzálek
2013 C conf
Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes.
IWOCA
Robert Ganian, Jan Obdrzálek
2013 J jnl
Expanding the expressive power of Monadic Second-Order logic on restricted graph classes.
CoRR
Robert Ganian, Jan Obdrzálek
2013 — conf
FO Model Checking of Interval Graphs.
ICALP (2)
Robert Ganian, Petr Hlinený, Daniel Král', Jan Obdrzálek, Jarett Schwartz, Jakub Teska
2013 J jnl
Meta-Kernelization with Structural Parameters
CoRR
Robert Ganian, Friedrich Slivovsky, Stefan Szeider
2013 B conf
Meta-kernelization with Structural Parameters.
MFCS
Robert Ganian, Friedrich Slivovsky, Stefan Szeider
2012 A conf
Lower Bounds on the Complexity of MSO_1 Model-Checking.
STACS
Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
2012 J jnl
Using Neighborhood Diversity to Solve Hard Problems
CoRR
Robert Ganian
2012 B conf
When Trees Grow Low: Shrubs and Fast MSO1.
MFCS
Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez, Reshma Ramadurai
2011 A conf
Clique-width: When Hard Does Not Mean Impossible.
STACS
Robert Ganian, Petr Hlinený, Jan Obdrzálek
2011 J jnl
Lower Bounds on the Complexity of MSO1 Model-Checking
CoRR
Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
2011 B conf
New Results on the Complexity of the Max- and Min-Rep Problems.
SOFSEM
Robert Ganian
2011 B conf
Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics.
IPEC
Robert Ganian
2010 B conf
Are There Any Good Digraph Width Measures?
IPEC
Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
2010 J jnl
Are there any good digraph width measures?
CoRR
Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
2010 — conf
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width.
FSTTCS
Robert Ganian, Petr Hlinený, Jan Obdrzálek
2010 J jnl
Better algorithms for satisfiability problems for formulas of bounded rank-width
CoRR
Robert Ganian, Petr Hlinený, Jan Obdrzálek
2010 B conf
New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes.
SOFSEM
Robert Ganian, Petr Hlinený
2010 J jnl
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width.
Discret. Appl. Math.
Robert Ganian, Petr Hlinený
2010 C conf
Thread Graphs, Linear Rank-Width and Their Algorithmic Applications.
IWOCA
Robert Ganian
2009 C conf
Better Polynomial Algorithms on Graphs of Bounded Rank-Width.
IWOCA
Robert Ganian, Petr Hlinený
2009 — conf
On Digraph Width Measures in Parameterized Algorithmics.
IWPEC
Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith
2009 — conf
The Parameterized Complexity of Oriented Colouring.
MEMICS
Robert Ganian
2008 C conf
Automata approach to graphs of bounded rank-width.
IWOCA
Petr Hlinený, Robert Ganian