Rolf Niedermeier
20 papers · 2015–2023 · 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 ↓+5 more ↓ Show less ↑
π Interdisciplinary Bridge Β· Silver πΊοΈ Taxonomy Completionist (21) π Conference Polyglot Β· Bronze π Academic Marathon Β· Sprint π Keyword Champion (2)
π€
Dynamic Duo
(11)
ποΈ
Keyword Collector
(77)
π₯
Unstoppable Β· Bronze
β‘
Prolific Year Β· Productive
π
Century Club Β· Bronze
Venues
Top co-authors
Research topics
Keywords
computational complexity
(6)
parameterized complexity
(5)
parameterized algorithm
(4)
fixed-parameter tractability
(3)
swap distance
(2)
vertex-colored graph
(2)
stable matching
(2)
temporal graph
(2)
graph theory
(2)
voting rule
(2)
combinatorial optimization
(2)
multiwinner election
(2)
np-hard problem
(2)
graph algorithm
(2)
fairness constraint
(2)
incremental algorithm
(2)
social network
(1)
approximation algorithm
(1)
discrete optimization
(1)
influence maximization
(1)
Papers
Fair Short Paths in Vertex-Colored Graphs
AAAI 2023
Parameterized Algorithms for Colored Clustering
AAAI 2023
Modification-Fair Cluster Editing
AAAI 2022
On Improving Resource Allocations by Sharing
AAAI 2022
Theory of and Experiments on Minimally Invasive Stability Preservation in Changing Two-Sided Matching Markets
AAAI 2022
Understanding Distance Measures Among Elections
IJCAI 2022
A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem
AAAI 2021
Equitable Scheduling on a Single Machine
AAAI 2021
Interference-free Walks in Time: Temporally Disjoint Paths
IJCAI 2021
Putting a Compass on the Map of Elections
IJCAI 2021
Two Influence Maximization Games on Graphs Made Temporal
IJCAI 2021
Winner Robustness via Swap- and Shift-Bribery: Parameterized Counting Complexity and Experiments
IJCAI 2021
Adapting Stable Matchings to Evolving Preferences
AAAI 2020
Electing Successive Committees: Complexity and Algorithms
AAAI 2020
Parameterized Algorithms for Finding a Collective Set of Items
AAAI 2020
An Experimental View on Committees Providing Justified Representation
IJCAI 2019
On Coalitional Manipulation for Multiwinner Elections: Shortlisting
IJCAI 2017
Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels
IJCAI 2016
H-Index Manipulation by Merging Articles: Models, Theory, and Experiments
IJCAI 2015
Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty
IJCAI 2015