Sie sind hier

## Conference Publications 2021

 Matthias Bentert and Robert Bredereck and Péter Györgyi and Andrzej Kaczmarczyk and Rolf Niedermeier. A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem. In Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI '21), 2021. Accepted for publication. Bibtex entry
 Niclas Boehmer and Rolf Niedermeier. Broadening the Research Agenda for Computational Social Choice: Multiple Preference Profiles and Multiple Solutions. In Proceedings of the 20th International Conference on Autonomous Agents and Multiagent Systems (AAMAS '21): Blue Sky Ideas Track, pages 1–5. IFAAMAS, 2021. Bibtex entry Link to publication
 Niclas Boehmer and Robert Bredereck and Piotr Faliszewski and Rolf Niedermeier and Stanislaw Szufa. Putting a Compass on the Map of Elections. In Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI '21), ijcai.org, 2021. Accepted for publication. Bibtex entry
 Niclas Boehmer and Robert Bredereck and Piotr Faliszewski and Rolf Niedermeier. Winner Robustness via Swap- and Shift-Bribery: Parameterized Counting Complexity and Experiments. In Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI '21), ijcai.org, 2021. Accepted for publication. Bibtex entry
 Niclas Boehmer and Vincent Froese and Julia Henkel and Yvonne Lasars and Rolf Niedermeier and Malte Renken. Two Influence Maximization Games on Graphs Made Temporal. In Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI '21), ijcai.org, 2021. Accepted for publication. Bibtex entry
 Robert Bredereck and Aleksander Figiel and Andrzej Kaczmarczyk and Dušan Knop and Rolf Niedermeier. High-Multiplicity Fair Allocation Made More Practical. In Proceedings of the 20th International Conference on Autonomous Agents and Multiagent Systems (AAMAS '21), 2021. Accepted for publication. Bibtex entry
 Aleksander Figiel and Anne-Sophie Himmel and André Nichterlein and Rolf Niedermeier. On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering. In Proceedings of the 11th International Conference on Algorithms and Complexity (CIAC '21), Springer, 2021. Accepted for publication. Bibtex entry Link to publication
 Till Fluschnik. A Multistage View on 2-Satisfiability. In Proceedings of the 11th International Conference on Algorithms and Complexity (CIAC '21), Springer, 2021. Accepted for publication. Bibtex entry Link to publication
 Till Fluschnik and Leon Kellerhals. Placing Green Bridges Optimally, with a Multivariate Analysis. In Proceedings of the 17th Conference on Computability in Europe (CiE '21), Springer, 2021. Accepted for publication. Bibtex entry Link to publication
 Klaus Heeger and Danny Hermelin and George B. Mertzios and Hendrik Molter and Rolf Niedermeier and Dvir Shabtay. Equitable Scheduling on a Single Machine. In Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI '21), AAAI Press, 2021. Accepted for publication. Bibtex entry Link to publication
 Nina Klobas and George B. Mertzios and Hendrik Molter and Rolf Niedermeier and Philipp Zschoche. Interference-free Walks in Time: Temporally Disjoint Paths. In Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI '21), ijcai.org, 2021. Accepted for publication. Bibtex entry
 Tomohiro Koana and Vincent Froese and Rolf Niedermeier. Binary Matrix Completion Under Diameter Constraints. In Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science (STACS '21), pages 47:1–47:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. Bibtex entry
 Maciej Rymar and Hendrik Molter and André Nicherlein and Rolf Niedermeier. Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. In Proceedings of the 47th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '21), Springer, 2021. Accepted for publication. Bibtex entry

## Conference Publications 2020

 Matthias Bentert and Piotr Skowron. Comparing Election Methods Where Each Voter Ranks Only Few Candidates. In Proceedings of the 34st AAAI Conference on Artificial Intelligence (AAAI '20), pages 2218–2225. AAAI Press, 2020. Bibtex entry
 Matthias Bentert and Klaus Heeger and Dusan Knop. Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters. In Proceedings of 31st International Symposium on Algorithms and Computation (ISAAC 2020), pages 36:1–36:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. Bibtex entry
 Niclas Boehmer and Klaus Heeger. A Fine-Grained View on Stable Many-To-One Matching Problems with Lower and Upper Quotas. In Proceedings of the 16th International Conference on Web and Internet Economics (WINE '20), pages 31–44. Springer, 2020. Bibtex entry
 Niclas Boehmer and Edith Elkind. Individual-Based Stability in Hedonic Diversity Games. In Proceedings of the 34st AAAI Conference on Artificial Intelligence (AAAI '20), pages 1822–1829. AAAI Press, 2020. Bibtex entry
 Niclas Boehmer and Edith Elkind. Stable Roommate Problem with Diversity Preferences. In Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems (AAMAS '20), pages 1780–1782. IFAAMAS, 2020. Bibtex entry
 Niclas Boehmer and Edith Elkind. Stable Roommate Problem with Diversity Preferences. In Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI '20), pages 96–102. AAAI Press, 2020. Bibtex entry
 Niclas Boehmer and Robert Bredereck and Dušan Knop and Junjie Luo. Fine-Grained View on Bribery for Group Identification. In Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI '20), pages 67–73. ijcai.org, 2020. Bibtex entry Link to publication
 Niclas Boehmer and Robert Bredereck and Piotr Faliszewski and Andrzej Kaczmarczyk and Rolf Niedermeier. Line-Up Elections: Parallel Voting with Shared Candidate Pool. In Proceedings of the 13th Symposium on Algorithmic Game Theory (SAGT '20), pages 275–290. 2020. Bibtex entry
 Niclas Boehmer and Robert Bredereck and Klaus Heeger and Rolf Niedermeier. Bribery and Control in Stable Marriage. In Proceedings of the 13th Symposium on Algorithmic Game Theory (SAGT '20), pages 163–177. 2020. Bibtex entry
 Robert Bredereck and Klaus Heeger and Dušan Knop and Rolf Niedermeier. Multidimensional Stable Roommates with Master List. In Proceedings of the 16th International Conference on Web and Internet Economics (WINE '20), pages 59–73. Springer, 2020. Bibtex entry
 Robert Bredereck and Andrzej Kaczmarczyk and Rolf Niedermeier. Electing Successive Committees: Complexity and Algorithms. In Proceedings of the 34st AAAI Conference on Artificial Intelligence (AAAI '20), pages 1846–1853. AAAI Press, 2020. Bibtex entry
 Robert Bredereck and Piotr Faliszewski and Andrzej Kaczmarczyk and Dušan Knop and Rolf Niedermeier. Parameterized Algorithms for Finding a Collective Set of Items. In Proceedings of the 34st AAAI Conference on Artificial Intelligence (AAAI '20), pages 1838–1845. AAAI Press, 2020. Bibtex entry
 Robert Bredereck and Jiehua Chen and Dušan Knop and Junjie Luo and Rolf Niedermeier. Adapting Stable Matchings to Evolving Preferences. In Proceedings of the 34st AAAI Conference on Artificial Intelligence (AAAI '20), pages 1830–1837. AAAI Press, 2020. Bibtex entry
 Robert Bredereck and Piotr Faliszewski and Michal Furdyna and Andrzej Kaczmarczyk and Martin Lackner. Strategic Campaign Management in Apportionment Elections. In Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI '20), pages 103–109. ijcai.org, 2020. Bibtex entry
 Robert Bredereck and Lilian Jacobs and Leon Kellerhals. Maximizing the Spread of an Opinion in Few Steps: Opinion Diffusion in Non-Binary Networks. In Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI '20), pages 1622–1628. ijcai.org, 2020. Bibtex entry
 Sebastian Buß and Hendrik Molter and Rolf Niedermeier and Maciej Rymar. Algorithmic Aspects of Temporal Betweenness. In Proceedings of the 26th SIGKDD Conference on Knowledge Discovery and Data Mining (KDD '20), pages 2084–2092. ACM, 2020. Bibtex entry
 Arnaud Casteigts and Anne-Sophie Himmel and Hendrik Molter and Philipp Zschoche. The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints. In Proceedings of the 31st International Symposium on Algorithms and Computation (ISAAC '20), pages 30:1–30:18. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2020. Bibtex entry
 Till Fluschnik and Hendrik Molter and Rolf Niedermeier and Malte Renken and Philipp Zschoche. As Time Goes By: Reflections on Treewidth for Temporal Graphs. In Treewidth, Kernels, and Algorithms - Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday, pages 49–77. Springer, 2020. Bibtex entry
 Till Fluschnik and Rolf Niedermeier and Carsten Schubert and Philipp Zschoche. Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs. In Proceedings of the 31st International Symposium on Algorithms and Computation (ISAAC'20), pages 43:1–43:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. Bibtex entry
 Roman Haag and Hendrik Molter and Rolf Niedermeier and Malte Renken. Feedback Edge Sets in Temporal Graphs. In Proceedings of the 46th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '20), pages 200–212. Springer, 2020. Bibtex entry
 Leon Kellerhals and Tomohiro Koana. Parameterized Complexity of Geodetic Set. In Proceedings of 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), pages 20:1–20:14. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2020. Bibtex entry
 Tomohiro Koana and Vincent Froese and Rolf Niedermeier. Parameterized Algorithms for Matrix Completion With Radius Constraints. In Proceedings of the 31th Annual Symposium on Combinatorial Pattern Matching (CPM '20), pages 20:1–20:14. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2020. Bibtex entry
 Tomohiro Koana and Christian Komusiewicz and Frank Sommer. Exploiting c-Closure in Kernelization Algorithms for Graph Problems. In Proceedings of the 28th Annual European Symposium on Algorithms, (ESA 2020), pages 65:1–65:17. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2020. Bibtex entry Link to publication
 Tomohiro Koana and Christian Komusiewicz and Frank Sommer. Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. In Proceedings of 31st International Symposium on Algorithms and Computation (ISAAC 2020), pages 20:1–20:17. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2020. Bibtex entry
 George B. Mertzios and Hendrik Molter and Rolf Niedermeier and Viktor Zamaraev and Philipp Zschoche. Computing Maximum Matchings in Temporal Graphs. In Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science (STACS '20), pages 27:1–27:14. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2020. Bibtex entry
 Nathan Schaar and Vincent Froese and Rolf Niedermeier. Faster Binary Mean Computation Under Dynamic Time Warping. In Proceedings of the 31th Annual Symposium on Combinatorial Pattern Matching (CPM '20), pages 28:1–28:13. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2020. Bibtex entry

## Conference Publications 2019

 Matthias Bentert and André Nichterlein. Parameterized Complexity of Diameter. In Proceedings of the 11th International Conference on Algorithms and Complexity (CIAC '19), pages 50–61. Springer, 2019. Bibtex entry
 Matthias Bentert and Roman Haag and Christian Hofer and Tomohiro Koana and André Nichterlein. Parameterized Complexity of Min-Power Asymmetric Connectivity. In Proceedings of the 30th International Workshop (IWOCA '19), pages 85–96. Springer, 2019. Bibtex entry Link to publication
 René van Bevern and Oxana Yu. Tsidulko and Philipp Zschoche. Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under Matroid Constraints. In 11th International Conference on Algorithms and Complexity (CIAC '19), pages 62–74. Springer, 2019. Bibtex entry Link to publication
 René van Bevern and Till Fluschnik and Oxana Yu. Tsidulko. On (1+$\varepsilon$)-approximate Data Reduction for the Rural Postman Problem. In Proceedings of the 18th International Conference on Mathematical Optimization Theory and Operations Research (MOTOR 2019), pages 279–294. Springer, 2019. Bibtex entry Link to publication
 Robert Bredereck and Klaus Heeger and Dušan Knop and Rolf Niedermeier. Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters. In Proceedings of the 30th International Symposium on Algorithms and Computation (ISAAC '19), pages 44:1–44:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. Bibtex entry
 Robert Bredereck and Andrzej Kaczmarczyk and Dušan Knop and Rolf Niedermeier. High-Multiplicity Fair Allocation: Lenstra Empowered by N-fold Integer Programming. In Proceedings of the 20th ACM Conference on Economics and Computation (EC'19), pages 505–523. ACM, 2019. Bibtex entry
 Robert Bredereck and Piotr Faliszewski and Andrzej Kaczmarczyk and Rolf Niedermeier. An Experimental View on Committees Providing Justified Representation. In Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI '19), pages 109–115. AAAI Press, 2019. Bibtex entry Link to original publication
 Robert Bredereck and Junjie Luo. Complexity of Manipulation in Premise-Based Judgment Aggregation with Simple Formulas. In Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS '19), pages 819–827. IFAAMAS, 2019. Bibtex entry
 Steven Chaplick and Fedor V. Fomin and Petr A. Golovach and Dušan Knop and Peter Zeman. Kernelization of Graph Hamiltonicity: Proper H-Graphs. In Proceedings of the Algorithms and Data Structures - 16th International Symposium, (WADS '19), pages 296–310. Springer, 2019. Bibtex entry Link to publication
 Eduard Eiben and Robert Ganian and Dušan Knop and Sebastian Ordyniak. Solving Integer Quadratic Programming via Explicit and Structural Restrictions. In Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI '19), pages 1477–1484. AAAI Press, 2019. Bibtex entry Link to publication
 Eduard Eiben and Dušan Knop and Fahad Panolan and Ondřej Suchý. Complexity of the Steiner Network Problem with Respect to the Number of Terminals. In Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science (STACS '19), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. Bibtex entry
 Eduard Eiben and Robert Ganian and Dušan Knop and Sebastian Ordyniak and Michał Pilipczuk and Marcin Wrochna. Integer Programming and Incidence Treedepth. In Proceedings of the Integer Programming and Combinatorial Optimization - 20th International Conference (IPCO '19), pages 194–204. Springer, 2019. Bibtex entry Link to publication
 Till Fluschnik and Piotr Skowron and Mervin Triphaus and Kai Wilker. Fair Knapsack. In Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI '19), pages 1941–1948. AAAI Press, 2019. Bibtex entry
 Till Fluschnik and Rolf Niedermeier and Valentin Rohm and Philipp Zschoche. Multistage Vertex Cover. In Proceedings of the 14th International Symposium on Parameterized and Exact Computation (IPEC 2019), pages 14:1–14:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. Bibtex entry
 Vincent Froese and Brijnesh Jain and Rolf Niedermeier and Malte Renken. Comparing Temporal Graphs Using Dynamic Time Warping. In Proceedings of the 8th International Conference on Complex Networks and their Applications, pages 469–480. Springer, 2019. Bibtex entry
 Anne-Sophie Himmel and Matthias Bentert and André Nichterlein and Rolf Niedermeier. Efficient Computation of Optimal Temporal Walks under Waiting-Time Constraints. In Proceedings of the 8th International Conference on Complex Networks and their Applications, pages 494–506. Springer, 2019. Bibtex entry
 Ayumi Igarashi and Edith Elkind and Robert Bredereck. Hedonic Games with Diversity Preferences. In Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS '19), pages 565–573. IFAAMAS, 2019. Bibtex entry
 Dušan Knop and Michal Pilipczuk and Marcin Wrochna. Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints. In Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science (STACS '19), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. Bibtex entry
 Dušan Knop and Tomáš Masařík and Tomáš Toufar. {Parameterized Complexity of Fair Vertex Evaluation Problems}. In Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), pages 33:1–33:16. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2019. Bibtex entry
 George B. Mertzios and Hendrik Molter and Viktor Zamaraev. Sliding Window Temporal Graph Coloring. In Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI '19), pages 7667–7674. AAAI Press, 2019. Bibtex entry
 Hendrik Molter and Rolf Niedermeier and Malte Renken. Enumerating Isolated Cliques in Temporal Networks. In Proceedings of the 8th International Conference on Complex Networks and their Applications, pages 519–531. Springer, 2019. Bibtex entry

## Conference Publications 2018

 Haris Aziz and Edith Elkind and Shenwei Huang and Martin Lackner and Luis Sánchez-Fernández and Piotr Skowron. On the Complexity of Extended and Proportional Justified Representation. In Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI '18), pages 902–909. AAAI Press, 2018. Bibtex entry
 Matthias Bentert and Josef Malík and Mathias Weller. Tree Containment With Soft Polytomies. In Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT '18), pages 9:1–9:14. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2018. Bibtex entry Link to publication
 Matthias Bentert and Anne-Sophie Himmel and Hendrik Molter and Marco Morik and Rolf Niedermeier and René Saitenmacher. Listing All Maximal k-Plexes in Temporal Graphs. In Proceedings of the 2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM '18), pages 41–46. IEEE Computer Society, 2018. Bibtex entry
 Matthias Bentert and Alexander Dittmann and Leon Kellerhals and André Nichterlein and Rolf Niedermeier. An Adaptive Version of Brandes' Algorithm for Betweenness Centrality. In Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC '18), pages 36:1–36:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. Bibtex entry
 René van Bevern and Till Fluschnik and Oxana Yu. Tsidulko. Parameterized algorithms and data reduction for safe convoy routing. In Proceedings of the 18th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS '18), pages 10:1–10:19. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. Bibtex entry
 Robert Bredereck and Andrzej Kaczmarczyk and Rolf Niedermeier. Envy-Free Allocations Respecting Social Networks. In Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems (AAMAS '18), pages 283–291. IFAAMAS, 2018. Bibtex entry
 Robert Bredereck and Piotr Faliszewski and Ayumi Igarashi and Martin Lackner and Piotr Skowron. Multiwinner Elections with Diversity Constraints. In Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI '18), pages 933–940. 2018. Bibtex entry
 Markus Brill and Till Fluschnik and Vincent Froese and Brijnesh Jain and Rolf Niedermeier and David Schultz. Exact Mean Computation in Dynamic Time Warping Spaces. In Proceedings of the SIAM International Conference on Data Mining (SDM '18), pages 540–548. SIAM, 2018. Bibtex entry
 Jiehua Chen and Hendrik Molter and Manuel Sorge and Ondrej Suchý. Cluster Editing in Multi-Layer and Temporal Graphs. In Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC '18), pages 24:1–24:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. Bibtex entry
 Pavel Dvořák and Dušan Knop and Tomáš Toufar. Target Set Selection in Dense Graph Classes. In Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC '18), pages 18:1–18:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. Bibtex entry Link to publication
 Henning Fernau and Till Fluschnik and Danny Hermelin and Andreas Krebs and Hendrik Molter and Rolf Niedermeier. Diminishable Parameterized Problems and Strict Polynomial Kernelization. In Proceedings of the 14th Conference on Computability in Europe (CiE '18), pages 161–171. Springer International Publishing, 2018. Bibtex entry
 Till Fluschnik and Hendrik Molter and Rolf Niedermeier and Philipp Zschoche. Temporal Graph Classes: A View Through Temporal Separators. In Proceedings of the 44th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '18), pages 216–227. Springer International Publishing, 2018. Bibtex entry
 Till Fluschnik and George B. Mertzios and André Nichterlein. Kernelization Lower Bounds for Finding Constant-Size Subgraphs. In Proceedings of the 14th Conference on Computability in Europe (CiE '18), pages 183–193. Springer International Publishing, 2018. Bibtex entry
 Clemens Hoffmann and Hendrik Molter and Manuel Sorge. The Parameterized Complexity of Centrality Improvement in Networks. In Proceedings of the 44th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM '18), pages 111–124. Springer International Publishing, 2018. Bibtex entry
 Viatcheslav Korenwein and André Nichterlein and Rolf Niedermeier and Philipp Zschoche. Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. In Proceedings of the 26th Annual European Symposium on Algorithms (ESA '18), pages 53:1–53:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. Bibtex entry Link to publication
 Junjie Luo and Hendrik Molter and Ondrej Suchý. A Parameterized Complexity View on Collapsing k-Cores. In Proceedings of the 13th International Symposium on Parameterized and Exact Computation (IPEC '18), pages 7:1–7:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. Bibtex entry
 Junjie Luo and Hendrik Molter and André Nichterlein and Rolf Niedermeier. Parameterized Dynamic Cluster Editing. In Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS '18), pages 46:1–46:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. Bibtex entry
 Marcelo Garlet Millani and Hendrik Molter and Rolf Niedermeier and Manuel Sorge. Efficient Algorithms for Measuring the Funnel-likeness of DAGs. In Proceedings of the 5th International Symposium on Combinatorial Optimization (ISCO '18), pages 183–195. Springer International Publishing, 2018. Bibtex entry
 Philipp Zschoche and Till Fluschnik and Hendrik Molter and Rolf Niedermeier. The Complexity of Finding Small Separators in Temporal Graphs. In Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS '18), pages 45:1–45:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. Bibtex entry

## Conference Publications 2017

 Haris Aziz and Edith Elkind and Piotr Faliszewski and Martin Lackner and Piotr Skowron. The Condorcet Principle for Multiwinner Elections: From Shortlisting to Proportionality. In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI '17), pages 84–90. AAAI Press, 2017. Bibtex entry
 Matthias Bentert and Till Fluschnik and André Nichterlein and Rolf Niedermeier. Parameterized Aspects of Triangle Enumeration. In Proceedings of the 21st Symposium on Fundamentals of Computation Theory (FCT '17), pages 96–110. Springer International Publishing, 2017. Bibtex entry
 Matthias Bentert and René van Bevern and André Nichterlein and Rolf Niedermeier. Parameterized algorithms for power-efficient connected symmetric wireless sensor networks. In Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS '17), pages 26–40. Springer International Publishing, 2017. Bibtex entry
 René van Bevern and Till Fluschnik and George B. Mertzios and Hendrik Molter and Manuel Sorge and Ondrej Suchý. Finding Secluded Places of Special Interest in Graphs. In Proceedings of the 11th International Symposium on Parameterized and Exact Computation (IPEC '16), pages 5:1–5:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. Bibtex entry
 Robert Bredereck and Christian Komusiewicz and Stefan Kratsch and Hendrik Molter and Rolf Niedermeier and Manuel Sorge. Assessing the Computational Complexity of Multi-Layer Subgraph Detection. In Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC '17), pages 128–139. Springer International Publishing, 2017. Bibtex entry
 Robert Bredereck and Vincent Froese and Marcel Koseler and Marcelo Garlet Millani and André Nichterlein and Rolf Niedermeier. A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems. In Proceedings of the 11th International Symposium on Parameterized and Exact Computation (IPEC '16), pages 10:1–10:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. Bibtex entry
 Robert Bredereck and Edith Elkind. Manipulating Opinion Diffusion in Social Networks. In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI '17), pages 894–900. AAAI Press, 2017. Bibtex entry
 Robert Bredereck and Andrzej Kaczmarczyk and Rolf Niedermeier. On Coalitional Manipulation for Multiwinner Elections: Shortlisting. In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI '17), pages 887–893. AAAI Press, 2017. Bibtex entry
 Robert Bredereck and Jiehua Chen and Ugo Paavo Finnendahl and Rolf Niedermeier. Stable Roommate with Narcissistic, Single-Peaked, and Single-Crossing Preferences. In Proceedings of the 5th International Conference on Algorithmic Decision Theory (ADT '17), pages 315–330. Springer, 2017. Bibtex entry
 Robert Bredereck and Jiehua Chen and Rolf Niedermeier and Svetlana Obraztsova and Nimrod Talmon. Teams in Online Scheduling Polls: Game-Theoretic Aspects. In Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI '17), pages 390–396. AAAI Press, 2017. Bibtex entry
 Robert Bredereck and Piotr Faliszewski and Andrzej Kaczmarczyk and Rolf Niedermeier and Piotr Skowron and Nimrod Talmon. Robustness Among Multiwinner Voting Rules. In Proceedings of the Algorithmic Game Theory: 10th International Symposium (SAGT '17), pages 80–92. Springer, 2017. Bibtex entry
 Markus Brill and Jean-François Laslier and Piotr Skowron. Multiwinner Approval Rules as Apportionment Methods. In Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI '17), pages 414–420. AAAI Press, 2017. Bibtex entry
 Markus Brill and Rupert Freeman and Svante Janson and Martin Lackner. Phragm\´en's Voting Methods and Justified Representation. In Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI '17), pages 406–413. AAAI Press, 2017. Bibtex entry
 Piotr Faliszewski and Piotr Skowron and Nimrod Talmon. Bribery as a Measure of Candidate Success: Complexity Results for Approval-Based Multiwinner Rules. In Proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems (AAMAS '17), pages 6–14. ACM, 2017. Bibtex entry
 Piotr Faliszewski and Piotr Skowron and Arkadii Slinko and Nimrod Talmon. Multiwinner Rules on Paths From k-Borda to Chamberlin-Courant. In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI '17), pages 192-198. AAAI Press, 2017. Bibtex entry
 Till Fluschnik and Meike Hatzel and Steffen Härtlein and Hendrik Molter and Henning Seidler. The Minimum Shared Edges Problem on Grid-like Graphs. In Proceedings of the 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG '17), pages 249–262. Springer International Publishing, 2017. Bibtex entry
 Till Fluschnik and Christian Komusiewicz and George B. Mertzios and André Nichterlein and Rolf Niedermeier and Nimrod Talmon. When can Graph Hyperbolicity be computed in Linear Time?. In Proceedings of the 15th Workshop on Algorithms and Data Structures (WADS '17), pages 397–408. Springer International Publishing, 2017. Bibtex entry
 Till Fluschnik and Marco Morik and Manuel Sorge. The Complexity of Routing with Few Collisions. In Proceedings of the 21st Symposium on Fundamentals of Computation Theory (FCT '17), pages 257–270. Springer International Publishing, 2017. Bibtex entry
 Ayumi Igarashi and Robert Bredereck and Edith Elkind. On Parameterized Complexity of Group Activity Selection Problems on Social Networks. In Proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems (AAMAS '17), pages 1575–1577. ACM, 2017. Bibtex entry
 Leon Kellerhals and Viatcheslav Korenwein and Philipp Zschoche and Robert Bredereck and Jiehua Chen. On the Computational Complexity of Variants of Combinatorial Voter Control in Elections. In Proceedings of the 14th Annual Conference on Theory and Applications of Models of Computation (TAMC '17), pages 348–361. 2017. Bibtex entry
 George B. Mertzios and André Nichterlein and Rolf Niedermeier. The Power of Linear-Time Data Reduction for Maximum Matching. In Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS '17), pages 46:1–46:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. Bibtex entry
 Piotr Skowron and Martin Lackner and Markus Brill and Dominik Peters and Edith Elkind. Proportional Rankings. In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI '17), pages 409–415. AAAI Press, 2017. Bibtex entry

## Conference Publications 2016

 René van Bevern and Hendrik Molter and Christian Komusiewicz and Rolf Niedermeier and Manuel Sorge and Toby Walsh. h-Index Manipulation by Undoing Merges. In Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI '16), pages 895–903. IOS Press, 2016. Bibtex entry
 René van Bevern and Iyad A. Kanj and Christian Komusiewicz and Rolf Niedermeier and Manuel Sorge. Twins in Subdivision Drawings of Hypergraphs. In Proceedings of the 24th International Symposium on Graph Drawing & Network Visualization (GD '16), Springer, 2016. Bibtex entry
 René van Bevern and Robert Bredereck and Laurent Bulteau and Christian Komusiewicz and Nimrod Talmon and Gerhard J. Woeginger. Precedence-constrained scheduling problems parameterized by partial order width. In Proceedings of the International Conference on Discrete Optimization and Operations Research (DOOR '16), pages 105–120. Springer, 2016. Bibtex entry
 René van Bevern and Vincent Froese and Christian Komusiewicz. Parameterizing edge modification problems above lower bounds. In Proceedings of the 11th International Computer Science Symposium in Russia (CSR '16), pages 57–72. Springer, 2016. Bibtex entry
 Berhard Bliem and Robert Bredereck and Rolf Niedermeier. Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels. In Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI '16), pages 102–108. AAAI Press, 2016. Bibtex entry Link to original publication
 Robert Bredereck and Jiehua Chen and Falk Hüffner and Stefan Kratsch. Parameterized Complexity of Team Formation in Social Networks. In Proceedings of the 11th International Conference on Algorithmic Aspects of Information and Management (AAIM '16), pages 137–149. 2016. Bibtex entry
 Robert Bredereck and Piotr Faliszewski and Rolf Niedermeier and Piotr Skowron and Nimrod Talmon. Complexity of Shift Bribery in Committee Elections. In Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI '16), pages 2452–2458. 2016. Bibtex entry Link to original publication
 Till Fluschnik and Danny Hermelin and André Nichterlein and Rolf Niedermeier. Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems. In Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP '16), pages 25:1–25:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. Bibtex entry
 Vincent Froese and Iyad Kanj and André Nichterlein and Rolf Niedermeier. Finding Points in General Position. In Proceedings of the 28th Canadian Conference on Computational Geometry (CCCG '16), pages 7–14. 2016. Bibtex entry
 Anne-Sophie Himmel and Hendrik Molter and Rolf Niedermeier and Manuel Sorge. Enumerating maximal cliques in temporal graphs. In Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, (ASONAM '16), pages 337–344. IEEE Computer Society, 2016. Bibtex entry
 Iyad A. Kanj and Christian Komusiewicz and Manuel Sorge and Erik Jan van Leeuwen. Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs. In Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT '16), pages 14:1–14:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. Bibtex entry

## Conference Publications 2015

 Cristina Bazgan and André Nichterlein and Rolf Niedermeier. A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths. In Proceedings of the 9th International Conference on Algorithms and Complexity (CIAC'15), pages 47–60. Springer, 2015. Bibtex entry
 René van Bevern and Christian Komusiewicz and Rolf Niedermeier and Manuel Sorge and Toby Walsh. H-Index Manipulation by Merging Articles: Models, Theory, and Experiments. In Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI '15), pages 808–814. AAAI Press, 2015. Bibtex entry Link to publication
 René van Bevern and Christian Komusiewicz and Manuel Sorge. Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems. In Proceedings of the 15th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS '15), pages 130–143. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015. Bibtex entry
 Robert Bredereck and Piotr Faliszewski and Rolf Niedermeier and Piotr Skowron and Nimrod Talmon. Elections with Few Candidates: Prices, Weights, and Covering Problems. In Proceedings of the 4th International Conference on Algorithmic Decision Theory (ADT '15), pages 414–431. Springer, 2015. Bibtex entry
 Robert Bredereck and Piotr Faliszewski and Rolf Niedermeier and Nimrod Talmon. Large-Scale Election Campaigns: Combinatorial Shift Bribery. In Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems (AAMAS '15), pages 67–75. ACM, 2015. Bibtex entry
 Robert Bredereck and Jiehua Chen and Rolf Niedermeier and Toby Walsh. Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty. In Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI '15), pages 164–170. AAAI Press, 2015. Bibtex entry
 Laurent Bulteau and Vincent Froese and Nimrod Talmon. Multi-Player Diffusion Games on Graph Classes. In Proceedings of the 12th Annual Conference on Theory and Applications of Models of Computation (TAMC '15), pages 200–211. Springer, 2015. Full version available at http://arxiv.org/abs/1412.2544. Bibtex entry
 Laurent Bulteau and Stefan Fafianie and Vincent Froese and Rolf Niedermeier and Nimrod Talmon. The Complexity of Finding Effectors. In Proceedings of the 12th Annual Conference on Theory and Applications of Models of Computation (TAMC '15), pages 224–235. Springer, 2015. Full version available at http://arxiv.org/abs/1411.7838. Bibtex entry
 Jiehua Chen and Piotr Faliszewski and Rolf Niedermeier and Nimrod Talmon. Elections with Few Voters: Candidate Control Can Be Easy. In Proceedings of the 29th Conference on Artificial Intelligence (AAAI '15), pages 2045–2051. AAAI Press, 2015. Bibtex entry
 Till Fluschnik and Stefan Kratsch and Rolf Niedermeier and Manuel Sorge. The Parameterized Complexity of the Minimum Shared Edges Problem. In Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS '15), pages 448–462. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. Bibtex entry
 Archontia C. Giannopoulou and George B. Mertzios and Rolf Niedermeier. Polynomial Fixed-parameter Algorithms: {A} Case Study for Longest Path on Interval Graphs. In Proceedings of the 10th International Symposium on Parameterized and Exact Computation (IPEC '15), pages 102–113. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015. Bibtex entry Link to publication
 Sepp Hartung and Holger H. Hoos. Programming by Optimisation meets Parameterised Algorithmics: A Case Study for Cluster Editing. In Proceedings of the 9th Learning and Intelligent OptimizatioN Conference (LION'15), pages 43–58. Springer, 2015. Bibtex entry
 Sepp Hartung and Nimrod Talmon. The Complexity of Degree Anonymization by Graph Contractions. In Proceedings of the 12th Annual Conference on Theory and Applications of Models of Computation (TAMC '15), pages 260–271. Springer, 2015. Bibtex entry Link to publication
 Falk Hüffner and Christian Komusiewicz and Manuel Sorge. Finding Highly Connected Subgraphs. In Proceedings of the 41st International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'15), pages 254–265. Springer, 2015. Bibtex entry
 Falk Hüffner and Christian Komusiewicz and André Nichterlein. Editing Graphs into Few Cliques: Complexity, Approximation, and Kernelization Schemes. In Proceedings of the Algorithms and Data Structures Symposium (WADS'15), pages 410–421. Springer, 2015. Bibtex entry
 Christian Komusiewicz and Manuel Sorge and Kolja Stahl. Finding Connected Subgraphs of Fixed Minimum Density: Implementation and Experiments. In Proceedings of the 14th International Symposium on Experimental Algorithms (SEA '15), pages 82-93. Springer, 2015. Bibtex entry Link to publication
 Christian Komusiewicz and Andreea Radulescu. On the Sound Covering Cycle Problem in Paired de Bruijn Graphs. In Proceedings of the 9th International Frontiers of Algorithmics Workshop (FAW'15), pages 150–161. Springer, 2015. Bibtex entry
 Christian Komusiewicz and André Nichterlein and Rolf Niedermeier. Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics. In Proceedings of the 41st International Workshop on Graph-Theoretic Concepts in Computer Science (WG '15), Springer, 2015. Bibtex entry Link to publication
 Stefan Kratsch and Manuel Sorge. On Kernelization and Approximation for the Vector Connectivity Problem. In Proceedings of the 10th International Symposium on Parameterized and Exact Computation (IPEC '15), pages 377–388. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015. Bibtex entry
 Nimrod Talmon. Privacy in Elections: k-Anonymizing Preference Orders. In Proceedings of the International Symposium on Fundamentals of Computation Theory (FCT '15), pages 299–310. Springer, 2015. Bibtex entry

## Conference Publications 2014

 Cristina Bazgan and Morgan Chopin and André Nichterlein and Florian Sikora. Parameterized Inapproximability of Target Set Selection and Generalizations. In Proceedings of the 10th International Conference on Computability in Europe (CiE' 14), pages 11–20. Springer, 2014. Bibtex entry
 Cristina Bazgan and André Nichterlein. Parameterized Inapproximability of Degree Anonymization. In Proceedings of the 9th International Symposium on Parameterized and Exact Computation (IPEC '14), pages 75–84. Springer, 2014. Bibtex entry
 René van Bevern and Robert Bredereck and Jiehua Chen and Vincent Froese and Rolf Niedermeier and Gerhard J. Woeginger. Network-Based Dissolution. In Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS '14), pages 69–80. Springer, 2014. Bibtex entry
 René van Bevern and Robert Bredereck and Laurent Bulteau and Jiehua Chen and Vincent Froese and Rolf Niedermeier and Gerhard J. Woeginger. Star Partitions of Perfect Graphs. In Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP '14), pages 174–185. Springer, 2014. Bibtex entry
 Robert Bredereck and Vincent Froese and Sepp Hartung and André Nichterlein and Rolf Niedermeier and Nimrod Talmon. The Complexity of Degree Anonymization by Vertex Addition. In Proceedings of the 10th International Conference on Algorithmic Aspects of Information and Management (AAIM '14), pages 44–55. Springer, 2014. Bibtex entry
 Robert Bredereck and Jiehua Chen and André Nichterlein and Piotr Faliszewski and Rolf Niedermeier. Prices Matter for the Parameterized Complexity of Shift Bribery. In Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI '14), pages 552–558. 2014. Bibtex entry
 Sharon Bruckner and Falk Hüffner and Christian Komusiewicz. A Graph Modification Approach for Finding Core–Periphery Structures in Protein Interaction Networks. In Proceedings of the 14th Workshop on Algorithms in Bioinformatics (WABI '14), pages 340–351. Springer, 2014. Bibtex entry
 Laurent Bulteau and Vincent Froese and Sepp Hartung and Rolf Niedermeier. Co-Clustering Under the Maximum Norm. In Proceedings of the 25th International Symposium on Algorithms and Computation (ISAAC '14), pages 298–309. Springer, 2014. Bibtex entry
 Laurent Bulteau and Christian Komusiewicz. Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable. In Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '14), pages 102-121. SIAM, 2014. Bibtex entry
 Laurent Bulteau and Guillaume Fertin and Christian Komusiewicz. Reversal Distances for Strings with Few Blocks or Small Alphabets. In Proceedings of the 25th Annual Symposium on Combinatorial Pattern Matching (CPM '14), pages 50-59. Springer, 2014. Bibtex entry
 Jiehua Chen and Piotr Faliszewski and Rolf Niedermeier and Nimrod Talmon. Combinatorial Voter Control in Elections. In Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS '14), pages 153–164. 2014. Bibtex entry Link to publication
 Yann Disser and Stefan Kratsch and Manuel Sorge. The Minimum Feasible Tileset problem. In Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA '14), pages 144–155. Springer, 2014. Bibtex entry
 Guillaume Fertin and Shahrad Jamshidi and Christian Komusiewicz. Towards an Algorithmic Guide to Spiral Galaxies. In Proceedings of the Seventh International Conference on Fun with Algorithms (FUN'14), pages 50-59. Springer, 2014. Bibtex entry
 Vincent Froese and André Nichterlein and Rolf Niedermeier. Win-Win Kernelization for Degree Sequence Completion Problems. In Proceedings of the 14th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT '14), pages 194–205. Springer, 2014. Bibtex entry
 Sepp Hartung and Clemens Hoffmann and André Nichterlein. Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks. In Proceedings of the 13th Symposium on Experimental Algorithms (SEA' 14), pages 376–387. Springer, 2014. Bibtex entry
 Falk Hüffner and Christian Komusiewicz and Rolf Niedermeier and Martin Rötzschke. The Parameterized Complexity of the Rainbow Subgraph Problem. In Proceedings of the 40th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '14), pages 287–298. Springer, 2014. Bibtex entry

## Conference Publications 2013

 Noga Alon and Robert Bredereck and Jiehua Chen and Stefan Kratsch and Rolf Niedermeier and Gerhard J. Woeginger. How to Put Through Your Agenda in Collective Binary Decisions. In Proceedings of the 3rd International Conference on Algorithmic Decision Theory (ADT '13), pages 30-44. Springer, 2013. Bibtex entry
 Cristina Bazgan and Morgan Chopin and André Nichterlein and Florian Sikora. Parameterized Approximability of Maximizing the Spread of Influence in Networks. In Proceedings of the 9th Annual International Computing and Combinatorics Conference (COCOON'13), pages 543-554. Springer, 2013. Bibtex entry
 René van Bevern and Robert Bredereck and Morgan Chopin and Sepp Hartung and Falk Hüffner and André Nichterlein and Ondrej Suchý. Parameterized Complexity of DAG Partitioning. In Proceedings of the 8th International Conference on Algorithms and Complexity (CIAC '13), pages 49-60. Springer, 2013. Bibtex entry
 René van Bevern and Michael R. Fellows and Serge Gaspers and Frances A. Rosamond. Myhill-Nerode Methods for Hypergraphs. In Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC '13), pages 372-382. 2013. Bibtex entry Link to publication
 René van Bevern and Andreas Emil Feldmann and Manuel Sorge and Ondrej Suchý. On the Parameterized Complexity of Computing Graph Bisections. In Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '13), pages 76–88. Springer, 2013. Bibtex entry
 Robert Bredereck and Jiehua Chen and Sepp Hartung and Christian Komusiewicz and Rolf Niedermeier and Ondrej Suchý. On Explaining Integer Vectors by Few Homogenous Segments. In Proceedings of the 13th Algorithms and Data Structures Symposium (WADS '13), pages 207-218. Springer, 2013. Bibtex entry Link to publication
 Robert Bredereck and Jiehua Chen and Gerhard J. Woeginger. Are There Any Nicely Structured Preference Profiles Nearby?. In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI '13), pages 62-68. AAAI Press, 2013. Bibtex entry
 Robert Bredereck and André Nichterlein and Rolf Niedermeier. Pattern-Guided k-Anonymity. In Proceedings of the Joint Conference of the 7th International Frontiers of Algorithmics Workshop and the 9th International Conference on Algorithmic Aspects of Information and Management (FAW-AAIM '13), pages 350-361. Springer, 2013. Bibtex entry
 Robert Bredereck and Sepp Hartung and André Nichterlein and Gerhard Woeginger. The complexity of finding a large subgraph under anonymity constraints. In Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC '13), pages 152–162. Springer, 2013. Bibtex entry
 Sharon Bruckner and Falk Hüffner and Christian Komusiewicz and Rolf Niedermeier. Evaluation of ILP-based Approaches for Partitioning into Colorful Components. In Proceedings of the 12th International Symposium on Experimental Algorithms (SEA '13), pages 176-187. Springer, 2013. Bibtex entry
 Laurent Bulteau and Guillaume Fertin and Christian Komusiewicz and Irena Rusu. A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications. In Proceedings of the 13th Workshop on Algorithms in Bioinformatics (WABI '13), pages 244-258. Springer, 2013. Bibtex entry
 Jiehua Chen and Christian Komusiewicz and Rolf Niedermeier and Manuel Sorge and Ondrej Suchý and Mathias Weller. Effective and Efficient Data Reduction for the Subset Interconnection Design Problem. In Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC '13), pages 361–371. 2013. Bibtex entry
 Vincent Froese and René van Bevern and Rolf Niedermeier and Manuel Sorge. A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems. In Proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS '13), pages 445–456. Springer, 2013. Bibtex entry
 Jiong Guo and Danny Hermelin and Christian Komusiewicz. Local Search for String Problems: Brute Force is Essentially Optimal. In Proceedings of the 24th Annual Symposium on Combinatorial Pattern Matching (CPM '13), pages 130-141. Springer, 2013. Bibtex entry
 Sepp Hartung and André Nichterlein and Rolf Niedermeier and Ondrej Suchý. A Refined Complexity Analysis of Degree Anonymization on Graphs. In Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP '13), pages 594-606. Springer, 2013. Bibtex entry
 Sepp Hartung and Christian Komusiewicz and André Nichterlein. On Structural Parameterizations for the 2-Club Problem. In Proceedings of the 39th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM '13), pages 233-243. Springer, 2013. Bibtex entry
 Sepp Hartung and André Nichterlein. On the Parameterized and Approximation Hardness of Metric Dimension. In Proceedings of the 28th IEEE Conference on Computational Complexity (CCC '13), pages 266-276. IEEE, 2013. Bibtex entry
 Falk Hüffner and Christian Komusiewicz and Adrian Liebtrau and Rolf Niedermeier. Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage. In Proceedings of the 9th International Symposium on Bioinformatics Research and Applications (ISBRA '13), pages 99-111. Springer, 2013. Bibtex entry

## Conference Publications 2012

 René van Bevern. Towards Optimal and Expressive Kernelization for d-Hitting Set. In Proceedings of the 18th Annual International Computing and Combinatorics Conference (COCOON'12), pages 121–132. Springer, 2012. Bibtex entry
 René van Bevern and Matthias Mnich and Rolf Niedermeier and Mathias Weller. Interval Scheduling and Colorful Independent Sets. In Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC '12), pages 247–256. 2012. Bibtex entry Link to publication
 Robert Bredereck and Jiehua Chen and Sepp Hartung and Stefan Kratsch and Rolf Niedermeier and Ondřej Suchý. A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. In Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI '12), pages 1292-1298. AAAI Press, 2012. Bibtex entry
 Sharon Bruckner and Falk Hüffner and Christian Komusiewicz and Rolf Niedermeier and Sven Thiel and Johannes Uhlmann. Partitioning into Colorful Components by Minimum Edge Deletions. In Proceedings of the 23rd Annual Symposium on Combinatorial Pattern Matching (CPM '12), pages 56-69. Springer, 2012. Bibtex entry
 Leo Brueggeman and Michael R. Fellows and Rudolf Fleischer and Martin Lackner and Christian Komusiewicz and Yiannis Koutis and Andreas Pfandler and Frances Rosamond. Train Marshalling is Fixed Parameter Tractable. In Proceedings of the 6th International Conference on Fun with Algorithms (FUN '12), pages 51-56. Springer, 2012. Bibtex entry
 Morgan Chopin and André Nichterlein and Rolf Niedermeier and Mathias Weller. Constant Thresholds Can Make Target Set Selection Tractable. In Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg '12), pages 120-133. 2012. Bibtex entry
 Hartmut Ehrig and Claudia Ermel and Falk Hüffner and Rolf Niedermeier and Olga Runge. Confluence in data reduction: bridging graph transformation and kernelization. In Proceedings of the 8th Conference on Computability in Europe (CiE '12), 2012. Bibtex entry
 Sepp Hartung and Christian Komusiewicz and André Nichterlein. Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs. In Proceedings of the 7th International Symposium on Parameterized and Exact Computation (IPEC'12), pages 231-241. Springer, 2012. Bibtex entry
 Sepp Hartung and André Nichterlein. NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs. In Proceedings of the 8th International Conference on Computability in Europe 2012 (CiE 2012), pages 283-292. Springer, 2012. Bibtex entry
 Christian Komusiewicz and Rolf Niedermeier. New Races in Parameterized Algorithmics. In Proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science (MFCS '12), pages 19-30. Springer, 2012. Bibtex entry
 Christian Komusiewicz and Manuel Sorge. Finding Dense Subgraphs of Sparse Graphs. In Proceedings of the 7th International Symposium on Parameterized and Exact Computation (IPEC'12), pages 242–251. Springer, 2012. Bibtex entry
 Manuel Sorge and Hannes Moser and Rolf Niedermeier and Mathias Weller. Exploiting a Hypergraph Model for Finding Golomb Rulers. In Proceedings of the 2nd International Symposium on Combinatorial Optimization (ISCO'12), pages 368-379. Springer, 2012. Bibtex entry

## Conference Publications 2011

 Nadja Betzler and Rolf Niedermeier and Gerhard Woeginger. Unweighted Coalitional Manipulation Under the Borda Rule is NP-Hard. In Proceedings of the 22th International Joint Conference on Artificial Intelligence (IJCAI '11), pages 55-60. IJCAI/AAAI, 2011. Bibtex entry
 Nadja Betzler and Robert Bredereck and Rolf Niedermeier and Johannes Uhlmann. On Making a Distinguished Vertex Minimum Degree by Vertex Deletion. In Proceedings of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM '11), pages 123–134. Springer, 2011. Bibtex entry
 René van Bevern and Sepp Hartung and Frank Kammer and Rolf Niedermeier and Mathias Weller. Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs. In Proceedings of the 6th International Symposium on Parameterized and Exact Computation (IPEC '11), pages 194–206. Springer, 2011. Bibtex entry
 Robert Bredereck and André Nichterlein and Rolf Niedermeier and Geevarghese Philip. The Effect of Homogeneity on the Complexity of $k$-Anonymity. In Proceedings of the 18th International Symposium on Fundamentals of Computation Theory (FCT '11), pages 53-64. Springer, 2011. Bibtex entry
 Robert Bredereck and André Nichterlein and Rolf Niedermeier and Geevarghese Philip. Pattern-Guided Data Anonymization and Clustering. In Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS '11), pages 182-193. Springer, 2011. Bibtex entry
 Britta Dorn and Falk Hüffner and Dominikus Krüger and Rolf Niedermeier and Johannes Uhlmann. Exploiting bounded signal flow for graph orientation based on cause--effect pairs. In Proceedings of the 1st International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems (TAPAS '11), pages 104–115. Springer, 2011. Bibtex entry
 Martin Dörnfelder and Jiong Guo and Christian Komusiewicz and Mathias Weller. On the Parameterized Complexity of Consensus Clustering. In Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC '11), pages 624-633. Springer, 2011. Bibtex entry
 Jiong Guo and Sepp Hartung and Rolf Niedermeier and Ondrej Suchý. The Parameterized Complexity of Local Search for TSP, More Refined. In Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC '11), pages 614-623. Springer, 2011. Bibtex entry
 Christian Komusiewicz and Johannes Uhlmann. Alternative Parameterizations for Cluster Editing. In Proceedings of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM '11), pages 344-355. Springer, 2011. Bibtex entry
 Manuel Sorge and René van Bevern and Rolf Niedermeier and Mathias Weller. From Few Components to an Eulerian Graph by Adding Arcs. In Proceedings of the 37th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '11), pages 307–318. Springer, 2011. Bibtex entry
 Manuel Sorge and René van Bevern and Rolf Niedermeier and Mathias Weller. A New View on Rural Postman Based on Eulerian Extension and Matching. In Proceedings of the 22nd International Workshop on Combinatorial Algorithms (IWOCA'11), pages 310–323. Springer, 2011. Bibtex entry

## Conference Publications 2010

 Yoram Bachrach and Nadja Betzler and Piotr Faliszewski. Probabilistic Possible Winner Determination. In Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI '10), AAAI Press, 2010. Bibtex entry
 Nadja Betzler and Jiong Guo and Christian Komusiewicz and Rolf Niedermeier. Average Parameterization and Partial Kernelization for Computing Medians. In Proceedings of the 9th Latin American Theoretical Informatics Symposium (LATIN '10), pages 60–71. Springer, 2010. Bibtex entry
 Nadja Betzler and Robert Bredereck and Rolf Niedermeier. Partial Kernelization for Rank Aggregation: Theory and Experiments. In Proceedings of the 5th International Symposium on Parameterized and Exact Computation (IPEC '10), pages 26–37. Springer, 2010. Bibtex entry
 Nadja Betzler. On Problem Kernels for Possible Winner Determination under the k-Approval Protocol. In Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science (MFCS '10), pages 114–125. Springer, 2010. Bibtex entry
 René van Bevern and Hannes Moser and Rolf Niedermeier. Kernelization Through Tidying---A Case Study Based on s-Plex Cluster Vertex Deletion. In Proceedings of the 9th Latin American Theoretical Informatics Symposium (LATIN '10), pages 528–539. Springer, 2010. Bibtex entry
 René van Bevern and Christian Komusiewicz and Hannes Moser and Rolf Niedermeier. Measuring Indifference: Unit Interval Vertex Deletion. In Proceedings of the 36th International Workshop on Graph Theoretic Concepts in Computer Science (WG '10), pages 232–243. Springer, 2010. Bibtex entry
 Frederic Dorn and Hannes Moser and Rolf Niedermeier and Mathias Weller. Efficient Algorithms for Eulerian Extension. In Proceedings of the 36th International Workshop on Graph Theoretic Concepts in Computer Science (WG '10), pages 100–111. 2010. Bibtex entry
 Rudolf Fleischer and Jiong Guo and Rolf Niedermeier and Johannes Uhlmann and Yihui Wang and Mathias Weller and Xi Wu. Extended Islands of Tractability for Parsimony Haplotyping. In Proceedings of the 21st Annual Symposium on Combinatorial Pattern Matching (CPM '10), pages 214–226. Springer, 2010. Bibtex entry
 Jiong Guo and Sepp Hartung and Christian Komusiewicz and Rolf Niedermeier and Johannes Uhlmann. Exact Algorithms and Experiments for Hierarchical Tree Clustering. In Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI '10), AAAI Press, 2010. Bibtex entry
 Sepp Hartung and Rolf Niedermeier. Incremental List Coloring of Graphs, Parameterized by Conservation. In Proceedings of the 7th Annual Conference on Theory and Applications of Models of Computation (TAMC '10), pages 258–270. Springer, 2010. Bibtex entry
 André Nichterlein and Rolf Niedermeier and Johannes Uhlmann and Mathias Weller. On Tractable Cases of Target Set Selection. In Proceedings of the 21st International Symposium on Algorithms and Computation (ISAAC '10), Part I, pages 378–389. Springer, 2010. Bibtex entry
 Rolf Niedermeier. Reflections on Multivariate Algorithmics and Problem Parameterization. In Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS '10), pages 17–32. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2010. Bibtex entry
 Johannes Uhlmann and Mathias Weller. Two-Layer Planarization Parameterized by Feedback Edge Set. In Proceedings of the 7th Annual Conference on Theory and Applications of Models of Computation (TAMC '10), pages 431–442. Springer, 2010. Bibtex entry

## Conference Publications 2009

 Nadja Betzler and Susanne Hemmann and Rolf Niedermeier. A Multivariate Complexity Analysis of Determining Possible Winners Given Incomplete Votes. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI '09), pages 53–58. 2009. Bibtex entry
 Nadja Betzler and Michael R. Fellows and Jiong Guo and Rolf Niedermeier and Frances A. Rosamond. How similarity helps to efficiently compute Kemeny rankings. In Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS '09), pages 657–664. IFAAMAS, 2009. Bibtex entry
 Nadja Betzler and Britta Dorn. Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules. In Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science (MFCS '09), pages 124–136. Springer, 2009. Bibtex entry
 Daniel Brügmann and Christian Komusiewicz and Hannes Moser. On Generating Triangle-Free Graphs. In Proceedings of the DIMAP Workshop on Algorithmic Graph Theory (AGT '09), pages 51–58. Elsevier, 2009. Bibtex entry
 Michael Dom and Daniel Lokshtanov and Saket Saurabh. Incompressibility through Colors and {ID}s. In Proceedings of the 36th International Colloquium on Automata, Languages, and Programming (ICALP '09), pages 378–389. Springer, 2009. Bibtex entry
 Michael Dom and Michael R. Fellows and Frances A. Rosamond. Parameterized Complexity of Stabbing Rectangles and Squares in the Plane. In Proceedings of the 3rd International Workshop on Algorithms and Computation (WALCOM '09), pages 298–309. Springer, 2009. Bibtex entry
 Rosa Enciso and Michael R. Fellows and Jiong Guo and Iyad A. Kanj and Frances A. Rosamond and Ondrej Suchý. What Makes Equitable Connected Partition Easy. In Proceedings of the 4th International Workshop on Parameterized and Exact Computation (IWPEC '09), pages 122–133. Springer, 2009. Bibtex entry Link to original publication
 Michael R. Fellows and Jiong Guo and Hannes Moser and Rolf Niedermeier. A Generalization of {Nemhauser and Trotter}'s Local Optimization Theorem. In Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS '09), pages 409–420. Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2009. Bibtex entry
 Michael R. Fellows and Jiong Guo and Hannes Moser and Rolf Niedermeier. A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. In Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science (MFCS '09), pages 319–330. Springer, 2009. Bibtex entry
 Michael R. Fellows and Jiong Guo and Christian Komusiewicz and Rolf Niedermeier and Johannes Uhlmann. Graph-Based Data Clustering with Overlaps. In Proceedings of the 15th International Computing and Combinatorics Conference (COCOON '09), pages 516–526. Springer, 2009. Bibtex entry
 Michael R. Fellows and Jiong Guo and Iyad A. Kanj. The Parameterized Complexity of Some Minimum Label Problems. In Proceedings of the 35th International Workshop an Graph-Theoretic Concepts in Computer Science (WG '09), pages 88–99. 2009. Bibtex entry Link to original publication
 Jiong Guo and Rolf Niedermeier and Ondrej Suchý. Parameterized Complexity of Arc-Weighted Directed Steiner Problems. In Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC '09), pages 544–553. Springer, 2009. Bibtex entry Link to original publication
 Jiong Guo and Christian Komusiewicz and Rolf Niedermeier and Johannes Uhlmann. A more relaxed model for graph-based data clustering: s-plex editing. In Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management (AAIM '09), pages 226–239. Springer, 2009. Bibtex entry
 Jiong Guo and Iyad A. Kanj and Christian Komusiewicz and Johannes Uhlmann. Editing Graphs into Disjoint Unions of Dense Clusters. In Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC '09), pages 583–593. Springer, 2009. Bibtex entry
 Jiong Guo. Fixed-Parameter Algorithms for Graph-Modeled Data Clustering. In Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation (TAMC '09), pages 39–48. Springer, 2009. Bibtex entry
 Christian Komusiewicz and Rolf Niedermeier and Johannes Uhlmann. Deconstructing Intractability --- A Case Study for Interval Constrained Coloring. In Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching (CPM '09), pages 207–220. Springer, 2009. Bibtex entry
 Hannes Moser and Rolf Niedermeier and Manuel Sorge. Algorithms and Experiments for Clique Relaxations---Finding Maximum $s$-Plexes. In Proceedings of the 8th International Symposium on Experimental Algorithms (SEA '09), pages 233–244. Springer, 2009. Bibtex entry
 Hannes Moser. A Problem Kernelization for Graph Packing. In Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM '09), pages 401–412. Springer, 2009. Bibtex entry
 Mathias Weller and Christian Komusiewicz and Rolf Niedermeier and Johannes Uhlmann. On Making Directed Graphs Transitive. In Proceedings of the 11th International Symposium on Algorithms and Data Structures (WADS '09), pages 542–553. Springer, 2009. Bibtex entry

## Conference Publications 2008

 Nadja Betzler and Johannes Uhlmann. Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems. In Proceedings of the Second International Conference on Combinatorial Optimization and Applications (COCOA '08), pages 43–53. Springer, 2008. Bibtex entry
 Nadja Betzler and Jiong Guo and Rolf Niedermeier. Parameterized Computational Complexity of Dodgson and Young Elections. In Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT '08), pages 402–413. Springer, 2008. Bibtex entry
 Nadja Betzler and Michael R. Fellows and Christian Komusiewicz and Rolf Niedermeier. Parameterized Algorithms and Hardness Results for Some Graph Motif Problems. In Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching (CPM '08), pages 31–43. Springer, 2008. Bibtex entry
 Nadja Betzler and Michael R. Fellows and Jiong Guo and Rolf Niedermeier and Frances A. Rosamond. Fixed-Parameter Algorithms for Kemeny Scores. In Proceedings of the 4th International Conference on Algorithmic Aspects in Information and Management (AAIM '08), pages 60–71. Springer, 2008. Bibtex entry
 Michael Dom and Somnath Sikdar. The Parameterized Complexity of the Rectangle Stabbing Problem and its Variants. In Proceedings of the 2nd International Frontiers of Algorithmics Workshop (FAW '08), pages 288–299. Springer, 2008. Bibtex entry
 Michael Dom and Daniel Lokshtanov and Saket Saurabh and Yngve Villanger. Capacitated Domination and Covering: A Parameterized Perspective. In Proceedings of the 3rd International Workshop on Parameterized and Exact Computation (IWPEC '08), pages 78–90. Springer, 2008. Bibtex entry
 Jiong Guo and Falk Hüffner and Christian Komusiewicz and Yong Zhang. Improved Algorithms for Bicluster Editing. In Proceedings of the 5th Annual Conference on Theory and Applications of Models of Computation (TAMC '08), pages 451–462. Springer, 2008. After publication, we have been notified of a problem in the proof of Theorem 4 that does not seem to be easy to fix. Thus, we retract the results in Section 4. Bibtex entry
 Falk Hüffner and Christian Komusiewicz and Hannes Moser and Rolf Niedermeier. Fixed-Parameter Algorithms for Cluster Vertex Deletion. In Proceedings of the 8th Latin American Theoretical Informatics Symposium (LATIN '08), pages 711–722. Springer, 2008. Bibtex entry
 Falk Hüffner and Christian Komusiewicz and Hannes Moser and Rolf Niedermeier. Enumerating isolated cliques in synthetic and financial networks. In Proceedings of the 2nd Annual International Conference on Combinatorial Optimization and Applications (COCOA '08), pages 405–416. Springer, 2008. Bibtex entry
 Christian Komusiewicz and Johannes Uhlmann. A Cubic-Vertex Kernel for Flip-Consensus Tree. In Proceedings of the 28th Foundations of Software Technology and Theoretical Computer Science Conference (FSTTCS '08), pages 280–291. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2008. Bibtex entry
 Oriana Ponta and Falk Hüffner and Rolf Niedermeier. Speeding up Dynamic Programming for Some {NP}-hard Graph Recoloring Problems. In Proceedings of the 5th Annual Conference on Theory and Applications of Models of Computation (TAMC '08), pages 490–501. Springer, 2008. Bibtex entry

## Conference Publications 2007

 Michael Dom and Rolf Niedermeier. The search for consecutive ones submatrices: faster and more general. In Proceedings of the 3rd Workshop on Algorithms and Complexity in Durham (ACiD '07), College Publications, 2007. Bibtex entry Link to publication
 Michael Dom and Jiong Guo and Rolf Niedermeier. Approximability and parameterized complexity of consecutive ones submatrix problems. In Proceedings of the 4th Annual Conference on Theory and Applications of Models of Computation (TAMC '07), pages 680–691. Springer, 2007. Bibtex entry
 Jiong Guo and Johannes Uhlmann. Kernelization and Complexity Results for Connectivity Augmentation Problems. In Proceedings of the 10th International Workshop on Algorithms and Data Structures (WADS '07), pages 483–494. Springer, 2007. Bibtex entry
 Jiong Guo and Rolf Niedermeier. Linear problem kernels for NP-hard problems on planar graphs. In Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP '07), pages 375–386. Springer, 2007. Bibtex entry
 Jiong Guo and Rolf Niedermeier. Probe matrix problems: totally balanced matrices. In Proceedings of the 3rd International Conference on Algorithmic Aspects in Information and Management (AAIM '07), pages 368–377. Springer, 2007. Bibtex entry
 Jiong Guo. A More Effective Linear Kernelization for Cluster Editing. In Proceedings of the 1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE '07), pages 36–47. Springer, 2007. Bibtex entry
 Jiong Guo. Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs. In Proceedings of the 18th International Symposium on Algorithms and Computation (ISAAC '07), pages 915–926. Springer, 2007. Bibtex entry
 Falk Hüffner and Sebastian Wernicke and Thomas Zichner. Algorithm Engineering for Color-Coding to Facilitate Signaling Pathway Detection. In Proceedings of the 5th Asia-Pacific Bioinformatics Conference (APBC '07), pages 277–286. Imperial College Press, 2007. Bibtex entry
 Falk Hüffner and Christian Komusiewicz and Hannes Moster and Rolf Niedermeier. Isolation concepts for enumerating dense subgraphs. In Proceedings of the 13th International Computing and Combinatorics Conference (COCOON '07), pages 140–150. Springer, 2007. Bibtex entry
 Falk Hüffner and Nadja Betzler and Rolf Niedermeier. Optimal edge deletions for signed graph balancing. In Proceedings of the 6th Workshop on Experimental Algorithms (WEA '07), pages 297–310. Springer, 2007. Bibtex entry

## Conference Publications 2006

 Jochen Alber and Britta Dorn and Rolf Niedermeier. A general data reduction scheme for domination in graphs. In Proceedings of the 32nd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM '06), pages 137–147. Springer, 2006. Bibtex entry
 Jochen Alber and M. Brosemann and Falk Hüffner and Rolf Niedermeier. Matrix robustness, with an application to power system observability. In Proceedings of the 2nd Algorithms and Complexity in Durham (ACiD '06), pages 37–48. College Publications, 2006. Bibtex entry Link to publication
 Michael Dom and Jiong Guo and Rolf Niedermeier and Sebastian Wernicke. Minimum membership set covering and the consecutive ones property. In Proceedings of the 10th Scandinavian Workshop on Algorithm Theory (SWAT '06), pages 339–350. Springer, 2006. Bibtex entry
 Michael Dom and Jiong Guo and Falk Hüffner and Rolf Niedermeier and Anke Truß. Fixed-parameter tractability results for feedback set problems in tournaments. In Proceedings of the 6th Conference on Algorithms and Complexity (CIAC '06), pages 320–331. Springer, 2006. Bibtex entry
 Jens Gramm and Tzvika Hartman and Till Nierhoff and Roded Sharan and Till Tantau. On the Complexity of SNP Block Partitioning Under the Perfect Phylogeny Model. In Proceedings of the 6th International Workshop on Algorithms in Bioinformatics (WABI '06), pages 92–102. Springer, 2006. Bibtex entry
 Jens Gramm and Jiong Guo and Falk Hüffner and Rolf Niedermeier. Data reduction, exact, and heuristic algorithms for clique cover. In Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX '06), pages 86–94. 2006. Bibtex entry
 Jiong Guo and Rolf Niedermeier and Sebastian Wernicke. Fixed-parameter tractability results for full-degree spanning tree and its dual. In Proceedings of the 2nd International Workshop on Parameterized and Exact Computation (IWPEC '06), pages 203–214. 2006. Bibtex entry
 Jiong Guo and Falk Hüffner and Erhan Kenar and Rolf Niedermeier and Johannes Uhlmann. Complexity and exact algorithms for multicut. In Proceedings of the 32nd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM '06), pages 303–312. Springer, 2006. Bibtex entry
 Hannes Moser and Dimitrios M. Thilikos. Parameterized Complexity of Finding Regular Induced Subgraphs. In Proceedings of the 2nd Algorithms and Complexity in Durham Workshop (ACiD '06), pages 107–118. College Publications, 2006. Bibtex entry Link to publication
 Harald Sack and Uwe Krüger and Michael Dom. A Knowledge Base on {NP}-complete Decision Problems and its Application in Bibliographic Search. In XML-Tage 2006, 2006. Bibtex entry Link to publication

## Conference Publications 2005

 Michael Dom and Jiong Guo and Rolf Niedermeier. Bounded degree closest k-tree power is NP-complete. In Proceedings of the 11th International Computing and Combinatorics Conference (COCOON '05), pages 757–766. Springer, 2005. Bibtex entry
 Michael Dom and Jiong Guo and Falk Hüffner and Rolf Niedermeier. Extending the Tractability Border for Closest Leaf Powers. In Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG '05), pages 397–408. Springer, 2005. Bibtex entry
 Stefan Eckhardt and Sven Kosub and Moritz G. Maaß and Hanjo Täubig and Sebastian Wernicke. Combinatorial Network Abstraction by Trees and Distances. pages 1100–1109. Springer, 2005. Bibtex entry
 Jiong Guo and Rolf Niedermeier and Sebastian Wernicke. Parameterized complexity of generalized vertex cover problems. In Proceedings of the 9th Workshop on Algorithms and Data Structures (WADS '05), pages 36–48. Springer, 2005. Bibtex entry
 Jiong Guo and Rolf Niedermeier and Daniel Raible. Improved algorithms and complexity results for power domination in graphs. In Proceedings of the 15th International Symposium on Fundamentals of Computation Theory (FCT '05), pages 172–184. Springer, 2005. Bibtex entry
 Jiong Guo and Jens Gramm and Falk Hüffner and Rolf Niedermeier and Sebastian Wernicke. Improved fixed-parameter algorithms for two feedback set problems. In Proceedings of the 9th Workshop on Algorithms and Data Structures (WADS '05), pages 158–168. Springer, 2005. Bibtex entry
 Falk Hüffner. Algorithm Engineering for Optimal Graph Bipartization. In Proceedings of the 4th International Workshop on Experimental and Efficient Algorithms (WEA '05), pages 240–252. Springer, 2005. Bibtex entry
 Sebastian Wernicke. A Faster Algorithm for Detecting Network Motifs. In Proceedings of the 5th International Workshop, on Algorithms in Bioinformatics (WABI '05), pages 165–177. Springer, 2005. Bibtex entry

## Conference Publications 2004

 Jochen Alber and Jens Gramm and Jiong Guo and Rolf Niedermeier and Sebastian Wernicke. Avoiding forbidden submatrices by row deletions. In Proceedings of the 30th Conference on Current Trends in Theory and Practice of Informatics (SOFSEM '04), pages 349–360. Springer, 2004. Bibtex entry
 Nadja Betzler and Rolf Niedermeier and J. Uhlmann. Tree decompositions of graphs: Saving memory in dynamic programming. In Proceedings of the Cologne Twente Workshop on Graphs and Combinatorial Optimization (CTW '04), 2004. Bibtex entry
 Hans L. Bodlaender and C. M. H. de Figueiredo and M. Gutierrez and Ton Kloks and Rolf Niedermeier. Simple Max-Cut for split-indifference graphs and graphs with few P4's. In Proceedings of the 3rd Workshop on Efficient and Experimental Algorithms (WEA '04), pages 87–99. Springer, 2004. Bibtex entry
 Michael Dom and Jiong Guo and Falk Hüffner and Rolf Niedermeier. Error compensation in leaf root problems. In Proceedings of the 15th Annual International Symposium on Algorithms and Computation (ISAAC '04), pages 389–401. Springer, 2004. Bibtex entry Link to original publication
 Jens Gramm and Till Nierhoff and Till Tantau. Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable. In Proceedings of the 1st International Workshop on Parameterized and Exact Computation (IWPEC '04), pages 174–186. Springer, 2004. Bibtex entry Link to original publication
 Jiong Guo and Falk Hüffner and Rolf Niedermeier. A Structural View on Parameterizing Problems: Distance from Triviality. In Proceedings of the 1st International Workshop on Parameterized and Exact Computation (IWPEC '04), pages 162–173. Springer, 2004. Bibtex entry Link to original publication
 Rolf Niedermeier. Ubiquitous parameterization - Invitation to fixed-parameter algorithms. In Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science (MFCS 2004), pages 84–103. Springer, 2004. Bibtex entry

## Conference Publications 2003

 Jochen Alber and Nadja Betzler and Rolf Niedermeier. Experiments on data reduction for optimal domination in networks. In Proceedings of the International Network Optimization Conference (INOC '03), pages 1–6. 2003. Bibtex entry Link to publication
 Jens Gramm and Jiong Guo and Rolf Niedermeier. On exact and approximation algorithms for Distinguishing Substring Selection. In Proceedings of the 14th International Symposium on Fundamentals of Computation Theory (FCT '03), pages 195–209. 2003. Bibtex entry
 Jens Gramm and Jiong Guo and Falk Hüffner and Rolf Niedermeier. Graph-modeled data clustering: fixed-parameter algorithms for clique generation.. In Proceedings of the 5th Italian Conference on Algorithms and Complexity (CIAC '03), pages 108–119. Springer, 2003. Bibtex entry Link to original publication
 Jens Gramm and Jiong Guo and Falk Hüffner and Rolf Niedermeier. Automated generation of search tree algorithms for graph modification problems. In Proceedings of the 11th Annual European Symposium on Algorithms (ESA '03), pages 642–653. Springer, 2003. Bibtex entry Link to original publication

## Conference Publications 2002

 Jochen Alber and Rolf Niedermeier. Improved tree decomposition based algorithms for domination-like problems. In Proceedings of the 5th Latin American Theoretical INformatics (LATIN '02), pages 613–627. Springer, 2002. Bibtex entry
 Jochen Alber and Jens Gramm and Jiong Guo and Rolf Niedermeier. Towards optimally solving the Longest Common Subsequence problem for sequences with nested arc annotations in linear time. In Proceedings of the 13th Annual Symposium on Combinatorial Pattern matching (CPM '02), pages 99–114. 2002. Bibtex entry
 Jochen Alber and Michael R. Fellows and Rolf Niedermeier. Efficient data reduction for Dominating Set: a linear problem kernel for the planar case. In Proceedings of the 8th Scandinavian Workshop on Algorithm Theory (SWAT '02), pages 150–159. Springer, 2002. Bibtex entry
 Michael R. Fellows and Jens Gramm and Rolf Niedermeier. On the Parameterized Intractability of Closest Substring and Related Problems. In Proceedings of the 19th International Symposium on Theoretical Aspects of Computer Science (STACS '02), pages 262–273. Springer, 2002. Bibtex entry
 Jens Gramm and Rolf Niedermeier. Breakpoint medians and breakpoint phylogenies: A fixed-parameter approach. In Proceedings of the European Conference on Computational Biology 2002 (ECCB '02), pages 128–139. Oxford University Press, 2002. Bibtex entry
 Jens Gramm and Jiong Guo and Rolf Niedermeier. Pattern matching for arc-annotated sequences. In Proceedings of the 22nd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS '02), pages 182–193. 2002. Bibtex entry

## Conference Publications 2001

 Jochen Alber and Henning Fernau and Rolf Niedermeier. Graph separators: A parameterized view. In Proceedings of the 7th Annual International Computing and Combinatorics Conference (COCOON '01), pages 318–327. Springer, 2001. Bibtex entry
 Jochen Alber and Henning Fernau and Rolf Niedermeier. Parameterized complexity: Exponential speed-up for planar graph problems. In Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP '01), pages 261–272. Springer, 2001. Bibtex entry
 Jochen Alber and Hongbing Fan and Michael R. Fellows and Henning Fernau and Rolf Niedermeier and Frances Rosamond and Ulrike Stege. Refined search tree technique for Dominating Set on planar graphs. In Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science (MFCS '01), pages 111–122. Springer, 2001. Bibtex entry
 Jens Gramm and Rolf Niedermeier and Peter Rossmanith. Exact solutions for Closest String and related problems. In Proceedings of the 12th Annual International Symposium on Algorithms and Computation (ISAAC '01), pages 441–452. Springer, 2001. Bibtex entry
 Jens Gramm and Rolf Niedermeier. Minimum quartet inconsistency is fixed parameter tractable. In Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching (CPM '01), pages 241–256. Springer, 2001. Bibtex entry

## Conference Publications 2000

 Jochen Alber and Hans L. Bodlaender and Henning Fernau and Rolf Niedermeier. Fixed parameter algorithms for Planar Dominating Set and related problems. In Proceedings of the 7th Scandinavian Workshop on Algorithm Theory (SWAT '00), pages 97–110. 2000. Bibtex entry
 Jens Gramm and Rolf Niedermeier. Faster exact solutions for Max2Sat. In Proceedings of the 4th Italian Conference on Algorithms and Complexity (CIAC '00), pages 174–186. Springer, 2000. Bibtex entry
 Rolf Niedermeier and Peter Rossmanith. On efficient fixed parameter algorithms for Weighted Vertex Cover. In Proceedings of the 11th Annual International Symposium on Algorithms And Computation (ISAAC '00), pages 180–191. Springer, 2000. Bibtex entry

## Conference Publications 1999

 Henning Fernau and Rolf Niedermeier. An efficient exact algorithm for Constraint Bipartite Vertex Cover. In Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science (MFCS '99), pages 387–397. Springer, 1999. Bibtex entry
 Rolf Niedermeier and Peter Rossmanith. New upper bounds for MaxSat. In Proceedings of the 26th International Colloquium on Automata, Languages, and Programming (ICALP '99), pages 575–584. Springer, 1999. Bibtex entry
 Rolf Niedermeier and Peter Rossmanith. Upper bounds for Vertex Cover further improved. In Proceedings of the 16th Symposium on Theoretical Aspects of Computer Science (STACS '99), pages 561–570. Springer, 1999. Bibtex entry

## Conference Publications 1998

 Jochen Alber and Rolf Niedermeier. On multi-dimensional Hilbert indexings. In Proceedings of the 4th International Computing and Combinatorics Conference (COCOON '98), pages 329–338. Springer, 1998. Bibtex entry
 Rolf Niedermeier. Some prospects for efficient fixed parameter algorithms. In Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics (SOFSEM '98), pages 168–185. Springer, 1998. Bibtex entry

## Conference Publications 1997

 Rolf Niedermeier and Klaus Reinhardt and Peter Sanders. Towards optimal locality in mesh-indexings. In Proceedings of the 11th International Symposium on Fundamentals of Computation Theory (FCT '97), pages 364–375. Springer, 1997. Bibtex entry

## Conference Publications 1996

 Rolf Niedermeier. Recursively divisible problems. In Proceedings of the 7th International Symposium on Algorithms and Computation (ISAAC '96), pages 83–192. Springer, 1996. Bibtex entry

## Conference Publications 1995

 Manfred Kunde and Rolf Niedermeier and Klaus Reinhardt and Peter Rossmanith. Optimal average case sorting on arrays. In Proceedings of the 12th Symposium on Theoretical Aspects of Computer Science (STACS '95), pages 503–514. Springer, 1995. Bibtex entry
 Rolf Niedermeier and Peter Rossmanith. PRAM's towards realistc parallelism: BRAM's. In Proceedings of the 10th International Conference on Fundamentals of Computation Theory (FCT' 95), pages 363–373. Springer, 1995. Bibtex entry

## Conference Publications 1994

 Manfred Kunde and Rolf Niedermeier and Peter Rossmanith. Faster sorting and routing on grids with diagonals. In Proceedings of the 11th Symposium on Theoretical Aspects of Computer Science (STACS '94), pages 225–236. Springer, 1994. Bibtex entry

## Conference Publications 1993

 Klaus-Jörn Lange and Rolf Niedermeier. Data-independences of parallel random access machines. In Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS '93), pages 104–113. Springer, 1993. Bibtex entry
 Rolf Niedermeier and Peter Rossmanith. Extended locally definable acceptance types. In Proceedings of the 10th Symposium on Theoretical Aspects of Computer Science (STACS '93), pages 473–483. Springer, 1993. Bibtex entry
 Rolf Niedermeier and Peter Rossmanith. On the power of reading and writing simultaneously in parallel computations. In Proceedings of the 4th International Symposium on Algorithms and Computation (ISAAC '93), pages 240–249. Springer, 1993. Bibtex entry

## Conference Publications 1992

 Rolf Niedermeier and Peter Rossmanith. Unambiguous simulations of auxiliary pushdown automata and circuits. In Proceedings of the 1st Symposium on Latin American Theoretical Informatics, pages 387–400. Springer, 1992. Bibtex entry