Rolf Niedermeier

514 papers A* 35A 27B 79C 23Misc 5Journal 293Unranked 42

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Adapting stable matchings to evolving preferences. Games Econ. Behav. Robert Bredereck, Jiehua Chen, Dusan Knop, Junjie Luo, Rolf Niedermeier
2026	J	`jnl`	Stable marriage with multi-modal preferences. J. Comput. Syst. Sci. Jiehua Chen, Rolf Niedermeier, Piotr Skowron
2025	J	`jnl`	Drawing a Map of Elections. CoRR Stanislaw Szufa, Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron, Arkadii Slinko, Nimrod Talmon
2025	J	`jnl`	Drawing a map of elections. Artif. Intell. Stanislaw Szufa, Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron, Arkadii Slinko, Nimrod Talmon
2025	J	`jnl`	Fairness in repetitive scheduling. Eur. J. Oper. Res. Danny Hermelin, Hendrik Molter, Rolf Niedermeier, Michael L. Pinedo, Dvir Shabtay
2024	J	`jnl`	Algorithmic aspects of temporal betweenness. Netw. Sci. Sebastian Buß, Hendrik Molter, Rolf Niedermeier, Maciej Rymar
2024	J	`jnl`	Approximating sparse quadratic programs. Theor. Comput. Sci. Danny Hermelin, Leon Kellerhals, Rolf Niedermeier, Rami Pugatch
2024	J	`jnl`	Equilibria in schelling games: computational hardness and robustness. Auton. Agents Multi Agent Syst. Luca Kreisel, Niclas Boehmer, Vincent Froese, Rolf Niedermeier
2024	J	`jnl`	Fast Parameterized Preprocessing for Polynomial-Time Solvable Graph Problems. Commun. ACM Anne-Sophie Himmel, George B. Mertzios, André Nichterlein, Rolf Niedermeier
2024	J	`jnl`	Modification-fair cluster editing. Soc. Netw. Anal. Min. Vincent Froese, Leon Kellerhals, Rolf Niedermeier
2024	J	`jnl`	The Structural Complexity Landscape of Finding Balance-Fair Shortest Paths. CoRR Matthias Bentert, Leon Kellerhals, Rolf Niedermeier
2024	J	`jnl`	The role of twins in computing planar supports of hypergraphs. J. Graph Algorithms Appl. René van Bevern, Iyad Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge
2023	J	`jnl`	A multivariate complexity analysis of the material consumption scheduling problem. J. Sched. Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier
2023	J	`jnl`	A refined complexity analysis of fair districting over graphs. Auton. Agents Multi Agent Syst. Niclas Boehmer, Tomohiro Koana, Rolf Niedermeier
2023	J	`jnl`	Computing maximum matchings in temporal graphs. J. Comput. Syst. Sci. George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche
2023	J	`jnl`	Equitable scheduling on a single machine. J. Sched. Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay
2023	A*	`conf`	Fair Short Paths in Vertex-Colored Graphs. AAAI Matthias Bentert, Leon Kellerhals, Rolf Niedermeier
2023	A	`conf`	High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming. ECAI Robert Bredereck, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier
2023	J	`jnl`	Improving Resource Allocations by Sharing in Pairs. J. Artif. Intell. Res. Robert Bredereck, Andrzej Kaczmarczyk, Junjie Luo, Rolf Niedermeier, Florian Sachse
2023	J	`jnl`	Interference-free walks in time: temporally disjoint paths. Auton. Agents Multi Agent Syst. Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche
2023	J	`jnl`	Multistage s-t Path: Confronting Similarity with Dissimilarity. Algorithmica Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche
2023	J	`jnl`	On finding separators in temporal split and permutation graphs. J. Comput. Syst. Sci. Nicolas Maack, Hendrik Molter, Rolf Niedermeier, Malte Renken
2023	A*	`conf`	Parameterized Algorithms for Colored Clustering. AAAI Leon Kellerhals, Tomohiro Koana, Pascal Kunz, Rolf Niedermeier
2023	J	`jnl`	Parameterized Algorithms for Colored Clustering. CoRR Leon Kellerhals, Tomohiro Koana, Pascal Kunz, Rolf Niedermeier
2023	A	`conf`	Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions. STACS Klaus Heeger, André Nichterlein, Rolf Niedermeier
2023	J	`jnl`	Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions. CoRR Klaus Heeger, André Nichterlein, Rolf Niedermeier
2023	J	`jnl`	Polynomial-time data reduction for weighted problems beyond additive goal functions. Discret. Appl. Math. Matthias Bentert, René van Bevern, Till Fluschnik, André Nichterlein, Rolf Niedermeier
2023	J	`jnl`	Temporal interval cliques and independent sets. Theor. Comput. Sci. Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Rolf Niedermeier
2023	J	`jnl`	The complexity of binary matrix completion under diameter constraints. J. Comput. Syst. Sci. Tomohiro Koana, Vincent Froese, Rolf Niedermeier
2023	J	`jnl`	The complexity of gerrymandering over graphs: Paths and trees. Discret. Appl. Math. Matthias Bentert, Tomohiro Koana, Rolf Niedermeier
2023	J	`jnl`	Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. J. Graph Algorithms Appl. Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier
2022	—	`conf`	A Quantitative and Qualitative Analysis of the Robustness of (Real-World) Election Winners. EAAMO Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier
2022	J	`jnl`	A Quantitative and Qualitative Analysis of the Robustness of (Real-World) Election Winners. CoRR Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier
2022	A	`conf`	A Refined Complexity Analysis of Fair Districting over Graphs. AAMAS Niclas Boehmer, Tomohiro Koana, Rolf Niedermeier
2022	B	`conf`	An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions. CPM Laurent Bulteau, Mark Jones, Rolf Niedermeier, Till Tantau
2022	B	`conf`	Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial Time. IPEC Hjalmar Schulz, André Nichterlein, Rolf Niedermeier, Christopher Weyand
2022	B	`conf`	Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems. MFCS Niclas Boehmer, Klaus Heeger, Rolf Niedermeier
2022	J	`jnl`	Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems. CoRR Niclas Boehmer, Klaus Heeger, Rolf Niedermeier
2022	A	`conf`	Delay-Robust Routes in Temporal Graphs. STACS Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken
2022	J	`jnl`	Delay-Robust Routes in Temporal Graphs. CoRR Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken
2022	J	`jnl`	Envy-free allocations respecting social networks. Artif. Intell. Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier
2022	A	`conf`	Equilibria in Schelling Games: Computational Hardness and Robustness. AAMAS Luca Kreisel, Niclas Boehmer, Vincent Froese, Rolf Niedermeier
2022	J	`jnl`	Feedback edge sets in temporal graphs. Discret. Appl. Math. Roman Haag, Hendrik Molter, Rolf Niedermeier, Malte Renken
2022	J	`jnl`	Finding Balance-Fair Short Paths in Graphs. CoRR Matthias Bentert, Leon Kellerhals, Rolf Niedermeier
2022	A*	`conf`	Modification-Fair Cluster Editing. AAAI Vincent Froese, Leon Kellerhals, Rolf Niedermeier
2022	—	`conf`	Most Classic Problems Remain NP-Hard on Relative Neighborhood Graphs and Their Relatives. SWAT Pascal Kunz, Till Fluschnik, Rolf Niedermeier, Malte Renken
2022	J	`jnl`	Multistage Vertex Cover. Theory Comput. Syst. Till Fluschnik, Rolf Niedermeier, Valentin Rohm, Philipp Zschoche
2022	A*	`conf`	On Improving Resource Allocations by Sharing. AAAI Robert Bredereck, Andrzej Kaczmarczyk, Junjie Luo, Rolf Niedermeier, Florian Sachse
2022	J	`jnl`	Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments. INFORMS J. Comput. Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier, Pavel V. Smirnov
2022	J	`jnl`	Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters. Inf. Comput. Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier
2022	—	`conf`	Temporal Connectivity: Coping with Foreseen and Unforeseen Delays. SAND Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken
2022	J	`jnl`	Temporal Connectivity: Coping with Foreseen and Unforeseen Delays. CoRR Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken
2022	—	`conf`	Temporal Unit Interval Independent Sets. SAND Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Rolf Niedermeier
2022	J	`jnl`	The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality. J. Artif. Intell. Res. Vincent Froese, Christoph Hertrich, Rolf Niedermeier
2022	J	`jnl`	The structural complexity landscape of finding balance-fair shortest paths. Theor. Comput. Sci. Matthias Bentert, Leon Kellerhals, Rolf Niedermeier
2022	A*	`conf`	Theory of and Experiments on Minimally Invasive Stability Preservation in Changing Two-Sided Matching Markets. AAAI Niclas Boehmer, Klaus Heeger, Rolf Niedermeier
2022	A	`conf`	There and Back Again: On Applying Data Reduction Rules by Undoing Others. ESA Aleksander Figiel, Vincent Froese, André Nichterlein, Rolf Niedermeier
2022	J	`jnl`	There and Back Again: On Applying Data Reduction Rules by Undoing Others. CoRR Aleksander Figiel, Vincent Froese, André Nichterlein, Rolf Niedermeier
2022	A*	`conf`	Understanding Distance Measures Among Elections. IJCAI Niclas Boehmer, Piotr Faliszewski, Rolf Niedermeier, Stanislaw Szufa, Tomasz Was
2022	J	`jnl`	Understanding Distance Measures Among Elections. CoRR Niclas Boehmer, Piotr Faliszewski, Rolf Niedermeier, Stanislaw Szufa, Tomasz Was
2021	A*	`conf`	A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem. AAAI Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier
2021	J	`jnl`	A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem. CoRR Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier
2021	J	`jnl`	A Refined Complexity Analysis of Fair Districting over Graphs. CoRR Niclas Boehmer, Tomohiro Koana, Rolf Niedermeier
2021	A	`conf`	Binary Matrix Completion Under Diameter Constraints. STACS Tomohiro Koana, Vincent Froese, Rolf Niedermeier
2021	J	`jnl`	Bribery and Control in Stable Marriage. J. Artif. Intell. Res. Niclas Boehmer, Robert Bredereck, Klaus Heeger, Rolf Niedermeier
2021	A	`conf`	Broadening the Research Agenda for Computational Social Choice: Multiple Preference Profiles and Multiple Solutions. AAMAS Niclas Boehmer, Rolf Niedermeier
2021	J	`jnl`	Complexity of Shift Bribery in Committee Elections. ACM Trans. Comput. Theory Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon
2021	J	`jnl`	Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. ACM J. Exp. Algorithmics Tomohiro Koana, Viatcheslav Korenwein, André Nichterlein, Rolf Niedermeier, Philipp Zschoche
2021	J	`jnl`	Equilibria in Schelling Games: Computational Complexity and Robustness. CoRR Luca Kreisel, Niclas Boehmer, Vincent Froese, Rolf Niedermeier
2021	J	`jnl`	Equitable Scheduling for the Total Completion Time Objective. CoRR Danny Hermelin, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay
2021	A*	`conf`	Equitable Scheduling on a Single Machine. AAAI Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay
2021	A	`conf`	High-Multiplicity Fair Allocation Made More Practical. AAMAS Robert Bredereck, Aleksander Figiel, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier
2021	A*	`conf`	Interference-free Walks in Time: Temporally Disjoint Paths. IJCAI Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche
2021	J	`jnl`	Interference-free Walks in Time: Temporally Disjoint Paths. CoRR Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche
2021	J	`jnl`	Isolation concepts applied to temporal clique enumeration. Netw. Sci. Hendrik Molter, Rolf Niedermeier, Malte Renken
2021	J	`jnl`	Modification-Fair Cluster Editing. CoRR Vincent Froese, Leon Kellerhals, Rolf Niedermeier
2021	J	`jnl`	Most Classic Problems Remain NP-hard on Relative Neighborhood Graphs and their Relatives. CoRR Pascal Kunz, Till Fluschnik, Rolf Niedermeier, Malte Renken
2021	J	`jnl`	Multistage graph problems on a global budget. Theor. Comput. Sci. Klaus Heeger, Anne-Sophie Himmel, Frank Kammer, Rolf Niedermeier, Malte Renken, Andrej Sajenko
2021	C	`conf`	On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering. CIAC Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier
2021	J	`jnl`	On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering. J. Graph Algorithms Appl. Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier
2021	B	`conf`	On Finding Separators in Temporal Split and Permutation Graphs. FCT Nicolas Maack, Hendrik Molter, Rolf Niedermeier, Malte Renken
2021	J	`jnl`	On Finding Separators in Temporal Split and Permutation Graphs. CoRR Nicolas Maack, Hendrik Molter, Rolf Niedermeier, Malte Renken
2021	J	`jnl`	On Improving Resource Allocations by Sharing. CoRR Robert Bredereck, Andrzej Kaczmarczyk, Junjie Luo, Rolf Niedermeier, Florian Sachse
2021	J	`jnl`	On coalitional manipulation for multiwinner elections: shortlisting. Auton. Agents Multi Agent Syst. Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier
2021	B	`conf`	Optimal Virtual Network Embeddings for Tree Topologies. SPAA Aleksander Figiel, Leon Kellerhals, Rolf Niedermeier, Matthias Rost, Stefan Schmid, Philipp Zschoche
2021	J	`jnl`	Optimal Virtual Network Embeddings for Tree Topologies. CoRR Aleksander Figiel, Leon Kellerhals, Rolf Niedermeier, Matthias Rost, Stefan Schmid, Philipp Zschoche
2021	J	`jnl`	Parameterized Dynamic Cluster Editing. Algorithmica Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier
2021	J	`jnl`	Preface of STACS 2019 Special Issue. Theory Comput. Syst. Rolf Niedermeier, Christophe Paul
2021	A*	`conf`	Putting a Compass on the Map of Elections. IJCAI Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Stanislaw Szufa
2021	J	`jnl`	Putting a Compass on the Map of Elections. CoRR Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Stanislaw Szufa
2021	J	`jnl`	Robustness among multiwinner voting rules. Artif. Intell. Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon
2021	J	`jnl`	Temporal Graphs: Structure, Algorithms, Applications (Dagstuhl Seminar 21171). Dagstuhl Reports Arnaud Casteigts, Kitty Meeks, George B. Mertzios, Rolf Niedermeier
2021	J	`jnl`	Temporal Unit Interval Independent Sets. CoRR Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Rolf Niedermeier
2021	J	`jnl`	The Complexity of Gerrymandering Over Graphs: Paths and Trees. CoRR Matthias Bentert, Tomohiro Koana, Rolf Niedermeier
2021	B	`conf`	The Complexity of Gerrymandering over Graphs: Paths and Trees. WG Matthias Bentert, Tomohiro Koana, Rolf Niedermeier
2021	J	`jnl`	The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality. CoRR Vincent Froese, Christoph Hertrich, Rolf Niedermeier
2021	J	`jnl`	Theory of and Experiments on Minimally Invasive Stability Preservation in Changing Two-Sided Matching Markets. CoRR Niclas Boehmer, Klaus Heeger, Rolf Niedermeier
2021	B	`conf`	Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. WG Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier
2021	J	`jnl`	Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. CoRR Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier
2021	A*	`conf`	Two Influence Maximization Games on Graphs Made Temporal. IJCAI Niclas Boehmer, Vincent Froese, Julia Henkel, Yvonne Lasars, Rolf Niedermeier, Malte Renken
2021	J	`jnl`	Two Influence Maximization Games on Graphs Made Temporal. CoRR Niclas Boehmer, Vincent Froese, Julia Henkel, Yvonne Lasars, Rolf Niedermeier, Malte Renken
2021	A*	`conf`	Winner Robustness via Swap- and Shift-Bribery: Parameterized Counting Complexity and Experiments. IJCAI Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier
2020	A*	`conf`	Adapting Stable Matchings to Evolving Preferences. AAAI Robert Bredereck, Jiehua Chen, Dusan Knop, Junjie Luo, Rolf Niedermeier
2020	A*	`conf`	Algorithmic Aspects of Temporal Betweenness. KDD Sebastian Buß, Hendrik Molter, Rolf Niedermeier, Maciej Rymar
2020	J	`jnl`	Algorithmic Aspects of Temporal Betweenness. CoRR Sebastian Buß, Hendrik Molter, Rolf Niedermeier, Maciej Rymar
2020	J	`jnl`	An Adaptive Version of Brandes' Algorithm for Betweenness Centrality. J. Graph Algorithms Appl. Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier
2020	J	`jnl`	Approximating Sparse Quadratic Programs. CoRR Danny Hermelin, Leon Kellerhals, Rolf Niedermeier, Rami Pugatch
2020	—	`conf`	As Time Goes By: Reflections on Treewidth for Temporal Graphs. Treewidth, Kernels, and Algorithms Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche
2020	J	`jnl`	As Time Goes By: Reflections on Treewidth for Temporal Graphs. CoRR Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche
2020	B	`conf`	Bribery and Control in Stable Marriage. SAGT Niclas Boehmer, Robert Bredereck, Klaus Heeger, Rolf Niedermeier
2020	J	`jnl`	Bribery and Control in Stable Marriage. CoRR Niclas Boehmer, Robert Bredereck, Klaus Heeger, Rolf Niedermeier
2020	J	`jnl`	Comparing temporal graphs using dynamic time warping. Soc. Netw. Anal. Min. Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, Malte Renken
2020	J	`jnl`	Complexity of Combinatorial Matrix Completion With Diameter Constraints. CoRR Tomohiro Koana, Vincent Froese, Rolf Niedermeier
2020	A	`conf`	Computing Maximum Matchings in Temporal Graphs. STACS George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche
2020	J	`jnl`	Diminishable parameterized problems and strict polynomial kernelization. Comput. Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier
2020	J	`jnl`	Efficient algorithms for measuring the funnel-likeness of DAGs. J. Comb. Optim. Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
2020	J	`jnl`	Efficient computation of optimal temporal walks under waiting-time constraints. Appl. Netw. Sci. Matthias Bentert, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier
2020	A*	`conf`	Electing Successive Committees: Complexity and Algorithms. AAAI Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier
2020	J	`jnl`	Envy-Free Allocations Respecting Social Networks. CoRR Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier
2020	J	`jnl`	Equitable Scheduling on a Single Machine. CoRR Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay
2020	B	`conf`	Faster Binary Mean Computation Under Dynamic Time Warping. CPM Nathan Schaar, Vincent Froese, Rolf Niedermeier
2020	J	`jnl`	Faster Binary Mean Computation Under Dynamic Time Warping. CoRR Nathan Schaar, Vincent Froese, Rolf Niedermeier
2020	B	`conf`	Feedback Edge Sets in Temporal Graphs. WG Roman Haag, Hendrik Molter, Rolf Niedermeier, Malte Renken
2020	J	`jnl`	Feedback Edge Sets in Temporal Graphs. CoRR Roman Haag, Hendrik Molter, Rolf Niedermeier, Malte Renken
2020	J	`jnl`	High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming. CoRR Robert Bredereck, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier
2020	B	`conf`	Line-Up Elections: Parallel Voting with Shared Candidate Pool. SAGT Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier
2020	J	`jnl`	Line-Up Elections: Parallel Voting with Shared Candidate Pool. CoRR Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier
2020	J	`jnl`	Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting. Theor. Comput. Sci. Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon
2020	—	`conf`	Multidimensional Stable Roommates with Master List. WINE Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier
2020	J	`jnl`	Multidimensional Stable Roommates with Master List. CoRR Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier
2020	B	`conf`	Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs. ISAAC Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche
2020	J	`jnl`	Multistage s-t Path: Confronting Similarity with Dissimilarity. CoRR Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche
2020	J	`jnl`	On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering. CoRR Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier
2020	J	`jnl`	On the Robustness of Winners: Counting Briberies in Elections. CoRR Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier
2020	A*	`conf`	Parameterized Algorithms for Finding a Collective Set of Items. AAAI Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier
2020	J	`jnl`	Parameterized Algorithms for Matrix Completion With Radius Constraints. CoRR Tomohiro Koana, Vincent Froese, Rolf Niedermeier
2020	B	`conf`	Parameterized Algorithms for Matrix Completion with Radius Constraints. CPM Tomohiro Koana, Vincent Froese, Rolf Niedermeier
2020	J	`jnl`	Preface of the Special Issue on Theoretical Aspects of Computer Science (2018). Theory Comput. Syst. Rolf Niedermeier, Brigitte Vallée
2020	J	`jnl`	Stable roommates with narcissistic, single-peaked, and single-crossing preferences. Auton. Agents Multi Agent Syst. Robert Bredereck, Jiehua Chen, Ugo Paavo Finnendahl, Rolf Niedermeier
2020	J	`jnl`	Temporal graph classes: A view through temporal separators. Theor. Comput. Sci. Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche
2020	J	`jnl`	The Power of Linear-Time Data Reduction for Maximum Matching. Algorithmica George B. Mertzios, André Nichterlein, Rolf Niedermeier
2020	J	`jnl`	The complexity of finding small separators in temporal graphs. J. Comput. Syst. Sci. Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier
2020	J	`jnl`	Tight Hardness Results for Consensus Problems on Circular Strings and Time Series. SIAM J. Discret. Math. Laurent Bulteau, Vincent Froese, Rolf Niedermeier
2020	J	`jnl`	h-Index manipulation by undoing merges. Quant. Sci. Stud. René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh
2019	A	`ed.`	36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, Berlin, Germany, March 13-16, 2019 STACS Rolf Niedermeier, Christophe Paul
2019	J	`jnl`	A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs. Algorithmica Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier
2019	J	`jnl`	A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths. Networks Cristina Bazgan, Till Fluschnik, André Nichterlein, Rolf Niedermeier, Maximilian Stahlberg
2019	J	`jnl`	Adapting Stable Matchings to Evolving Preferences. CoRR Robert Bredereck, Jiehua Chen, Dusan Knop, Junjie Luo, Rolf Niedermeier
2019	J	`jnl`	Algorithms and Complexity in Phylogenetics (Dagstuhl Seminar 19443). Dagstuhl Reports Magnus Bordewich, Britta Dorn, Simone Linz, Rolf Niedermeier
2019	A*	`conf`	An Experimental View on Committees Providing Justified Representation. IJCAI Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier
2019	J	`jnl`	Application-Oriented Computational Social Choice (Dagstuhl Seminar 19381). Dagstuhl Reports Umberto Grandi, Stefan Napel, Rolf Niedermeier, Kristen Brent Venable
2019	J	`jnl`	Assessing the computational complexity of multilayer subgraph detection. Netw. Sci. Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
2019	—	`conf`	Comparing Temporal Graphs Using Dynamic Time Warping. COMPLEX NETWORKS (2) Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, Malte Renken
2019	J	`jnl`	Computing Maximum Matchings in Temporal Graphs. CoRR George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche
2019	—	`conf`	Efficient Computation of Optimal Temporal Walks Under Waiting-Time Constraints. COMPLEX NETWORKS (2) Anne-Sophie Himmel, Matthias Bentert, André Nichterlein, Rolf Niedermeier
2019	J	`jnl`	Efficient Computation of Optimal Temporal Walks under Waiting-Time Constraints. CoRR Anne-Sophie Himmel, Matthias Bentert, André Nichterlein, Rolf Niedermeier
2019	—	`conf`	Enumerating Isolated Cliques in Temporal Networks. COMPLEX NETWORKS (2) Hendrik Molter, Rolf Niedermeier, Malte Renken
2019	J	`jnl`	Enumerating Isolated Cliques in Temporal Networks. CoRR Hendrik Molter, Rolf Niedermeier, Malte Renken
2019	J	`jnl`	Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: Theory and experiments. Eur. J. Oper. Res. Christian Komusiewicz, André Nichterlein, Rolf Niedermeier, Marten Picker
2019	J	`jnl`	Exact mean computation in dynamic time warping spaces. Data Min. Knowl. Discov. Markus Brill, Till Fluschnik, Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, David Schultz
2019	A*	`conf`	High-Multiplicity Fair Allocation: Lenstra Empowered by N-fold Integer Programming. EC Robert Bredereck, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier
2019	J	`jnl`	Inductive $$k$$ k -independent graphs and c-colorable subgraphs in scheduling: a review. J. Sched. Matthias Bentert, René van Bevern, Rolf Niedermeier
2019	J	`jnl`	Listing All Maximal ACM J. Exp. Algorithmics Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher
2019	J	`jnl`	Multistage Problems on a Global Budget. CoRR Klaus Heeger, Anne-Sophie Himmel, Frank Kammer, Rolf Niedermeier, Malte Renken, Andrej Sajenko
2019	B	`conf`	Multistage Vertex Cover. IPEC Till Fluschnik, Rolf Niedermeier, Valentin Rohm, Philipp Zschoche
2019	J	`jnl`	Multistage Vertex Cover. CoRR Till Fluschnik, Rolf Niedermeier, Valentin Rohm, Philipp Zschoche
2019	B	`conf`	Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters. ISAAC Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier
2019	J	`jnl`	Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters. CoRR Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier
2019	J	`jnl`	Parameterized aspects of triangle enumeration. J. Comput. Syst. Sci. Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier
2019	J	`jnl`	Polynomial-Time Preprocessing for Weighted Problems Beyond Additive Goal Functions. CoRR Matthias Bentert, René van Bevern, Till Fluschnik, André Nichterlein, Rolf Niedermeier
2019	J	`jnl`	Stable Roommates with Narcissistic, Single-Peaked, and Single-Crossing Preferences. CoRR Robert Bredereck, Jiehua Chen, Ugo Paavo Finnendahl, Rolf Niedermeier
2019	J	`jnl`	The parameterized complexity of the minimum shared edges problem. J. Comput. Syst. Sci. Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge
2019	J	`jnl`	When Can Graph Hyperbolicity be Computed in Linear Time? Algorithmica Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
2018	A	`ed.`	35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, Caen, France, February 28 - March 3, 2018 STACS Rolf Niedermeier, Brigitte Vallée
2018	J	`jnl`	A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs. SIAM J. Discret. Math. George B. Mertzios, André Nichterlein, Rolf Niedermeier
2018	J	`jnl`	A More Fine-Grained Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths. CoRR Cristina Bazgan, Till Fluschnik, André Nichterlein, Rolf Niedermeier, Maximilian Stahlberg
2018	B	`conf`	An Adaptive Version of Brandes' Algorithm for Betweenness Centrality. ISAAC Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier
2018	J	`jnl`	Comparing Temporal Graphs Using Dynamic Time Warping. CoRR Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, Malte Renken
2018	A	`conf`	Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. ESA Viatcheslav Korenwein, André Nichterlein, Rolf Niedermeier, Philipp Zschoche
2018	J	`jnl`	Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. CoRR Viatcheslav Korenwein, André Nichterlein, Philipp Zschoche, Rolf Niedermeier
2018	C	`conf`	Diminishable Parameterized Problems and Strict Polynomial Kernelization. CiE Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier
2018	C	`conf`	Efficient Algorithms for Measuring the Funnel-Likeness of DAGs. ISCO Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
2018	J	`jnl`	Efficient Algorithms for Measuring the Funnel-likeness of DAGs. CoRR Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
2018	A	`conf`	Envy-Free Allocations Respecting Social Networks. AAMAS Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier
2018	J	`jnl`	Exact Algorithms for Finding Well-Connected 2-Clubs in Real-World Graphs: Theory and Experiments. CoRR Christian Komusiewicz, André Nichterlein, Rolf Niedermeier, Marten Picker
2018	A	`conf`	Exact Mean Computation in Dynamic Time Warping Spaces. SDM Markus Brill, Till Fluschnik, Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, David Schultz
2018	J	`jnl`	Fractals for Kernelization Lower Bounds. SIAM J. Discret. Math. Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier
2018	J	`jnl`	Hardness of Consensus Problems for Circular Strings and Time Series Averaging. CoRR Laurent Bulteau, Vincent Froese, Rolf Niedermeier
2018	B	`conf`	Listing All Maximal k-Plexes in Temporal Graphs. ASONAM Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher
2018	J	`jnl`	Listing All Maximal k-Plexes in Temporal Graphs. CoRR Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher
2018	J	`jnl`	On Coalitional Manipulation for Multiwinner Elections: Shortlisting. CoRR Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier
2018	—	`conf`	Parameterized Dynamic Cluster Editing. FSTTCS Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier
2018	J	`jnl`	Parameterized Dynamic Cluster Editing. CoRR Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier
2018	A*	`conf`	Stable Marriage with Multi-Modal Preferences. EC Jiehua Chen, Rolf Niedermeier, Piotr Skowron
2018	J	`jnl`	Stable Marriage with Multi-Modal Preferences. CoRR Jiehua Chen, Rolf Niedermeier, Piotr Skowron
2018	B	`conf`	Temporal Graph Classes: A View Through Temporal Separators. WG Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche
2018	J	`jnl`	Temporal Graph Classes: A View Through Temporal Separators. CoRR Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche
2018	B	`conf`	The Complexity of Finding Small Separators in Temporal Graphs. MFCS Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier
2018	J	`jnl`	Towards Improving Brandes' Algorithm for Betweenness Centrality. CoRR Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier
2017	J	`jnl`	(Wireless) Scheduling, Graph Classes, and c-Colorable Subgraphs. CoRR Matthias Bentert, René van Bevern, Rolf Niedermeier
2017	J	`jnl`	A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack. J. Sched. René van Bevern, Rolf Niedermeier, Ondrej Suchý
2017	J	`jnl`	Adapting the Bron-Kerbosch algorithm for enumerating maximal cliques in temporal graphs. Soc. Netw. Anal. Min. Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
2017	C	`conf`	Assessing the Computational Complexity of Multi-layer Subgraph Detection. CIAC Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
2017	J	`jnl`	Elections with Few Voters: Candidate Control Can Be Easy. J. Artif. Intell. Res. Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon
2017	J	`jnl`	Exact Mean Computation in Dynamic Time Warping Spaces. CoRR Markus Brill, Till Fluschnik, Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, David Schultz
2017	J	`jnl`	Finding Points in General Position. Int. J. Comput. Geom. Appl. Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier
2017	J	`jnl`	Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs. CoRR George B. Mertzios, André Nichterlein, Rolf Niedermeier
2017	J	`jnl`	Mixed Integer Programming with Convex/Concave Constraints: Fixed-Parameter Tractability and Applications to Multicovering and Voting. CoRR Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon
2017	A*	`conf`	On Coalitional Manipulation for Multiwinner Elections: Shortlisting. IJCAI Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier
2017	C	`conf`	Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks. ALGOSENSORS Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier
2017	B	`conf`	Parameterized Aspects of Triangle Enumeration. FCT Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier
2017	J	`jnl`	Parameterized Aspects of Triangle Enumeration. CoRR Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier
2017	J	`jnl`	Parameterized algorithms for power-efficient connected symmetric wireless sensor networks. CoRR Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier
2017	J	`jnl`	Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty. J. Artif. Intell. Res. Robert Bredereck, Jiehua Chen, Rolf Niedermeier, Toby Walsh
2017	J	`jnl`	Partitioning Perfect Graphs into Stars. J. Graph Theory René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
2017	J	`jnl`	Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs. Theor. Comput. Sci. Archontia C. Giannopoulou, George B. Mertzios, Rolf Niedermeier
2017	B	`conf`	Robustness Among Multiwinner Voting Rules. SAGT Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon
2017	J	`jnl`	Robustness Among Multiwinner Voting Rules. CoRR Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon
2017	—	`conf`	Stable Roommate with Narcissistic, Single-Peaked, and Single-Crossing Preferences. ADT Robert Bredereck, Jiehua Chen, Ugo Paavo Finnendahl, Rolf Niedermeier
2017	A*	`conf`	Teams in Online Scheduling Polls: Game-Theoretic Aspects. AAAI Robert Bredereck, Jiehua Chen, Rolf Niedermeier, Svetlana Obraztsova, Nimrod Talmon
2017	J	`jnl`	The Complexity of Finding Effectors. Theory Comput. Syst. Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon
2017	J	`jnl`	The Computational Complexity of Finding Separators in Temporal Graphs. CoRR Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier
2017	B	`conf`	The Power of Linear-Time Data Reduction for Maximum Matching. MFCS George B. Mertzios, André Nichterlein, Rolf Niedermeier
2017	B	`conf`	When Can Graph Hyperbolicity Be Computed in Linear Time? WADS Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
2017	J	`jnl`	When can Graph Hyperbolicity be computed in Linear Time? CoRR Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
2016	B	`ed.`	41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, Kraków, Poland, August 22-26, 2016 MFCS Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier
2016	B	`conf`	A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs. IPEC Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier
2016	J	`jnl`	A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems. CoRR Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier
2016	J	`jnl`	Assessing the Computational Complexity of Multi-Layer Subgraph Detection. CoRR Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
2016	J	`jnl`	Co-Clustering under the Maximum Norm. Algorithms Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier
2016	A*	`conf`	Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels. IJCAI Bernhard Bliem, Robert Bredereck, Rolf Niedermeier
2016	A*	`conf`	Complexity of Shift Bribery in Committee Elections. AAAI Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon
2016	J	`jnl`	Complexity of Shift Bribery in Committee Elections. CoRR Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon
2016	—	`ch.`	Data Reduction for Domination in Graphs. Encyclopedia of Algorithms Rolf Niedermeier
2016	J	`jnl`	Diminishable Parameterized Problems and Strict Polynomial Kernelization. CoRR Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier
2016	J	`jnl`	Enumerating Maximal Cliques in Temporal Graphs. CoRR Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
2016	B	`conf`	Enumerating maximal cliques in temporal graphs. ASONAM Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
2016	J	`jnl`	Exploiting hidden structure in selecting dimensions that distinguish vectors. J. Comput. Syst. Sci. Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge
2016	—	`conf`	Finding Points in General Position. CCCG Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier
2016	J	`jnl`	Fine-Grained Algorithm Design for Matching. CoRR George B. Mertzios, André Nichterlein, Rolf Niedermeier
2016	A*	`conf`	Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems. ICALP Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier
2016	J	`jnl`	H-index manipulation by merging articles: Models, theory, and experiments. Artif. Intell. René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh
2016	J	`jnl`	Large-Scale Election Campaigns: Combinatorial Shift Bribery. J. Artif. Intell. Res. Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon
2016	—	`ch.`	Parameterization in Computational Social Choice. Encyclopedia of Algorithms Piotr Faliszewski, Rolf Niedermeier
2016	J	`jnl`	Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics. CoRR Christian Komusiewicz, André Nichterlein, Rolf Niedermeier
2016	J	`jnl`	Prices matter for the parameterized complexity of shift bribery. Inf. Comput. Robert Bredereck, Jiehua Chen, Piotr Faliszewski, André Nichterlein, Rolf Niedermeier
2016	J	`jnl`	Teams in Online Scheduling Polls: Game-Theoretic Aspects. CoRR Robert Bredereck, Jiehua Chen, Rolf Niedermeier, Svetlana Obraztsova, Nimrod Talmon
2016	J	`jnl`	The Parameterized Complexity of the Minimum Shared Edges Problem. CoRR Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge
2016	A	`conf`	Twins in Subdivision Drawings of Hypergraphs. GD René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge
2016	—	`ch.`	Weighted Tournament Solutions. Handbook of Computational Social Choice Felix A. Fischer, Olivier Hudry, Rolf Niedermeier
2016	J	`jnl`	Win-win kernelization for degree sequence completion problems. J. Comput. Syst. Sci. Vincent Froese, André Nichterlein, Rolf Niedermeier
2016	A	`conf`	h-Index Manipulation by Undoing Merges. ECAI René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh
2016	J	`jnl`	h-Index Manipulation by Undoing Merges. CoRR René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh
2015	C	`conf`	A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths. CIAC Cristina Bazgan, André Nichterlein, Rolf Niedermeier
2015	J	`jnl`	A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack. CoRR René van Bevern, Rolf Niedermeier, Ondrej Suchý
2015	J	`jnl`	A refined complexity analysis of degree anonymization in graphs. Inf. Comput. Sepp Hartung, André Nichterlein, Rolf Niedermeier, Ondrej Suchý
2015	J	`jnl`	Co-Clustering Under the Maximum Norm. CoRR Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier
2015	J	`jnl`	Combinatorial voter control in elections. Theor. Comput. Sci. Laurent Bulteau, Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon
2015	—	`conf`	Elections with Few Candidates: Prices, Weights, and Covering Problems. ADT Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon
2015	A*	`conf`	Elections with Few Voters: Candidate Control Can Be Easy. AAAI Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon
2015	J	`jnl`	Exploiting Hidden Structure in Selecting Dimensions that Distinguish Vectors. CoRR Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge
2015	J	`jnl`	Finding Points in General Position. CoRR Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier
2015	J	`jnl`	Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems. CoRR Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier
2015	A*	`conf`	H-Index Manipulation by Merging Articles: Models, Theory, and Experiments. IJCAI René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh
2015	J	`jnl`	How to Put Through Your Agenda in Collective Binary Decisions. ACM Trans. Economics and Comput. Noga Alon, Robert Bredereck, Jiehua Chen, Stefan Kratsch, Rolf Niedermeier, Gerhard J. Woeginger
2015	J	`jnl`	Interval scheduling and colorful independent sets. J. Sched. René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller
2015	A	`conf`	Large-Scale Election Campaigns: Combinatorial Shift Bribery. AAMAS Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon
2015	J	`jnl`	Network-Based Vertex Dissolution. SIAM J. Discret. Math. René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
2015	J	`jnl`	On explaining integer vectors by few homogeneous segments. J. Comput. Syst. Sci. Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Ondrej Suchý
2015	B	`conf`	Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics. WG Christian Komusiewicz, André Nichterlein, Rolf Niedermeier
2015	A*	`conf`	Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty. IJCAI Robert Bredereck, Jiehua Chen, Rolf Niedermeier, Toby Walsh
2015	J	`jnl`	Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty. CoRR Robert Bredereck, Jiehua Chen, Rolf Niedermeier, Toby Walsh
2015	J	`jnl`	Polynomial Fixed-Parameter Algorithms: A Case Study for Longest Path on Interval Graphs. CoRR Archontia C. Giannopoulou, George B. Mertzios, Rolf Niedermeier
2015	B	`conf`	Polynomial Fixed-parameter Algorithms: A Case Study for Longest Path on Interval Graphs. IPEC Archontia C. Giannopoulou, George B. Mertzios, Rolf Niedermeier
2015	J	`jnl`	Polynomial-Time Data Reduction for the Subset Interconnection Design Problem. SIAM J. Discret. Math. Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý, Mathias Weller
2015	J	`jnl`	Prices Matter for the Parameterized Complexity of Shift Bribery. CoRR Robert Bredereck, Jiehua Chen, Piotr Faliszewski, André Nichterlein, Rolf Niedermeier
2015	C	`conf`	The Complexity of Finding Effectors. TAMC Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon
2015	—	`conf`	The Parameterized Complexity of the Minimum Shared Edges Problem. FSTTCS Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge
2015	J	`jnl`	The Parameterized Complexity of the Rainbow Subgraph Problem. Algorithms Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Martin Rötzschke
2015	J	`jnl`	The complexity of degree anonymization by vertex addition. Theor. Comput. Sci. Robert Bredereck, Vincent Froese, Sepp Hartung, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
2015	J	`jnl`	Twins in Subdivision Drawings of Hypergraphs. CoRR René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge
2015	J	`jnl`	Using Patterns to Form Homogeneous Teams. Algorithmica Robert Bredereck, Thomas Köhler, André Nichterlein, Rolf Niedermeier, Geevarghese Philip
2015	J	`jnl`	Well-Formed Separator Sequences, with an Application to Hypergraph Drawing. CoRR René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge
2014	J	`jnl`	A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. J. Artif. Intell. Res. Robert Bredereck, Jiehua Chen, Sepp Hartung, Stefan Kratsch, Rolf Niedermeier, Ondrej Suchý, Gerhard J. Woeginger
2014	B	`conf`	Co-Clustering Under the Maximum Norm. ISAAC Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier
2014	—	`conf`	Combinatorial Voter Control in Elections. MFCS (2) Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon
2014	J	`jnl`	Combinatorial Voter Control in Elections. CoRR Laurent Bulteau, Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon
2014	J	`jnl`	Constant Thresholds Can Make Target Set Selection Tractable. Theory Comput. Syst. Morgan Chopin, André Nichterlein, Rolf Niedermeier, Mathias Weller
2014	J	`jnl`	Elections with Few Voters: Candidate Control Can Be Easy. CoRR Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon
2014	J	`jnl`	Exploiting a hypergraph model for finding Golomb rulers. Acta Informatica Manuel Sorge, Hannes Moser, Rolf Niedermeier, Mathias Weller
2014	J	`jnl`	Interval scheduling and colorful independent sets. CoRR René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller
2014	J	`jnl`	Multivariate Algorithmics for NP-Hard String Problems. Bull. EATCS Laurent Bulteau, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier
2014	—	`conf`	Network-Based Dissolution. MFCS (2) René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
2014	J	`jnl`	Network-Based Dissolution. CoRR René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
2014	J	`jnl`	On Google Scholar H-Index Manipulation by Merging Articles. CoRR René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh
2014	J	`jnl`	On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion. Algorithmica Nadja Betzler, Hans L. Bodlaender, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann
2014	J	`jnl`	Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges. CoRR Robert Bredereck, Jiehua Chen, Piotr Faliszewski, Jiong Guo, Rolf Niedermeier, Gerhard J. Woeginger
2014	J	`jnl`	Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage. IEEE ACM Trans. Comput. Biol. Bioinform. Falk Hüffner, Christian Komusiewicz, Adrian Liebtrau, Rolf Niedermeier
2014	A*	`conf`	Prices Matter for the Parameterized Complexity of Shift Bribery. AAAI Robert Bredereck, Jiehua Chen, Piotr Faliszewski, André Nichterlein, Rolf Niedermeier
2014	—	`conf`	Star Partitions of Perfect Graphs. ICALP (1) René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
2014	J	`jnl`	Star Partitions of Perfect Graphs. CoRR René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
2014	C	`conf`	The Complexity of Degree Anonymization by Vertex Addition. AAIM Robert Bredereck, Vincent Froese, Sepp Hartung, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
2014	J	`jnl`	The Complexity of Finding Effectors. CoRR Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon
2014	B	`conf`	The Parameterized Complexity of the Rainbow Subgraph Problem. WG Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Martin Rötzschke
2014	J	`jnl`	The effect of homogeneity on the computational complexity of combinatorial data anonymization. Data Min. Knowl. Discov. Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip
2014	J	`jnl`	Theoretical and empirical evaluation of data reduction for exact Kemeny Rank Aggregation. Auton. Agents Multi Agent Syst. Nadja Betzler, Robert Bredereck, Rolf Niedermeier
2014	—	`conf`	Win-Win Kernelization for Degree Sequence Completion Problems. SWAT Vincent Froese, André Nichterlein, Rolf Niedermeier
2014	J	`jnl`	Win-Win Kernelization for Degree Sequence Completion Problems. CoRR Vincent Froese, André Nichterlein, Rolf Niedermeier
2013	B	`conf`	A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems. MFCS Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge
2013	—	`conf`	A Refined Complexity Analysis of Degree Anonymization in Graphs. ICALP (2) Sepp Hartung, André Nichterlein, Rolf Niedermeier, Ondrej Suchý
2013	J	`jnl`	Confluence in Data Reduction: Bridging Graph Transformation and Kernelization. Comput. Hartmut Ehrig, Claudia Ermel, Falk Hüffner, Rolf Niedermeier, Olga Runge
2013	B	`conf`	Effective and Efficient Data Reduction for the Subset Interconnection Design Problem. ISAAC Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý, Mathias Weller
2013	J	`jnl`	Efficient Algorithms for Eulerian Extension and Rural Postman. SIAM J. Discret. Math. Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller
2013	B	`conf`	Evaluation of ILP-Based Approaches for Partitioning into Colorful Components. SEA Sharon Bruckner, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier
2013	—	`conf`	How to Put through Your Agenda in Collective Binary Decisions. ADT Noga Alon, Robert Bredereck, Jiehua Chen, Stefan Kratsch, Rolf Niedermeier, Gerhard J. Woeginger
2013	J	`jnl`	Incremental list coloring of graphs, parameterized by conservation. Theor. Comput. Sci. Sepp Hartung, Rolf Niedermeier
2013	B	`conf`	On Explaining Integer Vectors by Few Homogenous Segments. WADS Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Ondrej Suchý
2013	J	`jnl`	On tractable cases of Target Set Selection. Soc. Netw. Anal. Min. André Nichterlein, Rolf Niedermeier, Johannes Uhlmann, Mathias Weller
2013	—	`conf`	Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage. ISBRA Falk Hüffner, Christian Komusiewicz, Adrian Liebtrau, Rolf Niedermeier
2013	—	`conf`	Pattern-Guided FAW-AAIM Robert Bredereck, André Nichterlein, Rolf Niedermeier
2013	J	`jnl`	Pattern-Guided Algorithms Robert Bredereck, André Nichterlein, Rolf Niedermeier
2013	J	`jnl`	The Parameterized Complexity of Local Search for TSP, More Refined. Algorithmica Jiong Guo, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý
2012	A*	`conf`	A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. AAAI Robert Bredereck, Jiehua Chen, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý, Stefan Kratsch
2012	J	`jnl`	A new view on Rural Postman based on Eulerian Extension and Matching. J. Discrete Algorithms Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller
2012	J	`jnl`	Approximation and Tidying - A Problem Kernel for s-Plex Cluster Vertex Deletion. Algorithmica René van Bevern, Hannes Moser, Rolf Niedermeier
2012	C	`conf`	Confluence in Data Reduction: Bridging Graph Transformation and Kernelization. CiE Hartmut Ehrig, Claudia Ermel, Falk Hüffner, Rolf Niedermeier, Olga Runge
2012	—	`conf`	Constant Thresholds Can Make Target Set Selection Tractable. MedAlg Morgan Chopin, André Nichterlein, Rolf Niedermeier, Mathias Weller
2012	J	`jnl`	Exact combinatorial algorithms and experiments for finding maximum k-plexes. J. Comb. Optim. Hannes Moser, Rolf Niedermeier, Manuel Sorge
2012	C	`conf`	Exploiting a Hypergraph Model for Finding Golomb Rulers. ISCO Manuel Sorge, Hannes Moser, Rolf Niedermeier, Mathias Weller
2012	B	`conf`	Interval Scheduling and Colorful Independent Sets. ISAAC René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller
2012	B	`conf`	New Races in Parameterized Algorithmics. MFCS Christian Komusiewicz, Rolf Niedermeier
2012	J	`jnl`	On Bounded-Degree Vertex Deletion parameterized by treewidth. Discret. Appl. Math. Nadja Betzler, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann
2012	J	`jnl`	On making directed graphs transitive. J. Comput. Syst. Sci. Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
2012	J	`jnl`	Parameterized computational complexity of finding small-diameter subgraphs. Optim. Lett. Alexander Schäfer, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier
2012	B	`conf`	Partitioning into Colorful Components by Minimum Edge Deletions. CPM Sharon Bruckner, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Sven Thiel, Johannes Uhlmann
2012	—	`conf`	Studies in Computational Aspects of Voting - A Parameterized Complexity Perspective. The Multivariate Algorithmic Revolution and Beyond Nadja Betzler, Robert Bredereck, Jiehua Chen, Rolf Niedermeier
2011	J	`jnl`	A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. ACM Trans. Comput. Theory Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier
2011	C	`conf`	A New View on Rural Postman Based on Eulerian Extension and Matching. IWOCA Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller
2011	J	`jnl`	A generalization of Nemhauser and Trotterʼs local optimization theorem. J. Comput. Syst. Sci. Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier
2011	J	`jnl`	Aspects of a multivariate complexity analysis for Rectangle Tiling. Oper. Res. Lett. André Nichterlein, Michael Dom, Rolf Niedermeier
2011	J	`jnl`	Average parameterization and partial kernelization for computing medians. J. Comput. Syst. Sci. Nadja Betzler, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier
2011	J	`jnl`	Deconstructing intractability - A multivariate complexity analysis of interval constrained coloring. J. Discrete Algorithms Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
2011	—	`ch.`	Depth-First Search (Ariadne & Co.). Algorithms Unplugged Michael Dom, Falk Hüffner, Rolf Niedermeier
2011	—	`conf`	Exploiting Bounded Signal Flow for Graph Orientation Based on Cause-Effect Pairs. TAPAS Britta Dorn, Falk Hüffner, Dominikus Krüger, Rolf Niedermeier, Johannes Uhlmann
2011	J	`jnl`	Exploiting bounded signal flow for graph orientation based on cause-effect pairs. Algorithms Mol. Biol. Britta Dorn, Falk Hüffner, Dominikus Krüger, Rolf Niedermeier, Johannes Uhlmann
2011	B	`conf`	From Few Components to an Eulerian Graph by Adding Arcs. WG Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller
2011	J	`jnl`	Graph-based data clustering with overlaps. Discret. Optim. Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
2011	B	`conf`	Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs. IPEC René van Bevern, Sepp Hartung, Frank Kammer, Rolf Niedermeier, Mathias Weller
2011	B	`conf`	On Making a Distinguished Vertex Minimum Degree by Vertex Deletion. SOFSEM Nadja Betzler, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann
2011	J	`jnl`	Parameterized Algorithmics for Finding Connected Motifs in Biological Networks. IEEE ACM Trans. Comput. Biol. Bioinform. Nadja Betzler, René van Bevern, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier
2011	J	`jnl`	Parameterized Complexity of Arc-Weighted Directed Steiner Problems. SIAM J. Discret. Math. Jiong Guo, Rolf Niedermeier, Ondrej Suchý
2011	B	`conf`	Pattern-Guided Data Anonymization and Clustering. MFCS Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip
2011	B	`conf`	The Effect of Homogeneity on the Complexity of k-Anonymity. FCT Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip
2011	B	`conf`	The Parameterized Complexity of Local Search for TSP, More Refined. ISAAC Jiong Guo, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý
2011	A*	`conf`	Unweighted Coalitional Manipulation under the Borda Rule Is NP-Hard. IJCAI Nadja Betzler, Rolf Niedermeier, Gerhard J. Woeginger
2010	J	`jnl`	A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing. SIAM J. Discret. Math. Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
2010	J	`jnl`	Approximation and fixed-parameter algorithms for consecutive ones submatrix problems. J. Comput. Syst. Sci. Michael Dom, Jiong Guo, Rolf Niedermeier
2010	B	`conf`	Average Parameterization and Partial Kernelization for Computing Medians. LATIN Nadja Betzler, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier
2010	B	`conf`	Efficient Algorithms for Eulerian Extension. WG Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller
2010	A*	`conf`	Exact Algorithms and Experiments for Hierarchical Tree Clustering. AAAI Sepp Hartung, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
2010	B	`conf`	Extended Islands of Tractability for Parsimony Haplotyping. CPM Rudolf Fleischer, Jiong Guo, Rolf Niedermeier, Johannes Uhlmann, Yihui Wang, Mathias Weller, Xi Wu
2010	J	`jnl`	Fixed-Parameter Algorithms for Cluster Vertex Deletion. Theory Comput. Syst. Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier
2010	J	`jnl`	Fixed-parameter tractability results for feedback set problems in tournaments. J. Discrete Algorithms Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Anke Truß
2010	J	`jnl`	Fixed-parameter tractability results for full-degree spanning tree and its dual. Networks Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
2010	C	`conf`	Incremental List Coloring of Graphs, Parameterized by Conservation. TAMC Sepp Hartung, Rolf Niedermeier
2010	B	`conf`	Kernelization through Tidying. LATIN René van Bevern, Hannes Moser, Rolf Niedermeier
2010	B	`conf`	Measuring Indifference: Unit Interval Vertex Deletion. WG René van Bevern, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier
2010	—	`conf`	On Tractable Cases of Target Set Selection. ISAAC (1) André Nichterlein, Rolf Niedermeier, Johannes Uhlmann, Mathias Weller
2010	J	`jnl`	Parameterized computational complexity of Dodgson and Young elections. Inf. Comput. Nadja Betzler, Jiong Guo, Rolf Niedermeier
2010	B	`conf`	Partial Kernelization for Rank Aggregation: Theory and Experiments. IPEC Nadja Betzler, Robert Bredereck, Rolf Niedermeier
2010	A	`conf`	Reflections on Multivariate Algorithmics and Problem Parameterization. STACS Rolf Niedermeier
2010	J	`jnl`	Separator-based data reduction for signed graph balancing. J. Comb. Optim. Falk Hüffner, Nadja Betzler, Rolf Niedermeier
2009	—	`conf`	09171 Abstracts Collection - Adaptive, Output Sensitive, Online and Parameterized Algorithms. Adaptive, Output Sensitive, Online and Parameterized Algorithms Jérémy Barbay, Rolf Klein, Alejandro López-Ortiz, Rolf Niedermeier
2009	—	`conf`	09171 Executive Summary - Adaptive, Output Sensitive, Online and Parameterized Algorithms. Adaptive, Output Sensitive, Online and Parameterized Algorithms Jérémy Barbay, Rolf Klein, Alejandro López-Ortiz, Rolf Niedermeier
2009	B	`conf`	A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. MFCS Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier
2009	J	`jnl`	A Generalization of Nemhauser and Trotter's Local Optimization Theorem CoRR Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier
2009	A	`conf`	A Generalization of Nemhauser and Trotter's Local Optimization Theorem. STACS Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier
2009	C	`conf`	A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing. AAIM Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
2009	A*	`conf`	A Multivariate Complexity Analysis of Determining Possible Winners Given Incomplete Votes. IJCAI Nadja Betzler, Susanne Hemmann, Rolf Niedermeier
2009	—	`ed.`	Adaptive, Output Sensitive, Online and Parameterized Algorithms, 19.04. - 24.04.2009 Adaptive, Output Sensitive, Online and Parameterized Algorithms Jérémy Barbay, Rolf Klein, Alejandro López-Ortiz, Rolf Niedermeier
2009	B	`conf`	Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes. SEA Hannes Moser, Rolf Niedermeier, Manuel Sorge
2009	B	`conf`	Deconstructing Intractability: A Case Study for Interval Constrained Coloring. CPM Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
2009	J	`jnl`	Fixed-parameter algorithms for Kemeny rankings. Theor. Comput. Sci. Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond
2009	Misc	`conf`	Graph-Based Data Clustering with Overlaps. COCOON Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
2009	—	`conf`	How similarity helps to efficiently compute Kemeny rankings. AAMAS (1) Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond
2009	J	`jnl`	Isolation concepts for clique enumeration: Comparison and computational experiments. Theor. Comput. Sci. Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier
2009	J	`jnl`	Isolation concepts for efficiently enumerating dense subgraphs. Theor. Comput. Sci. Christian Komusiewicz, Falk Hüffner, Hannes Moser, Rolf Niedermeier
2009	—	`conf`	Iterative Compression for Exactly Solving NP-Hard Minimization Problems. Algorithmics of Large and Complex Networks Jiong Guo, Hannes Moser, Rolf Niedermeier
2009	B	`conf`	On Making Directed Graphs Transitive. WADS Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
2009	B	`conf`	Parameterized Complexity of Arc-Weighted Directed Steiner Problems. ISAAC Jiong Guo, Rolf Niedermeier, Ondrej Suchý
2008	J	`jnl`	Closest 4-leaf power is fixed-parameter tractable. Discret. Appl. Math. Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier
2008	J	`jnl`	Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs. Eur. J. Oper. Res. Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Niedermeier, Johannes Uhlmann
2008	—	`ch.`	Data Reduction for Domination in Graphs. Encyclopedia of Algorithms Rolf Niedermeier
2008	J	`jnl`	Data reduction and exact algorithms for clique cover. ACM J. Exp. Algorithmics Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier
2008	C	`conf`	Enumerating Isolated Cliques in Synthetic and Financial Networks. COCOA Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier
2008	B	`conf`	Fixed-Parameter Algorithms for Cluster Vertex Deletion. LATIN Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier
2008	C	`conf`	Fixed-Parameter Algorithms for Kemeny Scores. AAIM Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond
2008	J	`jnl`	Improved Algorithms and Complexity Results for Power Domination in Graphs. Algorithmica Jiong Guo, Rolf Niedermeier, Daniel Raible
2008	B	`conf`	Parameterized Algorithms and Hardness Results for Some Graph Motif Problems. CPM Nadja Betzler, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier
2008	—	`conf`	Parameterized Computational Complexity of Dodgson and Young Elections. SWAT Nadja Betzler, Jiong Guo, Rolf Niedermeier
2008	—	`ed.`	Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008. Proceedings IWPEC Martin Grohe, Rolf Niedermeier
2008	J	`jnl`	Red-blue covering problems and the consecutive ones property. J. Discrete Algorithms Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
2008	C	`conf`	Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems. TAMC Oriana Ponta, Falk Hüffner, Rolf Niedermeier
2008	J	`jnl`	Techniques for Practical Fixed-Parameter Algorithms. Comput. J. Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke
2008	—	`ch.`	Tiefensuche (Ariadne und Co.). Taschenbuch der Algorithmen Michael Dom, Falk Hüffner, Rolf Niedermeier
2008	J	`jnl`	Two fixed-parameter algorithms for Vertex Covering by Paths on Trees. Inf. Process. Lett. Jiong Guo, Rolf Niedermeier, Johannes Uhlmann
2007	J	`jnl`	Algorithms for compact letter displays: Comparison and evaluation. Comput. Stat. Data Anal. Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Hans-Peter Piepho, Ramona Schmid
2007	C	`conf`	Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems. TAMC Michael Dom, Jiong Guo, Rolf Niedermeier
2007	J	`jnl`	Das Knotenüberdeckungsproblem - Eine Fallstudie zur Didaktik NP-schwerer Probleme (Teil 1). LOG IN Rolf Niedermeier, Jörg Vogel, Michael Fothe, Mirko König
2007	J	`jnl`	Das Knotenüberdeckungsproblem Eine Fallstudie zur Didaktik NP-schwerer Probleme (Teil 2). LOG IN Rolf Niedermeier, Jörg Vogel, Michael Fothe, Mirko König
2007	J	`jnl`	Invitation to data reduction and problem kernelization. SIGACT News Jiong Guo, Rolf Niedermeier
2007	Misc	`conf`	Isolation Concepts for Enumerating Dense Subgraphs. COCOON Christian Komusiewicz, Falk Hüffner, Hannes Moser, Rolf Niedermeier
2007	A*	`conf`	Linear Problem Kernels for NP-Hard Problems on Planar Graphs. ICALP Jiong Guo, Rolf Niedermeier
2007	—	`conf`	Optimal Edge Deletions for Signed Graph Balancing. WEA Falk Hüffner, Nadja Betzler, Rolf Niedermeier
2007	J	`jnl`	Parameterized Complexity of Vertex Cover Variants. Theory Comput. Syst. Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
2007	C	`conf`	Probe Matrix Problems: Totally Balanced Matrices. AAIM David B. Chandler, Jiong Guo, Ton Kloks, Rolf Niedermeier
2006	B	`conf`	A General Data Reduction Scheme for Domination in Graphs. SOFSEM Jochen Alber, Britta Dorn, Rolf Niedermeier
2006	J	`jnl`	A fixed-parameter tractability result for multicommodity demand flow in trees. Inf. Process. Lett. Jiong Guo, Rolf Niedermeier
2006	B	`conf`	Complexity and Exact Algorithms for Multicut. SOFSEM Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Niedermeier, Johannes Uhlmann
2006	J	`jnl`	Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. J. Comput. Syst. Sci. Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke
2006	A	`conf`	Data Reduction, Exact, and Heuristic Algorithms for Clique Cover. ALENEX Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier
2006	J	`jnl`	Editorial. Theor. Comput. Sci. Rod Downey, Michael A. Langston, Rolf Niedermeier
2006	J	`jnl`	Error Compensation in Leaf Power Problems. Algorithmica Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier
2006	J	`jnl`	Exact algorithms and applications for Tree-like Weighted Set Cover. J. Discrete Algorithms Jiong Guo, Rolf Niedermeier
2006	J	`jnl`	Experiments on data reduction for optimal domination in networks. Ann. Oper. Res. Jochen Alber, Nadja Betzler, Rolf Niedermeier
2006	C	`conf`	Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments. CIAC Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Anke Truß
2006	—	`conf`	Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual. IWPEC Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
2006	—	`book`	Invitation to Fixed-Parameter Algorithms Rolf Niedermeier
2006	—	`conf`	Matrix Robustness, with an Application to Power System Observability. ACiD Matthias Brosemann, Jochen Alber, Falk Hüffner, Rolf Niedermeier
2006	—	`conf`	Minimum Membership Set Covering and the Consecutive Ones Property. SWAT Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
2006	J	`jnl`	On The Parameterized Intractability Of Motif Search Problems. Comb. Michael R. Fellows, Jens Gramm, Rolf Niedermeier
2006	J	`jnl`	Parameterized Intractability of Distinguishing Substring Selection. Theory Comput. Syst. Jens Gramm, Jiong Guo, Rolf Niedermeier
2006	J	`jnl`	Pattern matching for arc-annotated sequences. ACM Trans. Algorithms Jens Gramm, Jiong Guo, Rolf Niedermeier
2006	J	`jnl`	The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions. Int. J. Found. Comput. Sci. Sebastian Wernicke, Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier
2006	J	`jnl`	Tree decompositions of graphs: Saving memory in dynamic programming. Discret. Optim. Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann
2005	J	`jnl`	A refined search tree technique for Dominating Set on planar graphs. J. Comput. Syst. Sci. Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege
2005	Misc	`conf`	Bounded Degree Closest COCOON Michael Dom, Jiong Guo, Rolf Niedermeier
2005	J	`jnl`	Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs. Discret. Appl. Math. Jochen Alber, Frederic Dorn, Rolf Niedermeier
2005	B	`conf`	Extending the Tractability Border for Closest Leaf Powers. WG Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier
2005	J	`jnl`	Fixed-parameter tractability and data reduction for multicut in trees. Networks Jiong Guo, Rolf Niedermeier
2005	J	`jnl`	Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation. Theory Comput. Syst. Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier
2005	B	`conf`	Improved Algorithms and Complexity Results for Power Domination in Graphs. FCT Jiong Guo, Rolf Niedermeier, Daniel Raible
2005	B	`conf`	Improved Fixed-Parameter Algorithms for Two Feedback Set Problems. WADS Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke
2005	B	`conf`	Parameterized Complexity of Generalized Vertex Cover Problems. WADS Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
2004	—	`conf`	A Structural View on Parameterizing Problems: Distance from Triviality. IWPEC Jiong Guo, Falk Hüffner, Rolf Niedermeier
2004	J	`jnl`	Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems. Algorithmica Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier
2004	B	`conf`	Avoiding Forbidden Submatrices by Row Deletions. SOFSEM Sebastian Wernicke, Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier
2004	J	`jnl`	Computing the similarity of two sequences with nested arc annotations. Theor. Comput. Sci. Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier
2004	B	`conf`	Error Compensation in Leaf Root Problems. ISAAC Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier
2004	J	`jnl`	Parameterized complexity: exponential speed-up for planar graph problems. J. Algorithms Jochen Alber, Henning Fernau, Rolf Niedermeier
2004	J	`jnl`	Polynomial-time data reduction for dominating set. J. ACM Jochen Alber, Michael R. Fellows, Rolf Niedermeier
2004	—	`conf`	Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P WEA Hans L. Bodlaender, Celina M. H. de Figueiredo, Marisa Gutierrez, Ton Kloks, Rolf Niedermeier
2004	C	`conf`	Tree Decompositions of Graphs: Saving Memory in Dynamic Programming. CTW Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann
2004	J	`jnl`	Tree Decompositions of Graphs: Saving Memory in Dynamic Programming. Electron. Notes Discret. Math. Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann
2004	B	`conf`	Ubiquitous Parameterization - Invitation to Fixed-Parameter Algorithms. MFCS Rolf Niedermeier
2003	J	`jnl`	A fixed-parameter algorithm for minimum quartet inconsistency. J. Comput. Syst. Sci. Jens Gramm, Rolf Niedermeier
2003	J	`jnl`	An efficient fixed-parameter algorithm for 3-Hitting Set. J. Discrete Algorithms Rolf Niedermeier, Peter Rossmanith
2003	A	`conf`	Automated Generation of Search Tree Algorithms for Graph Modification Problems. ESA Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier
2003	J	`jnl`	Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems. Algorithmica Jens Gramm, Rolf Niedermeier, Peter Rossmanith
2003	J	`jnl`	Graph separators: a parameterized view. J. Comput. Syst. Sci. Jochen Alber, Henning Fernau, Rolf Niedermeier
2003	C	`conf`	Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation. CIAC Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier
2003	B	`conf`	On Exact and Approximation Algorithms for Distinguishing Substring Selection. FCT Jens Gramm, Jiong Guo, Rolf Niedermeier
2003	J	`jnl`	On efficient fixed-parameter algorithms for weighted vertex cover. J. Algorithms Rolf Niedermeier, Peter Rossmanith
2003	J	`jnl`	Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. Discret. Appl. Math. Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith
2002	C	`conf`	Breakpoint medians and breakpoint phylogenies: A fixed-parameter approach. ECCB Jens Gramm, Rolf Niedermeier
2002	—	`conf`	Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case. SWAT Jochen Alber, Michael R. Fellows, Rolf Niedermeier
2002	J	`jnl`	Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs. Algorithmica Jochen Alber, Hans L. Bodlaender, Henning Fernau, Ton Kloks, Rolf Niedermeier
2002	B	`conf`	Improved Tree Decomposition Based Algorithms for Domination-like Problems. LATIN Jochen Alber, Rolf Niedermeier
2002	A	`conf`	On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems. STACS Michael R. Fellows, Jens Gramm, Rolf Niedermeier
2002	J	`jnl`	Parameterized Intractability of Motif Search Problems CoRR Michael R. Fellows, Jens Gramm, Rolf Niedermeier
2002	—	`conf`	Pattern Matching for Arc-Annotated Sequences. FSTTCS Jens Gramm, Jiong Guo, Rolf Niedermeier
2002	J	`jnl`	Polynomial Time Data Reduction for Dominating Set CoRR Jochen Alber, Michael R. Fellows, Rolf Niedermeier
2002	B	`conf`	Towards Optimally Solving the LONGEST COMMON SUBSEQUENCE Problem for Sequences with Nested Arc Annotations in Linear Time. CPM Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier
2002	J	`jnl`	Towards optimal locality in mesh-indexings. Discret. Appl. Math. Rolf Niedermeier, Klaus Reinhardt, Peter Sanders
2001	J	`jnl`	An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover. J. Algorithms Henning Fernau, Rolf Niedermeier
2001	B	`conf`	Exact Solutions for CLOSEST STRING and Related Problems. ISAAC Jens Gramm, Rolf Niedermeier, Peter Rossmanith
2001	J	`jnl`	Faster exact algorithms for hard problems: A parameterized point of view. Discret. Math. Jochen Alber, Jens Gramm, Rolf Niedermeier
2001	—	`conf`	Finding Optimal Solutions to Atomix. KI/ÖGAI Falk Hüffner, Stefan Edelkamp, Henning Fernau, Rolf Niedermeier
2001	Misc	`conf`	Graph Separators: A Parameterized View. COCOON Jochen Alber, Henning Fernau, Rolf Niedermeier
2001	B	`conf`	Minimum Quartet Inconsistency Is Fixed Parameter Tractable. CPM Jens Gramm, Rolf Niedermeier
2001	J	`jnl`	Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems Electron. Colloquium Comput. Complex. Jochen Alber, Henning Fernau, Rolf Niedermeier
2001	A*	`conf`	Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems. ICALP Jochen Alber, Henning Fernau, Rolf Niedermeier
2001	B	`conf`	Refined Search Tree Technique for DOMINATING SET on Planar Graphs. MFCS Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege
2000	J	`jnl`	A general method to speed up fixed-parameter-tractable algorithms. Inf. Process. Lett. Rolf Niedermeier, Peter Rossmanith
2000	J	`jnl`	Data Independence of Read, Write, and Control Structures in PRAM Computations. J. Comput. Syst. Sci. Klaus-Jörn Lange, Rolf Niedermeier
2000	C	`conf`	Faster Exact Solutions for MAX2SAT. CIAC Jens Gramm, Rolf Niedermeier
2000	—	`conf`	Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems. SWAT Jochen Alber, Hans L. Bodlaender, Henning Fernau, Rolf Niedermeier
2000	J	`jnl`	New Upper Bounds for Maximum Satisfiability. J. Algorithms Rolf Niedermeier, Peter Rossmanith
2000	J	`jnl`	New Worst-Case Upper Bounds for MAX-2-SAT with Application to MAX-CUT Electron. Colloquium Comput. Complex. Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith
2000	B	`conf`	On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER. ISAAC Rolf Niedermeier, Peter Rossmanith
2000	J	`jnl`	On Multidimensional Curves with Hilbert Property. Theory Comput. Syst. Jochen Alber, Rolf Niedermeier
1999	B	`conf`	An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover. MFCS Henning Fernau, Rolf Niedermeier
1999	A*	`conf`	New Upper Bounds for MaxSat. ICALP Rolf Niedermeier, Peter Rossmanith
1999	J	`jnl`	Optimal Deterministic Sorting and Routing on Grids and Tori with Diagonals. Algorithmica Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith
1999	J	`jnl`	SIMPLE MAX-CUT for unit interval graphs and graphs with few P Electron. Notes Discret. Math. Hans L. Bodlaender, Ton Kloks, Rolf Niedermeier
1999	A	`conf`	Upper Bounds for Vertex Cover Further Improved. STACS Rolf Niedermeier, Peter Rossmanith
1998	Misc	`conf`	On Multi-dimensional Hilbert Indexings. COCOON Jochen Alber, Rolf Niedermeier
1998	B	`conf`	Some Prospects for Efficient Fixed Parameter Algorithms. SOFSEM Rolf Niedermeier
1998	J	`jnl`	Unambiguous Computations and Locally Definable Acceptance Types. Theor. Comput. Sci. Rolf Niedermeier, Peter Rossmanith
1997	B	`conf`	Towards Optimal Locality in Mesh-Indexings. FCT Rolf Niedermeier, Klaus Reinhardt, Peter Sanders
1996	B	`conf`	Recursively Divisible Problems. ISAAC Rolf Niedermeier
1996	—	`—`	Towards realistic and simple models of parallel computation. Rolf Niedermeier
1995	J	`jnl`	On Optimal Orow-Pram Algorithms for Computing Recursively Defined Functions. Parallel Process. Lett. Rolf Niedermeier, Peter Rossmanith
1995	A	`conf`	Optimal Average Case Sorting on Arrays. STACS Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith
1995	B	`conf`	PRAM's Towards Realistic Parallelism: BRAM's. FCT Rolf Niedermeier, Peter Rossmanith
1995	J	`jnl`	Unambiguous Auxiliary Pushdown Automata and Semi-unbounded Fan-in Circuits Inf. Comput. Rolf Niedermeier, Peter Rossmanith
1994	A	`conf`	Faster Sorting and Routing on Grids with Diagonals. STACS Manfred Kunde, Rolf Niedermeier, Peter Rossmanith
1993	—	`conf`	Data-Independences of Parallel Random Access Machines. FSTTCS Klaus-Jörn Lange, Rolf Niedermeier
1993	A	`conf`	Extended Locally Definable Acceptance Types (Extended Abstract). STACS Rolf Niedermeier, Peter Rossmanith
1993	J	`jnl`	Faster sorting and routing on grids with diagonals Forschungsberichte, TU Munich Manfred Kunde, Rolf Niedermeier, Peter Rossmanith
1993	B	`conf`	On the Power of Reading and Writing Simultaneously in Parallel Computation. ISAAC Rolf Niedermeier, Peter Rossmanith
1992	J	`jnl`	Optimal parallel algorithms for computing recursively defined functions Forschungsberichte, TU Munich Rolf Niedermeier, Peter Rossmanith
1992	B	`conf`	Unambiguous Simulations of Auxiliary Pushdown Automata and Circuits (Extended Abstract). LATIN Rolf Niedermeier, Peter Rossmanith
1990	J	`jnl`	Unambiguous simulations of auxiliary pushdown automata and circuits Forschungsberichte, TU Munich Rolf Niedermeier, Peter Rossmanith