Hendrik Molter
7 papers · 2019–2025 · 2 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 ↓+2 more ↓ Show less ↑
πΊοΈ Taxonomy Completionist (12) π Academic Marathon Β· Sprint π Conference Polyglot Β· Bronze π Interdisciplinary Bridge Β· Silver π§ Keyword Pioneer
π
Conference Pioneer
β
The Questioner
(2)
Top co-authors
Research topics
Keywords
computational complexity
(5)
temporal graph
(3)
fixed-parameter tractable
(2)
tournament design
(2)
approximation algorithm
(2)
knockout tournament
(2)
combinatorial optimization
(2)
knapsack problem
(1)
network routing
(1)
deadline constraint
(1)
sliding window
(1)
parameterized complexity
(1)
multi-agent path finding
(1)
fixed-parameter tractability
(1)
adaptive strategy
(1)
time-varying graph
(1)
polynomial hierarchy
(1)
complete binary tree
(1)
match score
(1)
tournament seeding
(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