kristof.berczi@ttk.elte.hu
Pázmány Péter sétány 1/C
Budapest 1117, Hungary

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ány University, Budapest
Postdoc, Hungarian Academy of Sciences

Teaching
Directed reading program, for BSM students
Matroid theory (Mon 10:15-11:45, Room 3.517)
Graph theory (Mon 12:00-13:30, Room 3.517)
Deep learning (lecture Thu 14:00-15:30, problem-solving class Thu 15:45-16:30, Room 7.206)

PhD students
Á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
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

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:

  • Principal partition sequences at IPCO
    The year kicked off in the same great way the last one finished: our research group’s […]
  • Goodbye 2025, Hello 2026!
    The end of 2025 has been very successful for the research group in terms of publications: […]
  • Generalizing the Multiple Exchange Property
    The multiple exchange property for matroid bases states that for any bases $A$ and $B$ of […]
  • Free-order secretary
    The Matroid Secretary Problem is a central question in online optimization, modeling sequential decision-making under combinatorial […]
  • Steiner rooted orientations
    Finding a Steiner strongly $k$-arc-connected orientation is particularly relevant in network design and reliability, as it […]
  • Principal partition sequences
    Narayanan and Fujishige showed the existence of the principal partition sequence of a submodular function, a […]