The Effect of Homogeneity on the Complexity of k-Anonymity. - Robert Bredereck; André Nichterlein; Rolf Niedermeier; Geevarghese Philip (FCT, 2011)

Pattern-Guided Data Anonymization and Clustering. - Robert Bredereck; André Nichterlein; Rolf Niedermeier; Geevarghese Philip (MFCS, 2011)

Realizing Degree Sequences for Directed Acyclic Graphs is Hard - André Nichterlein (CoRR, 2011)

Aspects of a multivariate complexity analysis for Rectangle Tiling. - André Nichterlein; Michael Dom; Rolf Niedermeier (Oper. Res. Lett., 2011)

Parameterized Complexity of DAG Partitioning. - René van Bevern; Robert Bredereck; Morgan Chopin; Sepp Hartung; Falk Hüffner; André Nichterlein; Ondrej Suchý 001 (CIAC, 2013)

On the Parameterized and Approximation Hardness of Metric Dimension. - Sepp Hartung; André Nichterlein (CCC, 2013)

The Complexity of Finding a Large Subgraph under Anonymity Constraints. - Robert Bredereck; Sepp Hartung; André Nichterlein; Gerhard J. Woeginger (ISAAC, 2013)

On Structural Parameterizations for the 2-Club Problem. - Sepp Hartung; Christian Komusiewicz; André Nichterlein (SOFSEM, 2013)

Pattern-Guided k-Anonymity. - Robert Bredereck; André Nichterlein; Rolf Niedermeier (Algorithms, 2013)

On tractable cases of Target Set Selection. - André Nichterlein; Rolf Niedermeier; Johannes Uhlmann; Mathias Weller (Soc. Netw. Anal. Min., 2013)

Parameterized Inapproximability of Degree Anonymization. - Cristina Bazgan; André Nichterlein (IPEC, 2014)

Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks. - Sepp Hartung; Clemens Hoffmann 002; André Nichterlein (SEA, 2014)

Parameterized Inapproximability of Target Set Selection and Generalizations. - Cristina Bazgan; Morgan Chopin; André Nichterlein; Florian Sikora (Comput., 2014)

The effect of homogeneity on the computational complexity of combinatorial data anonymization. - Robert Bredereck; André Nichterlein; Rolf Niedermeier; Geevarghese Philip (Data Min. Knowl. Discov., 2014)

Parameterized approximability of maximizing the spread of influence in networks. - Cristina Bazgan; Morgan Chopin; André Nichterlein; Florian Sikora (J. Discrete Algorithms, 2014)

Constant Thresholds Can Make Target Set Selection Tractable. - Morgan Chopin; André Nichterlein; Rolf Niedermeier; Mathias Weller (Theory Comput. Syst., 2014)

Constant-factor approximations for Capacitated Arc Routing without triangle inequality. - René van Bevern; Sepp Hartung; André Nichterlein; Manuel Sorge (Oper. Res. Lett., 2014)

A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths. - Cristina Bazgan; André Nichterlein; Rolf Niedermeier (CIAC, 2015)

Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes. - Falk Hüffner; Christian Komusiewicz; André Nichterlein (WADS, 2015)

Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics. - Christian Komusiewicz; André Nichterlein; Rolf Niedermeier (WG, 2015)

Using Patterns to Form Homogeneous Teams. - Robert Bredereck; Thomas Köhler; André Nichterlein; Rolf Niedermeier; Geevarghese Philip (Algorithmica, 2015)

On structural parameterizations for the 2-club problem. - Sepp Hartung; Christian Komusiewicz; André Nichterlein; Ondrej Suchý 001 (Discret. Appl. Math., 2015)

A refined complexity analysis of degree anonymization in graphs. - Sepp Hartung; André Nichterlein; Rolf Niedermeier; Ondrej Suchý 001 (Inf. Comput., 2015)

Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs. - Sepp Hartung; Christian Komusiewicz; André Nichterlein (J. Graph Algorithms Appl., 2015)

NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs. - Sepp Hartung; André Nichterlein (SIAM J. Discret. Math., 2015)

The complexity of degree anonymization by vertex addition. - Robert Bredereck; Vincent Froese; Sepp Hartung; André Nichterlein; Rolf Niedermeier; Nimrod Talmon (Theor. Comput. Sci., 2015)

Degree-constrained editing of small-degree graphs. - André Nichterlein (2015)

Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems. - Till Fluschnik; Danny Hermelin; André Nichterlein; Rolf Niedermeier (ICALP, 2016)

A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems. - Robert Bredereck; Vincent Froese; Marcel Koseler; Marcelo Garlet Millani; André Nichterlein; Rolf Niedermeier (CoRR, 2016)

Fine-Grained Algorithm Design for Matching. - George B. Mertzios; André Nichterlein; Rolf Niedermeier (CoRR, 2016)

Prices matter for the parameterized complexity of shift bribery. - Robert Bredereck; Jiehua Chen 001; Piotr Faliszewski; André Nichterlein; Rolf Niedermeier (Inf. Comput., 2016)

Win-win kernelization for degree sequence completion problems. - Vincent Froese; André Nichterlein; Rolf Niedermeier (J. Comput. Syst. Sci., 2016)

Finding large degree-anonymous subgraphs is hard. - Cristina Bazgan; Robert Bredereck; Sepp Hartung; André Nichterlein; Gerhard J. Woeginger (Theor. Comput. Sci., 2016)

Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks. - Matthias Bentert; René van Bevern; André Nichterlein; Rolf Niedermeier (ALGOSENSORS, 2017)

Fixed-parameter algorithms for DAG Partitioning. - René van Bevern; Robert Bredereck; Morgan Chopin; Sepp Hartung; Falk Hüffner; André Nichterlein; Ondrej Suchý 001 (Discret. Appl. Math., 2017)

Finding Points in General Position. - Vincent Froese; Iyad A. Kanj; André Nichterlein; Rolf Niedermeier (Int. J. Comput. Geom. Appl., 2017)

Kernelization Lower Bounds for Finding Constant-Size Subgraphs. - Till Fluschnik; George B. Mertzios; André Nichterlein (CiE, 2018)

Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. - Viatcheslav Korenwein; André Nichterlein; Rolf Niedermeier; Philipp Zschoche (ESA, 2018)

Towards Improving Brandes' Algorithm for Betweenness Centrality. - Matthias Bentert; Alexander Dittmann; Leon Kellerhals; André Nichterlein; Rolf Niedermeier (CoRR, 2018)

Exact Algorithms for Finding Well-Connected 2-Clubs in Real-World Graphs: Theory and Experiments. - Christian Komusiewicz; André Nichterlein; Rolf Niedermeier; Marten Picker (CoRR, 2018)

Fractals for Kernelization Lower Bounds. - Till Fluschnik; Danny Hermelin; André Nichterlein; Rolf Niedermeier (SIAM J. Discret. Math., 2018)

A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs. - George B. Mertzios; André Nichterlein; Rolf Niedermeier (SIAM J. Discret. Math., 2018)

A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs. - Robert Bredereck; Vincent Froese; Marcel Koseler; Marcelo Garlet Millani; André Nichterlein; Rolf Niedermeier (Algorithmica, 2019)

When Can Graph Hyperbolicity be Computed in Linear Time? - Till Fluschnik; Christian Komusiewicz; George B. Mertzios; André Nichterlein; Rolf Niedermeier; Nimrod Talmon (Algorithmica, 2019)

Polynomial-Time Preprocessing for Weighted Problems Beyond Additive Goal Functions. - Matthias Bentert; René van Bevern; Till Fluschnik; André Nichterlein; Rolf Niedermeier (CoRR, 2019)

Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: Theory and experiments. - Christian Komusiewicz; André Nichterlein; Rolf Niedermeier; Marten Picker (Eur. J. Oper. Res., 2019)

Parameterized aspects of triangle enumeration. - Matthias Bentert; Till Fluschnik; André Nichterlein; Rolf Niedermeier (J. Comput. Syst. Sci., 2019)

A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths. - Cristina Bazgan; Till Fluschnik; André Nichterlein; Rolf Niedermeier; Maximilian Stahlberg (Networks, 2019)

The Power of Linear-Time Data Reduction for Maximum Matching. - George B. Mertzios; André Nichterlein; Rolf Niedermeier (Algorithmica, 2020)

Efficient computation of optimal temporal walks under waiting-time constraints. - Matthias Bentert; Anne-Sophie Himmel; André Nichterlein; Rolf Niedermeier (Appl. Netw. Sci., 2020)

An Adaptive Version of Brandes' Algorithm for Betweenness Centrality. - Matthias Bentert; Alexander Dittmann; Leon Kellerhals; André Nichterlein; Rolf Niedermeier (J. Graph Algorithms Appl., 2020)

Parameterized Complexity of Min-Power Asymmetric Connectivity. - Matthias Bentert; Roman Haag; Christian Hofer; Tomohiro Koana; André Nichterlein (Theory Comput. Syst., 2020)

Using a Geometric Lens to Find k Disjoint Shortest Paths. - Matthias Bentert; André Nichterlein; Malte Renken; Philipp Zschoche (ICALP, 2021)

The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing. - Leon Kellerhals; Tomohiro Koana; André Nichterlein; Philipp Zschoche (IPEC, 2021)

Parameterized Dynamic Cluster Editing. - Junjie Luo 001; Hendrik Molter; André Nichterlein; Rolf Niedermeier (Algorithmica, 2021)

Detecting and enumerating small induced subgraphs in c-closed graphs. - Tomohiro Koana; André Nichterlein (Discret. Appl. Math., 2021)

Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. - Tomohiro Koana; Viatcheslav Korenwein; André Nichterlein; Rolf Niedermeier; Philipp Zschoche (ACM J. Exp. Algorithmics, 2021)

On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering. - Aleksander Figiel; Anne-Sophie Himmel; André Nichterlein; Rolf Niedermeier (J. Graph Algorithms Appl., 2021)

Correction to: Parameterized Complexity of Min-Power Asymmetric Connectivity. - Matthias Bentert; Roman Haag; Christian Hofer; Tomohiro Koana; André Nichterlein (Theory Comput. Syst., 2021)

Combating Collusion Rings Is Hard but Possible. - Niclas Boehmer; Robert Bredereck; André Nichterlein (AAAI, 2022)

There and Back Again: On Applying Data Reduction Rules by Undoing Others. - Aleksander Figiel; Vincent Froese; André Nichterlein; Rolf Niedermeier (ESA, 2022)

Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial Time. - Hjalmar Schulz; André Nichterlein; Rolf Niedermeier; Christopher Weyand (IPEC, 2022)

Covering Many (Or Few) Edges with k Vertices in Sparse Graphs. - Tomohiro Koana; Christian Komusiewicz; André Nichterlein; Frank Sommer (STACS, 2022)

Kernelization for Partial Vertex Cover via (Additive) Expansion Lemma. - Tomohiro Koana; André Nichterlein; Niklas Wünsche (CoRR, 2022)

Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments. - Matthias Bentert; René van Bevern; André Nichterlein; Rolf Niedermeier; Pavel V. Smirnov (INFORMS J. Comput., 2022)

Correlating Theory and Practice in Finding Clubs and Plexes. - Aleksander Figiel; Tomohiro Koana; André Nichterlein; Niklas Wünsche (ESA, 2023)

Graph Clustering Problems Under the Lens of Parameterized Local Search. - Jaroslav Garvardt; Nils Morawietz; André Nichterlein; Mathias Weller (IPEC, 2023)

Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions. - Klaus Heeger; André Nichterlein; Rolf Niedermeier (STACS, 2023)

Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. - Maciej Rymar; Hendrik Molter; André Nichterlein; Rolf Niedermeier (J. Graph Algorithms Appl., 2023)

Parameterized Complexity of Diameter. - Matthias Bentert; André Nichterlein (Algorithmica, 2023)

Polynomial-time data reduction for weighted problems beyond additive goal functions. - Matthias Bentert; René van Bevern; Till Fluschnik; André Nichterlein; Rolf Niedermeier (Discret. Appl. Math., 2023)

Using a Geometric Lens to Find ( boldsymbol{k} )-Disjoint Shortest Paths. - Matthias Bentert; André Nichterlein; Malte Renken; Philipp Zschoche (SIAM J. Discret. Math., 2023)

Brief Announcement: Minimizing the Weighted Average Shortest Path Length in Demand-Aware Networks via Matching Augmentation. - Aleksander Figiel; Darya Melnyk; André Nichterlein; Arash Pourdamghani; Stefan Schmid 001 (SPAA, 2024)

SpiderDAN: Matching Augmentation in Demand-Aware Networks. - Aleksander Figiel; Darya Melnyk; André Nichterlein; Arash Pourdamghani; Stefan Schmid 001 (CoRR, 2024)

Fast Parameterized Preprocessing for Polynomial-Time Solvable Graph Problems. - Anne-Sophie Himmel; George B. Mertzios; André Nichterlein; Rolf Niedermeier (Commun. ACM, 2024)

On the Computational Complexity of Graph Reconstruction. - Cristina Bazgan; Morgan Chopin; André Nichterlein; Camille Richer (CIAC (1), 2025)

Parameterized Complexity of Segment Routing. - Cristina Bazgan; Morgan Chopin; André Nichterlein; Camille Richer (INFOCOM, 2025)

On the hardness of problems around s-clubs on split graphs. - Cristina Bazgan; Pinar Heggernes; André Nichterlein; Thomas Pontoizeau (Discret. Appl. Math., 2025)

Effective data reduction for strongly stable matching in very sparse graphs. - Rosa Wolf; Klaus Heeger; André Nichterlein (Inf. Process. Lett., 2025)

Destroying densest subgraphs is hard. - Cristina Bazgan; André Nichterlein; Sofia Vazquez Alferez (J. Comput. Syst. Sci., 2025)