André Nichterlein

André Nichterlein is a Permanent Research Associate at the Technical University of Berlin, specializing in Algorithmics and Complexity Theory. He completed his PhD at TU Berlin (2014) and holds a Diploma from Friedrich Schiller University Jena (2010). His career includes postdoctoral research at Durham University (UK) under a DAAD fellowship and extensive work as a research assistant at TU Berlin.

Research Focus: Nichterlein's work centers on parameterized algorithms, kernelization techniques, graph problem optimization, and algorithm engineering. His research addresses fundamental challenges in computational complexity through practical algorithmic solutions, particularly in graph theory and network optimization.

Publication Trends: His recent articles (2020-2023) demonstrate a strong focus on parameterized complexity frontiers, efficient data reduction methods for NP-hard problems, and applications in network design. Recurring themes include kernelization innovations, graph modification problems, and experimental algorithmics, with consistent contributions to theoretical foundations of computer science.