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
- 2025
[j177]Stanislaw Szufa, Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
Drawing a map of elections. Artif. Intell. 343: 104332 (2025)- [j176]Danny Hermelin, Hendrik Molter, Rolf Niedermeier, Michael L. Pinedo
, Dvir Shabtay:
Fairness in repetitive scheduling. Eur. J. Oper. Res. 323(3): 724-738 (2025) - 2024
- [j175]Luca Kreisel, Niclas Boehmer, Vincent Froese, Rolf Niedermeier:
Equilibria in schelling games: computational hardness and robustness. Auton. Agents Multi Agent Syst. 38(1): 9 (2024) - [j174]Anne-Sophie Himmel, George B. Mertzios, André Nichterlein, Rolf Niedermeier:
Fast Parameterized Preprocessing for Polynomial-Time Solvable Graph Problems. Commun. ACM 67(4): 70-79 (2024) - [j173]René van Bevern, Iyad Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge:
The role of twins in computing planar supports of hypergraphs. J. Graph Algorithms Appl. 28(1): 51-79 (2024) - [j172]Sebastian Buß, Hendrik Molter, Rolf Niedermeier, Maciej Rymar:
Algorithmic aspects of temporal betweenness. Netw. Sci. 12(2): 160-188 (2024) - [j171]Vincent Froese, Leon Kellerhals, Rolf Niedermeier:
Modification-fair cluster editing. Soc. Netw. Anal. Min. 14(1): 109 (2024) - [j170]Danny Hermelin, Leon Kellerhals, Rolf Niedermeier, Rami Pugatch:
Approximating sparse quadratic programs. Theor. Comput. Sci. 984: 114319 (2024) - [i115]Matthias Bentert, Leon Kellerhals, Rolf Niedermeier:
The Structural Complexity Landscape of Finding Balance-Fair Shortest Paths. CoRR abs/2405.18866 (2024) - 2023
- [j169]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) - [j168]Niclas Boehmer, Tomohiro Koana, Rolf Niedermeier:
A refined complexity analysis of fair districting over graphs. Auton. Agents Multi Agent Syst. 37(1): 13 (2023) - [j167]Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche:
Multistage s-t Path: Confronting Similarity with Dissimilarity. Algorithmica 85(7): 2028-2064 (2023) - [j166]Matthias Bentert, Tomohiro Koana, Rolf Niedermeier:
The complexity of gerrymandering over graphs: Paths and trees. Discret. Appl. Math. 324: 103-112 (2023) - [j165]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) - [j164]Robert Bredereck, Andrzej Kaczmarczyk, Junjie Luo, Rolf Niedermeier, Florian Sachse:
Improving Resource Allocations by Sharing in Pairs. J. Artif. Intell. Res. 78: 1069-1109 (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) - [c206]Leon Kellerhals, Tomohiro Koana, Pascal Kunz, Rolf Niedermeier:
Parameterized Algorithms for Colored Clustering. AAAI 2023: 4400-4408 - [c205]Matthias Bentert, Leon Kellerhals, Rolf Niedermeier:
Fair Short Paths in Vertex-Colored Graphs. AAAI 2023: 12346-12354 - [c204]Robert Bredereck, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier:
High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming. ECAI 2023: 303-310 - [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 - [i114]Klaus Heeger, André Nichterlein, Rolf Niedermeier:
Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions. CoRR abs/2301.00797 (2023) - [i113]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 - [i112]Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken:
Temporal Connectivity: Coping with Foreseen and Unforeseen Delays. CoRR abs/2201.05011 (2022) - [i111]Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken:
Delay-Robust Routes in Temporal Graphs. CoRR abs/2201.05390 (2022) - [i110]Matthias Bentert, Leon Kellerhals, Rolf Niedermeier:
Finding Balance-Fair Short Paths in Graphs. CoRR abs/2203.17132 (2022) - [i109]Niclas Boehmer, Piotr Faliszewski, Rolf Niedermeier, Stanislaw Szufa, Tomasz Was:
Understanding Distance Measures Among Elections. CoRR abs/2205.00492 (2022) - [i108]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) - [i107]Niclas Boehmer, Klaus Heeger, Rolf Niedermeier:
Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems. CoRR abs/2208.01563 (2022) - [i106]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 - [i105]Matthias Bentert, Tomohiro Koana, Rolf Niedermeier:
The Complexity of Gerrymandering Over Graphs: Paths and Trees. CoRR abs/2102.08905 (2021) - [i104]Niclas Boehmer, Tomohiro Koana, Rolf Niedermeier:
A Refined Complexity Analysis of Fair Districting over Graphs. CoRR abs/2102.11864 (2021) - [i103]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) - [i102]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) - [i101]Luca Kreisel, Niclas Boehmer, Vincent Froese, Rolf Niedermeier:
Equilibria in Schelling Games: Computational Complexity and Robustness. CoRR abs/2105.06561 (2021) - [i100]Aleksander Figiel, Leon Kellerhals, Rolf Niedermeier, Matthias Rost, Stefan Schmid, Philipp Zschoche:
Optimal Virtual Network Embeddings for Tree Topologies. CoRR abs/2105.07006 (2021) - [i99]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Stanislaw Szufa:
Putting a Compass on the Map of Elections. CoRR abs/2105.07815 (2021) - [i98]Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche:
Interference-free Walks in Time: Temporally Disjoint Paths. CoRR abs/2105.08335 (2021) - [i97]Vincent Froese, Christoph Hertrich, Rolf Niedermeier:
The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality. CoRR abs/2105.08675 (2021) - [i96]Nicolas Maack, Hendrik Molter, Rolf Niedermeier, Malte Renken:
On Finding Separators in Temporal Split and Permutation Graphs. CoRR abs/2105.12003 (2021) - [i95]Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier:
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. CoRR abs/2105.13055 (2021) - [i94]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) - [i93]Vincent Froese, Leon Kellerhals, Rolf Niedermeier:
Modification-Fair Cluster Editing. CoRR abs/2112.03183 (2021) - [i92]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) - [i91]Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Rolf Niedermeier:
Temporal Unit Interval Independent Sets. CoRR abs/2112.06172 (2021) - [i90]Robert Bredereck, Andrzej Kaczmarczyk, Junjie Luo, Rolf Niedermeier, Florian Sachse:
On Improving Resource Allocations by Sharing. CoRR abs/2112.07525 (2021) - [i89]Danny Hermelin, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay:
Equitable Scheduling for the Total Completion Time Objective. CoRR abs/2112.13824 (2021) - [i88]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 - [i87]Tomohiro Koana, Vincent Froese, Rolf Niedermeier:
Parameterized Algorithms for Matrix Completion With Radius Constraints. CoRR abs/2002.00645 (2020) - [i86]Nathan Schaar, Vincent Froese, Rolf Niedermeier:
Faster Binary Mean Computation Under Dynamic Time Warping. CoRR abs/2002.01178 (2020) - [i85]Tomohiro Koana, Vincent Froese, Rolf Niedermeier:
Complexity of Combinatorial Matrix Completion With Diameter Constraints. CoRR abs/2002.05068 (2020) - [i84]Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche:
Multistage s-t Path: Confronting Similarity with Dissimilarity. CoRR abs/2002.07569 (2020) - [i83]Roman Haag, Hendrik Molter, Rolf Niedermeier, Malte Renken:
Feedback Edge Sets in Temporal Graphs. CoRR abs/2003.13641 (2020) - [i82]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) - [i81]Robert Bredereck, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier:
High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming. CoRR abs/2005.04907 (2020) - [i80]Sebastian Buß, Hendrik Molter, Rolf Niedermeier, Maciej Rymar:
Algorithmic Aspects of Temporal Betweenness. CoRR abs/2006.08668 (2020) - [i79]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) - [i78]Danny Hermelin, Leon Kellerhals, Rolf Niedermeier, Rami Pugatch:
Approximating Sparse Quadratic Programs. CoRR abs/2007.01252 (2020) - [i77]Niclas Boehmer, Robert Bredereck, Klaus Heeger, Rolf Niedermeier:
Bribery and Control in Stable Marriage. CoRR abs/2007.04948 (2020) - [i76]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier:
Line-Up Elections: Parallel Voting with Shared Candidate Pool. CoRR abs/2007.04960 (2020) - [i75]Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier:
Multidimensional Stable Roommates with Master List. CoRR abs/2009.14191 (2020) - [i74]Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay:
Equitable Scheduling on a Single Machine. CoRR abs/2010.04643 (2020) - [i73]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier:
On the Robustness of Winners: Counting Briberies in Elections. CoRR abs/2010.09678 (2020) - [i72]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] - [i71]Robert Bredereck, Jiehua Chen, Ugo Paavo Finnendahl, Rolf Niedermeier:
Stable Roommates with Narcissistic, Single-Peaked, and Single-Crossing Preferences. CoRR abs/1903.05975 (2019) - [i70]George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche:
Computing Maximum Matchings in Temporal Graphs. CoRR abs/1905.05304 (2019) - [i69]Till Fluschnik, Rolf Niedermeier, Valentin Rohm, Philipp Zschoche:
Multistage Vertex Cover. CoRR abs/1906.00659 (2019) - [i68]Robert Bredereck, Jiehua Chen, Dusan Knop, Junjie Luo, Rolf Niedermeier:
Adapting Stable Matchings to Evolving Preferences. CoRR abs/1907.01375 (2019) - [i67]Anne-Sophie Himmel, Matthias Bentert, André Nichterlein, Rolf Niedermeier:
Efficient Computation of Optimal Temporal Walks under Waiting-Time Constraints. CoRR abs/1909.01152 (2019) - [i66]Hendrik Molter, Rolf Niedermeier, Malte Renken:
Enumerating Isolated Cliques in Temporal Networks. CoRR abs/1909.06292 (2019) - [i65]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) - [i64]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) - [i63]Klaus Heeger, Anne-Sophie Himmel, Frank Kammer, Rolf Niedermeier, Malte Renken, Andrej Sajenko:
Multistage Problems on a Global Budget. CoRR abs/1912.04392 (2019) - [i62]Umberto Grandi, Stefan Napel, Rolf Niedermeier, Kristen Brent Venable:
Application-Oriented Computational Social Choice (Dagstuhl Seminar 19381). Dagstuhl Reports 9(9): 45-65 (2019) - [i61]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] - [i60]Jiehua Chen, Rolf Niedermeier, Piotr Skowron:
Stable Marriage with Multi-Modal Preferences. CoRR abs/1801.02693 (2018) - [i59]Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Efficient Algorithms for Measuring the Funnel-likeness of DAGs. CoRR abs/1801.10401 (2018) - [i58]Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier:
Towards Improving Brandes' Algorithm for Betweenness Centrality. CoRR abs/1802.06701 (2018) - [i57]Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche:
Temporal Graph Classes: A View Through Temporal Separators. CoRR abs/1803.00882 (2018) - [i56]Laurent Bulteau, Vincent Froese, Rolf Niedermeier:
Hardness of Consensus Problems for Circular Strings and Time Series Averaging. CoRR abs/1804.02854 (2018) - [i55]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) - [i54]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) - [i53]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) - [i52]Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier:
On Coalitional Manipulation for Multiwinner Elections: Shortlisting. CoRR abs/1806.10460 (2018) - [i51]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) - [i50]Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, Malte Renken:
Comparing Temporal Graphs Using Dynamic Time Warping. CoRR abs/1810.06240 (2018) - [i49]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]Robert Bredereck, Jiehua Chen, Ugo Paavo Finnendahl, Rolf Niedermeier:
Stable Roommate with Narcissistic, Single-Peaked, and Single-Crossing Preferences. ADT 2017: 315-330 - [c140]Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier:
Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks. ALGOSENSORS 2017: 26-40 - [c139]Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Assessing the Computational Complexity of Multi-layer Subgraph Detection. CIAC 2017: 128-139 - [c138]Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier:
Parameterized Aspects of Triangle Enumeration. FCT 2017: 96-110 - [c137]Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier:
On Coalitional Manipulation for Multiwinner Elections: Shortlisting. IJCAI 2017: 887-893 - [c136]George B. Mertzios, André Nichterlein, Rolf Niedermeier:
The Power of Linear-Time Data Reduction for Maximum Matching. MFCS 2017: 46:1-46:14 - [c135]Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Robustness Among Multiwinner Voting Rules. SAGT 2017: 80-92 - [c134]Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon:
When Can Graph Hyperbolicity Be Computed in Linear Time? WADS 2017: 397-408 - [i48]Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon:
When can Graph Hyperbolicity be computed in Linear Time? CoRR abs/1702.06503 (2017) - [i47]Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier:
Parameterized Aspects of Triangle Enumeration. CoRR abs/1702.06548 (2017) - [i46]George B. Mertzios, André Nichterlein, Rolf Niedermeier:
Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs. CoRR abs/1703.05598 (2017) - [i45]Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier:
Parameterized algorithms for power-efficient connected symmetric wireless sensor networks. CoRR abs/1706.03177 (2017) - [i44]Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Robustness Among Multiwinner Voting Rules. CoRR abs/1707.01417 (2017) - [i43]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. CoRR abs/1709.02850 (2017) - [i42]Markus Brill, Till Fluschnik, Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, David Schultz:
Exact Mean Computation in Dynamic Time Warping Spaces. CoRR abs/1710.08937 (2017) - [i41]Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier:
The Computational Complexity of Finding Separators in Temporal Graphs. CoRR abs/1711.00963 (2017) - [i40]Matthias Bentert, René van Bevern, Rolf Niedermeier:
(Wireless) Scheduling, Graph Classes, and c-Colorable Subgraphs. CoRR abs/1712.06481 (2017) - 2016
- [j106]René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh:
H-index manipulation by merging articles: Models, theory, and experiments. Artif. Intell. 240: 19-35 (2016) - [j105]Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier:
Co-Clustering under the Maximum Norm. Algorithms 9(1): 17 (2016) - [j104]Robert Bredereck, Jiehua Chen, Piotr Faliszewski, André Nichterlein, Rolf Niedermeier:
Prices matter for the parameterized complexity of shift bribery. Inf. Comput. 251: 140-164 (2016) - [j103]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Large-Scale Election Campaigns: Combinatorial Shift Bribery. J. Artif. Intell. Res. 55: 603-652 (2016) - [j102]Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge:
Exploiting hidden structure in selecting dimensions that distinguish vectors. J. Comput. Syst. Sci. 82(3): 521-535 (2016) - [j101]Vincent Froese, André Nichterlein, Rolf Niedermeier:
Win-win kernelization for degree sequence completion problems. J. Comput. Syst. Sci. 82(6): 1100-1111 (2016) - [c133]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Complexity of Shift Bribery in Committee Elections. AAAI 2016: 2452-2458 - [c132]Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Enumerating maximal cliques in temporal graphs. ASONAM 2016: 337-344 - [c131]Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier:
Finding Points in General Position. CCCG 2016: 7-14 - [c130]René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh:
h-Index Manipulation by Undoing Merges. ECAI 2016: 895-903 - [c129]René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge:
Twins in Subdivision Drawings of Hypergraphs. GD 2016: 67-80 - [c128]Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier:
Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems. ICALP 2016: 25:1-25:14 - [c127]Bernhard Bliem, Robert Bredereck, Rolf Niedermeier:
Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels. IJCAI 2016: 102-108 - [c126]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. IPEC 2016: 10:1-10:14 - [e3]Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier:
41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland. LIPIcs 58, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-016-3 [contents] - [r4]Rolf Niedermeier:
Data Reduction for Domination in Graphs. Encyclopedia of Algorithms 2016: 491-494 - [r3]Piotr Faliszewski, Rolf Niedermeier:
Parameterization in Computational Social Choice. Encyclopedia of Algorithms 2016: 1516-1520 - [r2]Felix A. Fischer, Olivier Hudry, Rolf Niedermeier:
Weighted Tournament Solutions. Handbook of Computational Social Choice 2016: 85-102 - [i39]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Complexity of Shift Bribery in Committee Elections. CoRR abs/1601.01492 (2016) - [i38]Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge:
The Parameterized Complexity of the Minimum Shared Edges Problem. CoRR abs/1602.01739 (2016) - [i37]René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh:
h-Index Manipulation by Undoing Merges. CoRR abs/1604.04827 (2016) - [i36]Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier:
A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems. CoRR abs/1604.06302 (2016) - [i35]Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Assessing the Computational Complexity of Multi-Layer Subgraph Detection. CoRR abs/1604.07724 (2016) - [i34]Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Enumerating Maximal Cliques in Temporal Graphs. CoRR abs/1605.03871 (2016) - [i33]Christian Komusiewicz, André Nichterlein, Rolf Niedermeier:
Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics. CoRR abs/1606.03268 (2016) - [i32]George B. Mertzios, André Nichterlein, Rolf Niedermeier:
Fine-Grained Algorithm Design for Matching. CoRR abs/1609.08879 (2016) - [i31]Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier:
Diminishable Parameterized Problems and Strict Polynomial Kernelization. CoRR abs/1611.03739 (2016) - [i30]Robert Bredereck, Jiehua Chen, Rolf Niedermeier, Svetlana Obraztsova, Nimrod Talmon:
Teams in Online Scheduling Polls: Game-Theoretic Aspects. CoRR abs/1611.08892 (2016) - 2015
- [j100]Robert Bredereck, Thomas Köhler, André Nichterlein, Rolf Niedermeier, Geevarghese Philip:
Using Patterns to Form Homogeneous Teams. Algorithmica 71(2): 517-538 (2015) - [j99]Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Martin Rötzschke:
The Parameterized Complexity of the Rainbow Subgraph Problem. Algorithms 8(1): 60-81 (2015) - [j98]Sepp Hartung, André Nichterlein, Rolf Niedermeier, Ondrej Suchý:
A refined complexity analysis of degree anonymization in graphs. Inf. Comput. 243: 249-262 (2015) - [j97]Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Ondrej Suchý:
On explaining integer vectors by few homogeneous segments. J. Comput. Syst. Sci. 81(4): 766-782 (2015) - [j96]René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller:
Interval scheduling and colorful independent sets. J. Sched. 18(5): 449-469 (2015) - [j95]Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý, Mathias Weller:
Polynomial-Time Data Reduction for the Subset Interconnection Design Problem. SIAM J. Discret. Math. 29(1): 1-25 (2015) - [j94]René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Network-Based Vertex Dissolution. SIAM J. Discret. Math. 29(2): 888-914 (2015) - [j93]Laurent Bulteau, Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Combinatorial voter control in elections. Theor. Comput. Sci. 589: 99-120 (2015) - [j92]Robert Bredereck, Vincent Froese, Sepp Hartung, André Nichterlein, Rolf Niedermeier, Nimrod Talmon:
The complexity of degree anonymization by vertex addition. Theor. Comput. Sci. 607: 16-34 (2015) - [j91]Noga Alon, Robert Bredereck, Jiehua Chen, Stefan Kratsch, Rolf Niedermeier, Gerhard J. Woeginger:
How to Put Through Your Agenda in Collective Binary Decisions. ACM Trans. Economics and Comput. 4(1): 5:1-5:28 (2015) - [c125]Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Elections with Few Voters: Candidate Control Can Be Easy. AAAI 2015: 2045-2051 - [c124]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Elections with Few Candidates: Prices, Weights, and Covering Problems. ADT 2015: 414-431 - [c123]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Large-Scale Election Campaigns: Combinatorial Shift Bribery. AAMAS 2015: 67-75 - [c122]Cristina Bazgan, André Nichterlein, Rolf Niedermeier:
A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths. CIAC 2015: 47-60 - [c121]Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge:
The Parameterized Complexity of the Minimum Shared Edges Problem. FSTTCS 2015: 448-462 - [c120]Robert Bredereck, Jiehua Chen, Rolf Niedermeier, Toby Walsh:
Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty. IJCAI 2015: 164-170 - [c119]René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh:
H-Index Manipulation by Merging Articles: Models, Theory, and Experiments. IJCAI 2015: 808-814 - [c118]Archontia C. Giannopoulou, George B. Mertzios, Rolf Niedermeier:
Polynomial Fixed-parameter Algorithms: A Case Study for Longest Path on Interval Graphs. IPEC 2015: 102-113 - [c117]Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon:
The Complexity of Finding Effectors. TAMC 2015: 224-235 - [c116]Christian Komusiewicz, André Nichterlein, Rolf Niedermeier:
Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics. WG 2015: 3-15 - [i29]Robert Bredereck, Jiehua Chen, Piotr Faliszewski, André Nichterlein, Rolf Niedermeier:
Prices Matter for the Parameterized Complexity of Shift Bribery. CoRR abs/1502.01253 (2015) - [i28]Archontia C. Giannopoulou, George B. Mertzios, Rolf Niedermeier:
Polynomial Fixed-Parameter Algorithms: A Case Study for Longest Path on Interval Graphs. CoRR abs/1506.01652 (2015) - [i27]René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge:
Well-Formed Separator Sequences, with an Application to Hypergraph Drawing. CoRR abs/1507.02350 (2015) - [i26]Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier:
Finding Points in General Position. CoRR abs/1508.01097 (2015) - [i25]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. CoRR abs/1508.01657 (2015) - [i24]Robert Bredereck, Jiehua Chen, Rolf Niedermeier, Toby Walsh:
Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty. CoRR abs/1509.02424 (2015) - [i23]René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge:
Twins in Subdivision Drawings of Hypergraphs. CoRR abs/1511.09389 (2015) - [i22]Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier:
Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems. CoRR abs/1512.00333 (2015) - [i21]Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge:
Exploiting Hidden Structure in Selecting Dimensions that Distinguish Vectors. CoRR abs/1512.01150 (2015) - [i20]Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier:
Co-Clustering Under the Maximum Norm. CoRR abs/1512.05693 (2015) - 2014
- [j90]Nadja Betzler, Robert Bredereck, Rolf Niedermeier:
Theoretical and empirical evaluation of data reduction for exact Kemeny Rank Aggregation. Auton. Agents Multi Agent Syst. 28(5): 721-748 (2014) - [j89]Manuel Sorge, Hannes Moser, Rolf Niedermeier, Mathias Weller:
Exploiting a hypergraph model for finding Golomb rulers. Acta Informatica 51(7): 449-471 (2014) - [j88]Nadja Betzler, Hans L. Bodlaender, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann:
On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion. Algorithmica 68(3): 715-738 (2014) - [j87]Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip:
The effect of homogeneity on the computational complexity of combinatorial data anonymization. Data Min. Knowl. Discov. 28(1): 65-91 (2014) - [j86]Laurent Bulteau, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier:
Multivariate Algorithmics for NP-Hard String Problems. Bull. EATCS 114 (2014) - [j85]Robert Bredereck, Jiehua Chen, Sepp Hartung, Stefan Kratsch, Rolf Niedermeier, Ondrej Suchý, Gerhard J. Woeginger:
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. J. Artif. Intell. Res. 50: 409-446 (2014) - [j84]Morgan Chopin, André Nichterlein, Rolf Niedermeier, Mathias Weller:
Constant Thresholds Can Make Target Set Selection Tractable. Theory Comput. Syst. 55(1): 61-83 (2014) - [j83]Falk Hüffner, Christian Komusiewicz, Adrian Liebtrau, Rolf Niedermeier:
Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage. IEEE ACM Trans. Comput. Biol. Bioinform. 11(3): 455-467 (2014) - [c115]Robert Bredereck, Jiehua Chen, Piotr Faliszewski, André Nichterlein, Rolf Niedermeier:
Prices Matter for the Parameterized Complexity of Shift Bribery. AAAI 2014: 1398-1404 - [c114]Robert Bredereck, Vincent Froese, Sepp Hartung, André Nichterlein, Rolf Niedermeier, Nimrod Talmon:
The Complexity of Degree Anonymization by Vertex Addition. AAIM 2014: 44-55 - [c113]René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Star Partitions of Perfect Graphs. ICALP (1) 2014: 174-185 - [c112]Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier:
Co-Clustering Under the Maximum Norm. ISAAC 2014: 298-309 - [c111]René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Network-Based Dissolution. MFCS (2) 2014: 69-80 - [c110]Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Combinatorial Voter Control in Elections. MFCS (2) 2014: 153-164 - [c109]Vincent Froese, André Nichterlein, Rolf Niedermeier:
Win-Win Kernelization for Degree Sequence Completion Problems. SWAT 2014: 194-205 - [c108]Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Martin Rötzschke:
The Parameterized Complexity of the Rainbow Subgraph Problem. WG 2014: 287-298 - [i19]René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller:
Interval scheduling and colorful independent sets. CoRR abs/1402.0851 (2014) - [i18]René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Star Partitions of Perfect Graphs. CoRR abs/1402.2589 (2014) - [i17]René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Network-Based Dissolution. CoRR abs/1402.2664 (2014) - [i16]Vincent Froese, André Nichterlein, Rolf Niedermeier:
Win-Win Kernelization for Degree Sequence Completion Problems. CoRR abs/1404.5432 (2014) - [i15]Laurent Bulteau, Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Combinatorial Voter Control in Elections. CoRR abs/1406.6859 (2014) - [i14]Robert Bredereck, Jiehua Chen, Piotr Faliszewski, Jiong Guo, Rolf Niedermeier, Gerhard J. Woeginger:
Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges. CoRR abs/1407.2143 (2014) - [i13]Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Elections with Few Voters: Candidate Control Can Be Easy. CoRR abs/1411.7812 (2014) - [i12]Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon:
The Complexity of Finding Effectors. CoRR abs/1411.7838 (2014) - [i11]René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh:
On Google Scholar H-Index Manipulation by Merging Articles. CoRR abs/1412.5498 (2014) - 2013
- [j82]Jiong Guo, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý:
The Parameterized Complexity of Local Search for TSP, More Refined. Algorithmica 67(1): 89-110 (2013) - [j81]Robert Bredereck, André Nichterlein, Rolf Niedermeier:
Pattern-Guided k-Anonymity. Algorithms 6(4): 678-701 (2013) - [j80]Hartmut Ehrig, Claudia Ermel, Falk Hüffner, Rolf Niedermeier, Olga Runge:
Confluence in Data Reduction: Bridging Graph Transformation and Kernelization. Comput. 2(1): 31-49 (2013) - [j79]Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller:
Efficient Algorithms for Eulerian Extension and Rural Postman. SIAM J. Discret. Math. 27(1): 75-94 (2013) - [j78]André Nichterlein, Rolf Niedermeier, Johannes Uhlmann, Mathias Weller:
On tractable cases of Target Set Selection. Soc. Netw. Anal. Min. 3(2): 233-256 (2013) - [j77]Sepp Hartung, Rolf Niedermeier:
Incremental list coloring of graphs, parameterized by conservation. Theor. Comput. Sci. 494: 86-98 (2013) - [c107]Robert Bredereck, André Nichterlein, Rolf Niedermeier:
Pattern-Guided k-Anonymity. FAW-AAIM 2013: 350-361 - [c106]Noga Alon, Robert Bredereck, Jiehua Chen, Stefan Kratsch, Rolf Niedermeier, Gerhard J. Woeginger:
How to Put through Your Agenda in Collective Binary Decisions. ADT 2013: 30-44 - [c105]Sepp Hartung, André Nichterlein, Rolf Niedermeier, Ondrej Suchý:
A Refined Complexity Analysis of Degree Anonymization in Graphs. ICALP (2) 2013: 594-606 - [c104]Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý, Mathias Weller:
Effective and Efficient Data Reduction for the Subset Interconnection Design Problem. ISAAC 2013: 361-371 - [c103]Falk Hüffner, Christian Komusiewicz, Adrian Liebtrau, Rolf Niedermeier:
Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage. ISBRA 2013: 99-111 - [c102]Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge:
A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems. MFCS 2013: 445-456 - [c101]Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Ondrej Suchý:
On Explaining Integer Vectors by Few Homogenous Segments. WADS 2013: 207-218 - [c100]Sharon Bruckner, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier:
Evaluation of ILP-Based Approaches for Partitioning into Colorful Components. SEA 2013: 176-187 - 2012
- [j76]René van Bevern, Hannes Moser, Rolf Niedermeier:
Approximation and Tidying - A Problem Kernel for s-Plex Cluster Vertex Deletion. Algorithmica 62(3-4): 930-950 (2012) - [j75]Nadja Betzler, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann:
On Bounded-Degree Vertex Deletion parameterized by treewidth. Discret. Appl. Math. 160(1-2): 53-60 (2012) - [j74]Hannes Moser, Rolf Niedermeier, Manuel Sorge:
Exact combinatorial algorithms and experiments for finding maximum k-plexes. J. Comb. Optim. 24(3): 347-373 (2012) - [j73]Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann:
On making directed graphs transitive. J. Comput. Syst. Sci. 78(2): 559-574 (2012) - [j72]Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller:
A new view on Rural Postman based on Eulerian Extension and Matching. J. Discrete Algorithms 16: 12-33 (2012) - [j71]Alexander Schäfer, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier:
Parameterized computational complexity of finding small-diameter subgraphs. Optim. Lett. 6(5): 883-891 (2012) - [c99]Robert Bredereck, Jiehua Chen, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý, Stefan Kratsch:
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. AAAI 2012: 1292-1298 - [c98]Nadja Betzler, Robert Bredereck, Jiehua Chen, Rolf Niedermeier:
Studies in Computational Aspects of Voting - A Parameterized Complexity Perspective. The Multivariate Algorithmic Revolution and Beyond 2012: 318-363 - [c97]Hartmut Ehrig, Claudia Ermel, Falk Hüffner, Rolf Niedermeier, Olga Runge:
Confluence in Data Reduction: Bridging Graph Transformation and Kernelization. CiE 2012: 193-202 - [c96]Sharon Bruckner, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Sven Thiel, Johannes Uhlmann:
Partitioning into Colorful Components by Minimum Edge Deletions. CPM 2012: 56-69 - [c95]René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller:
Interval Scheduling and Colorful Independent Sets. ISAAC 2012: 247-256 - [c94]Manuel Sorge, Hannes Moser, Rolf Niedermeier, Mathias Weller:
Exploiting a Hypergraph Model for Finding Golomb Rulers. ISCO 2012: 368-379 - [c93]Morgan Chopin, André Nichterlein, Rolf Niedermeier, Mathias Weller:
Constant Thresholds Can Make Target Set Selection Tractable. MedAlg 2012: 120-133 - [c92]Christian Komusiewicz, Rolf Niedermeier:
New Races in Parameterized Algorithmics. MFCS 2012: 19-30 - 2011
- [j70]Britta Dorn, Falk Hüffner, Dominikus Krüger, Rolf Niedermeier, Johannes Uhlmann:
Exploiting bounded signal flow for graph orientation based on cause-effect pairs. Algorithms Mol. Biol. 6: 21 (2011) - [j69]Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann:
Graph-based data clustering with overlaps. Discret. Optim. 8(1): 2-17 (2011) - [j68]Nadja Betzler, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier:
Average parameterization and partial kernelization for computing medians. J. Comput. Syst. Sci. 77(4): 774-789 (2011) - [j67]Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier:
A generalization of Nemhauser and Trotterʼs local optimization theorem. J. Comput. Syst. Sci. 77(6): 1141-1158 (2011) - [j66]Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann:
Deconstructing intractability - A multivariate complexity analysis of interval constrained coloring. J. Discrete Algorithms 9(1): 137-151 (2011) - [j65]André Nichterlein, Michael Dom, Rolf Niedermeier:
Aspects of a multivariate complexity analysis for Rectangle Tiling. Oper. Res. Lett. 39(5): 346-351 (2011) - [j64]Jiong Guo, Rolf Niedermeier, Ondrej Suchý:
Parameterized Complexity of Arc-Weighted Directed Steiner Problems. SIAM J. Discret. Math. 25(2): 583-599 (2011) - [j63]Nadja Betzler, René van Bevern, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier:
Parameterized Algorithmics for Finding Connected Motifs in Biological Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 8(5): 1296-1308 (2011) - [j62]Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier:
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. ACM Trans. Comput. Theory 2(2): 5:1-5:23 (2011) - [c91]Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip:
The Effect of Homogeneity on the Complexity of k-Anonymity. FCT 2011: 53-64 - [c90]Nadja Betzler, Rolf Niedermeier, Gerhard J. Woeginger:
Unweighted Coalitional Manipulation under the Borda Rule Is NP-Hard. IJCAI 2011: 55-60 - [c89]Jiong Guo, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý:
The Parameterized Complexity of Local Search for TSP, More Refined. ISAAC 2011: 614-623 - [c88]Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller:
A New View on Rural Postman Based on Eulerian Extension and Matching. IWOCA 2011: 310-323 - [c87]René van Bevern, Sepp Hartung, Frank Kammer, Rolf Niedermeier, Mathias Weller:
Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs. IPEC 2011: 194-206 - [c86]Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip:
Pattern-Guided Data Anonymization and Clustering. MFCS 2011: 182-193 - [c85]Nadja Betzler, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann:
On Making a Distinguished Vertex Minimum Degree by Vertex Deletion. SOFSEM 2011: 123-134 - [c84]Britta Dorn, Falk Hüffner, Dominikus Krüger, Rolf Niedermeier, Johannes Uhlmann:
Exploiting Bounded Signal Flow for Graph Orientation Based on Cause-Effect Pairs. TAPAS 2011: 104-115 - [c83]Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller:
From Few Components to an Eulerian Graph by Adding Arcs. WG 2011: 307-318 - [p2]Michael Dom, Falk Hüffner, Rolf Niedermeier:
Depth-First Search (Ariadne & Co.). Algorithms Unplugged 2011: 57-68 - 2010
- [j61]Nadja Betzler, Jiong Guo, Rolf Niedermeier:
Parameterized computational complexity of Dodgson and Young elections. Inf. Comput. 208(2): 165-177 (2010) - [j60]Falk Hüffner, Nadja Betzler, Rolf Niedermeier:
Separator-based data reduction for signed graph balancing. J. Comb. Optim. 20(4): 335-360 (2010) - [j59]Michael Dom, Jiong Guo, Rolf Niedermeier:
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems. J. Comput. Syst. Sci. 76(3-4): 204-221 (2010) - [j58]Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Anke Truß:
Fixed-parameter tractability results for feedback set problems in tournaments. J. Discrete Algorithms 8(1): 76-86 (2010) - [j57]Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier:
Fixed-Parameter Algorithms for Cluster Vertex Deletion. Theory Comput. Syst. 47(1): 196-217 (2010) - [j56]Jiong Guo, Rolf Niedermeier, Sebastian Wernicke:
Fixed-parameter tractability results for full-degree spanning tree and its dual. Networks 56(2): 116-130 (2010) - [j55]Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann:
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing. SIAM J. Discret. Math. 24(4): 1662-1683 (2010) - [c82]Sepp Hartung, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann:
Exact Algorithms and Experiments for Hierarchical Tree Clustering. AAAI 2010: 457-462 - [c81]Rudolf Fleischer, Jiong Guo, Rolf Niedermeier, Johannes Uhlmann, Yihui Wang, Mathias Weller, Xi Wu:
Extended Islands of Tractability for Parsimony Haplotyping. CPM 2010: 214-226 - [c80]André Nichterlein, Rolf Niedermeier, Johannes Uhlmann, Mathias Weller:
On Tractable Cases of Target Set Selection. ISAAC (1) 2010: 378-389 - [c79]Nadja Betzler, Robert Bredereck, Rolf Niedermeier:
Partial Kernelization for Rank Aggregation: Theory and Experiments. IPEC 2010: 26-37 - [c78]Nadja Betzler, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier:
Average Parameterization and Partial Kernelization for Computing Medians. LATIN 2010: 60-71 - [c77]René van Bevern, Hannes Moser, Rolf Niedermeier:
Kernelization through Tidying. LATIN 2010: 527-538 - [c76]Rolf Niedermeier:
Reflections on Multivariate Algorithmics and Problem Parameterization. STACS 2010: 17-32 - [c75]Sepp Hartung, Rolf Niedermeier:
Incremental List Coloring of Graphs, Parameterized by Conservation. TAMC 2010: 258-270 - [c74]Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller:
Efficient Algorithms for Eulerian Extension. WG 2010: 100-111 - [c73]René van Bevern, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier:
Measuring Indifference: Unit Interval Vertex Deletion. WG 2010: 232-243
2000 – 2009
- 2009
- [j54]Christian Komusiewicz, Falk Hüffner, Hannes Moser, Rolf Niedermeier:
Isolation concepts for efficiently enumerating dense subgraphs. Theor. Comput. Sci. 410(38-40): 3640-3654 (2009) - [j53]Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond:
Fixed-parameter algorithms for Kemeny rankings. Theor. Comput. Sci. 410(45): 4554-4570 (2009) - [j52]Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier:
Isolation concepts for clique enumeration: Comparison and computational experiments. Theor. Comput. Sci. 410(52): 5384-5397 (2009) - [c72]Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann:
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing. AAIM 2009: 226-239 - [c71]Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond:
How similarity helps to efficiently compute Kemeny rankings. AAMAS (1) 2009: 657-664 - [c70]Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann:
Graph-Based Data Clustering with Overlaps. COCOON 2009: 516-526 - [c69]Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann:
Deconstructing Intractability: A Case Study for Interval Constrained Coloring. CPM 2009: 207-220 - [c68]Jiong Guo, Hannes Moser, Rolf Niedermeier:
Iterative Compression for Exactly Solving NP-Hard Minimization Problems. Algorithmics of Large and Complex Networks 2009: 65-80 - [c67]Nadja Betzler, Susanne Hemmann, Rolf Niedermeier:
A Multivariate Complexity Analysis of Determining Possible Winners Given Incomplete Votes. IJCAI 2009: 53-58 - [c66]Jiong Guo, Rolf Niedermeier, Ondrej Suchý:
Parameterized Complexity of Arc-Weighted Directed Steiner Problems. ISAAC 2009: 544-553 - [c65]Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier:
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. MFCS 2009: 319-330 - [c64]Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier:
A Generalization of Nemhauser and Trotter's Local Optimization Theorem. STACS 2009: 409-420 - [c63]Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann:
On Making Directed Graphs Transitive. WADS 2009: 542-553 - [c62]Hannes Moser, Rolf Niedermeier, Manuel Sorge:
Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes. SEA 2009: 233-244 - [e2]Jérémy Barbay, Rolf Klein, Alejandro López-Ortiz, Rolf Niedermeier:
Adaptive, Output Sensitive, Online and Parameterized Algorithms, 19.04. - 24.04.2009. Dagstuhl Seminar Proceedings 09171, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2009 [contents] - [i10]Jérémy Barbay, Rolf Klein, Alejandro López-Ortiz, Rolf Niedermeier:
09171 Abstracts Collection - Adaptive, Output Sensitive, Online and Parameterized Algorithms. Adaptive, Output Sensitive, Online and Parameterized Algorithms 2009 - [i9]Jérémy Barbay, Rolf Klein, Alejandro López-Ortiz, Rolf Niedermeier:
09171 Executive Summary - Adaptive, Output Sensitive, Online and Parameterized Algorithms. Adaptive, Output Sensitive, Online and Parameterized Algorithms 2009 - [i8]Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier:
A Generalization of Nemhauser and Trotter's Local Optimization Theorem. CoRR abs/0902.2149 (2009) - 2008
- [j51]Jiong Guo, Rolf Niedermeier, Daniel Raible:
Improved Algorithms and Complexity Results for Power Domination in Graphs. Algorithmica 52(2): 177-202 (2008) - [j50]Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke:
Techniques for Practical Fixed-Parameter Algorithms. Comput. J. 51(1): 7-25 (2008) - [j49]Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
Closest 4-leaf power is fixed-parameter tractable. Discret. Appl. Math. 156(18): 3345-3361 (2008) - [j48]Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Niedermeier, Johannes Uhlmann:
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs. Eur. J. Oper. Res. 186(2): 542-553 (2008) - [j47]Jiong Guo, Rolf Niedermeier, Johannes Uhlmann:
Two fixed-parameter algorithms for Vertex Covering by Paths on Trees. Inf. Process. Lett. 106(2): 81-86 (2008) - [j46]Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke:
Red-blue covering problems and the consecutive ones property. J. Discrete Algorithms 6(3): 393-407 (2008) - [j45]Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
Data reduction and exact algorithms for clique cover. ACM J. Exp. Algorithmics 13 (2008) - [c61]Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond:
Fixed-Parameter Algorithms for Kemeny Scores. AAIM 2008: 60-71 - [c60]Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier:
Enumerating Isolated Cliques in Synthetic and Financial Networks. COCOA 2008: 405-416 - [c59]Nadja Betzler, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier:
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems. CPM 2008: 31-43 - [c58]Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier:
Fixed-Parameter Algorithms for Cluster Vertex Deletion. LATIN 2008: 711-722 - [c57]Nadja Betzler, Jiong Guo, Rolf Niedermeier:
Parameterized Computational Complexity of Dodgson and Young Elections. SWAT 2008: 402-413 - [c56]Oriana Ponta, Falk Hüffner, Rolf Niedermeier:
Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems. TAMC 2008: 490-501 - [p1]Michael Dom, Falk Hüffner, Rolf Niedermeier:
Tiefensuche (Ariadne und Co.). Taschenbuch der Algorithmen 2008: 61-73 - [e1]Martin Grohe, Rolf Niedermeier:
Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008. Proceedings. Lecture Notes in Computer Science 5018, Springer 2008, ISBN 978-3-540-79722-7 [contents] - [r1]Rolf Niedermeier:
Data Reduction for Domination in Graphs. Encyclopedia of Algorithms 2008 - 2007
- [j44]Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Hans-Peter Piepho, Ramona Schmid:
Algorithms for compact letter displays: Comparison and evaluation. Comput. Stat. Data Anal. 52(2): 725-736 (2007) - [j43]Rolf Niedermeier, Jörg Vogel, Michael Fothe, Mirko König:
Das Knotenüberdeckungsproblem - Eine Fallstudie zur Didaktik NP-schwerer Probleme (Teil 1). LOG IN 27(146/147): 53-59 (2007) - [j42]Rolf Niedermeier, Jörg Vogel, Michael Fothe, Mirko König:
Das Knotenüberdeckungsproblem Eine Fallstudie zur Didaktik NP-schwerer Probleme (Teil 2). LOG IN 27(148): 81-89 (2007) - [j41]Jiong Guo, Rolf Niedermeier, Sebastian Wernicke:
Parameterized Complexity of Vertex Cover Variants. Theory Comput. Syst. 41(3): 501-520 (2007) - [j40]Jiong Guo, Rolf Niedermeier:
Invitation to data reduction and problem kernelization. SIGACT News 38(1): 31-45 (2007) - [c55]David B. Chandler, Jiong Guo, Ton Kloks, Rolf Niedermeier:
Probe Matrix Problems: Totally Balanced Matrices. AAIM 2007: 368-377 - [c54]Christian Komusiewicz, Falk Hüffner, Hannes Moser, Rolf Niedermeier:
Isolation Concepts for Enumerating Dense Subgraphs. COCOON 2007: 140-150 - [c53]Jiong Guo, Rolf Niedermeier:
Linear Problem Kernels for NP-Hard Problems on Planar Graphs. ICALP 2007: 375-386 - [c52]Michael Dom, Jiong Guo, Rolf Niedermeier:
Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems. TAMC 2007: 680-691 - [c51]Falk Hüffner, Nadja Betzler, Rolf Niedermeier:
Optimal Edge Deletions for Signed Graph Balancing. WEA 2007: 297-310 - 2006
- [b2]Rolf Niedermeier:
Invitation to Fixed-Parameter Algorithms. Oxford University Press 2006, ISBN 9780198566076, pp. 1-294 - [j39]Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
Error Compensation in Leaf Power Problems. Algorithmica 44(4): 363-381 (2006) - [j38]Jochen Alber, Nadja Betzler, Rolf Niedermeier:
Experiments on data reduction for optimal domination in networks. Ann. Oper. Res. 146(1): 105-117 (2006) - [j37]Michael R. Fellows, Jens Gramm, Rolf Niedermeier:
On The Parameterized Intractability Of Motif Search Problems. Comb. 26(2): 141-167 (2006) - [j36]Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann:
Tree decompositions of graphs: Saving memory in dynamic programming. Discret. Optim. 3(3): 220-229 (2006) - [j35]Sebastian Wernicke, Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier:
The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions. Int. J. Found. Comput. Sci. 17(6): 1467-1484 (2006) - [j34]Jiong Guo, Rolf Niedermeier:
A fixed-parameter tractability result for multicommodity demand flow in trees. Inf. Process. Lett. 97(3): 109-114 (2006) - [j33]Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke:
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. J. Comput. Syst. Sci. 72(8): 1386-1396 (2006) - [j32]Jiong Guo, Rolf Niedermeier:
Exact algorithms and applications for Tree-like Weighted Set Cover. J. Discrete Algorithms 4(4): 608-622 (2006) - [j31]Jens Gramm, Jiong Guo, Rolf Niedermeier:
Parameterized Intractability of Distinguishing Substring Selection. Theory Comput. Syst. 39(4): 545-560 (2006) - [j30]Jens Gramm, Jiong Guo, Rolf Niedermeier:
Pattern matching for arc-annotated sequences. ACM Trans. Algorithms 2(1): 44-65 (2006) - [j29]Rod Downey, Michael A. Langston, Rolf Niedermeier:
Editorial. Theor. Comput. Sci. 351(3): 295 (2006) - [c50]Matthias Brosemann, Jochen Alber, Falk Hüffner, Rolf Niedermeier:
Matrix Robustness, with an Application to Power System Observability. ACiD 2006: 37-48 - [c49]Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
Data Reduction, Exact, and Heuristic Algorithms for Clique Cover. ALENEX 2006: 86-94 - [c48]Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Anke Truß:
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments. CIAC 2006: 320-331 - [c47]Jiong Guo, Rolf Niedermeier, Sebastian Wernicke:
Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual. IWPEC 2006: 203-214 - [c46]Jochen Alber, Britta Dorn, Rolf Niedermeier:
A General Data Reduction Scheme for Domination in Graphs. SOFSEM 2006: 137-147 - [c45]Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Niedermeier, Johannes Uhlmann:
Complexity and Exact Algorithms for Multicut. SOFSEM 2006: 303-312 - [c44]Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke:
Minimum Membership Set Covering and the Consecutive Ones Property. SWAT 2006: 339-350 - 2005
- [j28]Jochen Alber, Frederic Dorn, Rolf Niedermeier:
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs. Discret. Appl. Math. 145(2): 219-231 (2005) - [j27]Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege:
A refined search tree technique for Dominating Set on planar graphs. J. Comput. Syst. Sci. 71(4): 385-405 (2005) - [j26]Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation. Theory Comput. Syst. 38(4): 373-392 (2005) - [j25]Jiong Guo, Rolf Niedermeier:
Fixed-parameter tractability and data reduction for multicut in trees. Networks 46(3): 124-135 (2005) - [c43]Michael Dom, Jiong Guo, Rolf Niedermeier:
Bounded Degree Closest k-Tree Power Is NP-Complete. COCOON 2005: 757-766 - [c42]Jiong Guo, Rolf Niedermeier, Daniel Raible:
Improved Algorithms and Complexity Results for Power Domination in Graphs. FCT 2005: 172-184 - [c41]Jiong Guo, Rolf Niedermeier, Sebastian Wernicke:
Parameterized Complexity of Generalized Vertex Cover Problems. WADS 2005: 36-48 - [c40]Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke:
Improved Fixed-Parameter Algorithms for Two Feedback Set Problems. WADS 2005: 158-168 - [c39]Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
Extending the Tractability Border for Closest Leaf Powers. WG 2005: 397-408 - 2004
- [j24]Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems. Algorithmica 39(4): 321-347 (2004) - [j23]Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann:
Tree Decompositions of Graphs: Saving Memory in Dynamic Programming. Electron. Notes Discret. Math. 17: 57-62 (2004) - [j22]Jochen Alber, Michael R. Fellows, Rolf Niedermeier:
Polynomial-time data reduction for dominating set. J. ACM 51(3): 363-384 (2004) - [j21]Jochen Alber, Henning Fernau, Rolf Niedermeier:
Parameterized complexity: exponential speed-up for planar graph problems. J. Algorithms 52(1): 26-56 (2004) - [j20]Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier:
Computing the similarity of two sequences with nested arc annotations. Theor. Comput. Sci. 312(2-3): 337-358 (2004) - [c38]Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann:
Tree Decompositions of Graphs: Saving Memory in Dynamic Programming. CTW 2004: 56-60 - [c37]Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
Error Compensation in Leaf Root Problems. ISAAC 2004: 389-401 - [c36]Jiong Guo, Falk Hüffner, Rolf Niedermeier:
A Structural View on Parameterizing Problems: Distance from Triviality. IWPEC 2004: 162-173 - [c35]Rolf Niedermeier:
Ubiquitous Parameterization - Invitation to Fixed-Parameter Algorithms. MFCS 2004: 84-103 - [c34]Sebastian Wernicke, Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier:
Avoiding Forbidden Submatrices by Row Deletions. SOFSEM 2004: 349-360 - [c33]Hans L. Bodlaender, Celina M. H. de Figueiredo, Marisa Gutierrez, Ton Kloks, Rolf Niedermeier:
Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P4's. WEA 2004: 87-99 - 2003
- [j19]Jens Gramm, Rolf Niedermeier, Peter Rossmanith:
Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems. Algorithmica 37(1): 25-42 (2003) - [j18]Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith:
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. Discret. Appl. Math. 130(2): 139-155 (2003) - [j17]Rolf Niedermeier, Peter Rossmanith:
On efficient fixed-parameter algorithms for weighted vertex cover. J. Algorithms 47(2): 63-77 (2003) - [j16]Jens Gramm, Rolf Niedermeier:
A fixed-parameter algorithm for minimum quartet inconsistency. J. Comput. Syst. Sci. 67(4): 723-741 (2003) - [j15]Jochen Alber, Henning Fernau, Rolf Niedermeier:
Graph separators: a parameterized view. J. Comput. Syst. Sci. 67(4): 808-832 (2003) - [j14]Rolf Niedermeier, Peter Rossmanith:
An efficient fixed-parameter algorithm for 3-Hitting Set. J. Discrete Algorithms 1(1): 89-102 (2003) - [c32]Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation. CIAC 2003: 108-119 - [c31]Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
Automated Generation of Search Tree Algorithms for Graph Modification Problems. ESA 2003: 642-653 - [c30]Jens Gramm, Jiong Guo, Rolf Niedermeier:
On Exact and Approximation Algorithms for Distinguishing Substring Selection. FCT 2003: 195-209 - 2002
- [j13]Jochen Alber, Hans L. Bodlaender, Henning Fernau, Ton Kloks, Rolf Niedermeier:
Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs. Algorithmica 33(4): 461-493 (2002) - [j12]Rolf Niedermeier, Klaus Reinhardt, Peter Sanders:
Towards optimal locality in mesh-indexings. Discret. Appl. Math. 117(1-3): 211-237 (2002) - [c29]Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier:
Towards Optimally Solving the LONGEST COMMON SUBSEQUENCE Problem for Sequences with Nested Arc Annotations in Linear Time. CPM 2002: 99-114 - [c28]Jens Gramm, Rolf Niedermeier:
Breakpoint medians and breakpoint phylogenies: A fixed-parameter approach. ECCB 2002: 128-139 - [c27]Jens Gramm, Jiong Guo, Rolf Niedermeier:
Pattern Matching for Arc-Annotated Sequences. FSTTCS 2002: 182-193 - [c26]Jochen Alber, Rolf Niedermeier:
Improved Tree Decomposition Based Algorithms for Domination-like Problems. LATIN 2002: 613-628 - [c25]Michael R. Fellows, Jens Gramm, Rolf Niedermeier:
On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems. STACS 2002: 262-273 - [c24]Jochen Alber, Michael R. Fellows, Rolf Niedermeier:
Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case. SWAT 2002: 150-159 - [i7]Michael R. Fellows, Jens Gramm, Rolf Niedermeier:
Parameterized Intractability of Motif Search Problems. CoRR cs.CC/0205056 (2002) - [i6]Jochen Alber, Michael R. Fellows, Rolf Niedermeier:
Polynomial Time Data Reduction for Dominating Set. CoRR cs.DS/0207066 (2002) - 2001
- [j11]Jochen Alber, Jens Gramm, Rolf Niedermeier:
Faster exact algorithms for hard problems: A parameterized point of view. Discret. Math. 229(1-3): 3-27 (2001) - [j10]Henning Fernau, Rolf Niedermeier:
An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover. J. Algorithms 38(2): 374-410 (2001) - [c23]Jochen Alber, Henning Fernau, Rolf Niedermeier:
Graph Separators: A Parameterized View. COCOON 2001: 318-327 - [c22]Jens Gramm, Rolf Niedermeier:
Minimum Quartet Inconsistency Is Fixed Parameter Tractable. CPM 2001: 241-256 - [c21]Jochen Alber, Henning Fernau, Rolf Niedermeier:
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems. ICALP 2001: 261-272 - [c20]Jens Gramm, Rolf Niedermeier, Peter Rossmanith:
Exact Solutions for CLOSEST STRING and Related Problems. ISAAC 2001: 441-453 - [c19]Falk Hüffner, Stefan Edelkamp, Henning Fernau, Rolf Niedermeier:
Finding Optimal Solutions to Atomix. KI/ÖGAI 2001: 229-243 - [c18]Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege:
Refined Search Tree Technique for DOMINATING SET on Planar Graphs. MFCS 2001: 111-122 - [i5]Jochen Alber, Henning Fernau, Rolf Niedermeier:
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [j9]Rolf Niedermeier, Peter Rossmanith:
A general method to speed up fixed-parameter-tractable algorithms. Inf. Process. Lett. 73(3-4): 125-129 (2000) - [j8]Rolf Niedermeier, Peter Rossmanith:
New Upper Bounds for Maximum Satisfiability. J. Algorithms 36(1): 63-88 (2000) - [j7]Klaus-Jörn Lange, Rolf Niedermeier:
Data Independence of Read, Write, and Control Structures in PRAM Computations. J. Comput. Syst. Sci. 60(1): 109-144 (2000) - [j6]Jochen Alber, Rolf Niedermeier:
On Multidimensional Curves with Hilbert Property. Theory Comput. Syst. 33(4): 295-312 (2000) - [c17]Jens Gramm, Rolf Niedermeier:
Faster Exact Solutions for MAX2SAT. CIAC 2000: 174-186 - [c16]Rolf Niedermeier, Peter Rossmanith:
On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER. ISAAC 2000: 180-191 - [c15]Jochen Alber, Hans L. Bodlaender, Henning Fernau, Rolf Niedermeier:
Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems. SWAT 2000: 97-110 - [i4]Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith:
New Worst-Case Upper Bounds for MAX-2-SAT with Application to MAX-CUT. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [j5]Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith:
Optimal Deterministic Sorting and Routing on Grids and Tori with Diagonals. Algorithmica 25(4): 438-458 (1999) - [j4]Hans L. Bodlaender, Ton Kloks, Rolf Niedermeier:
SIMPLE MAX-CUT for unit interval graphs and graphs with few P4s. Electron. Notes Discret. Math. 3: 19-26 (1999) - [c14]Rolf Niedermeier, Peter Rossmanith:
New Upper Bounds for MaxSat. ICALP 1999: 575-584 - [c13]Henning Fernau, Rolf Niedermeier:
An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover. MFCS 1999: 387-397 - [c12]Rolf Niedermeier, Peter Rossmanith:
Upper Bounds for Vertex Cover Further Improved. STACS 1999: 561-570 - 1998
- [j3]Rolf Niedermeier, Peter Rossmanith:
Unambiguous Computations and Locally Definable Acceptance Types. Theor. Comput. Sci. 194(1-2): 137-161 (1998) - [c11]Jochen Alber, Rolf Niedermeier:
On Multi-dimensional Hilbert Indexings. COCOON 1998: 329-338 - [c10]Rolf Niedermeier:
Some Prospects for Efficient Fixed Parameter Algorithms. SOFSEM 1998: 168-185 - 1997
- [c9]Rolf Niedermeier, Klaus Reinhardt, Peter Sanders:
Towards Optimal Locality in Mesh-Indexings. FCT 1997: 364-375 - 1996
- [b1]Rolf Niedermeier:
Towards realistic and simple models of parallel computation. University of Tübingen, Germany, 1996, pp. 1-156 - [c8]Rolf Niedermeier:
Recursively Divisible Problems. ISAAC 1996: 183-192 - 1995
- [j2]Rolf Niedermeier, Peter Rossmanith:
Unambiguous Auxiliary Pushdown Automata and Semi-unbounded Fan-in Circuits. Inf. Comput. 118(2): 227-245 (1995) - [j1]Rolf Niedermeier, Peter Rossmanith:
On Optimal Orow-Pram Algorithms for Computing Recursively Defined Functions. Parallel Process. Lett. 5: 299-309 (1995) - [c7]Rolf Niedermeier, Peter Rossmanith:
PRAM's Towards Realistic Parallelism: BRAM's. FCT 1995: 363-373 - [c6]Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith:
Optimal Average Case Sorting on Arrays. STACS 1995: 503-514 - 1994
- [c5]Manfred Kunde, Rolf Niedermeier, Peter Rossmanith:
Faster Sorting and Routing on Grids with Diagonals. STACS 1994: 225-236 - 1993
- [c4]Klaus-Jörn Lange, Rolf Niedermeier:
Data-Independences of Parallel Random Access Machines. FSTTCS 1993: 104-113 - [c3]Rolf Niedermeier, Peter Rossmanith:
On the Power of Reading and Writing Simultaneously in Parallel Computation. ISAAC 1993: 240-249 - [c2]Rolf Niedermeier, Peter Rossmanith:
Extended Locally Definable Acceptance Types (Extended Abstract). STACS 1993: 473-483 - [i3]Manfred Kunde, Rolf Niedermeier, Peter Rossmanith:
Faster sorting and routing on grids with diagonals. Forschungsberichte, TU Munich TUM I 9313: 1-31 (1993) - 1992
- [c1]Rolf Niedermeier, Peter Rossmanith:
Unambiguous Simulations of Auxiliary Pushdown Automata and Circuits (Extended Abstract). LATIN 1992: 387-400 - [i2]Rolf Niedermeier, Peter Rossmanith:
Optimal parallel algorithms for computing recursively defined functions. Forschungsberichte, TU Munich TUM I 9218: 1-28 (1992) - 1990
- [i1]Rolf Niedermeier, Peter Rossmanith:
Unambiguous simulations of auxiliary pushdown automata and circuits. Forschungsberichte, TU Munich TUM I 9054: 1-38 (1990)
Coauthor Index
[j177] [j164] [j158] [c204] [j156] [j154] [c201] [c196] [i106] [j149] [j148] [j146] [j140] [c187] [c184] [c180] [c179] [i103] [i99] [i90] [j139] [j127] [c173] [c172] [c171] [c165] [c164] [c161] [i81] [i77] [i76] [i75] [i73] [i72] [j126] [j119] [c157] [c156] [c155] [i71] [i68] [i64] [c152] [i52] [j113] [j111] [c142] [c141] [c139] [c137] [c135] [i44] [i43] [j104] [j103] [c133] [c127] [c126] [i39] [i36] [i35] [i30] [j100] [j97] [j94] [j92] [j91] [c124] [c123] [c120] [i29] [i24] [j90] [j88] [j87] [j85] [c115] [c114] [c113] [c111] [i18] [i17] [i14] [j81] [c107] [c106] [c101] [j75] [c99] [c98] [c91] [c86] [c85] [c79]
[j175] [j171] [j163] [j152] [c200] [c199] [c195] [i108] [c181] [c176] [i102] [i101] [i97] [i93] [j130] [j129] [c169] [c168] [i87] [i86] [i85] [j126] [j124] [c160] [c145] [i56] [i50] [j114] [j111] [j110] [i42] [j105] [j102] [j101] [c131] [c126] [i36] [j94] [j92] [c117] [i26] [i21] [i20] [c114] [c113] [c112] [c111] [c109] [i18] [i17] [i16] [i12] [c102]
[i14] [j82] [j69] [j68] [j67] [j64] [j62] [c89] [j61] [j59] [j58] [j56] [j55] [c82] [c81] [c78] [j53] [c72] [c71] [c70] [c68] [c66] [c65] [c64] [i8] [j51] [j49] [j48] [j47] [j46] [j45] [c61] [c57] [j44] [j41] [j40] [c55] [c53] [c52] [j39] [j35] [j34] [j33] [j32] [j31] [j30] [c49] [c48] [c47] [c45] [c44] [j26] [j25] [c43] [c42] [c41] [c40] [c39] [j24] [j20] [c37] [c36] [c34] [c32] [c31] [c30] [c29] [c27]
[j173] [j131] [j125] [j123] [j119] [i51] [c139] [c134] [i48] [j106] [c130] [c129] [i37] [i35] [i33] [j99] [j97] [j95] [c119] [c116] [i27] [i23] [j86] [j83] [c108] [i11] [c104] [c103] [c101] [c100] [j73] [j71] [c96] [c92] [j69] [j68] [j66] [j63] [j57] [j55] [c82] [c78] [c73] [j54] [j52] [c72] [c70] [c69] [c63] [c60] [c59] [c58] [c54]
[j176] [j172] [j169] [j162] [j161] [j160] [j159] [j157] [j155] [c191] [c190] [c189] [i112] [i111] [j147] [j142] [c186] [c182] [c178] [c174] [i98] [i96] [i95] [i91] [i89] [j136] [j135] [j134] [j131] [j128] [c170] [c166] [c163] [c162] [i83] [i82] [i80] [i74] [j120] [j119] [c158] [i70] [i66] [c153] [c151] [c149] [c147] [c146] [c143] [i59] [i57] [i53] [i49] [j108] [c139] [i41] [c132] [c130] [i37] [i35] [i34] [i31]
[j174] [j165] [j160] [c203] [i114] [j153] [c195] [c193] [i108] [j147] [j145] [j144] [c183] [c174] [i95] [j138] [j137] [j133] [i79] [j126] [j125] [j123] [j122] [j118] [c159] [i67] [i65] [j116] [j115] [c150] [c149] [c148] [i58] [i55] [i54] [i51] [i49] [j114] [c140] [c138] [c136] [c134] [i48] [i47] [i46] [i45] [j104] [j101] [c131] [c128] [c126] [i36] [i33] [i32] [j100] [j98] [j92] [c122] [c116] [i29] [i26] [i22] [j87] [j84] [c115] [c114] [c109] [i16] [j81] [j78] [c107] [c105] [c93] [j65] [c91] [c86] [c80]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-16 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
