Rolf Niedermeier

ORCID

Publication Activity (10 Years)

Years Active: 1990-2024
Publications (10 Years): 241

Top Venues

CoRR

AAAI

IJCAI

J. Comput. Syst. Sci.

University of Tübingen, Germany (PHD)

Education History

University of Tübingen, Germany

PHD

Publications

Sebastian Buß, Hendrik Molter, Rolf Niedermeier, Maciej Rymar
Algorithmic aspects of temporal betweenness. Netw. Sci. 12 (2) (2024)
Vincent Froese, Leon Kellerhals, Rolf Niedermeier
Modification-fair cluster editing. Soc. Netw. Anal. Min. 14 (1) (2024)
Danny Hermelin, Leon Kellerhals, Rolf Niedermeier, Rami Pugatch
Approximating sparse quadratic programs. Theor. Comput. Sci. 984 (2024)
Luca Kreisel, Niclas Boehmer, Vincent Froese, Rolf Niedermeier
Equilibria in schelling games: computational hardness and robustness. Auton. Agents Multi Agent Syst. 38 (1) (2024)
Matthias Bentert, Leon Kellerhals, Rolf Niedermeier
The Structural Complexity Landscape of Finding Balance-Fair Shortest Paths. CoRR (2024)
Anne-Sophie Himmel, George B. Mertzios, André Nichterlein, Rolf Niedermeier
Fast Parameterized Preprocessing for Polynomial-Time Solvable Graph Problems. Commun. ACM 67 (4) (2024)
Robert Bredereck, Andrzej Kaczmarczyk, Junjie Luo, Rolf Niedermeier, Florian Sachse
Improving Resource Allocations by Sharing in Pairs. J. Artif. Intell. Res. 78 (2023)
Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. J. Graph Algorithms Appl. 27 (3) (2023)
Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche
Multistage s-t Path: Confronting Similarity with Dissimilarity. Algorithmica 85 (7) (2023)
Niclas Boehmer, Tomohiro Koana, Rolf Niedermeier
A refined complexity analysis of fair districting over graphs. Auton. Agents Multi Agent Syst. 37 (1) (2023)
Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay
Equitable scheduling on a single machine. J. Sched. 26 (2) (2023)
Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier
A multivariate complexity analysis of the material consumption scheduling problem. J. Sched. 26 (4) (2023)
Tomohiro Koana, Vincent Froese, Rolf Niedermeier
The complexity of binary matrix completion under diameter constraints. J. Comput. Syst. Sci. 132 (2023)
Nicolas Maack, Hendrik Molter, Rolf Niedermeier, Malte Renken
On finding separators in temporal split and permutation graphs. J. Comput. Syst. Sci. 135 (2023)
Matthias Bentert, Leon Kellerhals, Rolf Niedermeier
Fair Short Paths in Vertex-Colored Graphs. AAAI (2023)
Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Rolf Niedermeier
Temporal interval cliques and independent sets. Theor. Comput. Sci. 961 (2023)
Matthias Bentert, Tomohiro Koana, Rolf Niedermeier
The complexity of gerrymandering over graphs: Paths and trees. Discret. Appl. Math. 324 (2023)
George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche
Computing maximum matchings in temporal graphs. J. Comput. Syst. Sci. 137 (2023)
Matthias Bentert, René van Bevern, Till Fluschnik, André Nichterlein, Rolf Niedermeier
Polynomial-time data reduction for weighted problems beyond additive goal functions. Discret. Appl. Math. 328 (2023)
Klaus Heeger, André Nichterlein, Rolf Niedermeier
Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions. STACS (2023)
Klaus Heeger, André Nichterlein, Rolf Niedermeier
Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions. CoRR (2023)
Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche
Interference-free walks in time: temporally disjoint paths. Auton. Agents Multi Agent Syst. 37 (1) (2023)
Leon Kellerhals, Tomohiro Koana, Pascal Kunz, Rolf Niedermeier
Parameterized Algorithms for Colored Clustering. CoRR (2023)
Leon Kellerhals, Tomohiro Koana, Pascal Kunz, Rolf Niedermeier
Parameterized Algorithms for Colored Clustering. AAAI (2023)
Robert Bredereck, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier
High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming. ECAI (2023)
Robert Bredereck, Andrzej Kaczmarczyk, Junjie Luo, Rolf Niedermeier, Florian Sachse
On Improving Resource Allocations by Sharing. AAAI (2022)
Till Fluschnik, Rolf Niedermeier, Valentin Rohm, Philipp Zschoche
Multistage Vertex Cover. Theory Comput. Syst. 66 (2) (2022)
Aleksander Figiel, Vincent Froese, André Nichterlein, Rolf Niedermeier
There and Back Again: On Applying Data Reduction Rules by Undoing Others. CoRR (2022)
Matthias Bentert, Leon Kellerhals, Rolf Niedermeier
The structural complexity landscape of finding balance-fair shortest paths. Theor. Comput. Sci. 933 (2022)
Vincent Froese, Christoph Hertrich, Rolf Niedermeier
The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality. J. Artif. Intell. Res. 74 (2022)
Luca Kreisel, Niclas Boehmer, Vincent Froese, Rolf Niedermeier
Equilibria in Schelling Games: Computational Hardness and Robustness. AAMAS (2022)
Laurent Bulteau, Mark Jones, Rolf Niedermeier, Till Tantau
An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions. CPM (2022)
Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier
Envy-free allocations respecting social networks. Artif. Intell. 305 (2022)
Niclas Boehmer, Piotr Faliszewski, Rolf Niedermeier, Stanislaw Szufa, Tomasz Was
Understanding Distance Measures Among Elections. IJCAI (2022)
Niclas Boehmer, Klaus Heeger, Rolf Niedermeier
Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems. CoRR (2022)
Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier
A Quantitative and Qualitative Analysis of the Robustness of (Real-World) Election Winners. EAAMO (2022)
Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken
Temporal Connectivity: Coping with Foreseen and Unforeseen Delays. SAND (2022)
Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken
Temporal Connectivity: Coping with Foreseen and Unforeseen Delays. CoRR (2022)
Niclas Boehmer, Klaus Heeger, Rolf Niedermeier
Theory of and Experiments on Minimally Invasive Stability Preservation in Changing Two-Sided Matching Markets. AAAI (2022)
Niclas Boehmer, Piotr Faliszewski, Rolf Niedermeier, Stanislaw Szufa, Tomasz Was
Understanding Distance Measures Among Elections. CoRR (2022)
Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier, Pavel V. Smirnov
Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments. INFORMS J. Comput. 34 (1) (2022)
Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken
Delay-Robust Routes in Temporal Graphs. STACS (2022)
Niclas Boehmer, Klaus Heeger, Rolf Niedermeier
Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems. MFCS (2022)
Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken
Delay-Robust Routes in Temporal Graphs. CoRR (2022)
Vincent Froese, Leon Kellerhals, Rolf Niedermeier
Modification-Fair Cluster Editing. AAAI (2022)
Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Rolf Niedermeier
Temporal Unit Interval Independent Sets. SAND (2022)
Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier
A Quantitative and Qualitative Analysis of the Robustness of (Real-World) Election Winners. CoRR (2022)
Hjalmar Schulz, André Nichterlein, Rolf Niedermeier, Christopher Weyand
Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial Time. IPEC (2022)
Roman Haag, Hendrik Molter, Rolf Niedermeier, Malte Renken
Feedback edge sets in temporal graphs. Discret. Appl. Math. 307 (2022)
Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier
Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters. Inf. Comput. 289 (Part) (2022)
Niclas Boehmer, Tomohiro Koana, Rolf Niedermeier
A Refined Complexity Analysis of Fair Districting over Graphs. AAMAS (2022)
Pascal Kunz, Till Fluschnik, Rolf Niedermeier, Malte Renken
Most Classic Problems Remain NP-Hard on Relative Neighborhood Graphs and Their Relatives. SWAT (2022)
Aleksander Figiel, Vincent Froese, André Nichterlein, Rolf Niedermeier
There and Back Again: On Applying Data Reduction Rules by Undoing Others. ESA (2022)
Matthias Bentert, Leon Kellerhals, Rolf Niedermeier
Finding Balance-Fair Short Paths in Graphs. CoRR (2022)
Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Stanislaw Szufa
Putting a Compass on the Map of Elections. CoRR (2021)
Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier
On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering. CIAC (2021)
Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier
A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem. AAAI (2021)
Robert Bredereck, Aleksander Figiel, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier
High-Multiplicity Fair Allocation Made More Practical. AAMAS (2021)
Niclas Boehmer, Vincent Froese, Julia Henkel, Yvonne Lasars, Rolf Niedermeier, Malte Renken
Two Influence Maximization Games on Graphs Made Temporal. IJCAI (2021)
Luca Kreisel, Niclas Boehmer, Vincent Froese, Rolf Niedermeier
Equilibria in Schelling Games: Computational Complexity and Robustness. CoRR (2021)
Niclas Boehmer, Klaus Heeger, Rolf Niedermeier
Theory of and Experiments on Minimally Invasive Stability Preservation in Changing Two-Sided Matching Markets. CoRR (2021)
Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon
Robustness among multiwinner voting rules. Artif. Intell. 290 (2021)
Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon
Complexity of Shift Bribery in Committee Elections. ACM Trans. Comput. Theory 13 (3) (2021)
Matthias Bentert, Tomohiro Koana, Rolf Niedermeier
The Complexity of Gerrymandering Over Graphs: Paths and Trees. CoRR (2021)
Vincent Froese, Christoph Hertrich, Rolf Niedermeier
The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality. CoRR (2021)
Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche
Interference-free Walks in Time: Temporally Disjoint Paths. CoRR (2021)
Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier
A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem. CoRR (2021)
Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier
On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering. J. Graph Algorithms Appl. 25 (1) (2021)
Danny Hermelin, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay
Equitable Scheduling for the Total Completion Time Objective. CoRR (2021)
Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay
Equitable Scheduling on a Single Machine. AAAI (2021)
Tomohiro Koana, Vincent Froese, Rolf Niedermeier
Binary Matrix Completion Under Diameter Constraints. STACS (2021)
Vincent Froese, Leon Kellerhals, Rolf Niedermeier
Modification-Fair Cluster Editing. CoRR (2021)
Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Stanislaw Szufa
Putting a Compass on the Map of Elections. IJCAI (2021)
Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. WG (2021)
Niclas Boehmer, Vincent Froese, Julia Henkel, Yvonne Lasars, Rolf Niedermeier, Malte Renken
Two Influence Maximization Games on Graphs Made Temporal. CoRR (2021)
Aleksander Figiel, Leon Kellerhals, Rolf Niedermeier, Matthias Rost, Stefan Schmid, Philipp Zschoche
Optimal Virtual Network Embeddings for Tree Topologies. CoRR (2021)
Pascal Kunz, Till Fluschnik, Rolf Niedermeier, Malte Renken
Most Classic Problems Remain NP-hard on Relative Neighborhood Graphs and their Relatives. CoRR (2021)
Aleksander Figiel, Leon Kellerhals, Rolf Niedermeier, Matthias Rost, Stefan Schmid, Philipp Zschoche
Optimal Virtual Network Embeddings for Tree Topologies. SPAA (2021)
Klaus Heeger, Anne-Sophie Himmel, Frank Kammer, Rolf Niedermeier, Malte Renken, Andrej Sajenko
Multistage graph problems on a global budget. Theor. Comput. Sci. 868 (2021)
Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. CoRR (2021)
Tomohiro Koana, Viatcheslav Korenwein, André Nichterlein, Rolf Niedermeier, Philipp Zschoche
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. ACM J. Exp. Algorithmics 26 (2021)
Matthias Bentert, Tomohiro Koana, Rolf Niedermeier
The Complexity of Gerrymandering over Graphs: Paths and Trees. WG (2021)
Nicolas Maack, Hendrik Molter, Rolf Niedermeier, Malte Renken
On Finding Separators in Temporal Split and Permutation Graphs. FCT (2021)
Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Rolf Niedermeier
Temporal Unit Interval Independent Sets. CoRR (2021)
Arnaud Casteigts, Kitty Meeks, George B. Mertzios, Rolf Niedermeier
Temporal Graphs: Structure, Algorithms, Applications (Dagstuhl Seminar 21171). Dagstuhl Reports 11 (3) (2021)
Niclas Boehmer, Tomohiro Koana, Rolf Niedermeier
A Refined Complexity Analysis of Fair Districting over Graphs. CoRR (2021)
Niclas Boehmer, Robert Bredereck, Klaus Heeger, Rolf Niedermeier
Bribery and Control in Stable Marriage. J. Artif. Intell. Res. 71 (2021)
Hendrik Molter, Rolf Niedermeier, Malte Renken
Isolation concepts applied to temporal clique enumeration. Netw. Sci. 9 (S1) (2021)
Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier
Parameterized Dynamic Cluster Editing. Algorithmica 83 (1) (2021)
Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier
On coalitional manipulation for multiwinner elections: shortlisting. Auton. Agents Multi Agent Syst. 35 (2) (2021)
Niclas Boehmer, Rolf Niedermeier
Broadening the Research Agenda for Computational Social Choice: Multiple Preference Profiles and Multiple Solutions. AAMAS (2021)
Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche
Interference-free Walks in Time: Temporally Disjoint Paths. IJCAI (2021)
Nicolas Maack, Hendrik Molter, Rolf Niedermeier, Malte Renken
On Finding Separators in Temporal Split and Permutation Graphs. CoRR (2021)
Rolf Niedermeier, Christophe Paul
Preface of STACS 2019 Special Issue. Theory Comput. Syst. 65 (4) (2021)
Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier
Winner Robustness via Swap- and Shift-Bribery: Parameterized Counting Complexity and Experiments. IJCAI (2021)
Robert Bredereck, Andrzej Kaczmarczyk, Junjie Luo, Rolf Niedermeier, Florian Sachse
On Improving Resource Allocations by Sharing. CoRR (2021)
Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche
As Time Goes By: Reflections on Treewidth for Temporal Graphs. CoRR (2020)
Tomohiro Koana, Vincent Froese, Rolf Niedermeier
Parameterized Algorithms for Matrix Completion with Radius Constraints. CPM (2020)
Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon
Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting. Theor. Comput. Sci. 814 (2020)
Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier
Multidimensional Stable Roommates with Master List. WINE (2020)

Rolf Niedermeier.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Rolf Niedermeier