Assoc. Prof. Petr Gregor is a faculty member at the Department of Theoretical Computer Science and Mathematical Logic , Faculty of Mathematics and Physics , Charles University in Prague . His research focuses on algorithmic and structural problems in interconnection networks, leveraging tools from extremal combinatorics, graph theory, and coding theory. Research Interests : Interconnection networks, Gray codes, hypercube structures, symmetric graph decomposition, fault-tolerant combinatorial algorithms. Teaching : Offers courses in propositional/predicate logic, computational complexity, hypercube structures, automata theory, and data structures. Awards : Best paper award at MFCS 2022 . Contact : Petr.Gregor@mff.cuni.cz | gregor@ktiml.mff.cuni.cz | Personal Website
Václav Chvátal is a Professor at the Faculty of Mathematics and Physics , Charles University , affiliated with the Department of Applied Mathematics . His work focuses on foundational areas of applied mathematics, including combinatorial optimization, graph theory, and algorithmic problem-solving. Email : chvatal@kam.mff.cuni.cz His research interests span topics such as discrete mathematics , computational complexity , and theoretical computer science , with applications in algorithm design and mathematical modeling. Though no specific publications or awards are listed here, his academic profile reflects contributions to mathematical theory and education.
Mykhaylo Tyomkyn is an Associate Professor at the Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University in Prague. His research focuses on extremal and probabilistic combinatorics. He teaches courses such as Probability and Statistics 1 and Probabilistic Techniques at Charles University. University: Charles University School: Faculty of Mathematics and Physics Department: Department of Applied Mathematics Email: tyomkyn@kam.mff.cuni.cz Research His work centers on extremal combinatorics, probabilistic methods in discrete mathematics, and applications in theoretical computer science. Key research areas include Ramsey theory, graph theory, and randomized algorithms. Teaching Probability and Statistics 1 (Summer 2025) Probabilistic Techniques (Winter 2024) Contact Postal Address: Charles University Faculty of Mathematics and Physics Department of Applied Mathematics Malostranské nám. 25 118 00 Praha 1 Czech Republic
Prof. Michal Koucký is a faculty member at the Institute of Informatics, Faculty of Mathematics and Physics, Charles University in Prague. His research focuses on theoretical computer science, particularly computational complexity, data structures, algorithms, and combinatorics. He leads significant research projects including EPAC (supported by GA CR) and LBCAD (funded by ERC). His educational background includes a Ph.D. from Rutgers University (2003) and a Master's degree from Charles University (1998). Prof. Koucký's research spans multiple areas of theoretical computer science with emphasis on computational complexity , data structures , algorithms , and combinatorics . His work explores fundamental questions about computational efficiency, lower bounds, and algorithmic techniques. He has made significant contributions to edit distance algorithms, string processing, and circuit complexity. His research often bridges theoretical foundations with practical algorithmic applications, particularly in areas like dynamic data structures and approximation algorithms. An analysis of his recent publications (2019-2024) reveals a strong focus on string algorithms, particularly edit distance problems. His work develops novel approximation techniques, sketching methods, and sublinear-time algorithms for pattern matching. There's also significant work on data structure lower bounds and connections to popular complexity conjectures. His research demonstrates a consistent pattern of tackling fundamental problems with innovative approaches that push theoretical boundaries while maintaining practical relevance. Antonin Svoboda award for best dissertation in 2014 (awarded to Jan Bulánek) Best paper award at SAGT 2016 for 'The Big Match in Small Space' Best paper award at FOCS 2018 for 'Approximating Edit Distance Within Constant Factor in Truly Sub-Quadratic Time' He has successfully advised numerous graduate students including Pavel Dvořák, Karel Král, Debarati Das, and Jan Bulánek who have gone on to positions at prestigious institutions like Bristol, Google (Zurich), and Penn State. His research is supported by significant grants including the EPAC project (GA CR) and LBCAD project (ERC), demonstrating the impact and relevance of his work in theoretical computer science. Prof. Koucký is an active member of the theoretical computer science community, regularly presenting at major conferences including STOC, FOCS, ICALP, and SODA. His work often involves collaborations with researchers from institutions worldwide, contributing to a vibrant research environment at Charles University's Institute of Informatics.
Assoc. Prof. Robert Šámal is affiliated with the Institute of Informatics at the Faculty of Mathematics and Physics of Charles University in Prague, Czech Republic. His primary role involves academic research and teaching within theoretical computer science and mathematics. Research interests include Discrete Mathematics , Combinatorics , Graph Theory , and Algorithmic Complexity , areas central to theoretical computation and mathematical structures. Contact details: Email - Robert.Samal@mff.cuni.cz. Office located in room S 323, 3rd floor, Lesser Town, Malostranské nám. 2/25, Prague 1.
Prof. Zdeněk Dvořák serves as a Professor at the Institute of Informatics within the Faculty of Mathematics and Physics at Charles University, Prague. His academic work is centered at the Institute for Theoretical Computer Science (IUUK), with an office located in room S 220 on the 2nd floor in the historic Lesser Town district (Malostranské nám. 2/25, Prague 1). Contact details include phone 95155 4390 and email Zdenek.Dvorak@mff.cuni.cz. Professor Dvořák's research focuses on Theoretical Computer Science, specializing in Graph Theory and Algorithms as evidenced by his affiliation with IUUK. His work explores structural graph properties, combinatorial optimization, and discrete mathematics, contributing to foundational advancements in algorithmic theory and computational complexity. He actively supervises student research projects and theses, as indicated by the "Supervised work" section on his profile. Teaching responsibilities include course instruction and examinations, with schedules and exam dates available through university channels. His academic homepage at https://iuuk.mff.cuni.cz/~rakdver/ provides comprehensive details on his scholarly activities.
Prof. Vojtěch Rödl serves as a Professor at the Institute of Informatics, Charles University in Prague, Czech Republic. His office is located in room S 220 on the 2nd floor at Malostranské nám. 2/25 in the historic Lesser Town district (Prague 1), reflecting his active institutional presence within one of Europe's oldest academic centers. His research spans foundational areas of computer science and mathematics, with emphasis on: Theoretical Computer Science Discrete Mathematics Combinatorics Graph Theory Algorithmic Design Computational Complexity These disciplines form the mathematical backbone of modern computing, addressing structural problems in data organization, network analysis, and optimization. His work in combinatorics particularly explores extremal set systems and probabilistic methods, contributing to theoretical frameworks that underpin cryptographic systems and distributed computing architectures. Prof. Rödl maintains academic engagement through the Institute of Informatics, though specific advising activities or collaborative projects are not detailed in the source text. His institutional role encompasses teaching, research supervision, and participation in the university's scholarly ecosystem, centered in Prague's academic quarter near Charles Bridge.
Martin Klazar is an Associate Professor at the Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University. He has been affiliated with the university since 1995, initially as an assistant professor before becoming an associate professor in 2004. Since 2000, he has also worked at the Institute for Theoretical Computer Science (ITI). His education includes a Ph.D. (1995) under Jiří Nesetril at Charles University, following undergraduate studies at the same institution (1984–1989). Klazar's research spans multiple areas of discrete mathematics, with primary interests in enumerative and extremal combinatorics, number theory, power series, generating functions, and elementary mathematical analysis. His work frequently bridges combinatorial methods with analytic techniques, particularly in asymptotic enumeration and extremal problems. His publications demonstrate a strong focus on combinatorial structures (permutations, set partitions, matchings), graph theory algorithms, and combinatorial number theory. Recent trends include applications of combinatorial duality, growth rate classification of discrete structures, and interdisciplinary topics linking physics-inspired models (e.g., Potts model) with graph invariants. Honors include the Alexander von Humboldt Stiftung fellowship (1997/98) and a prize from the Rector of Charles University for co-editing the book Topics in Discrete Mathematics . He has supervised Ph.D. students including Vít Jelínek and Jaroslav Hančl. Klazar contributes to the ITI research group, focusing on theoretical computer science and combinatorial mathematics. His current teaching includes courses in mathematical analysis, combinatorial counting, and number theory.
Pavel Flegontov, Ph.D. is a researcher at the Department of Biology and Ecology within the Faculty of Science at the University of Ostrava. He specializes in population genetics, archaeogenetics, and genomic analysis with a particular focus on human evolutionary history across Eurasia and Southeast Asia. His research integrates ancient DNA analysis with computational methods to reconstruct population histories and migration patterns. Dr. Flegontov's primary research interests center on population genetics and human evolutionary history, with significant contributions to understanding the genetic history of Eurasian and Southeast Asian populations. His work employs advanced statistical methods including f-statistics and qpAdm modeling to analyze genetic admixture events. He has made important contributions to studies of Indo-European origins, Kra-Dai speakers in Thailand, and South Asian genetic influences in Southeast Asia, demonstrating expertise in connecting genetic data with historical and linguistic evidence. His publication record shows a strong trend toward increasingly sophisticated methods for analyzing complex population histories, with recent work focusing on methodological limitations and improvements in genetic admixture analysis. His research spans both human population genetics and marine microbial ecology, reflecting interdisciplinary approaches to evolutionary questions. The consistent publication in high-impact journals like Nature, Science, and PLOS Genetics demonstrates significant contributions to the field. Dr. Flegontov serves as principal investigator for multiple research grants, including projects funded by the Czech Science Foundation (GA ČR) and the Czech Academy of Sciences (GA AV). His current projects include "Archeogenetic perspective on the spread of Slavs in the first millennium AD" (2025-2027) and previously led "Genomic formation of Indo-Europeans: new approaches to modeling genetic admixture guided by simulated data" (2021-2024). He has also collaborated with Harvard University on subcontract research agreements. He teaches courses in genome analysis (WGEAN, 7GEAN, 8GEAN) and has supervised doctoral research, including Nefize Ezgi Altinişik's 2019 dissertation on the connection between America and Eurasia: Population history of people in the American Arctic. His work demonstrates strong mentorship in training the next generation of population geneticists.
Petr Hliněný is a Professor at the Faculty of Informatics, Masaryk University in Brno, Czech Republic, where he also serves as the Vice-dean for research, development, and doctoral studies. He is affiliated with the Department of Computer Science and leads the Discrete Methods and Algorithms (DIMEA) research group. His research interests span Graph Theory , Discrete Mathematics , Theoretical Computer Science , with a focus on structural and topological graph theory, parameterized complexity, logic in computer science, twin-width, crossing numbers, and discrete geometry. His recent work includes structural results on planar graphs, visibility graphs, and logical aspects of graph classes. His recent publications exhibit a strong trend in analyzing structural width parameters such as twin-width and clique-width, their logical transductions, and algorithmic implications. He has published extensively on planar graphs, crossing numbers, and geometric graphs, often in top venues like European Journal of Combinatorics , Journal of Combinatorial Theory , and LIPIcs conference proceedings. Professor, Faculty of Informatics, Masaryk University Vice-dean for Research, Development and Doctoral Studies Head of DIMEA Research Group Guarantor of Doctoral Study Programme in Computer Science He actively supervises PhD and master’s students, including current doctoral candidates Filip Pokrývka, Shubhang Mittal, Jakub Balabán, and Jan Jedelský. He has led multiple research grants funded by the Czech Science Foundation (GAČR), including project 20-04567S on tractable instances of hard graph algorithmic problems. He also organizes seminars such as IV119 and IV131, and offers thesis topics in discrete mathematical methods.
