Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
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
- 2023
[j168]Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche:
Interference-free walks in time: temporally disjoint paths. Auton. Agents Multi Agent Syst. 37(1): 1 (2023)- [j167]Niclas Boehmer
, Tomohiro Koana, Rolf Niedermeier:
A refined complexity analysis of fair districting over graphs. Auton. Agents Multi Agent Syst. 37(1): 13 (2023) - [j166]Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche:
Multistage s-t Path: Confronting Similarity with Dissimilarity. Algorithmica 85(7): 2028-2064 (2023) - [j165]Matthias Bentert, Tomohiro Koana, Rolf Niedermeier:
The complexity of gerrymandering over graphs: Paths and trees. Discret. Appl. Math. 324: 103-112 (2023) - [j164]Matthias Bentert, René van Bevern, Till Fluschnik, André Nichterlein, Rolf Niedermeier:
Polynomial-time data reduction for weighted problems beyond additive goal functions. Discret. Appl. Math. 328: 117-133 (2023) - [j163]Tomohiro Koana, Vincent Froese, Rolf Niedermeier:
The complexity of binary matrix completion under diameter constraints. J. Comput. Syst. Sci. 132: 45-67 (2023) - [j162]Nicolas Maack, Hendrik Molter, Rolf Niedermeier, Malte Renken:
On finding separators in temporal split and permutation graphs. J. Comput. Syst. Sci. 135: 1-14 (2023) - [j161]George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche:
Computing maximum matchings in temporal graphs. J. Comput. Syst. Sci. 137: 1-19 (2023) - [j160]Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier:
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. J. Graph Algorithms Appl. 27(3): 173-194 (2023) - [j159]Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay:
Equitable scheduling on a single machine. J. Sched. 26(2): 209-225 (2023) - [j158]Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier:
A multivariate complexity analysis of the material consumption scheduling problem. J. Sched. 26(4): 369-382 (2023) - [j157]Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Rolf Niedermeier:
Temporal interval cliques and independent sets. Theor. Comput. Sci. 961: 113885 (2023) - [c205]Leon Kellerhals, Tomohiro Koana, Pascal Kunz, Rolf Niedermeier:
Parameterized Algorithms for Colored Clustering. AAAI 2023: 4400-4408 - [c204]Matthias Bentert, Leon Kellerhals, Rolf Niedermeier:
Fair Short Paths in Vertex-Colored Graphs. AAAI 2023: 12346-12354 - [c203]Klaus Heeger, André Nichterlein, Rolf Niedermeier:
Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions. STACS 2023: 35:1-35:19 - [i111]Klaus Heeger, André Nichterlein, Rolf Niedermeier:
Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions. CoRR abs/2301.00797 (2023) - [i110]Leon Kellerhals, Tomohiro Koana, Pascal Kunz, Rolf Niedermeier:
Parameterized Algorithms for Colored Clustering. CoRR abs/2302.00630 (2023) - 2022
- [j156]Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier:
Envy-free allocations respecting social networks. Artif. Intell. 305: 103664 (2022) - [j155]Roman Haag, Hendrik Molter, Rolf Niedermeier, Malte Renken:
Feedback edge sets in temporal graphs. Discret. Appl. Math. 307: 65-78 (2022) - [j154]Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier:
Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters. Inf. Comput. 289(Part): 104943 (2022) - [j153]Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier, Pavel V. Smirnov:
Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments. INFORMS J. Comput. 34(1): 55-75 (2022) - [j152]Vincent Froese, Christoph Hertrich, Rolf Niedermeier:
The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality. J. Artif. Intell. Res. 74: 1775-1790 (2022) - [j151]Till Fluschnik, Rolf Niedermeier, Valentin Rohm, Philipp Zschoche:
Multistage Vertex Cover. Theory Comput. Syst. 66(2): 454-483 (2022) - [j150]Matthias Bentert, Leon Kellerhals, Rolf Niedermeier:
The structural complexity landscape of finding balance-fair shortest paths. Theor. Comput. Sci. 933: 149-162 (2022) - [c202]Niclas Boehmer, Klaus Heeger, Rolf Niedermeier:
Theory of and Experiments on Minimally Invasive Stability Preservation in Changing Two-Sided Matching Markets. AAAI 2022: 4851-4858 - [c201]Robert Bredereck, Andrzej Kaczmarczyk, Junjie Luo, Rolf Niedermeier, Florian Sachse:
On Improving Resource Allocations by Sharing. AAAI 2022: 4875-4883 - [c200]Vincent Froese, Leon Kellerhals, Rolf Niedermeier:
Modification-Fair Cluster Editing. AAAI 2022: 6631-6638 - [c199]Luca Kreisel, Niclas Boehmer, Vincent Froese, Rolf Niedermeier:
Equilibria in Schelling Games: Computational Hardness and Robustness. AAMAS 2022: 761-769 - [c198]Niclas Boehmer, Tomohiro Koana, Rolf Niedermeier:
A Refined Complexity Analysis of Fair Districting over Graphs. AAMAS 2022: 1548-1550 - [c197]Laurent Bulteau, Mark Jones, Rolf Niedermeier, Till Tantau:
An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions. CPM 2022: 6:1-6:11 - [c196]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier:
A Quantitative and Qualitative Analysis of the Robustness of (Real-World) Election Winners. EAAMO 2022: 7:1-7:10 - [c195]Aleksander Figiel, Vincent Froese, André Nichterlein, Rolf Niedermeier:
There and Back Again: On Applying Data Reduction Rules by Undoing Others. ESA 2022: 53:1-53:15 - [c194]Niclas Boehmer, Piotr Faliszewski, Rolf Niedermeier, Stanislaw Szufa, Tomasz Was:
Understanding Distance Measures Among Elections. IJCAI 2022: 102-108 - [c193]Hjalmar Schulz, André Nichterlein, Rolf Niedermeier, Christopher Weyand:
Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial Time. IPEC 2022: 25:1-25:14 - [c192]Niclas Boehmer, Klaus Heeger, Rolf Niedermeier:
Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems. MFCS 2022: 21:1-21:15 - [c191]Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken:
Temporal Connectivity: Coping with Foreseen and Unforeseen Delays. SAND 2022: 17:1-17:17 - [c190]Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Rolf Niedermeier:
Temporal Unit Interval Independent Sets. SAND 2022: 19:1-19:16 - [c189]Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken:
Delay-Robust Routes in Temporal Graphs. STACS 2022: 30:1-30:15 - [c188]Pascal Kunz, Till Fluschnik, Rolf Niedermeier, Malte Renken:
Most Classic Problems Remain NP-Hard on Relative Neighborhood Graphs and Their Relatives. SWAT 2022: 29:1-29:19 - [i109]Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken:
Temporal Connectivity: Coping with Foreseen and Unforeseen Delays. CoRR abs/2201.05011 (2022) - [i108]Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken:
Delay-Robust Routes in Temporal Graphs. CoRR abs/2201.05390 (2022) - [i107]Matthias Bentert, Leon Kellerhals, Rolf Niedermeier:
Finding Balance-Fair Short Paths in Graphs. CoRR abs/2203.17132 (2022) - [i106]Niclas Boehmer, Piotr Faliszewski, Rolf Niedermeier, Stanislaw Szufa, Tomasz Was:
Understanding Distance Measures Among Elections. CoRR abs/2205.00492 (2022) - [i105]Aleksander Figiel, Vincent Froese, André Nichterlein, Rolf Niedermeier:
There and Back Again: On Applying Data Reduction Rules by Undoing Others. CoRR abs/2206.14698 (2022) - [i104]Niclas Boehmer, Klaus Heeger, Rolf Niedermeier:
Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems. CoRR abs/2208.01563 (2022) - [i103]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier:
A Quantitative and Qualitative Analysis of the Robustness of (Real-World) Election Winners. CoRR abs/2208.13760 (2022) - 2021
- [j149]Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier:
On coalitional manipulation for multiwinner elections: shortlisting. Auton. Agents Multi Agent Syst. 35(2): 38 (2021) - [j148]Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Robustness among multiwinner voting rules. Artif. Intell. 290: 103403 (2021) - [j147]Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier:
Parameterized Dynamic Cluster Editing. Algorithmica 83(1): 1-44 (2021) - [j146]Niclas Boehmer, Robert Bredereck, Klaus Heeger, Rolf Niedermeier:
Bribery and Control in Stable Marriage. J. Artif. Intell. Res. 71: 993-1048 (2021) - [j145]Tomohiro Koana, Viatcheslav Korenwein, André Nichterlein, Rolf Niedermeier, Philipp Zschoche:
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. ACM J. Exp. Algorithmics 26: 1.3:1-1.3:30 (2021) - [j144]Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier:
On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering. J. Graph Algorithms Appl. 25(1): 521-547 (2021) - [j143]Rolf Niedermeier, Christophe Paul:
Preface of STACS 2019 Special Issue. Theory Comput. Syst. 65(4): 635-637 (2021) - [j142]Hendrik Molter, Rolf Niedermeier, Malte Renken:
Isolation concepts applied to temporal clique enumeration. Netw. Sci. 9(S1): S83-S105 (2021) - [j141]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) - [j140]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Complexity of Shift Bribery in Committee Elections. ACM Trans. Comput. Theory 13(3): 20:1-20:25 (2021) - [c187]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 - [c186]Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay:
Equitable Scheduling on a Single Machine. AAAI 2021: 11818-11825 - [c185]Niclas Boehmer, Rolf Niedermeier:
Broadening the Research Agenda for Computational Social Choice: Multiple Preference Profiles and Multiple Solutions. AAMAS 2021: 1-5 - [c184]Robert Bredereck, Aleksander Figiel, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier:
High-Multiplicity Fair Allocation Made More Practical. AAMAS 2021: 260-268 - [c183]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 - [c182]Nicolas Maack, Hendrik Molter, Rolf Niedermeier, Malte Renken:
On Finding Separators in Temporal Split and Permutation Graphs. FCT 2021: 385-398 - [c181]Niclas Boehmer, Vincent Froese, Julia Henkel, Yvonne Lasars, Rolf Niedermeier, Malte Renken:
Two Influence Maximization Games on Graphs Made Temporal. IJCAI 2021: 45-51 - [c180]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier:
Winner Robustness via Swap- and Shift-Bribery: Parameterized Counting Complexity and Experiments. IJCAI 2021: 52-58 - [c179]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Stanislaw Szufa:
Putting a Compass on the Map of Elections. IJCAI 2021: 59-65 - [c178]Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche:
Interference-free Walks in Time: Temporally Disjoint Paths. IJCAI 2021: 4090-4096 - [c177]Aleksander Figiel, Leon Kellerhals, Rolf Niedermeier, Matthias Rost, Stefan Schmid, Philipp Zschoche:
Optimal Virtual Network Embeddings for Tree Topologies. SPAA 2021: 221-231 - [c176]Tomohiro Koana, Vincent Froese, Rolf Niedermeier:
Binary Matrix Completion Under Diameter Constraints. STACS 2021: 47:1-47:14 - [c175]Matthias Bentert, Tomohiro Koana, Rolf Niedermeier:
The Complexity of Gerrymandering over Graphs: Paths and Trees. WG 2021: 195-206 - [c174]Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier:
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. WG 2021: 219-231 - [i102]Matthias Bentert, Tomohiro Koana, Rolf Niedermeier:
The Complexity of Gerrymandering Over Graphs: Paths and Trees. CoRR abs/2102.08905 (2021) - [i101]Niclas Boehmer, Tomohiro Koana, Rolf Niedermeier:
A Refined Complexity Analysis of Fair Districting over Graphs. CoRR abs/2102.11864 (2021) - [i100]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) - [i99]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) - [i98]Luca Kreisel, Niclas Boehmer, Vincent Froese, Rolf Niedermeier:
Equilibria in Schelling Games: Computational Complexity and Robustness. CoRR abs/2105.06561 (2021) - [i97]Aleksander Figiel, Leon Kellerhals, Rolf Niedermeier, Matthias Rost, Stefan Schmid, Philipp Zschoche:
Optimal Virtual Network Embeddings for Tree Topologies. CoRR abs/2105.07006 (2021) - [i96]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Stanislaw Szufa:
Putting a Compass on the Map of Elections. CoRR abs/2105.07815 (2021) - [i95]Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche:
Interference-free Walks in Time: Temporally Disjoint Paths. CoRR abs/2105.08335 (2021) - [i94]Vincent Froese, Christoph Hertrich, Rolf Niedermeier:
The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality. CoRR abs/2105.08675 (2021) - [i93]Nicolas Maack, Hendrik Molter, Rolf Niedermeier, Malte Renken:
On Finding Separators in Temporal Split and Permutation Graphs. CoRR abs/2105.12003 (2021) - [i92]Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier:
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. CoRR abs/2105.13055 (2021) - [i91]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) - [i90]Vincent Froese, Leon Kellerhals, Rolf Niedermeier:
Modification-Fair Cluster Editing. CoRR abs/2112.03183 (2021) - [i89]Niclas Boehmer, Klaus Heeger, Rolf Niedermeier:
Theory of and Experiments on Minimally Invasive Stability Preservation in Changing Two-Sided Matching Markets. CoRR abs/2112.05777 (2021) - [i88]Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Rolf Niedermeier:
Temporal Unit Interval Independent Sets. CoRR abs/2112.06172 (2021) - [i87]Robert Bredereck, Andrzej Kaczmarczyk, Junjie Luo, Rolf Niedermeier, Florian Sachse:
On Improving Resource Allocations by Sharing. CoRR abs/2112.07525 (2021) - [i86]Danny Hermelin, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay:
Equitable Scheduling for the Total Completion Time Objective. CoRR abs/2112.13824 (2021) - [i85]Arnaud Casteigts, Kitty Meeks, George B. Mertzios, Rolf Niedermeier:
Temporal Graphs: Structure, Algorithms, Applications (Dagstuhl Seminar 21171). Dagstuhl Reports 11(3): 16-46 (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]