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
Continuous optimization, Lecture, Thu 8:30 – 10:00 (Room 3.517)
Continuous optimization, Practicals, Thu 10:15 – 11:45 (Room 3.517)
PhD students
András Imolay (expected Dec 2027)
Lydia Mirabel Mendoza Cadena (2020-2025) – currently postdoc at CMM, Santiago, Chile
Tamás Schwarcz (2020-2024) – currently postdoc at LSE, London, UK
Fekadu Gedefa Tolessa (2018-2025) – currently lecturer at Salale University, Addis Ababa, Ethiopia
Editorial Boards
SIAM Journal on Discrete Mathematics
Conference Programme Committees
APPROX 2019, IPCO 2024, MATCH-UP 2024, WALCOM 2025, FCT 2025
Organizing Committees
100 years of Matching Theory in Hungary Workshop 2016, JH Symposium 2017, JH Symposium 2023, Workshop on Matroid-Constrained Optimization Problems 2024, Emléktábla Workshops 2022-ongoing
MTA-ELTE Matroid Optimization Research Group
Head of the MTA-ELTE Momentum Matroid Optimization Research Group. Recent news:
- Our paper on Matroid secretary via labeling schemes was accepted at IPCO! In this work, we […]
- The research group wrapped up 2024 with some great achievements. Tibor Jordán was awarded the prestigious […]
- The famous Ryser – Brualdi – Stein conjecture asserts that every $n\times n$ Latin square contains […]
- The Matroid Secretary Problem (MSP) is one of the most prominent settings for online resource allocation […]
- Several postdoc positions are available in Budapest in various research groups in discrete mathematics and probability […]
- The study of matroid products traces back to the 1970s, when Lovász and Mason studied the […]