Rolf Niedermeier
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
153
Venues
31
Active years
1992–2023
Best venue rank
A*
Where they publish
- A*AAAI16 papers
- BISAAC14 papers
- A*IJCAI12 papers
- BMFCS12 papers
- ASTACS11 papers
- BWG10 papers
- BCPM9 papers
- BFCT7 papers
- CCIAC6 papers
- A*ICALP6 papers
- BWADS5 papers
- CAAIM5 papers
- BSOFSEM5 papers
- BLATIN5 papers
- NationalCOCOON5 papers
- CTAMC4 papers
- AESA3 papers
- BSAGT3 papers
- AECAI2 papers
- CCiE2 papers
- BSPAA1 paper
- A*KDD1 paper
- A*EC1 paper
- ASDM1 paper
- CAlgosensors1 paper
- AGD1 paper
- CIWOCA1 paper
- CCOCOA1 paper
- AALENEX1 paper
- CECCB1 paper
- NationalKI1 paper
Papers
153 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2023 | AAAI | Fair Short Paths in Vertex-Colored Graphs. | Matthias Bentert, Leon Kellerhals, Rolf Niedermeier |
| 2023 | AAAI | Parameterized Algorithms for Colored Clustering. | Leon Kellerhals, Tomohiro Koana, Pascal Kunz, Rolf Niedermeier |
| 2023 | ECAI | High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming. | Robert Bredereck, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier |
| 2023 | STACS | Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions. | Klaus Heeger, Andr Nichterlein, Rolf Niedermeier |
| 2022 | AAAI | Theory of and Experiments on Minimally Invasive Stability Preservation in Changing Two-Sided Matching Markets. | Niclas Boehmer, Klaus Heeger, Rolf Niedermeier |
| 2022 | AAAI | On Improving Resource Allocations by Sharing. | Robert Bredereck, Andrzej Kaczmarczyk, Junjie Luo, Rolf Niedermeier, Florian Sachse |
| 2022 | AAAI | Modification-Fair Cluster Editing. | Vincent Froese, Leon Kellerhals, Rolf Niedermeier |
| 2022 | CPM | An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions. | Laurent Bulteau, Mark Jones, Rolf Niedermeier, Till Tantau |
| 2022 | ESA | There and Back Again: On Applying Data Reduction Rules by Undoing Others. | Aleksander Figiel, Vincent Froese, Andr Nichterlein, Rolf Niedermeier |
| 2022 | IJCAI | Understanding Distance Measures Among Elections. | Niclas Boehmer, Piotr Faliszewski, Rolf Niedermeier, Stanislaw Szufa, Tomasz Was |
| 2022 | MFCS | Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems. | Niclas Boehmer, Klaus Heeger, Rolf Niedermeier |
| 2022 | STACS | Delay-Robust Routes in Temporal Graphs. | Eugen Fchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken |
| 2021 | AAAI | A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem. | Matthias Bentert, Robert Bredereck, Pter Gyrgyi, Andrzej Kaczmarczyk, Rolf Niedermeier |
| 2021 | AAAI | Equitable Scheduling on a Single Machine. | Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay |
| 2021 | CIAC | On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering. | Aleksander Figiel, Anne-Sophie Himmel, Andr Nichterlein, Rolf Niedermeier |
| 2021 | FCT | On Finding Separators in Temporal Split and Permutation Graphs. | Nicolas Maack, Hendrik Molter, Rolf Niedermeier, Malte Renken |
| 2021 | IJCAI | Winner Robustness via Swap- and Shift-Bribery: Parameterized Counting Complexity and Experiments. | Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier |
| 2021 | IJCAI | Putting a Compass on the Map of Elections. | Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Stanislaw Szufa |
| 2021 | IJCAI | Two Influence Maximization Games on Graphs Made Temporal. | Niclas Boehmer, Vincent Froese, Julia Henkel, Yvonne Lasars, Rolf Niedermeier, Malte Renken |
| 2021 | IJCAI | Interference-free Walks in Time: Temporally Disjoint Paths. | Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche |
| 2021 | STACS | Binary Matrix Completion Under Diameter Constraints. | Tomohiro Koana, Vincent Froese, Rolf Niedermeier |
| 2021 | SPAA | Optimal Virtual Network Embeddings for Tree Topologies. | Aleksander Figiel, Leon Kellerhals, Rolf Niedermeier, Matthias Rost, Stefan Schmid, Philipp Zschoche |
| 2021 | WG | The Complexity of Gerrymandering over Graphs: Paths and Trees. | Matthias Bentert, Tomohiro Koana, Rolf Niedermeier |
| 2021 | WG | Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. | Maciej Rymar, Hendrik Molter, Andr Nichterlein, Rolf Niedermeier |
| 2020 | AAAI | Electing Successive Committees: Complexity and Algorithms. | Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier |
| 2020 | AAAI | Adapting Stable Matchings to Evolving Preferences. | Robert Bredereck, Jiehua Chen, Dusan Knop, Junjie Luo, Rolf Niedermeier |
| 2020 | AAAI | Parameterized Algorithms for Finding a Collective Set of Items. | Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier |
| 2020 | CPM | Parameterized Algorithms for Matrix Completion with Radius Constraints. | Tomohiro Koana, Vincent Froese, Rolf Niedermeier |
| 2020 | CPM | Faster Binary Mean Computation Under Dynamic Time Warping. | Nathan Schaar, Vincent Froese, Rolf Niedermeier |
| 2020 | ISAAC | Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs. | Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche |
| 2020 | KDD | Algorithmic Aspects of Temporal Betweenness. | Sebastian Bu, Hendrik Molter, Rolf Niedermeier, Maciej Rymar |
| 2020 | STACS | Computing Maximum Matchings in Temporal Graphs. | George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche |
| 2020 | SAGT | Line-Up Elections: Parallel Voting with Shared Candidate Pool. | Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier |
| 2020 | SAGT | Bribery and Control in Stable Marriage. | Niclas Boehmer, Robert Bredereck, Klaus Heeger, Rolf Niedermeier |
| 2020 | WG | Feedback Edge Sets in Temporal Graphs. | Roman Haag, Hendrik Molter, Rolf Niedermeier, Malte Renken |
| 2019 | EC | High-Multiplicity Fair Allocation: Lenstra Empowered by N-fold Integer Programming. | Robert Bredereck, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier |
| 2019 | IJCAI | An Experimental View on Committees Providing Justified Representation. | Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier |
| 2019 | ISAAC | Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters. | Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier |
| 2018 | CiE | Diminishable Parameterized Problems and Strict Polynomial Kernelization. | Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier |
| 2018 | ESA | Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. | Viatcheslav Korenwein, Andr Nichterlein, Rolf Niedermeier, Philipp Zschoche |
| 2018 | ISAAC | An Adaptive Version of Brandes' Algorithm for Betweenness Centrality. | Matthias Bentert, Alexander Dittmann, Leon Kellerhals, Andr Nichterlein, Rolf Niedermeier |
| 2018 | MFCS | The Complexity of Finding Small Separators in Temporal Graphs. | Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier |
| 2018 | SDM | Exact Mean Computation in Dynamic Time Warping Spaces. | Markus Brill, Till Fluschnik, Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, David Schultz |
| 2018 | WG | Temporal Graph Classes: A View Through Temporal Separators. | Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche |
| 2017 | AAAI | Teams in Online Scheduling Polls: Game-Theoretic Aspects. | Robert Bredereck, Jiehua Chen, Rolf Niedermeier, Svetlana Obraztsova, Nimrod Talmon |
| 2017 | Algosensors | Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks. | Matthias Bentert, Ren van Bevern, Andr Nichterlein, Rolf Niedermeier |
| 2017 | CIAC | Assessing the Computational Complexity of Multi-layer Subgraph Detection. | Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge |
| 2017 | FCT | Parameterized Aspects of Triangle Enumeration. | Matthias Bentert, Till Fluschnik, Andr Nichterlein, Rolf Niedermeier |
| 2017 | IJCAI | On Coalitional Manipulation for Multiwinner Elections: Shortlisting. | Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier |
| 2017 | MFCS | The Power of Linear-Time Data Reduction for Maximum Matching. | George B. Mertzios, Andr Nichterlein, Rolf Niedermeier |
| 2017 | SAGT | Robustness Among Multiwinner Voting Rules. | Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon |
| 2017 | WADS | When Can Graph Hyperbolicity Be Computed in Linear Time? | Till Fluschnik, Christian Komusiewicz, George B. Mertzios, Andr Nichterlein, Rolf Niedermeier, Nimrod Talmon |
| 2016 | AAAI | Complexity of Shift Bribery in Committee Elections. | Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon |
| 2016 | ECAI | h-Index Manipulation by Undoing Merges. | Ren van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh |
| 2016 | GD | Twins in Subdivision Drawings of Hypergraphs. | Ren van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge |
| 2016 | ICALP | Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems. | Till Fluschnik, Danny Hermelin, Andr Nichterlein, Rolf Niedermeier |
| 2016 | IJCAI | Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels. | Bernhard Bliem, Robert Bredereck, Rolf Niedermeier |
| 2015 | AAAI | Elections with Few Voters: Candidate Control Can Be Easy. | Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon |
| 2015 | CIAC | A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths. | Cristina Bazgan, Andr Nichterlein, Rolf Niedermeier |
| 2015 | IJCAI | H-Index Manipulation by Merging Articles: Models, Theory, and Experiments. | Ren van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh |
| 2015 | IJCAI | Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty. | Robert Bredereck, Jiehua Chen, Rolf Niedermeier, Toby Walsh |
| 2015 | TAMC | The Complexity of Finding Effectors. | Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon |
| 2015 | WG | Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics. | Christian Komusiewicz, Andr Nichterlein, Rolf Niedermeier |
| 2014 | AAAI | Prices Matter for the Parameterized Complexity of Shift Bribery. | Robert Bredereck, Jiehua Chen, Piotr Faliszewski, Andr Nichterlein, Rolf Niedermeier |
| 2014 | AAIM | The Complexity of Degree Anonymization by Vertex Addition. | Robert Bredereck, Vincent Froese, Sepp Hartung, Andr Nichterlein, Rolf Niedermeier, Nimrod Talmon |
| 2014 | ICALP | Star Partitions of Perfect Graphs. | Ren van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger |
| 2014 | ISAAC | Co-Clustering Under the Maximum Norm. | Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier |
| 2014 | MFCS | Network-Based Dissolution. | Ren van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger |
| 2014 | MFCS | Combinatorial Voter Control in Elections. | Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon |
| 2014 | WG | The Parameterized Complexity of the Rainbow Subgraph Problem. | Falk Hffner, Christian Komusiewicz, Rolf Niedermeier, Martin Rtzschke |
| 2013 | AAIM | Pattern-Guided | Robert Bredereck, Andr Nichterlein, Rolf Niedermeier |
| 2013 | ICALP | A Refined Complexity Analysis of Degree Anonymization in Graphs. | Sepp Hartung, Andr Nichterlein, Rolf Niedermeier, Ondrej Such |
| 2013 | ISAAC | Effective and Efficient Data Reduction for the Subset Interconnection Design Problem. | Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Such, Mathias Weller |
| 2013 | MFCS | A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems. | Vincent Froese, Ren van Bevern, Rolf Niedermeier, Manuel Sorge |
| 2013 | WADS | On Explaining Integer Vectors by Few Homogenous Segments. | Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Ondrej Such |
| 2012 | AAAI | A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. | Robert Bredereck, Jiehua Chen, Sepp Hartung, Rolf Niedermeier, Ondrej Such, Stefan Kratsch |
| 2012 | CiE | Confluence in Data Reduction: Bridging Graph Transformation and Kernelization. | Hartmut Ehrig, Claudia Ermel, Falk Hffner, Rolf Niedermeier, Olga Runge |
| 2012 | CPM | Partitioning into Colorful Components by Minimum Edge Deletions. | Sharon Bruckner, Falk Hffner, Christian Komusiewicz, Rolf Niedermeier, Sven Thiel, Johannes Uhlmann |
| 2012 | ISAAC | Interval Scheduling and Colorful Independent Sets. | Ren van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller |
| 2012 | MFCS | New Races in Parameterized Algorithmics. | Christian Komusiewicz, Rolf Niedermeier |
| 2011 | FCT | The Effect of Homogeneity on the Complexity of k-Anonymity. | Robert Bredereck, Andr Nichterlein, Rolf Niedermeier, Geevarghese Philip |
| 2011 | IJCAI | Unweighted Coalitional Manipulation under the Borda Rule Is NP-Hard. | Nadja Betzler, Rolf Niedermeier, Gerhard J. Woeginger |
| 2011 | ISAAC | The Parameterized Complexity of Local Search for TSP, More Refined. | Jiong Guo, Sepp Hartung, Rolf Niedermeier, Ondrej Such |
| 2011 | IWOCA | A New View on Rural Postman Based on Eulerian Extension and Matching. | Manuel Sorge, Ren van Bevern, Rolf Niedermeier, Mathias Weller |
| 2011 | MFCS | Pattern-Guided Data Anonymization and Clustering. | Robert Bredereck, Andr Nichterlein, Rolf Niedermeier, Geevarghese Philip |
| 2011 | SOFSEM | On Making a Distinguished Vertex Minimum Degree by Vertex Deletion. | Nadja Betzler, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann |
| 2011 | WG | From Few Components to an Eulerian Graph by Adding Arcs. | Manuel Sorge, Ren van Bevern, Rolf Niedermeier, Mathias Weller |
| 2010 | AAAI | Exact Algorithms and Experiments for Hierarchical Tree Clustering. | Sepp Hartung, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann |
| 2010 | CPM | Extended Islands of Tractability for Parsimony Haplotyping. | Rudolf Fleischer, Jiong Guo, Rolf Niedermeier, Johannes Uhlmann, Yihui Wang, Mathias Weller, Xi Wu |
| 2010 | ISAAC | On Tractable Cases of Target Set Selection. | Andr Nichterlein, Rolf Niedermeier, Johannes Uhlmann, Mathias Weller |
| 2010 | LATIN | Average Parameterization and Partial Kernelization for Computing Medians. | Nadja Betzler, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier |
| 2010 | LATIN | Kernelization through Tidying. | Ren van Bevern, Hannes Moser, Rolf Niedermeier |
| 2010 | STACS | Reflections on Multivariate Algorithmics and Problem Parameterization. | Rolf Niedermeier |
| 2010 | TAMC | Incremental List Coloring of Graphs, Parameterized by Conservation. | Sepp Hartung, Rolf Niedermeier |
| 2010 | WG | Measuring Indifference: Unit Interval Vertex Deletion. | Ren van Bevern, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier |
| 2010 | WG | Efficient Algorithms for Eulerian Extension. | Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller |
| 2009 | AAIM | A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing. | Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann |
| 2009 | COCOON | Graph-Based Data Clustering with Overlaps. | Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann |
| 2009 | CPM | Deconstructing Intractability: A Case Study for Interval Constrained Coloring. | Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann |
| 2009 | IJCAI | A Multivariate Complexity Analysis of Determining Possible Winners Given Incomplete Votes. | Nadja Betzler, Susanne Hemmann, Rolf Niedermeier |
| 2009 | ISAAC | Parameterized Complexity of Arc-Weighted Directed Steiner Problems. | Jiong Guo, Rolf Niedermeier, Ondrej Such |
| 2009 | MFCS | A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. | Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier |
| 2009 | STACS | A Generalization of Nemhauser and Trotter's Local Optimization Theorem. | Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier |
| 2009 | WADS | On Making Directed Graphs Transitive. | Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann |
| 2008 | AAIM | Fixed-Parameter Algorithms for Kemeny Scores. | Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond |
| 2008 | COCOA | Enumerating Isolated Cliques in Synthetic and Financial Networks. | Falk Hffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier |
| 2008 | CPM | Parameterized Algorithms and Hardness Results for Some Graph Motif Problems. | Nadja Betzler, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier |
| 2008 | LATIN | Fixed-Parameter Algorithms for Cluster Vertex Deletion. | Falk Hffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier |
| 2008 | TAMC | Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems. | Oriana Ponta, Falk Hffner, Rolf Niedermeier |
| 2007 | AAIM | Probe Matrix Problems: Totally Balanced Matrices. | David B. Chandler, Jiong Guo, Ton Kloks, Rolf Niedermeier |
| 2007 | COCOON | Isolation Concepts for Enumerating Dense Subgraphs. | Christian Komusiewicz, Falk Hffner, Hannes Moser, Rolf Niedermeier |
| 2007 | ICALP | Linear Problem Kernels for NP-Hard Problems on Planar Graphs. | Jiong Guo, Rolf Niedermeier |
| 2007 | TAMC | Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems. | Michael Dom, Jiong Guo, Rolf Niedermeier |
| 2006 | ALENEX | Data Reduction, Exact, and Heuristic Algorithms for Clique Cover. | Jens Gramm, Jiong Guo, Falk Hffner, Rolf Niedermeier |
| 2006 | CIAC | Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments. | Michael Dom, Jiong Guo, Falk Hffner, Rolf Niedermeier, Anke Tru |
| 2006 | SOFSEM | A General Data Reduction Scheme for Domination in Graphs. | Jochen Alber, Britta Dorn, Rolf Niedermeier |
| 2006 | SOFSEM | Complexity and Exact Algorithms for Multicut. | Jiong Guo, Falk Hffner, Erhan Kenar, Rolf Niedermeier, Johannes Uhlmann |
| 2005 | COCOON | Bounded Degree Closest | Michael Dom, Jiong Guo, Rolf Niedermeier |
| 2005 | FCT | Improved Algorithms and Complexity Results for Power Domination in Graphs. | Jiong Guo, Rolf Niedermeier, Daniel Raible |
| 2005 | WADS | Improved Fixed-Parameter Algorithms for Two Feedback Set Problems. | Jiong Guo, Jens Gramm, Falk Hffner, Rolf Niedermeier, Sebastian Wernicke |
| 2005 | WADS | Parameterized Complexity of Generalized Vertex Cover Problems. | Jiong Guo, Rolf Niedermeier, Sebastian Wernicke |
| 2005 | WG | Extending the Tractability Border for Closest Leaf Powers. | Michael Dom, Jiong Guo, Falk Hffner, Rolf Niedermeier |
| 2004 | ISAAC | Error Compensation in Leaf Root Problems. | Michael Dom, Jiong Guo, Falk Hffner, Rolf Niedermeier |
| 2004 | MFCS | Ubiquitous Parameterization - Invitation to Fixed-Parameter Algorithms. | Rolf Niedermeier |
| 2004 | SOFSEM | Avoiding Forbidden Submatrices by Row Deletions. | Sebastian Wernicke, Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier |
| 2003 | CIAC | Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation. | Jens Gramm, Jiong Guo, Falk Hffner, Rolf Niedermeier |
| 2003 | ESA | Automated Generation of Search Tree Algorithms for Graph Modification Problems. | Jens Gramm, Jiong Guo, Falk Hffner, Rolf Niedermeier |
| 2003 | FCT | On Exact and Approximation Algorithms for Distinguishing Substring Selection. | Jens Gramm, Jiong Guo, Rolf Niedermeier |
| 2002 | CPM | Towards Optimally Solving the LONGEST COMMON SUBSEQUENCE Problem for Sequences with Nested Arc Annotations in Linear Time. | Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier |
| 2002 | ECCB | Breakpoint medians and breakpoint phylogenies: A fixed-parameter approach. | Jens Gramm, Rolf Niedermeier |
| 2002 | LATIN | Improved Tree Decomposition Based Algorithms for Domination-like Problems. | Jochen Alber, Rolf Niedermeier |
| 2002 | STACS | On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems. | Michael R. Fellows, Jens Gramm, Rolf Niedermeier |
| 2001 | COCOON | Graph Separators: A Parameterized View. | Jochen Alber, Henning Fernau, Rolf Niedermeier |
| 2001 | CPM | Minimum Quartet Inconsistency Is Fixed Parameter Tractable. | Jens Gramm, Rolf Niedermeier |
| 2001 | ICALP | Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems. | Jochen Alber, Henning Fernau, Rolf Niedermeier |
| 2001 | ISAAC | Exact Solutions for CLOSEST STRING and Related Problems. | Jens Gramm, Rolf Niedermeier, Peter Rossmanith |
| 2001 | KI | Finding Optimal Solutions to Atomix. | Falk Hffner, Stefan Edelkamp, Henning Fernau, Rolf Niedermeier |
| 2001 | MFCS | Refined Search Tree Technique for DOMINATING SET on Planar Graphs. | Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege |
| 2000 | CIAC | Faster Exact Solutions for MAX2SAT. | Jens Gramm, Rolf Niedermeier |
| 2000 | ISAAC | On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER. | Rolf Niedermeier, Peter Rossmanith |
| 1999 | ICALP | New Upper Bounds for MaxSat. | Rolf Niedermeier, Peter Rossmanith |
| 1999 | MFCS | An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover. | Henning Fernau, Rolf Niedermeier |
| 1999 | STACS | Upper Bounds for Vertex Cover Further Improved. | Rolf Niedermeier, Peter Rossmanith |
| 1998 | COCOON | On Multi-dimensional Hilbert Indexings. | Jochen Alber, Rolf Niedermeier |
| 1998 | SOFSEM | Some Prospects for Efficient Fixed Parameter Algorithms. | Rolf Niedermeier |
| 1997 | FCT | Towards Optimal Locality in Mesh-Indexings. | Rolf Niedermeier, Klaus Reinhardt, Peter Sanders |
| 1996 | ISAAC | Recursively Divisible Problems. | Rolf Niedermeier |
| 1995 | FCT | PRAM's Towards Realistic Parallelism: BRAM's. | Rolf Niedermeier, Peter Rossmanith |
| 1995 | STACS | Optimal Average Case Sorting on Arrays. | Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith |
| 1994 | STACS | Faster Sorting and Routing on Grids with Diagonals. | Manfred Kunde, Rolf Niedermeier, Peter Rossmanith |
| 1993 | ISAAC | On the Power of Reading and Writing Simultaneously in Parallel Computation. | Rolf Niedermeier, Peter Rossmanith |
| 1993 | STACS | Extended Locally Definable Acceptance Types (Extended Abstract). | Rolf Niedermeier, Peter Rossmanith |
| 1992 | LATIN | Unambiguous Simulations of Auxiliary Pushdown Automata and Circuits (Extended Abstract). | Rolf Niedermeier, Peter Rossmanith |