Hendrik Molter
7 papers · 2019–2025 · 2 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+3 more ↓ Show less ↑
π Cross-Pollinator (15) πΊοΈ Taxonomy Completionist (13) π§ Keyword Pioneer π Conference Polyglot (2) π Academic Marathon (6)
π
Interdisciplinary Bridge
π
Conference Pioneer
β
The Questioner
(2)
Conferences
AAAI (4)
IJCAI (3)
Top co-authors
Keywords
computational complexity
(5)
temporal graph
(3)
combinatorial optimization
(2)
approximation algorithm
(2)
fixed-parameter tractable
(2)
knockout tournament
(2)
tournament design
(2)
disjoint path
(1)
parameterized algorithm
(1)
game theory
(1)
knapsack problem
(1)
network routing
(1)
deadline constraint
(1)
sliding window
(1)
parameterized complexity
(1)
multi-agent path finding
(1)
adaptive strategy
(1)
equitable scheduling
(1)
time-varying graph
(1)
polynomial hierarchy
(1)
Papers
Adaptive Manipulation for Coalitions in Knockout Tournaments
AAAI 2025
How to Make Knockout Tournaments More Popular?
AAAI 2024
Parameterized Analysis of Bribery in Challenge the Champ Tournaments
IJCAI 2024
In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?
IJCAI 2023
Equitable Scheduling on a Single Machine
AAAI 2021
Interference-free Walks in Time: Temporally Disjoint Paths
IJCAI 2021
Sliding Window Temporal Graph Coloring
AAAI 2019