Robert Ganian
31 papers · 2017–2026 · 5 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+10 more ↓ Show less ↑
πΊοΈ Taxonomy Completionist (30) π Conference Polyglot Β· Silver π Academic Marathon Β· Sprint π Interdisciplinary Bridge Β· Silver π Grand Slam
π
Grand Slam
π
Keyword Champion
(2)
π§
Keyword Pioneer
π€
Dynamic Duo
(12)
ποΈ
Keyword Collector
(117)
π₯
Unstoppable Β· Silver
β‘
Prolific Year Β· Productive
π
Conference Pioneer
π
Renaissance Researcher
(6)
π
Century Club Β· Bronze
Top co-authors
Research topics
Mathematics & Optimization
(22)
Optimization
(19)
Machine Learning
(17)
Mathematics
(13)
Optimization & Theory
(13)
Computer Science
(10)
Foundations
(10)
Artificial Intelligence
(9)
Core AI
(8)
Core Methods
(6)
Application Areas
(2)
Computer Vision
(1)
Data Science & Analytics
(1)
Deep Learning
(1)
Knowledge & Reasoning
(1)
Keywords
parameterized complexity
(19)
fixed-parameter tractability
(5)
combinatorial optimization
(5)
polynomial time algorithm
(4)
complexity analysis
(4)
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 data
(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
A Structural Complexity Analysis of Hierarchical Task Network Planning
IJCAI 2025
Parameterized Complexity of Caching in Networks
AAAI 2025
The Complexity of Extending Fair Allocations of Indivisible Goods
AAAI 2025
The Computational Complexity of Positive Non-Clashing Teaching in Graphs
ICLR 2025
Training One-Dimensional Graph Neural Networks is NP-Hard
ICLR 2025
Revisiting Causal Discovery from a Complexity-Theoretic Perspective
IJCAI 2024
The Complexity of Optimizing Atomic Congestion
AAAI 2024
A Parameterized Theory of PAC Learning
AAAI 2023
A Structural Complexity Analysis of Synchronous Dynamical Systems
AAAI 2023
New Complexity-Theoretic Frontiers of Tractability for Neural Network Training
NeurIPS 2023
The Computational Complexity of Concise Hypersphere Classification
ICML 2023
The Parameterized Complexity of Network Microaggregation
AAAI 2023
Hedonic Diversity Games: A Complexity Picture with More than Two Colors
AAAI 2022
The Complexity of Envy-Free Graph Cutting
IJCAI 2022
The Complexity of k-Means Clustering when Little is Known
ICML 2022
The Complexity of Bayesian Network Learning: Revisiting the Superstructure
NeurIPS 2021
The Complexity of Object Association in Multiple Object Tracking
AAAI 2021
The Parameterized Complexity of Clustering Incomplete Data
AAAI 2021
The Parameterized Complexity of Connected Fair Division
IJCAI 2021
On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank
AAAI 2020
Parameterized Complexity of Envy-Free Resource Allocation in Social Networks
AAAI 2020
Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP
IJCAI 2020
The Complexity Landscape of Resource-Constrained Scheduling
IJCAI 2020
Threshold Treewidth and Hypertree Width
IJCAI 2020
Solving Integer Quadratic Programming via Explicit and Structural Restrictions
AAAI 2019
The Parameterized Complexity of Cascading Portfolio Scheduling
NeurIPS 2019
A Structural Approach to Activity Selection
IJCAI 2018
Parameterized Algorithms for the Matrix Completion Problem
ICML 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