Automata approach to graphs of bounded rank-width. - Petr Hlinený; Robert Ganian (IWOCA, 2008)

Better Polynomial Algorithms on Graphs of Bounded Rank-Width. - Robert Ganian; Petr Hlinený (IWOCA, 2009)

The Parameterized Complexity of Oriented Colouring. - Robert Ganian (MEMICS, 2009)

Thread Graphs, Linear Rank-Width and Their Algorithmic Applications. - Robert Ganian (IWOCA, 2010)

New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes. - Robert Ganian; Petr Hlinený (SOFSEM, 2010)

On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width. - Robert Ganian; Petr Hlinený (Discret. Appl. Math., 2010)

Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics. - Robert Ganian (IPEC, 2011)

New Results on the Complexity of the Max- and Min-Rep Problems. - Robert Ganian (SOFSEM, 2011)

Clique-width: When Hard Does Not Mean Impossible. - Robert Ganian; Petr Hlinený; Jan Obdrzálek (STACS, 2011)

Lower Bounds on the Complexity of MSO1 Model-Checking - Robert Ganian; Petr Hlinený; Alexander Langer; Jan Obdrzálek; Peter Rossmanith; Somnath Sikdar (CoRR, 2011)

When Trees Grow Low: Shrubs and Fast MSO1. - Robert Ganian; Petr Hlinený; Jaroslav Nesetril; Jan Obdrzálek; Patrice Ossona de Mendez; Reshma Ramadurai (MFCS, 2012)

Lower Bounds on the Complexity of MSO_1 Model-Checking. - Robert Ganian; Petr Hlinený; Alexander Langer; Jan Obdrzálek; Peter Rossmanith; Somnath Sikdar (STACS, 2012)

Using Neighborhood Diversity to Solve Hard Problems - Robert Ganian (CoRR, 2012)

Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes. - Robert Ganian; Jan Obdrzálek (IWOCA, 2013)

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

Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width. - Robert Ganian; Petr Hlinený; Jan Obdrzálek (Fundam. Informaticae, 2013)

Digraph width measures in parameterized algorithmics. - Robert Ganian; Petr Hlinený; Joachim Kneis; Alexander Langer; Jan Obdrzálek; Peter Rossmanith (Discret. Appl. Math., 2014)

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., 2014)

Community Structure Inspired Algorithms for SAT and #SAT. - Robert Ganian; Stefan Szeider (SAT, 2015)

Polynomial-time Construction of Optimal Tree-structured Communication Data Layout Descriptions. - Robert Ganian; Martin Kalany; Stefan Szeider; Jesper Larsson Träff (CoRR, 2015)

FO Model Checking of Interval Graphs - Robert Ganian; Petr Hlinený; Daniel Král; Jan Obdrzálek; Jarett Schwartz; Jakub Teska (Log. Methods Comput. Sci., 2015)

Improving Vertex Cover as a Graph Parameter. - Robert Ganian (Discret. Math. Theor. Comput. Sci., 2015)

Backdoors to Tractable Valued CSP. - Robert Ganian; M. S. Ramanujan 001; Stefan Szeider (CP, 2016)

Polynomial-Time Construction of Optimal MPI Derived Datatype Trees. - Robert Ganian; Martin Kalany; Stefan Szeider; Jesper Larsson Träff (IPDPS, 2016)

Meta-kernelization with structural parameters. - Robert Ganian; Friedrich Slivovsky; Stefan Szeider (J. Comput. Syst. Sci., 2016)

Are there any good digraph width measures? - Robert Ganian; Petr Hlinený; Joachim Kneis; Daniel Meister 001; Jan Obdrzálek; Peter Rossmanith; Somnath Sikdar (J. Comb. Theory B, 2016)

Quantified conjunctive queries on partially ordered sets. - Simone Bova; Robert Ganian; Stefan Szeider (Theor. Comput. Sci., 2016)

Model Checking Existential Logic on Partially Ordered Sets. - Simone Bova; Robert Ganian; Stefan Szeider (ACM Trans. Comput. Log., 2016)

Going Beyond Primal Treewidth for (M)ILP. - Robert Ganian; Sebastian Ordyniak; M. S. Ramanujan 001 (AAAI, 2017)

Solving Integer Linear Programs with a Small Number of Global Variables and Constraints. - Pavel Dvorák; Eduard Eiben; Robert Ganian; Dusan Knop; Sebastian Ordyniak (IJCAI, 2017)

Backdoor Treewidth for SAT. - Robert Ganian; M. S. Ramanujan 001; Stefan Szeider (SAT, 2017)

New Width Parameters for Model Counting. - Robert Ganian; Stefan Szeider (SAT, 2017)

Combining Treewidth and Backdoors for CSP. - Robert Ganian; M. S. Ramanujan 001; Stefan Szeider (STACS, 2017)

Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. - Robert Ganian; M. S. Ramanujan 001; Stefan Szeider (ACM Trans. Algorithms, 2017)

Parameterized Algorithms for the Matrix Completion Problem. - Robert Ganian; Iyad A. Kanj; Sebastian Ordyniak; Stefan Szeider (ICML, 2018)

Unary Integer Linear Programming with Structural Restrictions. - Eduard Eiben; Robert Ganian; Dusan Knop; Sebastian Ordyniak (IJCAI, 2018)

A Structural Approach to Activity Selection. - Eduard Eiben; Robert Ganian; Sebastian Ordyniak (IJCAI, 2018)

Small Resolution Proofs for QBF using Dependency Treewidth. - Eduard Eiben; Robert Ganian; Sebastian Ordyniak (STACS, 2018)

The complexity landscape of decompositional parameters for ILP. - Robert Ganian; Sebastian Ordyniak (Artif. Intell., 2018)

Solving Problems on Graphs of High Rank-Width. - Eduard Eiben; Robert Ganian; Stefan Szeider (Algorithmica, 2018)

On the complexity of rainbow coloring problems. - Eduard Eiben; Robert Ganian; Juho Lauri (Discret. Appl. Math., 2018)

Meta-kernelization using well-structured modulators. - Eduard Eiben; Robert Ganian; Stefan Szeider (Discret. Appl. Math., 2018)

A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. - Eduard Eiben; Robert Ganian; O-joung Kwon (J. Comput. Syst. Sci., 2018)

Solving Integer Quadratic Programming via Explicit and Structural Restrictions. - Eduard Eiben; Robert Ganian; Dusan Knop; Sebastian Ordyniak (AAAI, 2019)

SAT-Encodings for Treecut Width and Treedepth. - Robert Ganian; Neha Lodha; Sebastian Ordyniak; Stefan Szeider (ALENEX, 2019)

A Join-Based Hybrid Parameter for Constraint Satisfaction. - Robert Ganian; Sebastian Ordyniak; Stefan Szeider (CP, 2019)

Integer Programming and Incidence Treedepth. - Eduard Eiben; Robert Ganian; Dusan Knop; Sebastian Ordyniak; Michal Pilipczuk; Marcin Wrochna (IPCO, 2019)

The Parameterized Complexity of Cascading Portfolio Scheduling. - Eduard Eiben; Robert Ganian; Iyad Kanj; Stefan Szeider (NeurIPS, 2019)

Counting Linear Extensions: Parameterizations by Treewidth. - Eduard Eiben; Robert Ganian; Kustaa Kangas; Sebastian Ordyniak (Algorithmica, 2019)

Parameterized Complexity of Asynchronous Border Minimization. - Robert Ganian; Martin Kronegger; Andreas Pfandler; Alexandru Popa 001 (Algorithmica, 2019)

On the Complexity Landscape of Connected f-Factor Problems. - Robert Ganian; N. S. Narayanaswamy; Sebastian Ordyniak; C. S. Rahul 001; M. S. Ramanujan 001 (Algorithmica, 2019)

Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey. - Robert Ganian; Sebastian Ordyniak (Algorithms, 2019)

On Clustering Incomplete Data. - Eduard Eiben; Robert Ganian; Iyad Kanj; Sebastian Ordyniak; Stefan Szeider (CoRR, 2019)

Shrub-depth: Capturing Height of Dense Graphs. - Robert Ganian; Petr Hlinený; Jaroslav Nesetril; Jan Obdrzálek; Patrice Ossona de Mendez (Log. Methods Comput. Sci., 2019)

On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank. - Robert Ganian; Iyad Kanj; Sebastian Ordyniak; Stefan Szeider (AAAI, 2020)

Extending Partial 1-Planar Drawings. - Eduard Eiben; Robert Ganian; Thekla Hamm; Fabian Klute; Martin Nöllenburg (ICALP, 2020)

Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP. - Jiehua Chen 001; Robert Ganian; Thekla Hamm (IJCAI, 2020)

The Complexity Landscape of Resource-Constrained Scheduling. - Robert Ganian; Thekla Hamm; Guillaume Mescoff (IJCAI, 2020)

Fixed-Parameter Tractability of Dependency QBF with Structural Parameters. - Robert Ganian; Tomás Peitl; Friedrich Slivovsky; Stefan Szeider (KR, 2020)

Extending Nearly Complete 1-Planar Drawings in Polynomial Time. - Eduard Eiben; Robert Ganian; Thekla Hamm; Fabian Klute; Martin Nöllenburg (MFCS, 2020)

Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada. - Derek G. Corneil; Robert Ganian; Andrzej Proskurowski (Discret. Appl. Math., 2020)

Using decomposition-parameters for QBF: Mind the prefix! - Eduard Eiben; Robert Ganian; Sebastian Ordyniak (J. Comput. Syst. Sci., 2020)

Parameterized Algorithms for Book Embedding Problems. - Sujoy Bhore; Robert Ganian; Fabrizio Montecchiani; Martin Nöllenburg (J. Graph Algorithms Appl., 2020)

On Existential MSO and Its Relation to ETH. - Robert Ganian; Ronald de Haan; Iyad Kanj; Stefan Szeider (ACM Trans. Comput. Theory, 2020)

The Parameterized Complexity of Clustering Incomplete Data. - Eduard Eiben; Robert Ganian; Iyad Kanj; Sebastian Ordyniak; Stefan Szeider (AAAI, 2021)

The Complexity of Object Association in Multiple Object Tracking. - Robert Ganian; Thekla Hamm; Sebastian Ordyniak (AAAI, 2021)

Crossing-Optimal Extension of Simple Drawings. - Robert Ganian; Thekla Hamm; Fabian Klute; Irene Parada; Birgit Vogtenhuber (ICALP, 2021)

The Parameterized Complexity of Connected Fair Division. - Argyrios Deligkas; Eduard Eiben; Robert Ganian; Thekla Hamm; Sebastian Ordyniak (IJCAI, 2021)

Graphs with Two Moplexes. - Clément Dallard; Robert Ganian; Meike Hatzel; Matjaz Krnc; Martin Milanic (LAGOS, 2021)

The Complexity of Bayesian Network Learning: Revisiting the Superstructure. - Robert Ganian; Viktoriia Korchemna (NeurIPS, 2021)

The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints. - Pavel Dvorák; Eduard Eiben; Robert Ganian; Dusan Knop; Sebastian Ordyniak (Artif. Intell., 2021)

New width parameters for SAT and #SAT. - Robert Ganian; Stefan Szeider (Artif. Intell., 2021)

Towards a Polynomial Kernel for Directed Feedback Vertex Set. - Benjamin Bergougnoux; Eduard Eiben; Robert Ganian; Sebastian Ordyniak; M. S. Ramanujan 001 (Algorithmica, 2021)

On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem. - Robert Ganian; Fabian Klute; Sebastian Ordyniak (Algorithmica, 2021)

The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths. - Robert Ganian; Sebastian Ordyniak (Algorithmica, 2021)

On Structural Parameterizations of the Edge Disjoint Paths Problem. - Robert Ganian; Sebastian Ordyniak; M. S. Ramanujan 001 (Algorithmica, 2021)

Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293). - Robert Ganian; Fabrizio Montecchiani; Martin Nöllenburg; Meirav Zehavi (Dagstuhl Reports, 2021)

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

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

Parameterized Algorithms for Upward Planarity. - Steven Chaplick; Emilio Di Giacomo; Fabrizio Frati; Robert Ganian; Chrysanthi N. Raftopoulou; Kirill Simonov (SoCG, 2022)

Finding a Cluster in Incomplete Data. - Eduard Eiben; Robert Ganian; Iyad Kanj; Sebastian Ordyniak; Stefan Szeider (ESA, 2022)

Testing Upward Planarity of Partial 2-Trees. - Steven Chaplick; Emilio Di Giacomo; Fabrizio Frati; Robert Ganian; Chrysanthi N. Raftopoulou; Kirill Simonov (GD, 2022)

The Complexity of k-Means Clustering when Little is Known. - Robert Ganian; Thekla Hamm; Viktoriia Korchemna; Karolina Okrasa; Kirill Simonov (ICML, 2022)

The Complexity of Envy-Free Graph Cutting. - Argyrios Deligkas; Eduard Eiben; Robert Ganian; Thekla Hamm; Sebastian Ordyniak (IJCAI, 2022)

A Unifying Framework for Characterizing and Computing Width Measures. - Eduard Eiben; Robert Ganian; Thekla Hamm; Lars Jaffke; O-joung Kwon (ITCS, 2022)

Weighted Model Counting with Twin-Width. - Robert Ganian; Filip Pokrývka; André Schidler; Kirill Simonov; Stefan Szeider (SAT, 2022)

Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts. - Cornelius Brand; Esra Ceylan; Robert Ganian; Christian Hatschka; Viktoriia Korchemna (WG, 2022)

An efficient algorithm for counting Markov equivalent DAGs. - Robert Ganian; Thekla Hamm; Topi Talvitie (Artif. Intell., 2022)

Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria. - Robert Ganian; Jan Kratochvíl; Stefan Szeider (Discret. Appl. Math., 2022)

Sum-of-Products with Default Values: Algorithms and Complexity Results. - Robert Ganian; Eun Jung Kim 002; Friedrich Slivovsky; Stefan Szeider (J. Artif. Intell. Res., 2022)

Threshold Treewidth and Hypertree Width. - Robert Ganian; André Schidler; Manuel Sorge; Stefan Szeider (J. Artif. Intell. Res., 2022)

Parameterized Algorithms for Queue Layouts. - Sujoy Bhore; Robert Ganian; Fabrizio Montecchiani; Martin Nöllenburg (J. Graph Algorithms Appl., 2022)

On Covering Segments with Unit Intervals. - Dan Bergren; Eduard Eiben; Robert Ganian; Iyad Kanj (SIAM J. Discret. Math., 2022)

Weighted Model Counting with Twin-Width: Experimental Results. - Robert Ganian; Filip Pokrývka; André Schidler; Kirill Simonov; Stefan Szeider (Zenodo, 2022)

Algorithmic Applications of Tree-Cut Width. - Robert Ganian; Eun Jung Kim 002; Stefan Szeider (SIAM J. Discret. Math., 2022)

The Parameterized Complexity of Network Microaggregation. - Václav Blazej; Robert Ganian; Dusan Knop; Jan Pokorný; Simon Schierreich; Kirill Simonov (AAAI, 2023)

A Parameterized Theory of PAC Learning. - Cornelius Brand; Robert Ganian; Kirill Simonov (AAAI, 2023)

A Structural Complexity Analysis of Synchronous Dynamical Systems. - Eduard Eiben; Robert Ganian; Thekla Hamm; Viktoriia Korchemna (AAAI, 2023)

Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable. - Sujoy Bhore; Robert Ganian; Liana Khazaliya; Fabrizio Montecchiani; Martin Nöllenburg (SoCG, 2023)

The Parameterized Complexity of Coordinated Motion Planning. - Eduard Eiben; Robert Ganian; Iyad Kanj (SoCG, 2023)

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 (ESA, 2023)

Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs. - Cornelius Brand; Robert Ganian; Sebastian Röder; Florian Schager (GD (2), 2023)

The Computational Complexity of Concise Hypersphere Classification. - Eduard Eiben; Robert Ganian; Iyad A. Kanj; Sebastian Ordyniak; Stefan Szeider (ICML, 2023)

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 (IPEC, 2023)

Consistency Checking Problems: A Gateway to Parameterized Sample Complexity. - Robert Ganian; Liana Khazaliya; Kirill Simonov (IPEC, 2023)

Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF. - Johannes Klaus Fichte; Robert Ganian; Markus Hecher; Friedrich Slivovsky; Sebastian Ordyniak (LICS, 2023)

New Complexity-Theoretic Frontiers of Tractability for Neural Network Training. - Cornelius Brand; Robert Ganian; Mathis Rocton (NeurIPS, 2023)

Parameterized complexity of envy-free resource allocation in social networks. - Eduard Eiben; Robert Ganian; Thekla Hamm; Sebastian Ordyniak (Artif. Intell., 2023)

Approximate Evaluation of Quantitative Second Order Queries. - Jan Dreier; Robert Ganian; Thekla Hamm (CoRR, 2023)

Maximizing Social Welfare in Score-Based Social Distance Games. - Robert Ganian; Thekla Hamm; Dusan Knop; Sanjukta Roy 001; Simon Schierreich; Ondrej Suchý 001 (TARK, 2023)

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

Group Activity Selection with Few Agent Types. - Robert Ganian; Sebastian Ordyniak; C. S. Rahul 001 (Algorithmica, 2023)

On the parameterized complexity of clustering problems for incomplete data. - Eduard Eiben; Robert Ganian; Iyad Kanj; Sebastian Ordyniak; Stefan Szeider (J. Comput. Syst. Sci., 2023)

Worbel: Aggregating Point Labels into Word Clouds. - Sujoy Bhore; Robert Ganian; Guangping Li 001; Martin Nöllenburg; Jules Wulms (ACM Trans. Spatial Algorithms Syst., 2023)

Hedonic diversity games: A complexity picture with more than two colors. - Robert Ganian; Thekla Hamm; Dusan Knop; Simon Schierreich; Ondrej Suchý 001 (Artif. Intell., 2023)

The Parameterized Complexity Of Extending Stack Layouts. - Thomas Depian; Simon D. Fink; Robert Ganian; Martin Nöllenburg (GD, 2024)

Minimizing Switches in Cased Graph Drawings (Poster Abstract). - Robert Ganian; Martin Nöllenburg; Sebastian Röder (GD, 2024)

Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. - Argyrios Deligkas; Eduard Eiben; Robert Ganian; Iyad Kanj; M. S. Ramanujan 001 (ICALP, 2024)

A Tight Subexponential-Time Algorithm for Two-Page Book Embedding. - Robert Ganian; Haiko Müller; Sebastian Ordyniak; Giacomo Paesani; Mateusz Rychlicki (ICALP, 2024)

Revisiting Causal Discovery from a Complexity-Theoretic Perspective. - Robert Ganian; Viktoriia Korchemna; Stefan Szeider (IJCAI, 2024)

Exact Algorithms for Clustered Planarity with Linear Saturators. - Giordano Da Lozzo; Robert Ganian; Siddharth Gupta 002; Bojan Mohar; Sebastian Ordyniak; Meirav Zehavi (ISAAC, 2024)

Twin-Width Meets Feedback Edges and Vertex Integrity. - Jakub Balabán; Robert Ganian; Mathis Rocton (IPEC, 2024)

Computing Twin-Width Parameterized by the Feedback Edge Number. - Jakub Balabán; Robert Ganian; Mathis Rocton (STACS, 2024)

The Parameterized Complexity Landscape of the Unsplittable Flow Problem. - Robert Ganian; Mathis Rocton; Daniel Unterberger (WG, 2024)

The Boundaries of Tractability in Hierarchical Task Network Planning. - Cornelius Brand; Robert Ganian; Fionn Mc Inerney; Simon Wietheger (CoRR, 2024)

Parameterized Complexity of Efficient Sortation. - Robert Ganian; Hung P. Hoang 001; Simon Wietheger (CoRR, 2024)

Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs. - Cornelius Brand; Robert Ganian; Sebastian Röder; Florian Schager (J. Graph Algorithms Appl., 2024)

Graphs with at most two moplexes. - Clément Dallard; Robert Ganian; Meike Hatzel; Matjaz Krnc; Martin Milanic (J. Graph Theory, 2024)

Bounding and Computing Obstacle Numbers of Graphs. - Martin Balko; Steven Chaplick; Robert Ganian; Siddharth Gupta 002; Michael Hoffmann 001; Pavel Valtr 001; Alexander Wolff 001 (SIAM J. Discret. Math., 2024)

The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. - Robert Ganian; Thekla Hamm; Viktoriia Korchemna; Karolina Okrasa; Kirill Simonov (ACM Trans. Algorithms, 2024)

Slim Tree-Cut Width. - Robert Ganian; Viktoriia Korchemna (Algorithmica, 2024)

The Complexity of Extending Fair Allocations of Indivisible Goods. - Argyrios Deligkas; Eduard Eiben; Robert Ganian; Tiger-Lily Goldsmith; Stavros D. Ioannidis (AAAI, 2025)

Parameterized Complexity of Caching in Networks. - Robert Ganian; Fionn Mc Inerney; Dimitra Tsigkari (AAAI, 2025)

A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robots. - Eduard Eiben; Robert Ganian; Iyad Kanj; M. S. Ramanujan 001 (SoCG, 2025)

The Computational Complexity of Positive Non-Clashing Teaching in Graphs. - Robert Ganian; Liana Khazaliya; Fionn Mc Inerney; Mathis Rocton (ICLR, 2025)

Training One-Dimensional Graph Neural Networks is NP-Hard. - Robert Ganian; Mathis Rocton; Simon Wietheger (ICLR, 2025)

Parameterized Algorithms for Multiagent Pathfinding on Trees. - Argyrios Deligkas; Eduard Eiben; Robert Ganian; Iyad Kanj; M. S. Ramanujan 001 (AAMAS, 2025)

Pathways to Tractability for Geometric Thickness. - Thomas Depian; Simon Dominik Fink; Alexander Firbas; Robert Ganian; Martin Nöllenburg (SOFSEM (1), 2025)

Crossing and Independent Families Among Polygons. - Anna Brötzner; Robert Ganian; Thekla Hamm; Fabian Klute; Irene Parada (WADS, 2025)

Routing Few Robots in a Crowded Network. - Argyrios Deligkas; Eduard Eiben; Robert Ganian; Iyad Kanj; Dominik Leko; M. S. Ramanujan 001 (WADS, 2025)

The complexity of optimizing atomic congestion. - Cornelius Brand; Robert Ganian; Subrahmanyam Kalyanasundaram; Fionn Mc Inerney (Artif. Intell., 2025)

Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees. - Narek Bojikian; Alexander Firbas; Robert Ganian; Hung P. Hoang 001; Krisztina Szilágyi (CoRR, 2025)

The Peculiarities of Extending Queue Layouts. - Thomas Depian; Simon D. Fink; Robert Ganian; Martin Nöllenburg (CoRR, 2025)