Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDRolf Niedermeier
Person information
- affiliation: Technical University of Berlin, Department of Mathematics, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[j144]Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier:
On coalitional manipulation for multiwinner elections: shortlisting. Auton. Agents Multi Agent Syst. 35(2): 38 (2021)- [j143]Robert Bredereck
, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Robustness among multiwinner voting rules. Artif. Intell. 290: 103403 (2021) - [j142]Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier:
Parameterized Dynamic Cluster Editing. Algorithmica 83(1): 1-44 (2021) - [j141]Rolf Niedermeier, Christophe Paul:
Preface of STACS 2019 Special Issue. Theory Comput. Syst. 65(4): 635-637 (2021) - [j140]Klaus Heeger, Anne-Sophie Himmel, Frank Kammer, Rolf Niedermeier, Malte Renken, Andrej Sajenko:
Multistage graph problems on a global budget. Theor. Comput. Sci. 868: 46-64 (2021) - [c180]Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier:
A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem. AAAI 2021: 11755-11763 - [c179]Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay:
Equitable Scheduling on a Single Machine. AAAI 2021: 11818-11825 - [c178]Niclas Boehmer, Rolf Niedermeier:
Broadening the Research Agenda for Computational Social Choice: Multiple Preference Profiles and Multiple Solutions. AAMAS 2021: 1-5 - [c177]Robert Bredereck, Aleksander Figiel, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier:
High-Multiplicity Fair Allocation Made More Practical. AAMAS 2021: 260-268 - [c176]Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier:
On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering. CIAC 2021: 216-230 - [c175]Aleksander Figiel, Leon Kellerhals, Rolf Niedermeier, Matthias Rost, Stefan Schmid, Philipp Zschoche:
Optimal Virtual Network Embeddings for Tree Topologies. SPAA 2021: 221-231 - [c174]Tomohiro Koana, Vincent Froese, Rolf Niedermeier:
Binary Matrix Completion Under Diameter Constraints. STACS 2021: 47:1-47:14 - [i96]Matthias Bentert, Tomohiro Koana, Rolf Niedermeier:
The Complexity of Gerrymandering Over Graphs: Paths and Trees. CoRR abs/2102.08905 (2021) - [i95]Niclas Boehmer, Tomohiro Koana, Rolf Niedermeier:
A Refined Complexity Analysis of Fair Districting over Graphs. CoRR abs/2102.11864 (2021) - [i94]Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier:
A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem. CoRR abs/2102.13642 (2021) - [i93]Niclas Boehmer, Vincent Froese, Julia Henkel, Yvonne Lasars, Rolf Niedermeier, Malte Renken:
Two Influence Maximization Games on Graphs Made Temporal. CoRR abs/2105.05987 (2021) - [i92]Luca Kreisel, Niclas Boehmer, Vincent Froese, Rolf Niedermeier:
Equilibria in Schelling Games: Computational Complexity and Robustness. CoRR abs/2105.06561 (2021) - [i91]Aleksander Figiel, Leon Kellerhals, Rolf Niedermeier, Matthias Rost, Stefan Schmid, Philipp Zschoche:
Optimal Virtual Network Embeddings for Tree Topologies. CoRR abs/2105.07006 (2021) - [i90]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Stanislaw Szufa:
Putting a Compass on the Map of Elections. CoRR abs/2105.07815 (2021) - [i89]Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche:
Interference-free Walks in Time: Temporally Disjoint Paths. CoRR abs/2105.08335 (2021) - [i88]Vincent Froese, Christoph Hertrich, Rolf Niedermeier:
The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality. CoRR abs/2105.08675 (2021) - [i87]Nicolas Maack, Hendrik Molter, Rolf Niedermeier, Malte Renken:
On Finding Separators in Temporal Split and Permutation Graphs. CoRR abs/2105.12003 (2021) - [i86]Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier:
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. CoRR abs/2105.13055 (2021) - [i85]Pascal Kunz, Till Fluschnik, Rolf Niedermeier, Malte Renken:
Most Classic Problems Remain NP-hard on Relative Neighborhood Graphs and their Relatives. CoRR abs/2107.04321 (2021) - 2020
- [j139]Robert Bredereck, Jiehua Chen, Ugo Paavo Finnendahl, Rolf Niedermeier:
Stable roommates with narcissistic, single-peaked, and single-crossing preferences. Auton. Agents Multi Agent Syst. 34(2): 53 (2020) - [j138]George B. Mertzios, André Nichterlein, Rolf Niedermeier:
The Power of Linear-Time Data Reduction for Maximum Matching. Algorithmica 82(12): 3521-3565 (2020) - [j137]Matthias Bentert, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier:
Efficient computation of optimal temporal walks under waiting-time constraints. Appl. Netw. Sci. 5(1): 73 (2020) - [j136]Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier:
Diminishable parameterized problems and strict polynomial kernelization. Comput. 9(1): 1-24 (2020) - [j135]Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Efficient algorithms for measuring the funnel-likeness of DAGs. J. Comb. Optim. 39(1): 216-245 (2020) - [j134]Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier:
The complexity of finding small separators in temporal graphs. J. Comput. Syst. Sci. 107: 72-92 (2020) - [j133]Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier:
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality. J. Graph Algorithms Appl. 24(3): 483-522 (2020) - [j132]Rolf Niedermeier, Brigitte Vallée:
Preface of the Special Issue on Theoretical Aspects of Computer Science (2018). Theory Comput. Syst. 64(3): 371-373 (2020) - [j131]René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh:
h-Index manipulation by undoing merges. Quant. Sci. Stud. 1(4): 1529-1552 (2020) - [j130]Laurent Bulteau, Vincent Froese, Rolf Niedermeier:
Tight Hardness Results for Consensus Problems on Circular Strings and Time Series. SIAM J. Discret. Math. 34(3): 1854-1883 (2020) - [j129]Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, Malte Renken:
Comparing temporal graphs using dynamic time warping. Soc. Netw. Anal. Min. 10(1): 50 (2020) - [j128]Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche:
Temporal graph classes: A view through temporal separators. Theor. Comput. Sci. 806: 197-218 (2020) - [j127]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting. Theor. Comput. Sci. 814: 86-105 (2020) - [c173]Robert Bredereck, Jiehua Chen, Dusan Knop, Junjie Luo, Rolf Niedermeier:
Adapting Stable Matchings to Evolving Preferences. AAAI 2020: 1830-1837 - [c172]Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier:
Parameterized Algorithms for Finding a Collective Set of Items. AAAI 2020: 1838-1845 - [c171]Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier:
Electing Successive Committees: Complexity and Algorithms. AAAI 2020: 1846-1853 - [c170]Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche:
As Time Goes By: Reflections on Treewidth for Temporal Graphs. Treewidth, Kernels, and Algorithms 2020: 49-77 - [c169]Tomohiro Koana, Vincent Froese, Rolf Niedermeier:
Parameterized Algorithms for Matrix Completion with Radius Constraints. CPM 2020: 20:1-20:14 - [c168]Nathan Schaar, Vincent Froese, Rolf Niedermeier:
Faster Binary Mean Computation Under Dynamic Time Warping. CPM 2020: 28:1-28:13 - [c167]Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche:
Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs. ISAAC 2020: 43:1-43:16 - [c166]Sebastian Buß, Hendrik Molter, Rolf Niedermeier, Maciej Rymar:
Algorithmic Aspects of Temporal Betweenness. KDD 2020: 2084-2092 - [c165]Niclas Boehmer, Robert Bredereck, Klaus Heeger, Rolf Niedermeier:
Bribery and Control in Stable Marriage. SAGT 2020: 163-177 - [c164]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier:
Line-Up Elections: Parallel Voting with Shared Candidate Pool. SAGT 2020: 275-290 - [c163]George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche:
Computing Maximum Matchings in Temporal Graphs. STACS 2020: 27:1-27:14 - [c162]Roman Haag, Hendrik Molter, Rolf Niedermeier, Malte Renken:
Feedback Edge Sets in Temporal Graphs. WG 2020: 200-212 - [c161]Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier:
Multidimensional Stable Roommates with Master List. WINE 2020: 59-73 - [i84]Tomohiro Koana, Vincent Froese, Rolf Niedermeier:
Parameterized Algorithms for Matrix Completion With Radius Constraints. CoRR abs/2002.00645 (2020) - [i83]Nathan Schaar, Vincent Froese, Rolf Niedermeier:
Faster Binary Mean Computation Under Dynamic Time Warping. CoRR abs/2002.01178 (2020) - [i82]Tomohiro Koana, Vincent Froese, Rolf Niedermeier:
Complexity of Combinatorial Matrix Completion With Diameter Constraints. CoRR abs/2002.05068 (2020) - [i81]Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche:
Multistage s-t Path: Confronting Similarity with Dissimilarity. CoRR abs/2002.07569 (2020) - [i80]Roman Haag, Hendrik Molter, Rolf Niedermeier, Malte Renken:
Feedback Edge Sets in Temporal Graphs. CoRR abs/2003.13641 (2020) - [i79]Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche:
As Time Goes By: Reflections on Treewidth for Temporal Graphs. CoRR abs/2004.13491 (2020) - [i78]Robert Bredereck, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier:
High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming. CoRR abs/2005.04907 (2020) - [i77]Sebastian Buß, Hendrik Molter, Rolf Niedermeier, Maciej Rymar:
Algorithmic Aspects of Temporal Betweenness. CoRR abs/2006.08668 (2020) - [i76]Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier:
On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering. CoRR abs/2006.14972 (2020) - [i75]Danny Hermelin, Leon Kellerhals, Rolf Niedermeier, Rami Pugatch:
Approximating Sparse Quadratic Programs. CoRR abs/2007.01252 (2020) - [i74]Niclas Boehmer, Robert Bredereck, Klaus Heeger, Rolf Niedermeier:
Bribery and Control in Stable Marriage. CoRR abs/2007.04948 (2020) - [i73]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier:
Line-Up Elections: Parallel Voting with Shared Candidate Pool. CoRR abs/2007.04960 (2020) - [i72]Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier:
Multidimensional Stable Roommates with Master List. CoRR abs/2009.14191 (2020) - [i71]Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay:
Equitable Scheduling on a Single Machine. CoRR abs/2010.04643 (2020) - [i70]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier:
On the Robustness of Winners: Counting Briberies in Elections. CoRR abs/2010.09678 (2020) - [i69]Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier:
Envy-Free Allocations Respecting Social Networks. CoRR abs/2011.11596 (2020)
2010 – 2019
- 2019
- [j126]Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier:
A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs. Algorithmica 81(4): 1584-1614 (2019) - [j125]Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon:
When Can Graph Hyperbolicity be Computed in Linear Time? Algorithmica 81(5): 2016-2045 (2019) - [j124]Markus Brill, Till Fluschnik, Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, David Schultz:
Exact mean computation in dynamic time warping spaces. Data Min. Knowl. Discov. 33(1): 252-291 (2019) - [j123]Christian Komusiewicz, André Nichterlein, Rolf Niedermeier, Marten Picker:
Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: Theory and experiments. Eur. J. Oper. Res. 275(3): 846-864 (2019) - [j122]Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier:
Parameterized aspects of triangle enumeration. J. Comput. Syst. Sci. 103: 61-77 (2019) - [j121]Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge:
The parameterized complexity of the minimum shared edges problem. J. Comput. Syst. Sci. 106: 23-48 (2019) - [j120]Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher:
Listing All Maximal k-Plexes in Temporal Graphs. ACM J. Exp. Algorithmics 24(1): 1.13:1-1.13:27 (2019) - [j119]Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Assessing the computational complexity of multilayer subgraph detection. Netw. Sci. 7(2): 215-241 (2019) - [j118]Cristina Bazgan, Till Fluschnik, André Nichterlein, Rolf Niedermeier, Maximilian Stahlberg:
A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths. Networks 73(1): 23-37 (2019) - [j117]Matthias Bentert, René van Bevern, Rolf Niedermeier:
Inductive $$k$$ k -independent graphs and c-colorable subgraphs in scheduling: a review. J. Sched. 22(1): 3-20 (2019) - [c160]Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, Malte Renken:
Comparing Temporal Graphs Using Dynamic Time Warping. COMPLEX NETWORKS (2) 2019: 469-480 - [c159]Anne-Sophie Himmel, Matthias Bentert, André Nichterlein, Rolf Niedermeier:
Efficient Computation of Optimal Temporal Walks Under Waiting-Time Constraints. COMPLEX NETWORKS (2) 2019: 494-506 - [c158]Hendrik Molter, Rolf Niedermeier, Malte Renken:
Enumerating Isolated Cliques in Temporal Networks. COMPLEX NETWORKS (2) 2019: 519-531 - [c157]Robert Bredereck, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier:
High-Multiplicity Fair Allocation: Lenstra Empowered by N-fold Integer Programming. EC 2019: 505-523 - [c156]Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier:
An Experimental View on Committees Providing Justified Representation. IJCAI 2019: 109-115 - [c155]Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier:
Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters. ISAAC 2019: 44:1-44:14 - [c154]Till Fluschnik, Rolf Niedermeier, Valentin Rohm, Philipp Zschoche:
Multistage Vertex Cover. IPEC 2019: 14:1-14:14 - [e5]Rolf Niedermeier, Christophe Paul:
36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany. LIPIcs 126, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-100-9 [contents] - [i68]Robert Bredereck, Jiehua Chen, Ugo Paavo Finnendahl, Rolf Niedermeier:
Stable Roommates with Narcissistic, Single-Peaked, and Single-Crossing Preferences. CoRR abs/1903.05975 (2019) - [i67]George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche:
Computing Maximum Matchings in Temporal Graphs. CoRR abs/1905.05304 (2019) - [i66]Till Fluschnik, Rolf Niedermeier, Valentin Rohm, Philipp Zschoche:
Multistage Vertex Cover. CoRR abs/1906.00659 (2019) - [i65]Robert Bredereck, Jiehua Chen, Dusan Knop, Junjie Luo, Rolf Niedermeier:
Adapting Stable Matchings to Evolving Preferences. CoRR abs/1907.01375 (2019) - [i64]Anne-Sophie Himmel, Matthias Bentert, André Nichterlein, Rolf Niedermeier:
Efficient Computation of Optimal Temporal Walks under Waiting-Time Constraints. CoRR abs/1909.01152 (2019) - [i63]Hendrik Molter, Rolf Niedermeier, Malte Renken:
Enumerating Isolated Cliques in Temporal Networks. CoRR abs/1909.06292 (2019) - [i62]Matthias Bentert, René van Bevern, Till Fluschnik, André Nichterlein, Rolf Niedermeier:
Polynomial-Time Preprocessing for Weighted Problems Beyond Additive Goal Functions. CoRR abs/1910.00277 (2019) - [i61]Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier:
Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters. CoRR abs/1911.09379 (2019) - [i60]Klaus Heeger, Anne-Sophie Himmel, Frank Kammer, Rolf Niedermeier, Malte Renken, Andrej Sajenko:
Multistage Problems on a Global Budget. CoRR abs/1912.04392 (2019) - [i59]Umberto Grandi, Stefan Napel, Rolf Niedermeier, Kristen Brent Venable:
Application-Oriented Computational Social Choice (Dagstuhl Seminar 19381). Dagstuhl Reports 9(9): 45-65 (2019) - [i58]Magnus Bordewich, Britta Dorn, Simone Linz, Rolf Niedermeier:
Algorithms and Complexity in Phylogenetics (Dagstuhl Seminar 19443). Dagstuhl Reports 9(10): 134-151 (2019) - 2018
- [j116]Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier:
Fractals for Kernelization Lower Bounds. SIAM J. Discret. Math. 32(1): 656-681 (2018) - [j115]George B. Mertzios, André Nichterlein, Rolf Niedermeier:
A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs. SIAM J. Discret. Math. 32(4): 2820-2835 (2018) - [c153]Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher:
Listing All Maximal k-Plexes in Temporal Graphs. ASONAM 2018: 41-46 - [c152]Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier:
Envy-Free Allocations Respecting Social Networks. AAMAS 2018: 283-291 - [c151]Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier:
Diminishable Parameterized Problems and Strict Polynomial Kernelization. CiE 2018: 161-171 - [c150]Viatcheslav Korenwein, André Nichterlein, Rolf Niedermeier, Philipp Zschoche:
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. ESA 2018: 53:1-53:13 - [c149]Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier:
Parameterized Dynamic Cluster Editing. FSTTCS 2018: 46:1-46:15 - [c148]Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier:
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality. ISAAC 2018: 36:1-36:13 - [c147]Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Efficient Algorithms for Measuring the Funnel-Likeness of DAGs. ISCO 2018: 183-195 - [c146]Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier:
The Complexity of Finding Small Separators in Temporal Graphs. MFCS 2018: 45:1-45:17 - [c145]Markus Brill, Till Fluschnik, Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, David Schultz:
Exact Mean Computation in Dynamic Time Warping Spaces. SDM 2018: 540-548 - [c144]Jiehua Chen, Rolf Niedermeier, Piotr Skowron:
Stable Marriage with Multi-Modal Preferences. EC 2018: 269-286 - [c143]Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche:
Temporal Graph Classes: A View Through Temporal Separators. WG 2018: 216-227 - [e4]Rolf Niedermeier, Brigitte Vallée:
35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France. LIPIcs 96, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-062-0 [contents] - [i57]Jiehua Chen, Rolf Niedermeier, Piotr Skowron:
Stable Marriage with Multi-Modal Preferences. CoRR abs/1801.02693 (2018) - [i56]Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Efficient Algorithms for Measuring the Funnel-likeness of DAGs. CoRR abs/1801.10401 (2018) - [i55]Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier:
Towards Improving Brandes' Algorithm for Betweenness Centrality. CoRR abs/1802.06701 (2018) - [i54]Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche:
Temporal Graph Classes: A View Through Temporal Separators. CoRR abs/1803.00882 (2018) - [i53]Laurent Bulteau, Vincent Froese, Rolf Niedermeier:
Hardness of Consensus Problems for Circular Strings and Time Series Averaging. CoRR abs/1804.02854 (2018) - [i52]Cristina Bazgan, Till Fluschnik, André Nichterlein, Rolf Niedermeier, Maximilian Stahlberg:
A More Fine-Grained Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths. CoRR abs/1804.09155 (2018) - [i51]Viatcheslav Korenwein, André Nichterlein, Philipp Zschoche, Rolf Niedermeier:
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. CoRR abs/1806.09683 (2018) - [i50]Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher:
Listing All Maximal k-Plexes in Temporal Graphs. CoRR abs/1806.10210 (2018) - [i49]Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier:
On Coalitional Manipulation for Multiwinner Elections: Shortlisting. CoRR abs/1806.10460 (2018) - [i48]Christian Komusiewicz, André Nichterlein, Rolf Niedermeier, Marten Picker:
Exact Algorithms for Finding Well-Connected 2-Clubs in Real-World Graphs: Theory and Experiments. CoRR abs/1807.07516 (2018) - [i47]Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, Malte Renken:
Comparing Temporal Graphs Using Dynamic Time Warping. CoRR abs/1810.06240 (2018) - [i46]Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier:
Parameterized Dynamic Cluster Editing. CoRR abs/1810.06625 (2018) - 2017
- [j114]Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier:
Finding Points in General Position. Int. J. Comput. Geom. Appl. 27(4): 277-296 (2017) - [j113]Robert Bredereck, Jiehua Chen, Rolf Niedermeier, Toby Walsh:
Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty. J. Artif. Intell. Res. 59: 133-173 (2017) - [j112]Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Elections with Few Voters: Candidate Control Can Be Easy. J. Artif. Intell. Res. 60: 937-1002 (2017) - [j111]René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Partitioning Perfect Graphs into Stars. J. Graph Theory 85(2): 297-335 (2017) - [j110]Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon:
The Complexity of Finding Effectors. Theory Comput. Syst. 60(2): 253-279 (2017) - [j109]René van Bevern, Rolf Niedermeier, Ondrej Suchý:
A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack. J. Sched. 20(3): 255-265 (2017) - [j108]Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Adapting the Bron-Kerbosch algorithm for enumerating maximal cliques in temporal graphs. Soc. Netw. Anal. Min. 7(1): 35:1-35:16 (2017) - [j107]Archontia C. Giannopoulou, George B. Mertzios, Rolf Niedermeier:
Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs. Theor. Comput. Sci. 689: 67-95 (2017) - [c142]Robert Bredereck, Jiehua Chen, Rolf Niedermeier, Svetlana Obraztsova, Nimrod Talmon:
Teams in Online Scheduling Polls: Game-Theoretic Aspects. AAAI 2017: 390-396 - [c141]