48 citations · 356 across the 69 of their papers we have counts for
105 papers
Parameterized Algorithms for Colored Clustering
Leon Kellerhals, Tomohiro Koana, Pascal Kunz +1
In the Colored Clustering problem, one is asked to cluster edge-colored (hyper-)graphs whose colors represent interaction types. More specifically, the goal is to select as many ed…
Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions
Klaus Heeger, André Nichterlein, Rolf Niedermeier
We provide a general framework to exclude parameterized running times of the form for problems that have polynomial running time lower bounds under hypotheses from…
A Quantitative and Qualitative Analysis of the Robustness of (Real-World) Election Winners
Niclas Boehmer, Robert Bredereck, Piotr Faliszewski +1
Contributing to the toolbox for interpreting election results, we evaluate the robustness of election winners to random noise. We compare the robustness of different voting rules a…
Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems
Niclas Boehmer, Klaus Heeger, Rolf Niedermeier
When computing stable matchings, it is usually assumed that the preferences of the agents in the matching market are fixed. However, in many realistic scenarios, preferences change…
There and Back Again: On Applying Data Reduction Rules by Undoing Others
Aleksander Figiel, Vincent Froese, André Nichterlein +1
Data reduction rules are an established method in the algorithmic toolbox for tackling computationally challenging problems. A data reduction rule is a polynomial-time algorithm th…
Understanding Distance Measures Among Elections
Niclas Boehmer, Piotr Faliszewski, Rolf Niedermeier +2
Motivated by putting empirical work based on (synthetic) election data on a more solid mathematical basis, we analyze six distances among elections, including, e.g., the challengin…