direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Journal Publications 2019

Matthias Bentert and René van Bevern and Rolf Niedermeier.
Inductive k-independent graphs and c-colorable subgraphs in scheduling: A review.
Journal of Scheduling, 22(1):3–20, 2019.
Bibtex entry Link to publication
Link to original publication
Matthias Bentert and Till Fluschnik and André Nichterlein and Rolf Niedermeier.
Parameterized aspects of triangle enumeration.
Journal of Computer and System Sciences, 103:61 - 77, 2019.
Bibtex entry Link to publication
Link to original publication
Matthias Bentert and Anne-Sophie Himmel and Hendrik Molter and Marco Morik and Rolf Niedermeier and René Saitenmacher.
Listing All Maximal k-Plexes in Temporal Graphs.
ACM Journal of Experimental Algorithmics, ACM, 2019. Accepted for publication.
Bibtex entry Link to publication
Robert Bredereck and Vincent Froese and Marcel Koseler and Marcelo Garlet Millani and André Nichterlein and Rolf Niedermeier.
A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems.
Algorithmica, 81(4):1584–1614, 2019.
Bibtex entry Link to publication
Link to original publication
Robert Bredereck and Christian Komusiewicz and Stefan Kratsch and Hendrik Molter and Rolf Niedermeier and Manuel Sorge.
Assessing the Computational Complexity of Multi-Layer Subgraph Detection.
Network Science, Cambridge University Press, 2019. Accepted for publication.
Bibtex entry Link to publication
Markus Brill and Till Fluschnik and Vincent Froese and Brijnesh Jain and Rolf Niedermeier and David Schultz.
Exact Mean Computation in Dynamic Time Warping Spaces.
Data Mining and Knowledge Discovery, 33(1):252–291, 2019.
Bibtex entry Link to publication
Link to original publication
Cristina Bazgan, Till Fluschnik, André Nichterlein, Rolf Niedermeier, and Maximilian Stahlberg.
A More Fine-Grained Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths.
Networks, 73(1):23–37, 2019.
Bibtex entry Link to publication
Link to original publication
Till Fluschnik and Marco Morik and Manuel Sorge.
The complexity of routing with collision avoidance.
Journal of Computer and System Sciences, 102:69 - 86, 2019.
Bibtex entry Link to publication
Link to original publication
Till Fluschnik and Hendrik Molter and Rolf Niedermeier and Malte Renken and Philipp Zschoche.
Temporal graph classes: A view through temporal separators.
Theoretical Computer Science, Elsevier, 2019. Accepted for publication.
Bibtex entry Link to publication
Anne-Sophie Himmel and Clemens Hoffmann and Pascal Kunz and Vincent Froese and Manuel Sorge.
Computational complexity aspects of point visibility graphs.
Discrete Applied Mathematics, 254:283–290, 2019.
Bibtex entry Link to publication
Link to original publication
Andrzej Kaczmarczyk and Piotr Faliszewski.
Algorithms for Destructive Shift Bribery.
Autonomous Agents and Multi-Agent Systems, 33(3):275–297, 2019.
Bibtex entry Link to publication
Link to original publication
Christian Komusiewicz and André Nichterlein and Rolf Niedermeier and Marten Picker.
Exact Algorithms for Finding Well-Connected 2-Clubs in Sparse Real-World Graphs: Theory and Experiments.
European Journal of Operational Research, 275(3):846–864, 2019.
Bibtex entry Link to publication
Link to original publication

Journal Publications 2018

René van Bevern and Vincent Froese and Christian Komusiewicz.
Parameterizing edge modification problems above lower bounds.
Theory of Computing Systems, 62(3):739–770, 2018.
Bibtex entry Link to publication
Link to original publication
René van Bevern and Till Fluschnik and George B. Mertzios and Hendrik Molter and Manuel Sorge and Ondrej Suchý.
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs.
Discrete Optimization, 30:20–50, 2018.
Bibtex entry Link to publication
Link to original publication
Robert Bredereck and Jiehua Chen and Falk Hüffner and Stefan Kratsch.
Parameterized complexity of team formation in social networks.
Theoretical Computer Science, 717:26–36, 2018.
Bibtex entry
Link to original publication
Jiehua Chen and Ugo Paavo Finnendahl.
On the Number of Single-Peaked Narcissistic or Single-Crossing Narcissistic Preferences.
Discrete Mathematics, 341(5):1225 - 1236, 2018.
Bibtex entry Link to publication
Link to original publication
Till Fluschnik and Danny Hermelin and André Nichterlein and Rolf Niedermeier.
Fractals for Kernelization Lower Bounds.
SIAM Journal on Discrete Mathematics, 32(1):656–681, 2018.
Bibtex entry Link to publication
Link to original publication
Till Fluschnik and Christian Komusiewicz and George B. Mertzios and André Nichterlein and Rolf Niedermeier and Nimrod Talmon.
When Can Graph Hyperbolicity be Computed in Linear Time?.
Algorithmica, 2018.
Bibtex entry Link to publication
Link to original publication
George B. Mertzios and André Nichterlein and Rolf Niedermeier.
A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs.
SIAM Journal on Discrete Mathematics, 32(4):2820-2835, 2018.
Bibtex entry Link to publication
Link to original publication

Journal Publications 2017

René van Bevern and Robert Bredereck and Morgan Chopin and Sepp Hartung and Falk Hüffner and André Nichterlein and Ondřej Suchý.
Fixed-parameter algorithms for DAG Partitioning.
Discrete Applied Mathematics, 220:134–160, 2017.
Bibtex entry Link to publication
Link to original publication
René van Bevern and Robert Bredereck and Laurent Bulteau and Jiehua Chen and Vincent Froese and Rolf Niedermeier and Gerhard J. Woeginger.
Partitioning Perfect Graphs into Stars.
Journal of Graph Theory, 85(2):297–335, 2017.
Bibtex entry Link to publication
Link to original publication
René van Bevern and Rolf Niedermeier and Ondrej Suchý.
A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack.
Journal of Scheduling, 20(3):255–265, 2017.
Bibtex entry Link to publication
Link to original publication
Robert Bredereck and Jiehua Chen and Rolf Niedermeier and Toby Walsh.
Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty.
Journal of Artificial Intelligence Research, 59:133–173, 2017.
Bibtex entry
Link to original publication
Laurent Bulteau and Stefan Fafianie and Vincent Froese and Rolf Niedermeier and Nimrod Talmon.
The Complexity of Finding Effectors.
Theory of Computing Systems, 60(2):253–279, 2017.
Bibtex entry Link to publication
Link to original publication
Vincent Froese and Iyad Kanj and André Nichterlein and Rolf Niedermeier.
Finding Points in General Position.
International Journal of Computational Geometry & Applications, 27(4):277–296, 2017.
Bibtex entry Link to publication
Link to original publication
Archontia C. Giannopoulou and George B. Mertzios and Rolf Niedermeier.
Polynomial Fixed-parameter Algorithms: {A} Case Study for Longest Path on Interval Graphs.
Theoretical Computer Science, 2017. Accepted for publication.
Bibtex entry Link to publication
Link to original publication
Anne-Sophie Himmel and Hendrik Molter and Rolf Niedermeier and Manuel Sorge.
Adapting the Bron-Kerbosch algorithm for enumerating maximal cliques in temporal graphs.
Social Network Analysis and Mining, 7(1):35:1–35:16, 2017.
Bibtex entry Link to publication
Link to original publication
Kratsch, Stefan and Sorge, Manuel.
On Kernelization and Approximation for the Vector Connectivity Problem.
Algorithmica, 79(1):96–138, 2017.
Bibtex entry Link to publication
Link to original publication
Piotr Skowron and Piotr Faliszewski.
Chamberlin-Courant Rule with Approval Ballots: Approximating the MaxCover Problem with Bounded Frequencies in FPT Time.
Journal of Artificial Intelligence Research, 60:687–716, 2017.
Bibtex entry Link to publication
Link to original publication
Piotr Skowron.
FPT Approximation Schemes for Maximizing Submodular Functions.
Information and Computation, 257:65–78, 2017.
Bibtex entry Link to publication
Link to original publication
Nimrod Talmon and Sepp Hartung.
The complexity of degree anonymization by graph contractions.
Information and Computation, 2017. Accepted for publication.
Bibtex entry
Link to original publication

Journal Publications 2016

Cristina Bazgan and Robert Bredereck and Sepp Hartung and André Nichterlein and Gerhard J. Woeginger.
Finding large degree-anonymous subgraphs is hard.
Theoretical Computer Science, 622:90–110, 2016.
Bibtex entry Link to publication
Link to original publication
René van Bevern and Christian Komusiewicz and Rolf Niedermeier and Manuel Sorge and Toby Walsh.
H-Index Manipulation by Merging Articles: Models, Theory, and Experiment.
Artificial Intelligence, 260:19–35, 2016.
Bibtex entry Link to publication
Link to original publication
René van Bevern and Rolf Niedermeier and Ondřej Suchý.
A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack.
Journal of Scheduling, Springer, 2016. In press
Bibtex entry Link to publication
Link to original publication
Robert Bredereck and Jiehua Chen and Gerhard J. Woeginger.
Are there any nicely structured preference profiles nearby?.
Mathematical Social Sciences, 79:61–73, 2016.
Bibtex entry
Link to original publication
Robert Bredereck and Nimrod Talmon.
NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting.
Information Processing Letters, 116(2):147–152, 2016.
Bibtex entry
Link to original publication
Robert Bredereck and Piotr Faliszewski and Rolf Niedermeier and Nimrod Talmon.
Large-Scale Election Campaigns: Combinatorial Shift Bribery.
Journal of Artificial Intelligence Research, 55:603–652, 2016.
Bibtex entry
Link to original publication
Robert Bredereck and Jiehua Chen and André Nichterlein and Piotr Faliszewski and Rolf Niedermeier.
Prices Matter for the Parameterized Complexity of Shift Bribery.
Information and Computation, 251:140–164, 2016.
Bibtex entry Link to publication
Link to original publication
Laurent Bulteau and Vincent Froese and Sepp Hartung and Rolf Niedermeier.
Co-Clustering Under the Maximum Norm.
Algorithms, 9(1):17, 2016.
Bibtex entry Link to publication
Link to original publication
Laurent Bulteau and Vincent Froese and Nimrod Talmon.
Multi-Player Diffusion Games on Graph Classes.
Internet Mathematics, 12(6):363–380, 2016.
Bibtex entry Link to publication
Link to original publication
Laurent Bulteau and Vincent Froese and Konstantin Kutzkov and Rasmus Pagh.
Triangle counting in dynamic graph streams.
Algorithmica, 76(1):259–278, 2016.
Bibtex entry Link to publication
Link to original publication
Vincent Froese and René van Bevern and Rolf Niedermeier and Manuel Sorge.
Exploiting Hidden Structure in Selecting Dimensions that Distinguish Vectors.
Journal of Computer and System Sciences, 82(3):521–535, 2016.
Bibtex entry Link to publication
Link to original publication
Vincent Froese and André Nichterlein and Rolf Niedermeier.
Win-Win Kernelization for Degree Sequence Completion Problems.
Journal of Computer and System Sciences, 82(6):1100–1111, 2016.
Bibtex entry Link to publication
Link to original publication

Journal Publications 2015

Noga Alon and Robert Bredereck and Jiehua Chen and Stefan Kratsch and Rolf Niedermeier and Gerhard J. Woeginger.
How to Put Through Your Agenda in Collective Binary Decisions.
ACM Transactions on Economics and Computation, 4(1):5:1–5:28, 2015.
Bibtex entry Link to publication
Link to original publication
René van Bevern and Jiehua Chen and Falk Hüffner and Stefan Kratsch and Nimrod Talmon and Gerhard J. Woeginger.
Approximability and parameterized complexity of multicover by c-intervals.
Information Processing Letters, 2015. In press.
Bibtex entry Link to publication
Link to original publication
René van Bevern and Rodney G. Downey and Michael R. Fellows and Serge Gaspers and Frances A. Rosamond.
Myhill-Nerode methods for hypergraphs.
Algorithmica In press
Bibtex entry Link to publication
Link to original publication
René van Bevern and Robert Bredereck and Jiehua Chen and Vincent Froese and Rolf Niedermeier and Gerhard J. Woeginger.
Network-Based Vertex Dissolution.
SIAM Journal on Discrete Mathematics, 29(2):888–914, 2015.
Bibtex entry Link to publication
Link to original publication
René van Bevern and Matthias Mnich and Rolf Niedermeier and Mathias Weller.
Interval scheduling and colorful independent sets.
Journal of Scheduling, 18(5):449–469, 2015.
Bibtex entry Link to publication
Link to original publication
René van Bevern and Andreas Emil Feldmann and Manuel Sorge and Ondrej Suchý.
On the Parameterized Complexity of Computing Balanced Partitions in Graphs.
Theory of Computing Systems, 57:1–35, Springer, 2014.
Bibtex entry Link to publication
Link to original publication
Robert Bredereck and Jiehua Chen and Sepp Hartung and Christian Komusiewicz and Rolf Niedermeier and Ondrej Suchý.
On Explaining Integer Vectors by Few Homogenous Segments.
Journal of Computer and System Sciences, 81(4):766-782, Elsevier, 2015.
Bibtex entry Link to publication
Link to original publication
Robert Bredereck and Thomas Köhler and André Nichterlein and Rolf Niedermeier and Geevarghese Philip.
Using Patterns to Form Homogeneous Teams.
Algorithmica, 71(2):517-538, Springer, 2015.
Bibtex entry Link to publication
Link to original publication
Robert Bredereck and Nimrod Talmon.
NP-Hardness of Two Edge Cover Generalizations with Applications to Control and Bribery for Approval Voting.
Information Processing Letters, Elsevier, 2015. In press.
Bibtex entry Link to publication
Robert Bredereck and Vincent Froese and Sepp Hartung and André Nichterlein and Rolf Niedermeier and Nimrod Talmon.
The Complexity of Degree Anonymization by Vertex Addition.
Theoretical Computer Science, 607(1):16–34, Elsevier, 2015.
Bibtex entry Link to publication
Link to original publication
Sharon Bruckner and Falk Hüffner and Christian Komusiewicz.
A Graph Modification Approach for Finding Core–Periphery Structures in Protein Interaction Networks.
Algorithms for Molecular Biology, 2015.
Bibtex entry Link to publication
Laurent Bulteau and Jiehua Chen and Piotr Faliszewski and Rolf Niedermeier and Nimrod Talmon.
Combinatorial Voter Control in Elections.
Theoretical Computer Science, 589:99–120, 2015.
Bibtex entry
Link to original publication
Jiehua Chen and Christian Komusiewicz and Rolf Niedermeier and Manuel Sorge and Ondrej Suchý and Mathias Weller.
Polynomial-Time Data Reduction for the Subset Interconnection Design Problem.
SIAM Journal on Discrete Mathematics, 29(1):1–25, 2015.
Bibtex entry Link to publication
Link to original publication
Guillaume Fertin and Shahrad Jamshidi and Christian Komusiewicz.
Towards an Algorithmic Guide to Spiral Galaxies.
Theoretical Computer Science, 586:26-39, Elsevier, 2015.
Bibtex entry Link to publication
Link to original publication
Sepp Hartung and Christian Komusiewicz and André Nichterlein and Ondrej Suchý.
On structural parameterizations for the 2-club problem.
Discrete Applied Mathematics, 185:79-92, 2015.
Bibtex entry Link to publication
Link to original publication
Sepp Hartung and Christian Komusiewicz and André Nichterlein.
Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs.
Journal of Graph Algorithms and Applications, 19(1):155–190, 2015.
Bibtex entry Link to publication
Link to original publication
Sepp Hartung and André Nichterlein and Rolf Niedermeier and Ondrej Suchý.
A Refined Complexity Analysis of Degree Anonymization on Graphs.
Information and Computation, 243:249–262, 2015.
Bibtex entry Link to publication
Link to original publication
Sepp Hartung and André Nichterlein.
NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs.
SIAM Journal on Discrete Mathematics, 29(4):1931-1960, 2015.
Bibtex entry Link to publication
Link to original publication
Falk Hüffner and Christian Komusiewicz and Rolf Niedermeier and Martin Rötzschke.
The Parameterized Complexity of the Rainbow Subgraph Problem.
Algorithms, 8(1):60-81, 2015.
Bibtex entry Link to publication
Link to original publication
Christian Komusiewicz and Manuel Sorge.
An Algorithmic Framework for Fixed-Cardinality Optimization in Sparse Graphs Applied to Dense Subgraph Problems.
Discrete Applied Mathematics, 193:145-161, Elsevier, 2015.
Bibtex entry Link to publication
Link to original publication

Journal Publications 2014

Cristina Bazgan and Morgan Chopin and André Nichterlein and Florian Sikora.
Parameterized approximability of maximizing the spread of influence in networks.
Journal of Discrete Algorithms, 27:54-65, 2014.
Bibtex entry Link to publication
Link to original publication
Cristina Bazgan and Morgan Chopin and André Nichterlein and Florian Sikora.
Parameterized Inapproximability of Target Set Selection and Generalizations.
Computability, 3(2):135–145, 2014.
Bibtex entry Link to publication
Link to original publication
Nadja Betzler and Robert Bredereck and Rolf Niedermeier.
Theoretical and empirical evaluation of data reduction for exact Kemeny Rank Aggregation.
Autonomous Agents and Multi-Agent Systems, 28(5):721–748, Springer, 2014.
Bibtex entry Link to publication
Link to original publication
Nadja Betzler and Hans Bodlaender and Robert Bredereck and Rolf Niedermeier and Johannes Uhlmann.
On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion.
Algorithmica, 715-738, Springer, 2014.
Bibtex entry Link to publication
Link to original publication
René van Bevern and Sepp Hartung and André Nichterlein and Manuel Sorge.
Constant-factor approximations for {Capacitated Arc Routing} without triangle inequality.
Operations Research Letters, 4(4):290–292, 2014.
Bibtex entry Link to publication
Link to original publication
René van Bevern.
Towards Optimal and Expressive Kernelization for $d$-Hitting Set.
Algorithmica, 70(1):129-147, 2014.
Bibtex entry Link to publication
Link to original publication
Robert Bredereck and Jiehua Chen and Piotr Faliszewski and Jiong Guo and Rolf Niedermeier and Gerhard J. Woeginger.
Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges.
Tsinghua Science and Technology, 19(4):358-373, 2014.
Bibtex entry Link to publication
Link to original publication
Robert Bredereck and Jiehua Chen and Sepp Hartung and Stefan Kratsch and Rolf Niedermeier and Ondřej Suchý and Gerhard J. Woeginger.
A multivariate complexity analysis of lobbying in multiple referenda.
Journal of Artificial Intelligence Research, 50:409–446, 2014.
Bibtex entry Link to publication
Link to original publication
Robert Bredereck and André Nichterlein and Rolf Niedermeier and Geevarghese Philip.
The Effect of Homogeneity on the Computational Complexity of Combinatorial Data Anonymization.
Data Mining and Knowledge Discovery, 28(1):65–91, Springer, 2014.
Bibtex entry Link to publication
Link to original publication
Laurent Bulteau and Falk Hüffner and Christian Komusiewicz and Adrian Liebtrau and Rolf Niedermeier.
Multivariate Algorithmics for NP-Hard String Problems.
Bulletin of the EATCS, 114:31-73, 2014.
Bibtex entry Link to publication
Link to original publication
Morgan Chopin and André Nichterlein and Rolf Niedermeier and Mathias Weller.
Constant Thresholds Can Make Target Set Selection Tractable.
Theory of Computing Systems, 55(1):61–83, Springer, 2014.
Bibtex entry Link to publication
Link to original publication
Martin Dörnfelder and Jiong Guo and Christian Komusiewicz and Mathias Weller.
On the parameterized complexity of consensus clustering.
Theoretical Computer Science, 542:71-82, 2014.
Bibtex entry Link to publication
Link to original publication
Jiong Guo and Danny Hermelin and Christian Komusiewicz.
Local search for string problems: Brute-force is essentially optimal.
Theoretical Computer Science, 525:30-41, 2014.
Bibtex entry Link to publication
Link to original publication
Falk Hüffner and Christian Komusiewicz and Adrian Liebtrau and Rolf Niedermeier.
Partitioning biological networks into highly connected clusters with maximum edge coverage.
IEEE/ACM Transactions on Computational Biology and Bioinformatics, 11(3):455-467, 2014.
Bibtex entry Link to publication
Link to original publication
Christian Komusiewicz and Johannes Uhlmann.
A Cubic-Vertex Kernel for Flip-Consensus Tree.
Algorithmica, 68(1):81–108, Springer, 2014.
Bibtex entry Link to publication
Link to original publication
Manuel Sorge and Hannes Moser and Rolf Niedermeier and Mathias Weller.
Exploiting a Hypergraph Model for Finding Golomb Rulers.
Acta Informatica, 51:449–471, Springer, 2014.
Bibtex entry Link to publication
Link to original publication

Journal Publications 2013

Robert Bredereck and Jiehua Chen and Gerhard J. Woeginger.
A characterization of the single-crossing domain.
Social Choice and Welfare, 41(4):989-998, Springer, 2013.
Bibtex entry Link to publication
Link to original publication
Robert Bredereck and André Nichterlein and Rolf Niedermeier.
Pattern-Guided k-Anonymity.
Algorithms, 6(4):678–701, 2013.
Bibtex entry Link to publication
Link to original publication
Frederic Dorn and Hannes Moser and Rolf Niedermeier and Mathias Weller.
Efficient Algorithms for Eulerian Extension and Rural Postman.
SIAM Journal on Discrete Mathematics, 27(1):75–94, SIAM, 2013.
Bibtex entry Link to publication
Link to original publication
Hartmut Ehrig and Claudia Ermel and Falk Hüffner and Rolf Niedermeier and Olga Runge.
Confluence in data reduction: bridging graph transformation and kernelization.
Computability, 2(1):31-49, 2013.
Bibtex entry Link to publication
Link to original publication
Sepp Hartung and Rolf Niedermeier.
Incremental List Coloring of Graphs, Parameterized by Conservation.
Theoretical Computer Science, 494:86-98, 2013.
Bibtex entry Link to publication
Neeldhara Misra and Hannes Moser and Venkatesh Raman and Saket Saurabh and Somnath Sikdar.
The Parameterized Complexity of Unique Coverage and Its Variants.
Algorithmica, 65(3):517-544, Springer, 2013.
Bibtex entry
Link to original publication
André Nichterlein and Rolf Niedermeier and Johannes Uhlmann and Mathias Weller.
On tractable cases of Target Set Selection.
Social Network Analysis and Mining, 3(2):233-256, Springer, 2013.
Bibtex entry Link to publication
Link to original publication
Johannes Uhlmann and Mathias Weller.
Two-Layer Planarization parameterized by feedback edge set.
Theoretical Computer Science, 494:99 - 111, 2013.
Bibtex entry Link to publication
Link to original publication

Journal Publications 2012

Nadja Betzler and Robert Bredereck and Rolf Niedermeier and Johannes Uhlmann.
On Bounded-Degree Vertex Deletion Parameterized by Treewidth.
Discrete Applied Mathematics, 160(1–2):53–60, Elsevier, 2012.
Bibtex entry Link to publication
Link to original publication
René van Bevern and Hannes Moser and Rolf Niedermeier.
Approximation and Tidying-A Problem Kernel for s-Plex Cluster Vertex Deletion.
Algorithmica, 62(3):930–950, Springer, 2012.
Bibtex entry Link to publication
Link to original publication
Jiong Guo and Sepp Hartung and Rolf Niedermeier and Ondrej Suchý.
The Parameterized Complexity of Local Search for TSP, More Refined.
Algorithmica, 67(1):89-110, Springer, 2013.
Bibtex entry Link to publication
Link to original publication
Christian Komusiewicz and Johannes Uhlmann.
Cluster Editing with Locally Bounded Modifications.
Discrete Applied Mathematics, 160(15):2259-2270, Elsevier, 2012.
Bibtex entry Link to publication
Link to original publication
Hannes Moser and Rolf Niedermeier and Manuel Sorge.
Exact combinatorial algorithms and experiments for finding maximum $k$-plexes.
Journal of Combinatorial Optimization, 24:347–373, Springer, 2012.
Bibtex entry Link to publication
Link to original publication
Christoph Schmidt and Thomas Weiss and Christian Komusiewicz and Herbert Witte and Lutz Leistritz.
An Analytical Approach to Network Motif Detection in Samples of Networks with Pairwise Different Vertex Labels.
Computational and Mathematical Methods in Medicine, 2012. Article ID 910380
Bibtex entry Link to publication
Link to original publication
Alexander Schäfer and Christian Komusiewicz and Hannes Moser and Rolf Niedermeier.
Parameterized Computational Complexity of Finding Small-Diameter Subgraphs.
Optimization Letters, 6(5):883-891, Springer, 2012.
Bibtex entry Link to publication
Link to original publication
Manuel Sorge and René van Bevern and Rolf Niedermeier and Mathias Weller.
A New View on Rural Postman Based on Eulerian Extension and Matching.
Journal of Discrete Algorithms, 16:12–33, Elsevier, 2012.
Bibtex entry Link to publication
Link to original publication
Mathias Weller and Christian Komusiewicz and Rolf Niedermeier and Johannes Uhlmann.
On making directed graphs transitive.
Journal of Computer and System Sciences, 78(2):559–574, Elsevier, 2012.
Bibtex entry Link to publication
Link to original publication

Journal Publications 2011

Nadja Betzler and Jiong Guo and Christian Komusiewicz and Rolf Niedermeier.
Average Parameterization and Partial Kernelization for Computing Medians.
Journal of Computer and System Sciences, 77(4):774–789, Elsevier, 2011.
Bibtex entry Link to publication
Link to original publication
Nadja Betzler and René van Bevern and Christian Komusiewicz and Michael R. Fellows and Rolf Niedermeier.
Parameterized Algorithmics for Finding Connected Motifs in Biological Networks.
IEEE/ACM Transactions on Computational Biology and Bioinformatics, 8(5):1296-1308, IEEE Computer Society Press, 2011.
Bibtex entry Link to publication
Link to original publication
Britta Dorn and Falk Hüffner and Dominikus Krüger and Rolf Niedermeier and Johannes Uhlmann.
Exploiting bounded signal flow for graph orientation based on cause--effect pairs.
Algorithms for Molecular Biology, 6(1):21, 2011.
Bibtex entry Link to publication
Link to original publication
Michael R. Fellows and Jiong Guo and Hannes Moser and Rolf Niedermeier.
A complexity dichotomy for finding disjoint solutions of vertex deletion problems.
ACM Transactions on Computation Theory, 2(2):5:1–5:23, ACM, 2011.
Bibtex entry Link to publication
Link to original publication
Michael R. Fellows and Jiong Guo and Hannes Moser and Rolf Niedermeier.
A generalization of Nemhauser and Trotter's local optimization theorem.
Journal of Computer and System Sciences, In Press, Corrected Proof(6):1141-1158, Elsevier, 2011.
Bibtex entry Link to publication
Link to original publication
Michael R. Fellows and Jiong Guo and Christian Komusiewicz and Rolf Niedermeier and Johannes Uhlmann.
Graph-Based Data Clustering with Overlaps.
Discrete Optimization, 8(1):2–17, 2011.
Bibtex entry Link to publication
Link to original publication
Jiong Guo and Rolf Niedermeier and Ondřej Suchý.
Parameterized Complexity of Arc-Weighted Directed Steiner Problems.
SIAM J. Discrete Math., 25(2):583-599, 2011.
Bibtex entry Link to publication
Link to original publication
Jiong Guo and Iyad A. Kanj and Christian Komusiewicz and Johannes Uhlmann.
Editing Graphs into Disjoint Unions of Dense Clusters.
Algorithmica, 1–22, Springer, 2011.
Bibtex entry Link to publication
Link to original publication
Christian Komusiewicz and Rolf Niedermeier and Johannes Uhlmann.
Deconstructing Intractability --- A Multivariate Complexity Analysis of Interval Constrained Coloring.
Journal of Discrete Algorithms, 9(1):137–151, 2011. 20th Anniversary Edition of the Annual Symposium on Combinatorial Pattern Matching (CPM 2009)
Bibtex entry Link to publication
Link to original publication
André Nichterlein and Michael Dom and Rolf Niedermeier.
Aspects of a Multivariate Complexity Analysis for Rectangle Tiling.
Operation Research Letters, 39(5):346-351, Elsevier, 2011.
Bibtex entry Link to publication
Link to original publication

Journal Publications 2010

Nadja Betzler and Jiong Guo and Rolf Niedermeier.
Parameterized computational complexity of Dodgson and Young elections.
Information and Computation, 208(2):165–177, 2010.
Bibtex entry Link to publication
Link to original publication
Nadja Betzler and Britta Dorn.
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules.
Journal of Computer and System Sciences, 76(8):812–836, 2010.
Bibtex entry Link to publication
Link to original publication
Michael Dom and Jiong Guo and Rolf Niedermeier.
Approximation and Fixed-Parameter Algorithms for Consecutive Ones Submatrix Problems.
Journal of Computer and System Sciences, 76(3–4):204–221, 2010.
Bibtex entry Link to publication
Link to original publication
Michael Dom and Jiong Guo and Falk Hüffner and Rolf Niedermeier and Anke Truss.
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments.
Journal of Discrete Algorithms, 8(1):76–86, 2010.
Bibtex entry Link to publication
Link to original publication
Jiong Guo and Johannes Uhlmann.
Kernelization and complexity results for connectivity augmentation problems.
Networks, 56(2):131–142, 2010.
Bibtex entry Link to publication
Link to original publication
Jiong Guo and Rolf Niedermeier and Sebastian Wernicke.
Fixed-parameter tractability results for full-degree spanning tree and its dual.
Networks, 56(2):116–130, 2010.
Bibtex entry Link to publication
Link to original publication
Jiong Guo and Christian Komusiewicz and Rolf Niedermeier and Johannes Uhlmann.
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing.
SIAM Journal on Discrete Mathematics, 24(4):1662–1683, 2010.
Bibtex entry Link to publication
Link to original publication
Falk Hüffner and Christian Komusiewicz and Hannes Moser and Rolf Niedermeier.
Fixed-Parameter Algorithms for Cluster Vertex Deletion.
Theory of Computing Systems, 47(1):196–217, 2010.
Bibtex entry Link to publication
Link to original publication
Falk Hüffner and Nadja Betzler and Rolf Niedermeier.
Separator-Based Data Reduction for Signed Graph Balancing.
Journal of Combinatorial Optimization, 20(4):335–360, 2010.
Bibtex entry Link to publication
Link to original publication

Journal Publications 2009

Nadja Betzler and Johannes Uhlmann.
Parameterized complexity of candidate control in elections and related digraph problems.
Theoretical Computer Science, 410(52):5425–5442, 2009.
Bibtex entry Link to publication
Link to original publication
Nadja Betzler and Michael R. Fellows and Jiong Guo and Rolf Niedermeier and Frances A. Rosamond.
Fixed-parameter algorithms for Kemeny rankings.
Theoretical Computer Science, 410(45):4554–4570, 2009.
Bibtex entry Link to publication
Link to original publication
Michael Dom.
Algorithmic Aspects of the Consecutive-Ones Property.
Bulletin of the European Association for Theoretical Computer Science, 98:27–59, EATCS, 2009.
Bibtex entry Link to publication
Link to original publication
Jens Gramm and Tzvika Hartman and Till Nierhoff and Roded Sharan and Till Tantau.
On the complexity of SNP block partitioning under the perfect phylogeny model.
Discrete Mathematics, 309(18):5610–5617, 2009.
Bibtex entry
Link to original publication
Jiong Guo.
A more effective linear kernelization for cluster editing.
Theoretical Computer Science, 410(8-10):718–726, 2009.
Bibtex entry
Link to original publication
Falk Hüffner and Christian Komusiewicz and Hannes Moser and Rolf Niedermeier.
Isolation Concepts for Clique Enumeration: Comparison and Computational Experiments.
Theoretical Computer Science, 410(52):5384–5397, 2009.
Bibtex entry Link to publication
Link to original publication
Falk Hüffner.
Algorithm Engineering for Optimal Graph Bipartization.
Journal of Graph Algorithms and Applications, 13(2):77–98, 2009.
Bibtex entry Link to publication
Link to original publication
Falk Hüffner.
{Parametrisierte Ans\"atze f\"ur schwere Graphprobleme: Algorithmen und Experimente}.
it – Information Technology, 51(3):171–174, 2009.
Bibtex entry Link to publication
Link to original publication
Christian Komusiewicz and Falk Hüffner and Hannes Moser and Rolf Niedermeier.
Isolation Concepts for Efficiently Enumerating Dense Subgraphs.
Theoretical Computer Science, 410(38–40):3640–3654, 2009.
Bibtex entry Link to publication
Link to original publication
Hannes Moser and Dimitrios M. Thilikos.
Parameterized Complexity of Finding Regular Induced Subgraphs.
Journal of Discrete Algorithms, 7(2):181–190, Elsevier, 2009.
Bibtex entry Link to publication
Link to original publication
Hannes Moser and Somnath Sikdar.
The Parameterized Complexity of the Induced Matching Problem.
Discrete Applied Mathematics, 157(4):715–727, Elsevier, 2009.
Bibtex entry Link to publication
Link to original publication

Journal Publications 2008

Michael Dom and Jiong Guo and Rolf Niedermeier and Sebastian Wernicke.
Red-blue covering problems and the consecutive ones property.
Journal of Discrete Algorithms, 6(3):393–407, 2008.
Bibtex entry Link to publication
Link to original publication
Michael Dom and Jiong Guo and Falk Hüffner and Rolf Niedermeier.
Closest 4-leaf power is fixed-parameter tractable.
Discrete Applied Mathematics, 156(18):3345–3361, 2008.
Bibtex entry Link to publication
Link to original publication
Stefan Eckhardt and Sven Kosub and Moritz G. Maaß and Hanjo Täubig and Sebastian Wernicke.
Combinatorial network abstraction by trees and distances.
Theoretical Computer Science, 407(1-3):1–20, 2008.
Bibtex entry
Link to original publication
Jens Gramm and Arfst Nickelsen and Till Tantau.
Fixed-Parameter Algorithms in Phylogenetics.
The Computer Journal, 51(1):79–101, 2008.
Bibtex entry
Link to original publication
Jens Gramm and Jiong Guo and Falk Hüffner and Rolf Niedermeier.
Data reduction and exact algorithms for clique cover.
ACM Journal of Experimental Algorithmics, 13:2.2:1–2.2:15, 2008.
Bibtex entry Link to publication
Link to original publication
Jiong Guo and Rolf Niedermeier and Johannes Uhlmann.
Two fixed-parameter algorithms for Vertex Covering by Paths on Trees.
Information Processing Letters, 106(2):81–86, 2008.
Bibtex entry Link to publication
Link to original publication
Jiong Guo and Rolf Niedermeier and Daniel Raible.
Improved Algorithms and Complexity Results for Power Domination in Graphs.
Algorithmica, 52(2):177–202, 2008.
Bibtex entry Link to publication
Link to original publication
Jiong Guo and Falk Hüffner and Erhan Kenar and Rolf Niedermeier and Johannes Uhlmann.
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs.
European Journal of Operational Research, 186(2):542–553, 2008.
Bibtex entry Link to publication
Link to original publication
Falk Hüffner and Sebastian Wernicke and Thomas Zichner.
Algorithm Engineering for Color-Coding with Applications to Signaling Pathway Detection.
Algorithmica, 52(2):114–132, 2008.
Bibtex entry Link to publication
Link to original publication
Falk Hüffner and Rolf Niedermeier and Sebastian Wernicke.
Techniques for Practical Fixed-Parameter Algorithms.
The Computer Journal, 51(1):7–25, 2008.
Bibtex entry Link to publication
Link to original publication

Journal Publications 2007

Jens Gramm and Till Nierhoff and Roded Sharan and Till Tantau.
Haplotyping with missing data via perfect path phylogenies.
Discrete Applied Mathematics, 155(6-7):788–805, 2007.
Bibtex entry Link to publication
Link to original publication
Jens Gramm and Jiong Guo and Falk Hüffner and Rolf Niedermeier and Hans-Peter Piepho and Ramona Schmid.
Algorithms for Compact Letter Displays: Comparison and Evaluation.
Computational Statistics & Data Analysis, 52(2):725–736, 2007.
Bibtex entry Link to publication
Link to original publication
Jiong Guo and Rolf Niedermeier and Sebastian Wernicke.
Parameterized Complexity of Vertex Cover Variants.
Theory of Computing Systems, 41(3):501–520, 2007.
Bibtex entry Link to publication
Link to original publication
Jiong Guo and Rolf Niedermeier.
Invitation to data reduction and problem kernelization.
SIGACT News, 38(1):31–45, 2007.
Bibtex entry Link to publication
Link to original publication
Jiong Guo and Falk Hüffner and Hannes Moser.
Feedback Arc Set in Bipartite Tournaments is NP-Complete.
Information Processing Letters, 102(2–3):62–65, 2007.
Bibtex entry Link to publication
Link to original publication
Falk Hüffner and Sebastian Wernicke and Thomas Zichner.
{FASPAD}: fast signaling pathway detection.
Bioinformatics, 23(13):1708–1709, 2007.
Bibtex entry Link to publication
Link to original publication
Rolf Niedermeier and Jörg Vogel and Michael Fothe and Mirko König.
Das Knotenüberdeckungsproblem - Eine Fallstudie zur Didaktik NP-schwerer Probleme (Teil 1 und 2).
LOG IN, 27(146/147 (Teil 1), 148 (Teil 2)):53–59 (Teil 1), 81–89 (Teil 2), 2007.
Bibtex entry Link to publication
Sebastian Wernicke and Florian Rasche.
Simple and fast alignment of metabolic pathways by exploiting local diversity.
Bioinformatics, 23(15):1978–1985, 2007.
Bibtex entry Link to publication
Link to original publication

Journal Publications 2006

Jochen Alber and Nadja Betzler and Rolf Niedermeier.
Experiments on data reduction for optimal domination in networks.
Annals of Operations Research, 146(1):105–117, 2006.
Bibtex entry Link to publication
Link to original publication
Nadja Betzler and Rolf Niedermeier and Johannes Uhlmann.
Tree decompositions of graphs: saving memory in dynamic programming.
Discrete Optimization, 3(3):220–229, 2006.
Bibtex entry Link to publication
Link to original publication
Michael Dom and Jiong Guo and Falk Hüffner and Rolf Niedermeier.
Error Compensation in Leaf Power Problems.
Algorithmica, 44(4):363–381, 2006.
Bibtex entry Link to publication
Link to original publication
Michael R. Fellows and Jens Gramm and Rolf Niedermeier.
On the parameterized intractability of motif search problems.
Combinatorica, 26(2):141–167, 2006.
Bibtex entry Link to publication
Link to original publication
Jens Gramm and Jiong Guo and Rolf Niedermeier and Sebastian Wernicke.
The computational complexity of avoiding forbidden submatrices by row deletions.
International Journal of Foundations of Computer Science, 17(6):1467–1484, 2006.
Bibtex entry Link to publication
Link to original publication
Jens Gramm and Jiong Guo and Rolf Niedermeier.
Parameterized Intractability of Distinguishing Substring Selection.
Theory of Computing Systems, 39(4):545–560, 2006.
Bibtex entry Link to publication
Link to original publication
Jens Gramm and Jiong Guo and Rolf Niedermeier.
Pattern matching for arc-annotated sequences.
ACM Transactions on Algorithms, 2(1):44–65, 2006.
Bibtex entry Link to publication
Link to original publication
Jens Gramm and Jiong Guo and Falk Hüffner and Rolf Niedermeier and Sebastian Wernicke.
Compression-based fixed-parameter algorithms for Feedback Vertex Set and Edge Bipartization.
Journal of Computer and System Sciences, 72(8):1368–1396, 2006.
Bibtex entry Link to publication
Link to original publication
Jiong Guo and Rolf Niedermeier.
Exact algorithms and applications for tree-like weighted set cover.
Journal of Discrete Algorithms, 4(4):608–622, 2006.
Bibtex entry Link to publication
Link to original publication
Jiong Guo and Rolf Niedermeier.
A fixed-parameter tractability result for multicommodity demand flow in trees.
Information Processing Letters, 97(3):109–114, 2006.
Bibtex entry Link to publication
Link to original publication
Sebastian Wernicke and Florian Rasche.
FANMOD: a tool for fast network motif detection.
Bioinformatics, 22(9):1152–1153, 2006.
Bibtex entry
Link to original publication
Sebastian Wernicke.
Efficient Detection of Network Motifs.
IEEE/ACM Transactions on Computational Biology and Bioinformatics, 3(4):347–359, 2006.
Bibtex entry Link to publication
Link to original publication

Journal Publications 2005

Jochen Alber and Hongbing Fan and Michael R. Fellows and Henning Fernau and Rolf Niedermeier and Frances A. Rosamond and Ulrike Stege.
A refined search tree technique for Dominating Set on planar graphs.
Journal of Computer and System Sciences, 71(4):385–405, 2005.
Bibtex entry Link to publication
Link to original publication
Jochen Alber and Frederic Dorn and Rolf Niedermeier.
Experimental evaluation of a tree decomposition based algorithm for vertex cover on planar graphs.
Discrete Applied Mathematics, 145(2):219–231, 2005.
Bibtex entry Link to publication
Link to original publication
Jens Gramm and Jiong Guo and Falk Hüffner and Rolf Niedermeier.
Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation.
Theory of Computing Systems, 38(4):373–392, 2005.
Bibtex entry Link to publication
Link to original publication
Jiong Guo and Rolf Niedermeier.
Fixed-parameter tractability and data reduction for multicut in trees.
Networks, 46(3):124–135, 2005.
Bibtex entry Link to publication
Link to original publication
Roded Sharan and Jens Gramm and Zohar Yakhini and Amir Ben-Dor.
Multiplexing Schemes for Generic SNP Genotyping Assays.
Journal of Computational Biology, 12(5):514–533, 2005.
Bibtex entry Link to publication
Link to original publication

Journal Publications 2004

Jochen Alber and Jens Gramm and Jiong Guo and Rolf Niedermeier.
Computing the similarity of two sequences with nested arc annotations.
Theoretical Computer Science, 312(2–3):337–358, 2004.
Bibtex entry Link to publication
Link to original publication
Jochen Alber and Jirí Fiala.
Geometric separation and exact solutions for the parameterized independent set problem on disk graphs.
Journal of Algorithms, 52(2):134–151, 2004.
Bibtex entry
Link to original publication
Jochen Alber and Henning Fernau and Rolf Niedermeier.
Parameterized complexity: exponential speed-up for planar graph problems.
Journal of Algorithms, 52:26–56, 2004.
Bibtex entry Link to publication
Link to original publication
Jochen Alber and Michael R. Fellows and Rolf Niedermeier.
Polynomial time data reduction for Dominating Set.
Journal of the ACM, 51(3):363–384, 2004.
Bibtex entry Link to publication
Link to original publication
Jens Gramm and Jiong Guo and Falk Hüffner and Rolf Niedermeier.
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems.
Algorithmica, 39(4):321–347, 2004.
Bibtex entry Link to publication
Link to original publication
Jens Gramm.
A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns.
IEEE/ACM Transactions of Computational Biology and Bioinformatics, 1(4):171–180, 2004. An error in the main result of this work as well as the NP-hardness of the considered problem was shown by Shuai Cheng Li and Ming Li [WABI 2006].
Bibtex entry
Link to original publication

Journal Publications 2003

Jochen Alber and Henning Fernau and Rolf Niedermeier.
Graph separators: a parameterized view.
Journal of Computer and System Sciences, 67(4):808–832, 2003.
Bibtex entry Link to publication
Link to original publication
Jens Gramm and Rolf Niedermeier.
A fixed-parameter algorithm for Minumium Quartet Inconsistency.
Journal of Computer and System Sciences, 67(4):723–741, 2003.
Bibtex entry Link to publication
Link to original publication
Jens Gramm and Rolf Niedermeier and Peter Rossmanith.
Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems.
Algorithmica, 37(1):25-42, 2003.
Bibtex entry
Link to original publication
Jens Gramm and Edward A. Hirsch and Rolf Niedermeier and Peter Rossmanith.
Worst-case upper bounds for MAX-2-SAT with application to MAX-CUT.
Discrete Applied Mathematics, 130(2):139–155, 2003.
Bibtex entry Link to publication
Link to original publication
Rolf Niedermeier and Peter Rossmanith.
An efficient fixed parameter algorithm for 3-Hitting Set.
Journal of Discrete Algorithms, 1:89–102, 2003.
Bibtex entry Link to publication
Link to original publication
Rolf Niedermeier and Peter Rossmanith.
On efficient fixed-parameter algorithms for Weighted Vertex Cover.
Journal of Algorithms, 47:63–77, 2003.
Bibtex entry Link to publication
Link to original publication

Journal Publications 2002

Jochen Alber and Hans L. Bodlaender and Henning Fernau and Ton Kloks and Rolf Niedermeier.
Fixed parameter algorithms for Dominating Set and related problems on planar graphs.
Algorithmica, 33:461–493, 2002.
Bibtex entry Link to publication
Link to original publication
Rolf Niedermeier and Klaus Reinhardt and Peter Sanders.
Towards optimal locality in mesh-indexings.
Discrete Applied Mathematics, 117(1–3):211–237, 2002.
Bibtex entry Link to publication
Link to original publication

Journal Publications 2001

Jochen Alber and Jens Gramm and Rolf Niedermeier.
Faster exact algorithms for hard problems: A parameterized point of view.
Discrete Mathematics, 229(1–3):3–27, 2001.
Bibtex entry Link to publication
Link to original publication
Henning Fernau and Rolf Niedermeier.
An efficient exact algorithm for constraint bipartite vertex cover.
Journal of Algorithms, 38(2):374–410, 2001.
Bibtex entry Link to publication
Link to original publication
Falk Hüffner and Stefan Edelkamp and Henning Fernau and Rolf Niedermeier.
Finding Optimal Solutions to {Atomix}.
, 2174:229–243, Springer, 2001.
Bibtex entry
Link to original publication

Journal Publications 2000

Jochen Alber and Rolf Niedermeier.
On multidimensional curves with Hilbert property.
Theory of Computing Systems, 33:295–312, 2000.
Bibtex entry Link to publication
Link to original publication
Klaus-Jörn Lange and Rolf Niedermeier.
Data-independences of read, write, and control structures in PRAM computations.
Journal of Computer and System Sciences, 60:109–144, 2000.
Bibtex entry Link to publication
Link to original publication
Rolf Niedermeier and Peter Rossmanith.
A general method to speed up fixed-parameter-tractable algorithms.
Information Processing Letters, 73:125–129, 2000.
Bibtex entry Link to publication
Link to original publication
Rolf Niedermeier and Peter Rossmanith.
New upper bounds for Maximum Satisfiability.
Journal of Algorithms, 36:63–88, 2000.
Bibtex entry Link to publication
Link to original publication

Journal Publications 1999

Manfred Kunde and Rolf Niedermeier and Klaus Reinhardt and Peter Rossmanith.
Optimal deterministic sorting and routing on grids and tori with diagonals.
Algorithmica, 25(4):438–42, 1999.
Bibtex entry Link to publication
Link to original publication

Journal Publications 1998

Rolf Niedermeier and Peter Rossmanith.
Unambiguous computations and locally definable acceptance types.
Theoretical Computer Science, 194:137–161, 1998.
Bibtex entry Link to publication
Link to original publication

Journal Publications 1995

Rolf Niedermeier and Peter Rossmanith.
On optimal {OROW-PRAM} algorithms for computing recursively defined functions.
Parallel Processing Letters, 5(2):299–309, 1995.
Bibtex entry Link to publication
Link to original publication
Rolf Niedermeier and Peter Rossmanith.
Unambiguous auxiliary pushdown automata and semi-unbounded fan-in circuits.
Information and Computation, 118(2):227–245, 1995.
Bibtex entry Link to publication
Link to original publication

Zusatzinformationen / Extras