Scholar
André Nichterlein
Google Scholar ID: 5ZHydoAAAAAJ
TU Berlin
Parameterized Complexity
Algorithms
Graph Problems
Follow
Google Scholar
↗
Citations & Impact
All-time
Citations
944
H-index
19
i10-index
35
Publications
20
Co-authors
39
list available
Publications
6 items
Designing Caterpillars for Graphs: Approximation and Hardness
2026
Cited
0
On the Parameterized Complexity of Bounded-Density Vertex Deletion
2026
Cited
0
Designing Approximate Binary Trees for Trees
2026
Cited
0
Parameterized Algorithms for Computing MAD Trees
2026
Cited
0
Density Matters: A Complexity Dichotomy of Deleting Edges to Bound Subgraph Density
arXiv.org · 2026
Cited
0
Parameterized Complexity of Segment Routing
2025
Cited
0
Co-authors
16 total
Rolf Niedermeier
TU Berlin
Robert Bredereck
TU Clausthal
Matthias Bentert
UiB
Morgan Chopin
Researcher, Orange
Christian Komusiewicz
Friedrich-Schiller-Universität Jena
Till Fluschnik
HU Berlin
George B. Mertzios
Associate Professor, Durham University
Tomohiro Koana
Keio University
