André Nichterlein

ORCID

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 83

Top Venues

CoRR

Algorithmica

IPEC

SIAM J. Discret. Math.

Berlin Institute of Technology (PHD)

Education History

Berlin Institute of Technology

PHD

Publications

Cristina Bazgan, André Nichterlein, Sofia Vazquez Alferez
Destroying Densest Subgraphs is Hard. CoRR (2024)
Aleksander Figiel, Darya Melnyk, André Nichterlein, Arash Pourdamghani, Stefan Schmid
Brief Announcement: Minimizing the Weighted Average Shortest Path Length in Demand-Aware Networks via Matching Augmentation. SPAA (2024)
Cristina Bazgan, André Nichterlein, Sofia Vazquez Alferez
Destroying Densest Subgraphs Is Hard. SWAT (2024)
Anne-Sophie Himmel, George B. Mertzios, André Nichterlein, Rolf Niedermeier
Fast Parameterized Preprocessing for Polynomial-Time Solvable Graph Problems. Commun. ACM 67 (4) (2024)
Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. J. Graph Algorithms Appl. 27 (3) (2023)
Aleksander Figiel, Tomohiro Koana, André Nichterlein, Niklas Wünsche
Correlating Theory and Practice in Finding Clubs and Plexes. ESA (2023)
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 (2023)
Jaroslav Garvardt, Nils Morawietz, André Nichterlein, Mathias Weller
Graph Clustering Problems Under the Lens of Parameterized Local Search. IPEC (2023)
Matthias Bentert, André Nichterlein
Parameterized Complexity of Diameter. Algorithmica 85 (2) (2023)
Klaus Heeger, André Nichterlein, Rolf Niedermeier
Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions. STACS (2023)
Matthias Bentert, André Nichterlein, Malte Renken, Philipp Zschoche
Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths. SIAM J. Discret. Math. 37 (3) (2023)
Klaus Heeger, André Nichterlein, Rolf Niedermeier
Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions. CoRR (2023)
Aleksander Figiel, Vincent Froese, André Nichterlein, Rolf Niedermeier
There and Back Again: On Applying Data Reduction Rules by Undoing Others. CoRR (2022)
Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer
Covering Many (or Few) Edges with k Vertices in Sparse Graphs. CoRR (2022)
Aleksander Figiel, Tomohiro Koana, André Nichterlein, Niklas Wünsche
Correlating Theory and Practice in Finding Clubs and Plexes. CoRR (2022)
Tomohiro Koana, André Nichterlein, Niklas Wünsche
Kernelization for Partial Vertex Cover via (Additive) Expansion Lemma. CoRR (2022)
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) (2022)
Hjalmar Schulz, André Nichterlein, Rolf Niedermeier, Christopher Weyand
Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial Time. IPEC (2022)
Niclas Boehmer, Robert Bredereck, André Nichterlein
Combating Collusion Rings Is Hard but Possible. AAAI (2022)
Aleksander Figiel, Vincent Froese, André Nichterlein, Rolf Niedermeier
There and Back Again: On Applying Data Reduction Rules by Undoing Others. ESA (2022)
Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer
Covering Many (Or Few) Edges with k Vertices in Sparse Graphs. STACS (2022)
Tomohiro Koana, André Nichterlein
Detecting and enumerating small induced subgraphs in c-closed graphs. Discret. Appl. Math. 302 (2021)
Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier
On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering. CIAC (2021)
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) (2021)
Leon Kellerhals, Tomohiro Koana, André Nichterlein, Philipp Zschoche
The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing. IPEC (2021)
Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein
Correction to: Parameterized Complexity of Min-Power Asymmetric Connectivity. Theory Comput. Syst. 65 (7) (2021)
Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. WG (2021)
Niclas Boehmer, Robert Bredereck, André Nichterlein
Combating Collusion Rings is Hard but Possible. CoRR (2021)
Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. CoRR (2021)
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 (2021)
Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier
Parameterized Dynamic Cluster Editing. Algorithmica 83 (1) (2021)
Matthias Bentert, André Nichterlein, Malte Renken, Philipp Zschoche
Using a Geometric Lens to Find k Disjoint Shortest Paths. ICALP (2021)
Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein
Parameterized Complexity of Min-Power Asymmetric Connectivity. CoRR (2020)
Matthias Bentert, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier
Efficient computation of optimal temporal walks under waiting-time constraints. Appl. Netw. Sci. 5 (1) (2020)
Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier
On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering. CoRR (2020)
Matthias Bentert, André Nichterlein, Malte Renken, Philipp Zschoche
Using a geometric lens to find k disjoint shortest paths. CoRR (2020)
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) (2020)
Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein
Parameterized Complexity of Min-Power Asymmetric Connectivity. Theory Comput. Syst. 64 (7) (2020)
Tomohiro Koana, André Nichterlein
Detecting and Enumerating Small Induced Subgraphs in c-Closed Graphs. CoRR (2020)
George B. Mertzios, André Nichterlein, Rolf Niedermeier
The Power of Linear-Time Data Reduction for Maximum Matching. Algorithmica 82 (12) (2020)
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) (2019)
Anne-Sophie Himmel, Matthias Bentert, André Nichterlein, Rolf Niedermeier
Efficient Computation of Optimal Temporal Walks under Waiting-Time Constraints. CoRR (2019)
Matthias Bentert, André Nichterlein
Parameterized Complexity of Diameter. CIAC (2019)
Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier
Parameterized aspects of triangle enumeration. J. Comput. Syst. Sci. 103 (2019)
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) (2019)
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) (2019)
Anne-Sophie Himmel, Matthias Bentert, André Nichterlein, Rolf Niedermeier
Efficient Computation of Optimal Temporal Walks Under Waiting-Time Constraints. COMPLEX NETWORKS (2) (2019)
Matthias Bentert, René van Bevern, Till Fluschnik, André Nichterlein, Rolf Niedermeier
Polynomial-Time Preprocessing for Weighted Problems Beyond Additive Goal Functions. CoRR (2019)
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) (2019)
Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein
Parameterized Complexity of Min-Power Asymmetric Connectivity. IWOCA (2019)
Viatcheslav Korenwein, André Nichterlein, Philipp Zschoche, Rolf Niedermeier
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. CoRR (2018)
Christian Komusiewicz, André Nichterlein, Rolf Niedermeier, Marten Picker
Exact Algorithms for Finding Well-Connected 2-Clubs in Real-World Graphs: Theory and Experiments. CoRR (2018)
Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality. ISAAC (2018)
Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier
Parameterized Dynamic Cluster Editing. CoRR (2018)
Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier
Towards Improving Brandes' Algorithm for Betweenness Centrality. CoRR (2018)
Matthias Bentert, André Nichterlein
Parameterized Complexity of Diameter. CoRR (2018)
Viatcheslav Korenwein, André Nichterlein, Rolf Niedermeier, Philipp Zschoche
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. ESA (2018)
Till Fluschnik, George B. Mertzios, André Nichterlein
Kernelization Lower Bounds for Finding Constant-Size Subgraphs. CiE (2018)
Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier
Parameterized Dynamic Cluster Editing. FSTTCS (2018)
Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier
Fractals for Kernelization Lower Bounds. SIAM J. Discret. Math. 32 (1) (2018)
George B. Mertzios, André Nichterlein, Rolf Niedermeier
A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs. SIAM J. Discret. Math. 32 (4) (2018)
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 (2018)
Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier
Parameterized Aspects of Triangle Enumeration. FCT (2017)
Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier
Finding Points in General Position. Int. J. Comput. Geom. Appl. 27 (4) (2017)
Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier
Parameterized algorithms for power-efficient connected symmetric wireless sensor networks. CoRR (2017)
Till Fluschnik, George B. Mertzios, André Nichterlein
Kernelization Lower Bounds for Finding Constant Size Subgraphs. CoRR (2017)
Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
When can Graph Hyperbolicity be computed in Linear Time? CoRR (2017)
Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
When Can Graph Hyperbolicity Be Computed in Linear Time? WADS (2017)
Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier
Parameterized Aspects of Triangle Enumeration. CoRR (2017)
Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier
Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks. ALGOSENSORS (2017)
René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý
Fixed-parameter algorithms for DAG Partitioning. Discret. Appl. Math. 220 (2017)
George B. Mertzios, André Nichterlein, Rolf Niedermeier
The Power of Linear-Time Data Reduction for Maximum Matching. MFCS (2017)
George B. Mertzios, André Nichterlein, Rolf Niedermeier
Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs. CoRR (2017)
Christian Komusiewicz, André Nichterlein, Rolf Niedermeier
Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics. CoRR (2016)
George B. Mertzios, André Nichterlein, Rolf Niedermeier
Fine-Grained Algorithm Design for Matching. CoRR (2016)
Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier
A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems. CoRR (2016)
Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier
Finding Points in General Position. CCCG (2016)
Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier
Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems. ICALP (2016)
René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý
Fixed-Parameter Algorithms for DAG Partitioning. CoRR (2016)
Vincent Froese, André Nichterlein, Rolf Niedermeier
Win-win kernelization for degree sequence completion problems. J. Comput. Syst. Sci. 82 (6) (2016)
Cristina Bazgan, Robert Bredereck, Sepp Hartung, André Nichterlein, Gerhard J. Woeginger
Finding large degree-anonymous subgraphs is hard. Theor. Comput. Sci. 622 (2016)
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)
Robert Bredereck, Jiehua Chen, Piotr Faliszewski, André Nichterlein, Rolf Niedermeier
Prices matter for the parameterized complexity of shift bribery. Inf. Comput. 251 (2016)
Cristina Bazgan, André Nichterlein, Rolf Niedermeier
A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths. CIAC (2015)
Robert Bredereck, Jiehua Chen, Piotr Faliszewski, André Nichterlein, Rolf Niedermeier
Prices Matter for the Parameterized Complexity of Shift Bribery. CoRR (2015)
Sepp Hartung, Christian Komusiewicz, André Nichterlein
Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs. J. Graph Algorithms Appl. 19 (1) (2015)
Sepp Hartung, André Nichterlein
NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs. SIAM J. Discret. Math. 29 (4) (2015)
Robert Bredereck, Thomas Köhler, André Nichterlein, Rolf Niedermeier, Geevarghese Philip
Using Patterns to Form Homogeneous Teams. Algorithmica 71 (2) (2015)
Sepp Hartung, Christian Komusiewicz, André Nichterlein, Ondrej Suchý
On structural parameterizations for the 2-club problem. Discret. Appl. Math. 185 (2015)
Sepp Hartung, André Nichterlein, Rolf Niedermeier, Ondrej Suchý
A refined complexity analysis of degree anonymization in graphs. Inf. Comput. 243 (2015)
Robert Bredereck, Vincent Froese, Sepp Hartung, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
The complexity of degree anonymization by vertex addition. Theor. Comput. Sci. 607 (2015)
Christian Komusiewicz, André Nichterlein, Rolf Niedermeier
Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics. WG (2015)
Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier
Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems. CoRR (2015)
Falk Hüffner, Christian Komusiewicz, André Nichterlein
Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes. WADS (2015)
Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier
Finding Points in General Position. CoRR (2015)
Cristina Bazgan, André Nichterlein
Parameterized Inapproximability of Degree Anonymization. IPEC (2014)
Vincent Froese, André Nichterlein, Rolf Niedermeier
Win-Win Kernelization for Degree Sequence Completion Problems. CoRR (2014)
Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora
Parameterized approximability of maximizing the spread of influence in networks. J. Discrete Algorithms 27 (2014)
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) (2014)
Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora
Parameterized Inapproximability of Target Set Selection and Generalizations. CiE (2014)

André Nichterlein.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

André Nichterlein