Algorithmik und Komplexitätstheorie

Prof. Dr. Rolf Niedermeier

 

 

 

Curriculum Vitae

March 2022Rolf Niedermeier unexpectedly passed away
2010 - March 2022Chair Algorithmics and Computational Complexity, TU Berlin
2004-2010Chair Theoretical Computer Science I, Friedrich-Schiller-Universität Jena
2002-2004Head of Emmy Noether research group Eberhard-Karls-Universität Tübinge
1999-2002Eberhard-Karls-Universität Tübingen (Prof. Lange)
1998Charles University Prague (Prof. Nešetříl)
1994-1997Eberhard-Karls-Universität Tübingen (Prof. Lange)
1991-1994TU München (Prof. Brauer, Prof. Lange)

Forschungsprojekte

started November 2021COMSOC-MPMS: Computational Social Choice: Multiple Preference Profiles and Multiple Solutions
started March 2021DiPa: The Art of Difference Parameterization in Multivariate Algorithmics
started April 2018MaMu: Matching under Preferences: Multimodal Views and Domain Restrictions
2018 - 2022TORE: Trade-offs in Parameterized Data Reduction
2018 - 2022MATE: Multivariate Algorithmics for Temporal Graph Problems
started December 2017FPTinP: More Efficient Algorithms for Polynomial-Time Solvable Graph Problems
started October 2016AFFA: Algorithms for Fair Allocations
2012 -DAMM: Data Reduction in Parameterized Algorithmics - New Models and Methods
2012 -DAPA: Data Driven Parameterized Algorithmics for Graph Modification Problems
2010 - 2014DARE: Data Reduction and Problem Kernels
2009 - 2017PAWS: Parameterized Algorithmics for Voting Systems
2008 - 2013AREG: Algorithms for Generating Quasi-Regular Structures in Graphs
2007 - 2014PABI: Parameterized Algorithmics for Bioinformatics

Publikationen

2023

N. Boehmer, T. Koana and R. Niedermeier, "A Refined Complexity Analysis of Fair Districting over Graphs" , Autonomous Agents and Multi-Agent Systems, vol. 37, no. 1, pp. 13, 2023.
T. Koana, V. Froese and R. Niedermeier, "The Complexity of Binary Matrix Completion Under Diameter Constraints" , Journal of Computer and System Sciences, vol. 132, pp. 45–67, 2023.

2022

T. Fluschnik, P. Kunz, R. Niedermeier and M. Renken, "Most Classic Problems Remain NP-hard on Relative Neighborhood Graphs and their Relatives" in Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT '22), 2022.
N. Boehmer, P. Faliszewski, R. Niedermeier, S. Szufa and T. Wąs, "Understanding Distance Measures Among Elections" in Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI '22), ijcai.org, 2022. pp. 102–108.
A. Figiel, V. Froese, A. Nichterlein and R. Niedermeier, "There and Back Again: On Applying Data Reduction Rules by Undoing Others" in Proceedings of the 30th Annual European Symposium on Algorithms (ESA '22), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022. pp. 53:1–53:15.
N. Boehmer, K. Heeger and R. Niedermeier, "Theory of and Experiments on Minimally Invasive Stability Preservation in Changing Two-Sided Matching Markets" in Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI '22), 2022. pp. 4851–4858.
R. Bredereck, K. Heeger, D. Knop and R. Niedermeier, "Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters" , Information and Computation, pp. 104943, 2022.
R. Bredereck, A. Kaczmarczyk, J. Luo, R. Niedermeier and F. Sachse, "On Improving Resource Allocations by Sharing" in Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI '22), 2022.
V. Froese, C. Hertrich and R. Niedermeier, "The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality" , Journal of Artificial Intelligence Research, vol. 74, pp. 1775–1790, 2022.
V. Froese, L. Kellerhals and R. Niedermeier, "Modification-Fair Cluster Editing" in Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI '22), 2022. pp. 6631–6638.
L. Kreisel, N. Boehmer, V. Froese and R. Niedermeier, "Equilibria in Schelling Games: Computational Hardness and Robustness" in Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems (AAMAS '22), IFAAMAS, 2022. pp. 761–769.
N. Boehmer, K. Heeger and R. Niedermeier, "Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems" in Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science (MFCS '22), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. pp. 21:1–21:15.
H. Schulz, A. Nichterlein, R. Niedermeier and C. Weyand, "Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial Time" in Proceedings of the 17th International Symposium on Parameterized and Exact Computation (IPEC 22), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022. pp. 25:1–25:14.
H. Schulz, A. Nichterlein, R. Niedermeier and C. Weyand, "Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial Time" in Proceedings of the 17th International Symposium on Parameterized and Exact Computation (IPEC 22), 2022.
N. Boehmer, T. Koana and R. Niedermeier, "A Refined Complexity Analysis of Fair Districting over Graphs" in Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems (AAMAS '22), IFAAMAS, 2022. pp. 1548–1550.
N. Boehmer, R. Bredereck, P. Faliszewski and R. Niedermeier, "A Quantitative and Qualitative Analysis of the Robustness of (Real-World) Election Winners" in Proceedings of the Second Conference on Equity and Access in Algorithms, Mechanisms, and Optimization (EAAMO '22), ACM, 2022. pp. 7:1–7:10.
K. Heeger, D. Hermelin, G. B. Mertzios, H. Molter, R. Niedermeier and D. Shabtay, "Equitable Scheduling on a Single Machine" , Journal of Scheduling, 2022. Springer.

2021

R. Bredereck, P. Faliszewski, A. Kaczmarczyk, R. Niedermeier, P. Skowron and N. Talmon, "Robustness among multiwinner voting rules" , Artificial Intelligence, vol. 290, pp. 103403, 2021.
M. Bentert, R. Bevern, A. Nichterlein, R. Niedermeier and P. V. Smirnov, "Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments" , Informs Journal on Computing, pp. 1–29, 2021.
J. Luo, H. Molter, A. Nichterlein and R. Niedermeier, "Parameterized Dynamic Cluster Editing" , Algorithmica, vol. 83, no. 1, pp. 1–44, 2021. Springer.
N. Boehmer, R. Bredereck, P. Faliszewski, R. Niedermeier and S. 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. pp. 59–65.
N. Boehmer, R. Bredereck, P. Faliszewski and R. 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. pp. 52–58.
M. Bentert, T. Koana and R. Niedermeier, "The Complexity of Gerrymandering over Graphs: Paths and Trees" in Proceedings of the 47th International Workshop on Graph-Theoretic Concepts in Computer Science, 2021. pp. 195–206.
M. Rymar, H. Molter, A. Nichterlein and R. 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. pp. 219–231.
N. Boehmer, V. Froese, J. Henkel, Y. Lasars, R. Niedermeier and M. 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. pp. 45–51.
N. Maack, H. Molter, R. Niedermeier and M. Renken, "On Finding Separators in Temporal Split and Permutation Graphs" in Proceedings of the 23rd International Symposium on Fundamentals of Computation Theory, 2021. pp. 385–398.
A. Figiel, L. Kellerhals, R. Niedermeier, M. Rost, S. Schmid and P. Zschoche, "Optimal Virtual Network Embeddings for Tree Topologies" in Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architechtures, ACM, 2021.
N. Klobas, G. B. Mertzios, H. Molter, R. Niedermeier and P. 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.
A. Figiel, A. Himmel, A. Nichterlein and R. 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. pp. 216–230.
E. Ulitzsch, Q. He, V. Ulitzsch, A. Nichterlein, H. Molter, R. Niedermeier and S. Pohl, "Combining Clickstream Analyses and Graph-Modeled Data Clustering for Identifying Common Response Processes" , Psychometrika, pp. 1–25, 2021. Springer.
K. Heeger, A. Himmel, F. Kammer, R. Niedermeier, M. Renken and A. Sajenko, "Multistage graph problems on a global budget" , Theoretical Computer Science, vol. 868, pp. 46-64, 2021.
T. Koana, V. Froese and R. Niedermeier, "Binary Matrix Completion Under Diameter Constraints" in Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science (STACS '21), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. pp. 47:1–47:14.
N. Boehmer, R. Bredereck, K. Heeger and R. Niedermeier, "Bribery and Control in Stable Marriage" , Journal of Artificial Intelligence Research, vol. 71, pp. 993–1048, 2021.
N. Boehmer and R. 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, IFAAMAS, 2021. pp. 1–5.
M. Bentert, R. Bredereck, P. Györgyi, A. Kaczmarczyk and R. Niedermeier, "A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem" in Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI '21), 2021.
T. Koana, V. Korenwein, A. Nichterlein, R. Niedermeier and P. Zschoche, "Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments" , ACM Journal of Experimental Algorithmics, vol. 24, pp. 1–30, 2021. ACM.
K. Heeger, D. Hermelin, G. B. Mertzios, H. Molter, R. Niedermeier and D. Shabtay, "Equitable Scheduling on a Single Machine" in Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI '21), AAAI Press, 2021.
R. Bredereck, A. Figiel, A. Kaczmarczyk, D. Knop and R. Niedermeier, "High-Multiplicity Fair Allocation Made More Practical" in Proceedings of the 20th International Conference on Autonomous Agents and Multiagent Systems (AAMAS '21), 2021.
H. Molter, R. Niedermeier and M. Renken, "Isolation concepts applied to temporal clique enumeration" , Network Science, vol. 9, no. S1, pp. S83–S105, 2021.

2020

R. Bevern, H. Molter, C. Komusiewicz, R. Niedermeier, M. Sorge and T. Walsh, "h-Index Manipulation by Undoing Merges" , Quantitative Science Studies, vol. 1, no. 4, pp. 1529–1552, 2020. MIT Press.
L. Bulteau, V. Froese and R. Niedermeier, "Tight Hardness Results for Consensus Problems on Circular Strings and Time Series" , SIAM Journal on Discrete Mathematics, vol. 34, no. 3, pp. 1854–1883, 2020. SIAM.
G. B. Mertzios, A. Nichterlein and R. Niedermeier, "The Power of Linear-Time Data Reduction for Maximum Matching" , Algorithmica, vol. 82, pp. 3521–3565, 2020. Springer.
P. Zschoche, T. Fluschnik, H. Molter and R. Niedermeier, "The Complexity of Finding Small Separators in Temporal Graphs" , Journal of Computer and System Sciences, vol. 107, pp. 72–92, 2020. Elsevier.
T. Fluschnik, H. Molter, R. Niedermeier, M. Renken and P. Zschoche, "Temporal graph classes: A view through temporal separators" , Theoretical Computer Science, vol. 806, pp. 197–218, 2020. Elsevier.
T. Koana, V. Froese and R. Niedermeier, "Parameterized Algorithms for Matrix Completion With Radius Constraints" in Proceedings of the 31th Annual Symposium on Combinatorial Pattern Matching (CPM '20), Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2020. pp. 20:1–20:14.
R. Bredereck, P. Faliszewski, A. Kaczmarczyk, D. Knop and R. Niedermeier, "Parameterized Algorithms for Finding a Collective Set of Items" in Proceedings of the 34st AAAI Conference on Artificial Intelligence (AAAI '20), AAAI Press, 2020. pp. 1838–1845.
T. Fluschnik, R. Niedermeier, C. Schubert and P. 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), Yixin Cao and Siu-Wing Cheng and Minming Li, Eds. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. pp. 43:1–43:16.
R. Bredereck, K. Heeger, D. Knop and R. Niedermeier, "Multidimensional Stable Roommates with Master List" in Proceedings of the 16th International Conference on Web and Internet Economics (WINE '20), Springer, 2020. pp. 59–73.
R. Bredereck, P. Faliszewski, R. Niedermeier, P. Skowron and N. Talmon, "Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting" , Theoretical Computer Science, vol. 814, pp. 86–105, 2020. Elsevier.
N. Boehmer, R. Bredereck, P. Faliszewski, A. Kaczmarczyk and R. Niedermeier, "Line-Up Elections: Parallel Voting with Shared Candidate Pool" in Proceedings of the 13th Symposium on Algorithmic Game Theory (SAGT '20), 2020. pp. 275–290.
T. Fluschnik, H. Molter, R. Niedermeier, M. Renken and P. 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, Springer, 2020. pp. 49–77.
R. Haag, H. Molter, R. Niedermeier and M. Renken, "Feedback Edge Sets in Temporal Graphs" in Proceedings of the 46th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '20), Springer, 2020. pp. 200–212.
V. Froese, B. Jain, R. Niedermeier and M. Renken, "Comparing Temporal Graphs Using Dynamic Time Warping" , Social Network Analysis and Mining, vol. 10, pp. 50, 2020. Springer.
N. Schaar, V. Froese and R. Niedermeier, "Faster Binary Mean Computation Under Dynamic Time Warping" in Proceedings of the 31th Annual Symposium on Combinatorial Pattern Matching (CPM '20), Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2020. pp. 28:1–28:13.
S. Buß, H. Molter, R. Niedermeier and M. Rymar, "Algorithmic Aspects of Temporal Betweenness" in Proceedings of the 26th SIGKDD Conference on Knowledge Discovery and Data Mining (KDD '20), ACM, 2020. pp. 2084–2092.
R. Bredereck, J. Chen, D. Knop, J. Luo and R. Niedermeier, "Adapting Stable Matchings to Evolving Preferences" in Proceedings of the 34st AAAI Conference on Artificial Intelligence (AAAI '20), AAAI Press, 2020. pp. 1830–1837.
N. Boehmer, R. Bredereck, K. Heeger and R. Niedermeier, "Bribery and Control in Stable Marriage" in Proceedings of the 13th Symposium on Algorithmic Game Theory (SAGT '20), 2020. pp. 163–177.
M. Bentert, A. Dittmann, L. Kellerhals, A. Nichterlein and R. Niedermeier, "An Adaptive Version of Brandes' Algorithm for Betweenness Centrality" , Journal of Graph Algorithms and Applications, vol. 24, no. 3, pp. 483–522, 2020.
G. B. Mertzios, H. Molter, R. Niedermeier, V. Zamaraev and P. Zschoche, "Computing Maximum Matchings in Temporal Graphs" in Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science (STACS '20), Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2020. pp. 27:1–27:14.
H. Fernau, T. Fluschnik, D. Hermelin, A. Krebs, H. Molter and R. Niedermeier, "Diminishable Parameterized Problems and Strict Polynomial Kernelization" , Computability, vol. 9, no. 1, pp. 1–24, 2020.
M. G. Millani, H. Molter, R. Niedermeier and M. Sorge, "Efficient Algorithms for Measuring the Funnel-likeness of DAGs" , Journal of Combinatorial Optimization, vol. 39, pp. 216–245, 2020.
M. Bentert, A. Himmel, A. Nichterlein and R. Niedermeier, "Efficient computation of optimal temporal walks under waiting-time constraints" , Applied Network Science, vol. 5, no. 73, pp. 1–26, 2020.
R. Bredereck, A. Kaczmarczyk and R. Niedermeier, "Electing Successive Committees: Complexity and Algorithms" in Proceedings of the 34st AAAI Conference on Artificial Intelligence (AAAI '20), AAAI Press, 2020. pp. 1846–1853.

2019

R. Bredereck, A. Kaczmarczyk, D. Knop and R. 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), ACM, 2019. pp. 505–523.
T. Fluschnik, C. Komusiewicz, G. B. Mertzios, A. Nichterlein, R. Niedermeier and N. Talmon, "When Can Graph Hyperbolicity be Computed in Linear Time?" , Algorithmica, vol. 81, no. 5, pp. 2016–2045, 2019.
T. Fluschnik, S. Kratsch, R. Niedermeier and M. Sorge, "The parameterized complexity of the minimum shared edges problem" , Journal of Computer and System Sciences, vol. 106, pp. 23–48, 2019.
R. Bredereck, K. Heeger, D. Knop and R. 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), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. pp. 44:1–44:14.
M. Bentert, T. Fluschnik, A. Nichterlein and R. Niedermeier, "Parameterized aspects of triangle enumeration" , Journal of Computer and System Sciences, vol. 103, pp. 61 - 77, 2019.
T. Fluschnik, R. Niedermeier, V. Rohm and P. Zschoche, "Multistage Vertex Cover" in Proceedings of the 14th International Symposium on Parameterized and Exact Computation (IPEC 2019), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. pp. 14:1–14:14.
M. Bentert, A. Himmel, H. Molter, M. Morik, R. Niedermeier and R. Saitenmacher, "Listing All Maximal k-Plexes in Temporal Graphs" , ACM Journal of Experimental Algorithmics, vol. 24, no. 1, pp. 1–13, 2019. ACM.
M. Bentert, R. Bevern and R. Niedermeier, "Inductive k-independent graphs and c-colorable subgraphs in scheduling: A review" , Journal of Scheduling, vol. 22, no. 1, pp. 3–20, 2019.
A. Himmel, M. Bentert, A. Nichterlein and R. Niedermeier, "Efficient Computation of Optimal Temporal Walks under Waiting-Time Constraints" in Proceedings of the 8th International Conference on Complex Networks and their Applications, Springer, 2019. pp. 494–506.
M. Brill, T. Fluschnik, V. Froese, B. Jain, R. Niedermeier and D. Schultz, "Exact Mean Computation in Dynamic Time Warping Spaces" , Data Mining and Knowledge Discovery, vol. 33, no. 1, pp. 252–291, 2019.
C. Komusiewicz, A. Nichterlein, R. Niedermeier and M. Picker, "Exact Algorithms for Finding Well-Connected 2-Clubs in Sparse Real-World Graphs: Theory and Experiments" , European Journal of Operational Research, vol. 275, no. 3, pp. 846–864, 2019.
H. Molter, R. Niedermeier and M. Renken, "Enumerating Isolated Cliques in Temporal Networks" in Proceedings of the 8th International Conference on Complex Networks and their Applications, Springer, 2019. pp. 519–531.
V. Froese, B. Jain, R. Niedermeier and M. Renken, "Comparing Temporal Graphs Using Dynamic Time Warping" in Proceedings of the 8th International Conference on Complex Networks and their Applications, Springer, 2019. pp. 469–480.
R. Bredereck, C. Komusiewicz, S. Kratsch, H. Molter, R. Niedermeier and M. Sorge, "Assessing the Computational Complexity of Multi-Layer Subgraph Detection" , Network Science, vol. 7, no. 2, pp. 215–241, 2019. Cambridge University Press.
R. Bredereck, P. Faliszewski, A. Kaczmarczyk and R. Niedermeier, "An Experimental View on Committees Providing Justified Representation" in Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI '19), AAAI Press, 2019. pp. 109–115.
R. Bredereck, V. Froese, M. Koseler, M. G. Millani, A. Nichterlein and R. Niedermeier, "A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems" , Algorithmica, vol. 81, no. 4, pp. 1584–1614, 2019.
C. Bazgan, T. Fluschnik, A. Nichterlein, R. Niedermeier and M. Stahlberg, "A More Fine-Grained Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths" , Networks, vol. 73, no. 1, pp. 23–37, 2019.

2018

M. Brill, T. Fluschnik, V. Froese, B. Jain, R. Niedermeier and D. Schultz, "Exact Mean Computation in Dynamic Time Warping Spaces" in Proceedings of the SIAM International Conference on Data Mining (SDM '18), SIAM, 2018. pp. 540–548.
T. Fluschnik, H. Molter, R. Niedermeier and P. 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), Springer International Publishing, 2018. pp. 216–227.
J. Luo, H. Molter, A. Nichterlein and R. Niedermeier, "Parameterized Dynamic Cluster Editing" in Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS '18), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. pp. 46:1–46:15.
M. Bentert, A. Himmel, H. Molter, M. Morik, R. Niedermeier and R. 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), IEEE Computer Society, 2018. pp. 41–46.
T. Fluschnik, D. Hermelin, A. Nichterlein and R. Niedermeier, "Fractals for Kernelization Lower Bounds" , SIAM Journal on Discrete Mathematics, vol. 32, no. 1, pp. 656–681, 2018.
P. Zschoche, T. Fluschnik, H. Molter and R. 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), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. pp. 45:1–45:17.
R. Bredereck, A. Kaczmarczyk and R. Niedermeier, "Envy-Free Allocations Respecting Social Networks" in Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems (AAMAS '18), IFAAMAS, 2018. pp. 283–291.
H. Fernau, T. Fluschnik, D. Hermelin, A. Krebs, H. Molter and R. Niedermeier, "Diminishable Parameterized Problems and Strict Polynomial Kernelization" in Proceedings of the 14th Conference on Computability in Europe (CiE '18), Springer International Publishing, 2018. pp. 161–171.
V. Korenwein, A. Nichterlein, R. Niedermeier and P. 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), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. pp. 53:1–53:13.
M. Bentert, A. Dittmann, L. Kellerhals, A. Nichterlein and R. Niedermeier, "An Adaptive Version of Brandes' Algorithm for Betweenness Centrality" in Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC '18), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. pp. 36:1–36:13.
G. B. Mertzios, A. Nichterlein and R. Niedermeier, "A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs" , SIAM Journal on Discrete Mathematics, vol. 32, no. 4, pp. 2820-2835, 2018.
M. G. Millani, H. Molter, R. Niedermeier and M. Sorge, "Efficient Algorithms for Measuring the Funnel-likeness of DAGs" in Proceedings of the 5th International Symposium on Combinatorial Optimization (ISCO '18), Springer International Publishing, 2018. pp. 183–195.

2017

R. Bredereck, J. Chen, R. Niedermeier and T. Walsh, "Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty" , Journal of Artificial Intelligence Research, vol. 59, pp. 133–173, 2017.
G. B. Mertzios, A. Nichterlein and R. 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), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. pp. 46:1–46:14.
L. Bulteau, S. Fafianie, V. Froese, R. Niedermeier and N. Talmon, "The Complexity of Finding Effectors" , Theory of Computing Systems, vol. 60, no. 2, pp. 253–279, 2017.
R. Bredereck, J. Chen, R. Niedermeier, S. Obraztsova and N. Talmon, "Teams in Online Scheduling Polls: Game-Theoretic Aspects" in Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI '17), AAAI Press, 2017. pp. 390–396.
R. Bredereck, J. Chen, U. P. Finnendahl and R. Niedermeier, "Stable Roommate with Narcissistic, Single-Peaked, and Single-Crossing Preferences" in Proceedings of the 5th International Conference on Algorithmic Decision Theory (ADT '17), Springer, 2017. pp. 315–330.
R. Bredereck, P. Faliszewski, A. Kaczmarczyk, R. Niedermeier, P. Skowron and N. Talmon, "Robustness Among Multiwinner Voting Rules" in Proceedings of the Algorithmic Game Theory: 10th International Symposium (SAGT '17), Springer, 2017. pp. 80–92.
A. C. Giannopoulou, G. B. Mertzios and R. Niedermeier, "Polynomial Fixed-parameter Algorithms: A Case Study for Longest Path on Interval Graphs", 2017.
R. Bevern, R. Bredereck, L. Bulteau, J. Chen, V. Froese, R. Niedermeier and G. J. Woeginger, "Partitioning Perfect Graphs into Stars" , Journal of Graph Theory, vol. 85, no. 2, pp. 297–335, 2017.

Seite 1 von 4