Kristóf Bérczi

Department of Operations Research | Eötvös Loránd University

Research interests
Approximation algorithms, Combinatorial optimization, Matroid theory
[Publications] [Google Scholar]

Bio
MSc, Eötvös Loránd University, Budapest
PhD, Dept. of Operations Research, Eötvös Loránd University, Budapest
Postdoc, Hungarian Academy of Sciences

Teaching
Directed reading program, for BSM students
Matroid theory 2 (TBA)
Continuous optimization (Mon 12:30-14:00, Room 0.83)

PhD students
Viktor Csaplár (expected Dec 2030)
Péter Varga (expected Dec 2030)
Áron Jánosik (expected Dec 2029)
András Imolay (expected Dec 2027)
Lydia Mirabel Mendoza Cadena (2020-2025) – assistant professor at Universidad de O’Higgins, Rancagua, Chile
Tamás Schwarcz (2020-2024) – postdoc at LSE, London, UK
Fekadu Gedefa Tolessa (2018-2025) – dean of the College of Natural Sciences, Salale University, Ethiopia

Editorial Boards
Mathematical Programming (2026 – ongoing)
SIAM Journal on Discrete Mathematics (2025 – ongoing)
Discrete Applied Mathematics (2025 – ongoing)

Conference Programme Committees
APPROX 2019, IPCO 2024, MATCH-UP 2024, WALCOM 2025, FCT 2025, MATCH-UP 2026, APPROX 2026, IPCO 2027

Organizing Committees
100 years of Matching Theory in Hungary Workshop 2016, JH Symposium 2017, JH Symposium 2023, Workshop on Matroid-Constrained Optimization Problems 2024, ISMP 2027 stream organizer, Emléktábla Workshops 2022 – ongoing

MTA-ELTE Matroid Optimization Research Group
Head of the MTA-ELTE Momentum Matroid Optimization Research Group. Recent news:

• Weighted equitability and matroid-constrained discrepancy
  September 2, 2026
  The equitability theorem for matroids says that if the ground set of a matroid can be […]
• How far do joins and ears survive beyond graphs?
  September 2, 2026
  Frank’s min–max theorem gives an exact relation between maximum joins and optimal ear decompositions in graphic […]
• Steiner rooted orientations at FOCS 2026
  September 2, 2026
  Our paper Fixed-Parameter Tractability and Hardness for Steiner Rooted and Locally Connected Orientations was accepted to […]
• A hierarchy of edge-weight symmetries in perfect matchings
  April 25, 2026
  Motivated by the exact weight perfect matching problem and recent parameterized algorithms for finding an $\ell$-th […]
• Above-guarantee algorithm for properly colored spanning trees
  April 25, 2026
  In the Properly Colored Spanning Tree problem, we are given an edge-colored undirected graph and the […]
• Principal partition sequences at IPCO
  January 24, 2026
  The year kicked off in the same great way the last one finished: our research group’s […]