← Authors

Robert Ganian

31 papers · 2017–2026 · 5 conferences · across top CS/AI conferences

Achievements

🧭 Keyword Pioneer πŸŒ‰ Interdisciplinary Bridge 🌈 Renaissance Researcher (7) 🌍 Conference Polyglot (5) πŸƒ Academic Marathon (8) πŸ—ΊοΈ Taxonomy Completionist (10) 🐝 Cross-Pollinator (6) πŸ† Keyword Champion (5) πŸ”¬ Deep Specialist (17) 🀝 Dynamic Duo (12) 🧬 Topic Evolution πŸ† Grand Slam πŸ—ƒοΈ Keyword Collector (113) ⚑ Prolific Year (5) πŸš€ Conference Pioneer πŸ’Ž Century Club (30) πŸ”₯ Unstoppable (9)

Conferences

AAAI (13) IJCAI (10) ICML (3) NIPS (3) ICLR (2)

Top co-authors

Eduard Eiben (12) Sebastian Ordyniak (12) Thekla Hamm (9) Stefan Szeider (7) Dusan Knop (5) Cornelius Brand (4) Iyad Kanj (4) Fionn Mc Inerney (4) Viktoriia Korchemna (4) Mathis Rocton (3)

Keywords

parameterized complexity (18) combinatorial optimization (5) fixed-parameter tractability (4) complexity analysis (4) polynomial-time algorithm (3) parameterized algorithm (3) fixed-parameter tractable (3) computational complexity (3) fixed-parameter algorithm (3) complexity theory (2) algorithmic game theory (2) clustering algorithm (2) incomplete datum (2) rank minimization (2) constraint satisfaction (2) integer linear programming (2) matrix completion (2) fair division (2) graph structure (1) network dynamics (1)

Papers

Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity AAAI 2026
The Computational Complexity of Positive Non-Clashing Teaching in Graphs ICLR 2025
Parameterized Complexity of Caching in Networks AAAI 2025
The Complexity of Extending Fair Allocations of Indivisible Goods AAAI 2025
Training One-Dimensional Graph Neural Networks is NP-Hard ICLR 2025
A Structural Complexity Analysis of Hierarchical Task Network Planning IJCAI 2025
Revisiting Causal Discovery from a Complexity-Theoretic Perspective IJCAI 2024
The Complexity of Optimizing Atomic Congestion AAAI 2024
The Parameterized Complexity of Network Microaggregation AAAI 2023
A Structural Complexity Analysis of Synchronous Dynamical Systems AAAI 2023
A Parameterized Theory of PAC Learning AAAI 2023
New Complexity-Theoretic Frontiers of Tractability for Neural Network Training NIPS 2023
The Computational Complexity of Concise Hypersphere Classification ICML 2023
The Complexity of Envy-Free Graph Cutting IJCAI 2022
The Complexity of k-Means Clustering when Little is Known ICML 2022
Hedonic Diversity Games: A Complexity Picture with More than Two Colors AAAI 2022
The Complexity of Object Association in Multiple Object Tracking AAAI 2021
The Parameterized Complexity of Clustering Incomplete Data AAAI 2021
The Complexity of Bayesian Network Learning: Revisiting the Superstructure NIPS 2021
The Parameterized Complexity of Connected Fair Division IJCAI 2021
Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP IJCAI 2020
Threshold Treewidth and Hypertree Width IJCAI 2020
Parameterized Complexity of Envy-Free Resource Allocation in Social Networks AAAI 2020
On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank AAAI 2020
The Complexity Landscape of Resource-Constrained Scheduling IJCAI 2020
Solving Integer Quadratic Programming via Explicit and Structural Restrictions AAAI 2019
The Parameterized Complexity of Cascading Portfolio Scheduling NIPS 2019
Parameterized Algorithms for the Matrix Completion Problem ICML 2018
A Structural Approach to Activity Selection IJCAI 2018
Unary Integer Linear Programming with Structural Restrictions IJCAI 2018
Solving Integer Linear Programs with a Small Number of Global Variables and Constraints IJCAI 2017