Andreas Emil Feldmann

Andreas Emil Feldmann is a Senior Lecturer at the Department of Computer Science, University of Sheffield (United Kingdom) since 2023. Previously, he served as Associate Professor (2015-2023) and Assistant Professor (until 2022) at the Department of Applied Mathematics (KAM) at Charles University in Prague, Czechia. His academic journey includes postdoctoral positions at SZTAKI (Hungarian Academy of Sciences, 2015-2016) and the University of Waterloo (2012-2015), and doctoral studies at ETH Zurich (2008-2012). He holds a diploma from RWTH Aachen (2000-2008) and participated in an Erasmus program at Chalmers University (2004-2005).

His research focuses on parameterized and approximation algorithms, with contributions to combinatorial optimization and graph theory. He has organized major workshops such as the Parameterized Approximation Algorithms Workshop (PAAW) in 2019 and 2022, and serves on program committees for conferences like ICALP, IPEC, and WAOA. Notably, he received a teaching excellence award from Charles University in 2022.

Feldmann is deeply involved in advancing algorithmic theory, particularly at the intersection of approximation and parameterized complexity. His recent work includes talks on bidirected Steiner networks and inapproximability results for k-center problems. He actively contributes to the academic community through organizing events and peer-review roles.