Jarosław Byrka is a Professor in the Combinatorial Optimization group at the Institute of Computer Science, University of Wrocław. He has held postdoctoral positions at TU Eindhoven and EPFL, and has been a full professor since 2021. His research focuses on algorithmic and mathematical aspects of discrete optimization problems. Research Interests: His primary research areas include Discrete Optimization, Location and Covering Problems, Network Design, and LP-rounding Approximation Algorithms. He employs advanced techniques such as randomized rounding to develop efficient approximation algorithms for NP-hard problems. His work bridges theoretical foundations with practical applications in network design and resource allocation. The recent publications, such as the 2024 result on the integrality gap of BCR, reflect a strong trend in pushing the limits of approximation guarantees in combinatorial optimization. His research consistently contributes to the theoretical understanding of LP-based methods and their applications in graph and network problems. Scientific Awards: STOC 2010 Best Paper Award Witold Lipski Prize Advising and Grants: He has successfully supervised five PhD students to graduation and mentored several postdoctoral researchers including Joachim Spoerhase, Meesum Syed Mohammad, Martin Boehm, Sandip Banerjee, and Yongho Shin. While specific grant details are not listed, his long-term research productivity and leadership in major conferences suggest sustained funding support. Labs and Teams: He is a key member of the Combinatorial Optimization group at the University of Wrocław, contributing to its international visibility through editorial work and conference organization.






