Kristóf BércziView profile
Researcher
Kristóf Bérczi is a researcher at the Department of Operations Research, Eötvös Loránd University, Hungary. His work intersects computer science, mathematics, and operations research, focusing on theoretical and applied optimization problems. MSc and PhD in Operations Research, ELTE Postdoc at Hungarian Academy of Sciences Research Interests: Approximation algorithms Combinatorial optimization Matroid theory Submodular functions Algorithmic game theory Graph theory Recent Publication Trends: His 2024-2025 work explores matroid-constrained partitioning, inverse optimization algorithms, rainbow subgraph problems, and envy-free pricing models, often combining matroid theory with practical algorithm design. Scientific Contributions: Active in program committees (APPROX 2019, IPCO 2024, WALCOM 2025) Organized workshops on matroid optimization and matching theory Editorial board member of SIAM Journal on Discrete Mathematics Mentorship: Supervises PhD students Áron Jánosik, András Imolay, and others, with graduates now in postdoc/lecturer positions at institutions like CMM Chile and LSE UK.