Dr Andreas Feldmann
School of Computer Science
Senior Lecturer in Algorithms
Full contact details
School of Computer Science
Regent Court (DCS)
211 Portobello
91Ö±²¥
S1 4DP
- Profile
-
Dr. habil. Andreas Emil Feldmann attended the European School in Luxemburg, and studied computer science at RWTH Aachen with an Erasmus exchange year at Chalmers University in Gothenburg. He obtained his Diploma in computer science from RWTH Aachen in 2007, and the title of Doctor of Sciences from ETH Zurich in 2012. After that he joined the University of Waterloo as a postdoctoral fellow until 2015, and then spent another year as a postdoctoral fellow at the Hungarian Academy of Sciences. In 2015 he joined Charles University in Prague as an assistant professor, where he successfully defended his habilitation in 2021. Since 2023 he is a senior lecturer at the Department of Computer Science within the Algorithms research group.
- Research interests
-
Combinatorial optimization, parameterized approximation algorithms.
- Publications
-
Journal articles
- . Journal of Computer and System Sciences, 103604-103604.
- . Algorithmica, 85(4), 902-928.
- . Journal of Computer and System Sciences, 122, 72-93.
- . Journal of the ACM, 68(6), 1-34.
- . Operations Research Letters, 49(3), 310-315.
- . ACM Transactions on Algorithms, 17(2), 1-68.
- . SIAM Journal on Discrete Mathematics, 35(1), 546-574.
- . Algorithmica, 83(5), 1352-1370.
- . SIAM Journal on Computing, 49(2), 318-364.
- . Algorithmica, 82(7), 1989-2005.
- . Algorithmica, 81(8), 3200-3216.
- . Algorithmica, 81(3), 1031-1052.
- . SIAM Journal on Computing, 47(4), 1667-1704.
- . Mathematical Programming, 160(1-2), 379-406.
- . SIAM Journal on Discrete Mathematics, 30(1), 141-153.
- . Theoretical Computer Science, 562, 557-564.
- . Algorithmica, 71(1), 181-200.
- . Theory of Computing Systems, 57(1), 1-35.
- . Algorithmica, 71(2), 354-376.
- . Theoretical Computer Science, 485, 61-68.
- . Networks, 59(4), 380-386.
- . Small Wars & Insurgencies, 1-27.
- . ACM Transactions on Computation Theory.
- . Algorithms, 13(6), 146-146.
Chapters
- , Symposium on Simplicity in Algorithms (SOSA) (pp. 37-56). Society for Industrial and Applied Mathematics
Conference proceedings papers
- . Leibniz International Proceedings in Informatics, LIPIcs, Vol. 308
- . Leibniz International Proceedings in Informatics, LIPIcs, Vol. 297
- . Leibniz International Proceedings in Informatics, LIPIcs, Vol. 275
- . Leibniz International Proceedings in Informatics, LIPIcs, Vol. 249
- (pp 215-229)
- . Leibniz International Proceedings in Informatics, LIPIcs, Vol. 214
- (pp 796-809)
- . Leibniz International Proceedings in Informatics, LIPIcs, Vol. 180
- (pp 40-53)
- . Leibniz International Proceedings in Informatics, LIPIcs, Vol. 173
- . Leibniz International Proceedings in Informatics, LIPIcs, Vol. 162
- . Leibniz International Proceedings in Informatics, LIPIcs, Vol. 148
- . 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 9 November 2019 - 12 November 2019.
- (pp 175-189)
- . Leibniz International Proceedings in Informatics, LIPIcs, Vol. 112
- . Leibniz International Proceedings in Informatics, LIPIcs, Vol. 101 (pp 191-1913)
- (pp 65-77)
- . Leibniz International Proceedings in Informatics, LIPIcs, Vol. 96
- . Leibniz International Proceedings in Informatics, LIPIcs, Vol. 64 (pp 33.1-33.12)
- . Leibniz International Proceedings in Informatics, LIPIcs, Vol. 55
- (pp 469-480)
- (pp 588-600)
- . Leibniz International Proceedings in Informatics, LIPIcs, Vol. 28 (pp 176-191)
- (pp 158-169)
- . Discrete Applied Mathematics, Vol. 161(7-8) (pp 970-998)
- (pp 76-87)
- . Leibniz International Proceedings in Informatics, LIPIcs, Vol. 14 (pp 100-111)
- (pp 372-382)
- (pp 143-154)
- (pp 143-154)
- An O(n(4)) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs. ALGORITHMS - ESA 2011, Vol. 6942 (pp 143-154)
- (pp 11-20)
- (pp 209-220)
Preprints
- A $(5/3+{epsilon})$-Approximation for Tricolored Non-crossing Euclidean TSP, arXiv.
- A $(5/3+ε)$-Approximation for Tricolored Non-crossing Euclidean TSP.
- Parameterized Algorithms for Steiner Forest in Bounded Width Graphs, arXiv.
- , arXiv.
- , arXiv.
- , arXiv.
- , arXiv.
- , arXiv.
- , arXiv.
- , arXiv.
- , arXiv.
- , arXiv.
- , arXiv.
- , arXiv.
- , arXiv.
- , arXiv.
- , arXiv.
- , arXiv.
- , arXiv.
- , arXiv.
- , arXiv.
- , arXiv.
- , arXiv.
- , arXiv.
- , arXiv.
- , arXiv.
- Research group
-
Foundations of Computation research group