André Nichterlein
Technische Universität Berlin
H-index: 21
Europe-Germany
Top articles of André Nichterlein
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
Destroying Densest Subgraphs is Hard | arXiv preprint arXiv:2404.08599 | Cristina Bazgan André Nichterlein Sofia Vazquez Alferez | 2024/4/12 |
Fast Parameterized Preprocessing for Polynomial-Time Solvable Graph Problems | Communications of the ACM | Anne-Sophie Himmel George B Mertzios André Nichterlein Rolf Niedermeier | 2024/3/25 |
Polynomial-time data reduction for weighted problems beyond additive goal functions | Discrete Applied Mathematics | Matthias Bentert René van Bevern Till Fluschnik André Nichterlein Rolf Niedermeier | 2023/3/31 |
Parameterized complexity of diameter | Algorithmica | Matthias Bentert André Nichterlein | 2023/2 |
Parameterized lower bounds for problems in p via fine-grained cross-compositions | arXiv preprint arXiv:2301.00797 | Klaus Heeger André Nichterlein Rolf Niedermeier | 2023/1/2 |
Graph Clustering Problems Under the Lens of Parameterized Local Search | Jaroslav Garvardt Nils Morawietz André Nichterlein Mathias Weller | 2023 | |
Using a Geometric Lens to Find -Disjoint Shortest Paths | SIAM Journal on Discrete Mathematics | Matthias Bentert André Nichterlein Malte Renken Philipp Zschoche | 2023/9/30 |
There and back again: On applying data reduction rules by undoing others | arXiv preprint arXiv:2206.14698 | Aleksander Figiel Vincent Froese André Nichterlein Rolf Niedermeier | 2022/6/29 |
Combating collusion rings is hard but possible | Proceedings of the AAAI Conference on Artificial Intelligence | Niclas Boehmer Robert Bredereck André Nichterlein | 2022/6/28 |
Covering many (or few) edges with k vertices in sparse graphs | arXiv preprint arXiv:2201.05465 | Tomohiro Koana Christian Komusiewicz André Nichterlein Frank Sommer | 2022/1/14 |
Applying a cut-based data reduction rule for weighted cluster editing in polynomial time | Hjalmar Schulz André Nichterlein Rolf Niedermeier Christopher Weyand | 2022 | |
Correlating Theory and Practice in Finding Clubs and Plexes | arXiv preprint arXiv:2212.07533 | Aleksander Figiel Tomohiro Koana André Nichterlein Niklas Wünsche | 2022/12/14 |
Parameterized algorithms for power-efficiently connecting wireless sensor networks: Theory and experiments | INFORMS Journal on Computing | Matthias Bentert René van Bevern André Nichterlein Rolf Niedermeier Pavel V Smirnov | 2022/1 |
Kernelization for Partial Vertex Cover via (Additive) Expansion Lemma | arXiv preprint arXiv:2211.07001 | Tomohiro Koana André Nichterlein Niklas Wünsche | 2022/11/13 |
On 2-clubs in graph-based data clustering: theory and algorithm engineering | Aleksander Figiel Anne-Sophie Himmel André Nichterlein Rolf Niedermeier | 2021 | |
Detecting and enumerating small induced subgraphs in c-closed graphs | Discrete Applied Mathematics | Tomohiro Koana André Nichterlein | 2021/10/30 |
Parameterized dynamic cluster editing | Algorithmica | Junjie Luo Hendrik Molter André Nichterlein Rolf Niedermeier | 2021/1 |
Correction to: Parameterized Complexity of Min-Power Asymmetric Connectivity | Theory of Computing Systems | Matthias Bentert Roman Haag Christian Hofer Tomohiro Koana André Nichterlein | 2021/10 |
Combining clickstream analyses and graph-modeled data clustering for identifying common response processes | psychometrika | Esther Ulitzsch Qiwei He Vincent Ulitzsch Hendrik Molter André Nichterlein | 2021/3 |
The PACE 2021 parameterized algorithms and computational experiments challenge: Cluster editing | Leon Kellerhals Tomohiro Koana André Nichterlein Philipp Zschoche | 2021 |
Co-Authors
