Gabor Tardos

Gábor Tardos is a Research Professor at the Alfréd Rényi Institute of Mathematics, part of the Hungarian Academy of Sciences. He has held academic positions including Professorships at Central European University (2010–2020) and Eötvös University (1992–2003), and visiting roles at institutions like the Institute for Advanced Study (1996–97) and the University of Chicago. His research focuses on combinatorics, discrete and computational geometry, and complexity theory, with significant contributions to graph theory, Ramsey problems, and extremal combinatorics.

Education:

• Diploma in Mathematics, Eötvös University, 1987.
• Ph.D. in Mathematics, Eötvös University, 1988 (thesis on universal algebra).
• Doctor of the Hungarian Academy of Sciences, 2005.

Research Interests: Combining theoretical depth with algorithmic applications, Tardos explores combinatorics (including extremal graph theory and Ramsey theory), discrete geometry (geometric graphs, arrangements), and computational complexity (algorithm design, lower bounds). His work often bridges abstract combinatorial structures with practical computational challenges.

Recent Publications Trends: His recent work emphasizes edge-ordered graphs, extremal functions for forbidden matrices, and geometric applications like necklace cuts and grasshopper problems. These studies advance theoretical foundations while addressing algorithmic efficiency and structural limits in discrete systems.

Awards:

• 2022 ERC Advanced Grant, 2020 Gödel Prize, 2019 Corresponding Member of Hungarian Academy of Sciences.
• 2018 Invited Speaker at ICM, 1999 Erdős Prize, and 1988 G. Grünwald Prize.

Grants and Labs: Leading projects funded by the European Research Council and Canadian Research Chairs, focusing on geometric and algorithmic combinatorics. Collaborations span international teams addressing foundational questions in discrete mathematics.

Future Works: Ongoing research includes extremal edge-ordered graph functions, Ramsey-type problems, and applications of combinatorial methods in theoretical computer science.