Jan Rataj is a Professor at the Faculty of Mathematics and Physics , Charles University , specializing in Integral Geometry , Geometric Measure Theory , and Stochastic Geometry . He has been affiliated with Charles University since 1991 and has held visiting positions at universities in Jena, Karlsruhe, Ulm, and Aarhus. Research interests focus on geometric probability, convex geometry, and measure theory Teaches courses on Measure and Integration Theory , Geometry , and advanced topics in geometric measure theory Scientific contributions include coauthoring 2 monographs and ~50 research papers. His work explores: Random measurable sets and perimeter analysis Stochastic modeling of microstructures Geometric functionals and invariants Applications to spatial statistics and probability theory He supervises PhD students and leads the Seminar of Stochastic Geometry , which examines topics like: Max-stable random fields Convex body reconstruction Point process analysis
Martin Koutecký is an Associate Professor at the Institute of Informatics, Faculty of Mathematics and Physics, Charles University in Prague, Czech Republic. His research primarily focuses on parameterized complexity of integer programming, combinatorial optimization, and computational social choice. He completed his PhD under Petr Kolman at Charles University and conducted postdoctoral research at Technion (Haifa, Israel) under Asaf Levin and Shmuel Onn. Research Interests: Koutecký's work bridges theoretical computer science and optimization, with emphasis on: Designing efficient algorithms for integer programming under structural constraints Applying optimization techniques to computational social choice problems Developing parameterized approaches for combinatorial optimization Exploring geometric perspectives in election modeling and bribery problems Publication Focus: His recent articles (2020-2025) demonstrate consistent work in algorithm design for optimization problems, particularly in integer programming variants and computational social choice. Key themes include block-structured IP, parameterized complexity, election modeling, and convex optimization. Methodological innovations frequently involve polyhedral theory, approximation algorithms, and complexity analysis.
Michal Outrata is an Assistant Professor in the Department of Numerical Mathematics at Charles University's Faculty of Mathematics and Physics in Prague, Czech Republic. He began his position in fall 2024 after completing a postdoctoral fellowship at Virginia Tech with Prof. Eric de Sturler and earning his PhD under Prof. Martin Gander at the University of Geneva, where his thesis was awarded the Henri Fehr Prize in 2023. His academic journey started with undergraduate studies in Prague under Prof. Zdeněk Strakoš (bachelor) and Prof. Miroslav Tůma (master). Dr. Outrata's research focuses on understanding why certain numerical methods work for specific problem classes, with emphasis on numerical linear algebra , Krylov subspace methods , and domain decomposition techniques . His work bridges theoretical analysis with practical algorithm development, particularly in preconditioning strategies for iterative solvers. Current projects include the Primus Research Programme (2025-2028) titled 'Divide, Conquer and Optimize: Domain Decomposition Methods in Scientific Computing' which explores hierarchical matrix formats and mixed precision computations for optimizing domain decomposition methods. His publication record demonstrates consistent contributions to top journals including SIAM Journal on Scientific Computing and Linear Algebra with Applications. His research shows progression from foundational work on GMRES convergence to sophisticated analyses of block Runge-Kutta preconditioners and optimized Schwarz methods with data-sparse transmission conditions. His recent work increasingly integrates hierarchical matrix formats and explores mixed precision computing approaches. Swiss Government Excellence Scholarship (3-year award) Henri Fehr Prize for best PhD thesis in mathematics (2023) Primus Research Programme grant (2025-2028) Dr. Outrata actively mentors students and postdocs, currently supervising Marouan Handa and Lenka Ptáčková (PostDocs) along with undergraduate researchers. He teaches courses including Numerical Analysis and Introduction to Numerical Mathematics at Charles University. His collaborative network spans international institutions including University of Geneva, Virginia Tech, and various European research centers. He is also involved in organizing major conferences including DD29 and GAMM95.
Erin Claire Carson is an Assistant Professor at the Department of Numerical Mathematics, Faculty of Mathematics and Physics, Charles University, Prague. A specialist in numerical linear algebra and high-performance computing, she leads the ERC Starting Grant project InEXASCALE focused on exascale algorithms. Her research explores mixed precision arithmetic, communication-avoiding Krylov subspace methods, and stability analysis in finite precision. Ph.D., University of California, Berkeley (2015) Courant Instructor, New York University (2015-2018) Postdoctoral Researcher and PRIMUS Fellow, Charles University (2018-2022) Dr. Carson's work bridges theoretical analysis with practical implementations for supercomputers. Her recent publications include advancements in low-synchronization orthogonalization, silent error detection, and multilevel sampling techniques. She received the 2025 Wilkinson Prize from SIAM for outstanding contributions to numerical analysis. Current trends in her research involve: Exploiting mixed precision arithmetic for algorithm acceleration Developing stable communication-avoiding Krylov methods Optimizing numerical stability in GPU-based solvers Understanding error propagation in multistage refinements Scientific honors: 2025 SIAM Wilkinson Prize in Numerical Analysis and Scientific Computing 2023 ERC Starting Grant recipient 2019-2022 PRIMUS Research Fellow She supervises PhD and Master’s students while teaching advanced courses in numerical linear algebra and high-performance computing. Her work has been featured in WIRED and Forbes Czech Republic for improving supercomputer algorithms.
Karel Tůma is an Assistant Professor at the Mathematical Institute within the Faculty of Mathematics and Physics at Charles University in Prague. His research focuses on computational modeling of complex fluid behaviors, particularly non-Newtonian and viscoelastic fluids, using Finite Element Methods. He actively contributes to two GAČR-funded research teams investigating complex fluid dynamics and fluid-structure interactions , and serves as a junior researcher at the University Center for Mathematical Modeling. Education RNDr. in Physics (Mathematical and Computational Modeling, 2014) Ph.D. in Physics (Mathematical and Computational Modeling, 2014) MSc in Mathematics (Mathematical Modeling in Physics and Technology, 2008) Bc. in General Mathematics (2006) Research Focus Dr. Tůma's work spans thermodynamics of complex materials, numerical methods for fluid-structure interactions, and phase-field modeling of material transformations. Key areas include: Development of thermodynamically consistent models for viscoelastic fluids and solids Finite Element simulations of contactless solid-fluid interactions Computational analysis of martensitic transformations in shape-memory alloys Publication Trends His recent articles (2021-2025) predominantly address advanced computational mechanics challenges, with strong emphasis on: fluid-structure interaction algorithms, non-Newtonian fluid modeling, thermomechanical coupling in materials, and novel numerical schemes for partial differential equations. Over 70% involve finite element implementations. Research Teams Dr. Tůma collaborates in multiple research groups: Josef Málek's GAČR team (complex fluid behavior) Sebastian Schwarzacher's GAČR team (fluid-structure interactions) University Center for Mathematical Modeling (applied analysis)
Assoc. Prof. Petr Kolman is an academic at the Department of Applied Mathematics , Charles University , where he serves in advisory bodies of the faculty management. His research focuses on theoretical computer science , combinatorial optimization , and graph algorithms , particularly in approximation techniques and network flow problems . He has taught courses such as Linear Algebra 1/2 and Mathematical Programming and Polyhedral Combinatorics . Recent publications highlight his work on spanning tree congestion (2025), length-bounded cuts (2020), and treewidth-based extended formulations (2020). His research spans algorithms , flow theory , and graph modification problems . He maintains contact through kolman@kam.mff.cuni.cz and office hours in Prague Malostranské nám. 2/25, 2nd floor, room S225 .
Libor Barto is a full professor at the Department of Algebra, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic. He is a leading researcher in universal algebra and computational complexity, with a strong focus on constraint satisfaction problems (CSPs) and their algebraic foundations. He leads the ERC Synergy Grant POCOCOP and previously led the ERC Consolidator Grant CoCoSym, and is deeply involved in advancing the algebraic theory of promise constraint satisfaction. Research Interests: His primary research areas include universal algebra, computational complexity, constraint satisfaction problems (CSP), promise constraint satisfaction problems (PCSP), clone theory, and the algebraic approach to logic and computation. He investigates the interplay between algebraic structures and computational tractability, particularly through polymorphisms, minions, and Taylor algebras. The recent articles reflect a strong trend in unifying algebraic approaches to CSP, exploring promise variants, approximation through plurimorphisms, symmetries in structures, and the role of Weisfeiler-Leman hierarchies. His work often appears in top-tier journals and conferences such as the Journal of the ACM, SIAM Journal on Computing, and LICS. Fellow of the Learned Society of the Czech Republic (since 2024) ERC Synergy Grant (POCOCOP, 2023–2029) ERC Consolidator Grant (CoCoSym, 2018–2023) Charles University Research Center (UNCE) Grant (PI, 2024–2029) Libor Barto advises PhD students and leads research teams under major grants like POCOCOP and CoCoSym. He has secured substantial funding from the European Research Council and the Czech Science Foundation (GACR). He is actively involved in the academic community as an editor of Algebra Universalis and Acta Scientiarum Mathematicarum , and has served on program committees for LICS, ICALP, and STACS. He has organized major workshops, including at the Fields Institute and multiple AAA and SSAOS conferences. He is involved in several research labs and collaborative teams, particularly through the Department of Algebra at Charles University, the POCOCOP project (with M. Bodirsky and M. Pinsker), and the CoCoSym ERC team. His work fosters international collaboration with researchers in France, Germany, Austria, Poland, Canada, and the USA.
Zbyněk ŠÍR is an Associate Professor at the Mathematical Institute within the Faculty of Mathematics and Physics at Charles University in Prague . He specializes in Computer-Aided Geometric Design (CAGD) , Differential Geometry , and the History of Geometry , with a focus on Pythagorean Hodograph curves and their applications in geometric modeling. Education: 1989: Graduated from Gymnázium J. K. Tyla, Hradec Králové 1993: DEA (Diplôme d'Études Approfondies) in Algebra and Geometry, University Pierre et Marie Curie (Paris VI) 1995: Master's in Mathematics (Riemannian Geometry, Representation Theory), Charles University 2002: PhD in Mathematics (History of French Geometry), Charles University & Université Pierre et Marie Curie 2012: Habilitation in Mathematics (Geometry and Topology), Charles University His research spans theoretical and applied geometry, including Pythagorean Hodograph curves , rational curves , and historical mathematical texts . Recent work focuses on rotation-minimizing motions , framing motions , and complex quaternions for minimal surfaces. Collaborations with researchers like Carlotta Giannelli, Lucia Sacco, and Bert Jüttler highlight interdisciplinary applications in robotics, aerospace, and computational geometry. ŠÍR teaches courses in Geometric Modeling and Mathematical Education , emphasizing the use of tools like Mathematica for visualizing curves, surfaces, and geometric transformations. His teaching integrates theoretical concepts (e.g., Frenet frames, projective geometry) with practical applications (e.g., CNC manufacturing, 3D reconstruction).
Prof. Zuzana Masáková is a full professor at the Department of Mathematics and Doppler Institute for Mathematical Physics and Applied Mathematics, Faculty of Nuclear Sciences and Physical Engineering, Czech Technical University. Her work bridges non-standard numeration systems, combinatorics on words, aperiodic tilings, and mathematical models of quasicrystals. PhD in Mathematical Engineering (2000), Habilitation in Applied Mathematics (2006), Full Professor (2016) Her research focuses on: Non-standard numeration systems (negative/irrational bases, beta-expansions) Combinatorics on infinite words (palindromes, substitutions, Sturmian sequences) Quasicrystals and aperiodic structures via cut-and-project methods Arithmetic in quasicrystal models and algebraic properties Her recent publications explore self-similarities of quasicrystals, redundancy in Fibonacci-like systems, and antipalindromic morphisms. Notable awards include the Rector's Prize (2004) and NATO Postdoctoral Fellowship (2001). She coordinates grants on numeration systems and aperiodic dynamics, while serving on editorial boards and doctoral school committees. Grants : GA ČR 13-03538S (2013-2017), GA ČR 201/09/0584 (2009-2012) Teaching : Number theory, discrete mathematics, aperiodic structures Membership : Theoretical Informatics Group (TIGR), Editorial boards of Acta Polytechnica and Journal of Discrete Mathematics
Petr Tichý is an Associate Professor at the Department of Numerical Mathematics, Faculty of Mathematics and Physics, Charles University. He specializes in numerical analysis, matrix computations, and Krylov subspace methods. His work focuses on error estimation in iterative methods and the convergence properties of algorithms like the conjugate gradient method. Education: Ph.D. in Scientific Computations, Charles University (2002) M.S. in Computational Mathematics, Charles University (1997) Research Interests: His research emphasizes numerical linear algebra, including matrix approximations, CG algorithm stability, and the development of efficient error estimation techniques. He has contributed to the analysis of block conjugate gradient methods, Gauss-Radau error bounds, and the theoretical foundations of Krylov subspace methods. Publications: Tichý has authored over 30 peer-reviewed articles and a book on error norm estimation in conjugate gradient algorithms. His recent work includes studies on matrix best approximation and the behavior of error estimates in iterative solvers. Awards: Dean's Award for Best Book (2024) Jaroslav Jirsa Prize (2013) Otto Wichterle Prize (2007) Ivo Babuška Prize (2002) Grants & Collaborations: He has led projects funded by GACR and participated in EU initiatives. Collaborators include Gerard Meurant, Vance Faber, and Jörg Liesen.
Pavel Veselý is an Assistant Professor at the Computer Science Institute of the Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic. His research focuses on the design and analysis of efficient algorithms and data structures, particularly in streaming, online, and approximation algorithms, with applications in bioinformatics and data privacy. His research interests include: Streaming algorithms for quantile estimation, geometric problems, and adversarial robustness Online algorithms, especially in scheduling and buffer management Approximation algorithms, including shortest superstrings and their use in genomic data (k-mer sets) Randomized algorithms and algorithmic data privacy His recent work has advanced the state of the art in streaming quantile estimation (KLL sketch), indexed k-mer representations using masked superstrings, and streaming facility location in high dimensions. His publications appear in top venues such as FOCS, STOC, PODS, and SODA. Notable scientific awards include: Best Paper Award at PODS 2021 2022 ACM SIGMOD Research Highlight Award Supervision of award-winning student theses, including Dean’s Award and Czech-Slovak competition wins He actively advises students, including PhD and master’s level researchers, and leads a research group focused on data sketches and streaming algorithms. He has taught courses such as Algorithmic Data Privacy, Randomized Algorithms, and Streaming Algorithms, and previously served as a postdoc at the University of Warwick under Graham Cormode.
Tomáš Vojnar is a Professor at the Department of Intelligent Systems, Faculty of Information Technology, Brno University of Technology (FIT BUT), Czech Republic. He has been a faculty member since 1999, promoted to Associate Professor in 2007 and full Professor in 2012. He leads the VeriFIT research group and has extensive experience in academic leadership, including candidacy for Dean of FIT BUT in 2023 and chairing major conferences such as TACAS'19 and SV-COMP 2018. Research Interests: Static and dynamic analysis of programs, especially those with pointers and dynamic data structures Formal verification of concurrent and infinite-state systems Automata-theoretic and logical methods in verification Binary code analysis and performance analysis His recent publications show a strong trend in developing and applying static analysis tools for verifying memory safety, concurrency, and semantic equivalence in C programs. He has made significant contributions to tools like Predator, 2LS, and DiffKemp, which are widely used in the verification community and have achieved top rankings in international competitions such as SV-COMP. His work bridges theoretical foundations in automata and logic with practical software verification applications. Scientific Awards: Best theory paper award of ETAPS'10 (EATCS) Best paper awards at CADE'19 and CIAA'08 Best tool paper awards at ISSTA'18 and RV'12 Multiple gold, silver, and bronze medals in SV-COMP (Predator, 2LS, Symbiotic) Bronze Humies award for automated design of approximate circuits Gödel prize from FLoC 2014 Olympic Games 1 gold and 3 silver medals at SL-COMP'14 Siemens prize for outstanding PhD thesis (2001) Advising and Grants: He has supervised numerous PhD and Master's students who have contributed to major verification tools and publications. He has been actively involved in national and international research projects, including the Czech Science Foundation panel P103 (2019–2023), and has secured funding for research in formal methods and software verification. His collaborations span institutions in France (LIAFA, CNRS), Austria (TU Vienna), and beyond. Labs and Teams: He leads the VeriFIT research group at FIT BUT, which focuses on formal methods and software verification. The group develops state-of-the-art tools such as Predator (shape analysis), 2LS (heap verification), DiffKemp (semantic diffing), and others used in both academia and industry. The team actively participates in international verification competitions and collaborates with researchers worldwide.
Iveta Hnetynkova is an Associate Professor at the Department of Numerical Mathematics, Faculty of Mathematics and Physics, Charles University in Prague. She specializes in numerical linear algebra, inverse problems, and regularization methods, with applications in image processing and scientific computing. Education: Doctor of Natural Sciences (RNDr.) from Charles University (2003) Ph.D. in Scientific Computations from Charles University (2006) Habilitation thesis on error-contaminated linear approximation (2019) Research Interests: Krylov subspace methods Total Least Squares (TLS) formulations Noise revealing in discrete inverse problems Tensor generalizations and structured matrices Applications in image processing and jewelry defect analysis Scientific Awards: Visegrad Group Young Researcher Award (2014) J. Jirsa Prize for textbook excellence (2013) I. Babuska Prize (2nd place) (2007) SVOČ Prize in mathematics (2003)
Jiří Klimeš is an Associate Professor at the Faculty of Mathematics and Physics , Charles University , Prague, where he leads the APES group in the Department of Chemical Physics and Optics . He is the Principal Investigator of the ERC-funded project APES: Accuracy and precision for molecular solids . His expertise lies at the intersection of quantum chemistry, materials science, and computational physics. Education & Career: PhD in Theoretical Chemistry, University College London (UCL) , with Prof. Angelos Michaelides Post-doctoral research, University of Vienna , with Prof. Georg Kresse Marie Skłodowska-Curie Fellow, Heyrovsky Institute of Physical Chemistry , Prague Research Interests: Development of highly-accurate, low-scaling quantum-chemical methods (RPA, GW, MP2) Non-covalent interactions and van der Waals forces in molecular solids, surfaces, and confined systems Crystal-structure prediction and polymorphism of molecular crystals Adsorption on porous and layered materials (zeolites, graphene, TMDCs) Phase transitions and freezing of confined water Machine-learned potentials for molecular interactions Scientific Awards & Funding: European Research Council (ERC) Starting Grant APES (2020–2025) Marie Skłodowska-Curie Individual Fellowship, European Commission Supervision & Teaching: Current PhD students: Kyrylo Prokofiev, Pham Ngoc Khanh Former PhD student: Jaroslav Hofierka (MSc 2017 → PhD 2019) Post-doctoral researchers: Dr. Sirous Yourdkhani (current), Dr. Marcin M. Modrzejewski, Dr. Lu Ding (former) Lecture courses: Ab-initio methods for periodic systems , Introduction to quantum mechanics , Basics of quantum mechanics tutorials Labs & Facilities: The APES group operates a dedicated high-performance computing cluster funded by the ERC project, enabling routine RPA and GW calculations on systems with hundreds of atoms.
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.
