Robert Ganian

Algorithms and Complexity group , TU Wien , Austria

10 papers in the IJCAI proceedings

IJCAI 2025

A Structural Complexity Analysis of Hierarchical Task Network Planning

with Cornelius Brand, Fionn Mc Inerney, Simon Wietheger

doi:10.24963/ijcai.2025/489

Details PDF

IJCAI 2024

Revisiting Causal Discovery from a Complexity-Theoretic Perspective

with Viktoriia Korchemna, Stefan Szeider

doi:10.24963/ijcai.2024/374

Details PDF

IJCAI 2022

The Complexity of Envy-Free Graph Cutting

with Argyrios Deligkas, Eduard Eiben, Thekla Hamm, Sebastian Ordyniak

doi:10.24963/ijcai.2022/34

Details PDF

IJCAI 2021

The Parameterized Complexity of Connected Fair Division

with Argyrios Deligkas, Eduard Eiben, Thekla Hamm, Sebastian Ordyniak

doi:10.24963/ijcai.2021/20

Details PDF

IJCAI 2020

Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP

with Jiehua Chen, Thekla Hamm

doi:10.24963/ijcai.2020/21

Details PDF

The Complexity Landscape of Resource-Constrained Scheduling

with Thekla Hamm, Guillaume Mescoff

doi:10.24963/ijcai.2020/241

Details PDF

Threshold Treewidth and Hypertree Width

with Andre Schidler, Manuel Sorge, Stefan Szeider

doi:10.24963/ijcai.2020/263

Details PDF

IJCAI 2018

A Structural Approach to Activity Selection

with Eduard Eiben, Sebastian Ordyniak

doi:10.24963/ijcai.2018/28

Details PDF

Unary Integer Linear Programming with Structural Restrictions

with Eduard Eiben, Dušan Knop, Sebastian Ordyniak

doi:10.24963/ijcai.2018/179

Details PDF

IJCAI 2017

Solving Integer Linear Programs with a Small Number of Global Variables and Constraints

with Pavel Dvořák, Eduard Eiben, Dušan Knop, Sebastian Ordyniak

doi:10.24963/ijcai.2017/85

Details PDF

Future Conferences

AI Journal Division

IJCAI Proceedings