جست‌وجوی استاد و پژوهشگر

Jaroslav Hronمشاهده پروفایل

دانشیار

• Fluid Mechanics
• Biomechanics
• Numerical Analysis
• +۳ مورد دیگر

Dr. Jaroslav Hron is an Associate Professor at the Department of Numerical Mathematics within the Faculty of Mathematics and Physics at Charles University in Prague, Czech Republic. His primary research focuses on fluid mechanics, biomechanics, and numerical analysis, with particular expertise in fluid-structure interaction problems and their applications to cardiovascular mechanics. Dr. Hron's research interests span fluid mechanics, biomechanics, numerical analysis, and computational mathematics. His work primarily investigates fluid-structure interaction problems, particularly as they apply to cardiovascular mechanics and hemodynamics. He has made significant contributions to the understanding of non-Newtonian fluids, pressure-dependent viscosities, and the development of advanced numerical methods for solving complex fluid flow problems. His research often bridges the gap between theoretical mathematics and practical applications in biomedical engineering. Analysis of his recent publications reveals a strong focus on cardiovascular applications, particularly in determining pressure data from velocity measurements and modeling blood flow in complex geometries. His work demonstrates a consistent progression from theoretical considerations to practical applications in biomechanics, with increasing emphasis on computational methods for fluid-structure interaction problems. The research shows interdisciplinary collaboration across mathematics, engineering, and medical fields. Dr. Hron has been actively involved in academic advising and research supervision, contributing to the development of computational methods in fluid mechanics. His work has established important benchmarks in fluid-structure interaction simulation, particularly in hemodynamic applications. His laboratory work primarily focuses on computational fluid dynamics and fluid-structure interaction, with applications to cardiovascular mechanics. He has developed and refined numerical methods for simulating complex fluid behaviors, particularly those relevant to biological systems.

• Boolean Functions
• Horn Formulas
• Computational Complexity
• +۷ مورد دیگر

Ondřej Čepek is an Associate Professor at the Department of Theoretical Computer Science and Mathematical Logic, Faculty of Mathematics and Physics, Charles University in Prague. His academic career spans several decades with numerous publications demonstrating his expertise in theoretical computer science, particularly in Boolean logic, computational complexity, and operations research. Čepek's research primarily focuses on Boolean functions, Horn formulas, and computational complexity. His work explores structural properties of logical constructs, minimization techniques, and applications in knowledge representation. He has made significant contributions to understanding satisfiability testing complexity, CNF minimization, and Boolean function representations using interval structures. His research also extends to scheduling problems, particularly just-in-time scheduling with periodic time slots, where he has developed efficient algorithms for multislot scheduling on identical parallel machines and nonpreemptive flowshop scheduling with machine dominance. Analysis of his recent publications reveals a consistent research trajectory from theoretical foundations to practical applications. His work demonstrates expertise in tractable classes of Boolean formulas, knowledge compilation techniques, and the relationship between computational complexity and logical representations. The recurring themes include efficient representations for logical formulas, characterization of tractable problem classes, and development of optimization algorithms for discrete structures. His collaborations with researchers like Petr Kučera, Roman Barták, and Endre Boros have produced influential work in constraint programming and artificial intelligence. Distinguished Paper Award at CP2004 for 'Unary resource constraint with optional activities' While specific details about his advising activities are not provided in available sources, his extensive publication record spanning from 1989 to 2017 suggests substantial involvement in academic mentoring. His numerous collaborations both within Charles University and internationally indicate an active role in the academic community. His research has practical applications in knowledge-based systems, constraint satisfaction problems, and artificial intelligence. Čepek maintains an active research profile with publications continuing through 2017. His recent work has focused on knowledge compilation techniques, recognition of tractable DNFs, and the complexity of CNF minimization. He has also explored applications of Boolean techniques to DNA microarray data analysis, demonstrating the interdisciplinary nature of his research.

Pavel Cejnarمشاهده پروفایل

استاد

• Quantum Theory
• Quantum Chaos
• Quantum Phase Transitions
• +۳ مورد دیگر

Pavel Cejnar is a Professor at the Institute of Particle and Nuclear Physics, Faculty of Mathematics and Physics, Charles University in Prague. He has been a full professor since 2012, following his appointment as an associate professor in 2004 and assistant professor in 1995. His research focuses on quantum theory, particularly quantum phase transitions, quantum chaos, and nuclear structure models as laboratories for studying quantum phenomena. Cejnar received his Master's degree in nuclear physics from Charles University in 1988, his Ph.D. in 1995 with a thesis on "statistical modelling of nuclear processes," and his Doctor of Science (DSc.) in 2010. He has held research positions at several international institutions including the University of Fribourg, Yale University, Michigan State University, University of Stellenbosch, University of Cologne, and the European Center for Theoretical Studies in Nuclear Physics in Trento. His research interests span quantum chaos, quantum phase transitions, quantum entanglement, and quantum computing. He views nuclear-structure models as ideal laboratories for studying quantum effects. His work has significant implications for understanding fundamental quantum phenomena in many-body systems. Professor Cejnar's publications show a strong focus on excited-state quantum phase transitions, with numerous papers exploring the connections between quantum criticality, quantum dynamics, and many-body physics. His recent work has delved into quantum geometry, open quantum systems, and the application of quantum phase transitions to quantum information processing. Among his notable scientific contributions are the development of theoretical frameworks for understanding quantum phase transitions in nuclear models and their extensions to other quantum systems. His work bridges nuclear physics with broader quantum physics concepts. Cejnar has supervised numerous students at various levels, from bachelor's theses to PhD dissertations, with research topics centered around quantum phase transitions, quantum chaos, and quantum information. He is also actively involved in teaching quantum mechanics and related topics to both physics students and non-specialists. He has contributed significantly to science popularization, including co-authoring the book "Einstein again in Prague" and developing the "Physics as an Adventure of Knowledge" course, which introduces key concepts of modern physics to bachelor's students.

Martin Balkoمشاهده پروفایل

دانشیار

• Graph Theory
• Classical Combinatorics
• Ramsey Theory
• +۱ مورد دیگر

Martin Balko is an Associate Professor at the Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University in Prague. He previously held postdoctoral positions at Ben Gurion University of the Negev (2017–2018) and the Alfréd Rényi Institute of Mathematics (2016–2017). His research focuses on graph theory, classical combinatorics, Ramsey theory, and combinatorial geometry. His recent work explores topics such as Ramsey numbers of ordered graphs and hypergraphs, geometric graph representations, and extremal problems in discrete geometry. He has contributed to advancements in probabilistic methods for random point sets and combinatorial characterizations of graph drawings. Best paper award at the 23rd International Symposium on Graph Drawing & Network Visualization (GD 2015) He teaches courses including Algorithmic Game Theory and Geometric Seminar, emphasizing computational geometry and combinatorics. He is actively involved in supervising student presentations and mentoring in discrete mathematics.

Vladimír Plickaمشاهده پروفایل

پژوهشگر

• Earthquake location
• Empirical Green's function modeling
• Finite-extent seismic sources
• +۲ مورد دیگر

Dr. Vladimír Plicka is a research geophysicist at the Department of Geophysics , Faculty of Mathematics and Physics, Charles University in Prague. Since 1999, he has been responsible for seismic station operations in Prague and Greece. His research focuses on earthquake source characterization , seismic wave propagation , and crustal deformation analysis using empirical Green's functions and waveform inversion techniques. PhD in Geophysics (2003, Charles University) Coordinated multinational projects: CzechGeo/EPOS (2016-2019), MOBILITY (2012-2013), Greece geodesy (2007-2009) Key research areas include: Earthquake location with P/S arrival time inversion Finite-source modeling using Empirical Green's Functions Strong motion simulation for seismic hazard assessment Crustal velocity structure from neighborhood algorithm inversions Hybrid seismic simulation combining deterministic and stochastic methods His recent publications show expertise in: Marmara and Hellenic slab intermediate-depth earthquakes Corinth Rift seismic sequence analysis 3D-to-1D crustal model conversion for seismic monitoring North Korea nuclear test source modeling He has developed: Fortran/Matlab tools for source parameter inversion GMT-compatible visualization scripts NonLinLoc uncertainty analysis software

Martin Kouteckýمشاهده پروفایل

دانشیار

• Parameterized Complexity
• Integer Programming
• Combinatorial Optimization
• +۱ مورد دیگر

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.

Petr Navrátilمشاهده پروفایل

استادیار

• Control Systems
• Adaptive Control
• Recursive Estimation
• +۳ مورد دیگر

Institute of Process Management, Faculty of Applied Informatics at Tomas Bata University in Zlín. Petr Navrátil, Ph.D., is an Assistant Professor whose work bridges theoretical and applied control systems research. He holds a Ph.D. from Tomas Bata University in Zlín (2007) and an M.Sc. from Brno University of Technology (2001). A three-month internship at the University of Applied Science Cologne (2003) enriched his expertise in process engineering and control systems. Petr's research spans adaptive control , recursive identification , Delta model , and MIMO systems . His publications (2003-2016) focus on real-time control of laboratory models, optosensor applications, and environmental factors in measurement accuracy. Collaborations with colleagues like Vladimir Bobál and Ján Ivanka highlight his team-based approach to solving complex control problems, including TITO and three-tank systems. His work with MATLAB/Simulink libraries for recursive algorithms and applications in commercial security (light/laser protection systems) underscores his commitment to practical, industry-relevant solutions. The Institute of Process Control at Tomas Bata University serves as his primary research environment, where he develops tools and frameworks for both educational and industrial applications.

Libor Bartoمشاهده پروفایل

استاد

• Universal Algebra
• Computational Complexity
• Constraint Satisfaction Problems
• +۶ مورد دیگر

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.

Erin Claire Carsonمشاهده پروفایل

استادیار

• Numerical Linear Algebra
• Parallel Computing
• High-Performance Computing
• +۷ مورد دیگر

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.

Martin Loeblمشاهده پروفایل

استاد

• Discrete Mathematics
• Graph Theory
• Combinatorial Optimization
• +۱۰ مورد دیگر

Professor Martin Loebl is a distinguished academic at the Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University in Prague. His extensive teaching portfolio includes Discrete and Continuous Optimization, Linear Programming, Nonlinear Optimization, Game Theory for intelligent networks, and Linear Algebra. His office is located in room S 325 on the 3rd floor in Lesser Town, Malostranské nám. 2/25, Prague 1. Loebl's research spans the breadth of discrete mathematics with particular emphasis on graph theory, combinatorial optimization, and applications to statistical physics. His work bridges theoretical mathematics with practical applications in network optimization, market equilibria, and critical distribution systems. He has made significant contributions to Kasteleyn theory, dimer models, Ising model applications, matroid theory, and matching theory. Analysis of his recent publications reveals a strong focus on the intersection of discrete mathematics with economic and social systems. His work increasingly addresses real-world challenges such as resource allocation during crises, market design, and fair division problems. The publications demonstrate sophisticated applications of graph theory and combinatorial optimization to game-theoretic models and distribution systems, with growing emphasis on practical implementations of theoretical frameworks. Scientific Awards: Prize of Rector of Charles University for the book 'Topics in Discrete Mathematics: Dedicated to Jarik Nešetřil on the Occasion of his 60th birthday' Professor Loebl coordinates the H2020-MSCA-RISE-2018 project 'Combinatorial Structures and Processes (CoSP)' and previously coordinated the Czech Ministry of Interior's 'Critical Distribution System (CRISDIS)' project motivated by the COVID-19 pandemic. His research has practical applications in winter road maintenance routing, market equilibria design, and critical goods distribution systems. He maintains an active research laboratory focused on discrete mathematics applications, with particular emphasis on translating theoretical results into practical algorithms for optimization problems in network design, resource allocation, and market mechanisms. His group has produced significant work on dimer models, Kasteleyn orientations, and their applications to statistical physics problems.

• Mathematics
• Discrete Mathematics
• Graph Theory
• +۳ مورد دیگر

Jan Kratochvíl is a Professor at the Department of Applied Mathematics within the Faculty of Mathematics and Physics at Charles University in Prague. His contact information includes the email honza@kam.mff.cuni.cz and his office is located in room S 226 on the 2nd floor of the building at Malostranské nám. 2/25, Prague 1. His research focuses on applied mathematics, with particular emphasis on discrete mathematics, graph theory, combinatorics, algorithms, and computational complexity. These fields reflect his contributions to theoretical computer science and mathematical problem-solving.

Petr Jancarمشاهده پروفایل

استاد

• Theoretical Computer Science
• Language and Automata Theory
• Computability and Complexity Theory
• +۴ مورد دیگر

Petr Jancar is a Professor at the Department of Informatics, Faculty of Science, Palacký University in Olomouc. He has previously held academic positions at VŠB-Technical University of Ostrava and the University of Ostrava. His research is centered in theoretical computer science, with deep contributions to automata theory, Petri nets, system verification, and computational complexity. Education RNDr, Theoretical Cybernetics and Mathematical Informatics, Faculty of Mathematics and Physics, Charles University, Prague (1982) CSc. (PhD equivalent), Dissertation: "Questions of Decidability of Dynamic Properties of Petri Nets", Charles University (1989) Appointed Associate Professor in Informatics, Faculty of Informatics, Masaryk University (1996) Appointed Professor in Informatics, VŠB-TU Ostrava (2008) His primary research interests include theoretical computer science , focusing on language and automata theory, computability and complexity, algorithm theory, and mathematical logic. A significant portion of his work addresses system verification , particularly using Petri nets and infinite-state systems. He investigates fundamental questions of bisimilarity, equivalence checking, decidability, and complexity in models like pushdown and one-counter automata. Jancar's recent publications (2020–2025) show a strong trend in advancing the theory of Petri nets, especially structural liveness, reachability, and home-space problems, often establishing high complexity bounds (e.g., Ackermann-complete). His work combines deep theoretical insight with formal rigor, frequently published in top venues like LICS, CONCUR, and LogMethCS. He has long-standing collaborations with researchers such as Jérôme Leroux, Zdeněk Sawa, and Antonín Kučera. Scientific Service and Recognition Member, Editorial Board, Information and Computation (since 2015) Member, Scientific Councils at Masaryk University, VŠB-TU Ostrava, Palacký University, and Brno University of Technology Chairman, GAČR Panel P202 Informatics (2015–2017) Member, Program Committees of major international conferences He has been a co-investigator and researcher on multiple GAČR projects, including those on algorithms for infinite-state systems, computational complexity of verification, and modeling of parallel systems. He has also participated in the Center for Applied Cybernetics. He has held research stays supported by grants in Germany, France, Sweden, and the UK. Laboratories and Research Groups His work is closely associated with formal methods and verification research groups at Palacký University and former affiliations. He has contributed to collaborative projects involving MPI verification and infinite-state system analysis.

• Syntax
• Morphology
• Typology
• +۳ مورد دیگر

Pavel Caha is an Associate Professor at the Department of Czech Language, Faculty of Arts, Masaryk University, where he also serves as Vice-Dean for Research and Project Activities. His academic career spans theoretical linguistics with a focus on syntax and morphology, particularly within the Nanosyntax framework. Dr. Caha received his PhD from CASTL in Tromsø. His educational background has prepared him for advanced research in linguistic theory and cross-linguistic analysis, with particular expertise in Czech language structures. Dr. Caha's primary research interests center around syntax, morphology, and typology, with a particular focus on the Nanosyntax framework. His work investigates morphological puzzles through the lens of syntactic decomposition, examining phenomena such as allomorphy, syncretism, case marking, and degree expressions. He has made significant contributions to understanding how morphological patterns can be explained through syntactic operations, challenging traditional boundaries between syntax and morphology. His research often bridges theoretical linguistics with empirical analysis of specific languages, particularly Czech but also extending to diverse languages like Russian, Tamil, and Dutch. His recent publications reveal a consistent focus on morphological theory within the Nanosyntax framework, with particular attention to allomorphy, syncretism, and case systems. His work demonstrates how seemingly complex morphological patterns can be derived from simpler syntactic operations. There's a clear progression in his research from foundational work on Czech morphology to broader theoretical contributions and cross-linguistic applications. His collaborative work with researchers like Karen De Clercq and Guido Vanden Wyngaerd has been particularly influential in advancing the Nanosyntax framework. Dr. Caha has been recognized for his academic contributions through multiple research grants and invitations to present at prestigious institutions including MIT and Stanford. His leadership roles and successful grant acquisitions demonstrate recognition within the academic community. As a supervisor, Dr. Caha has successfully guided several PhD students to completion, including Maria Cortiula (2023), Lucie Janků (2022), Fenna Bergsma (2021), and Veronika Kloudová (2020). His grant portfolio includes significant projects such as 'A life with Language: the nature and ontogeny of linguistic communication' (2025-2028), 'Stem Morphology' (2025-2027), and 'Case marking in subordinate clauses' (2022-2024), demonstrating sustained research funding and leadership in his field. Dr. Caha is actively involved in the academic community through editorial board memberships at journals including Open Slavic Linguistics, Continua (Penn State), The Rivista, and Textbooks in Language Sciences. He was a member of the Academic Senate at the Faculty of Arts from 2021-2023. His work continues to shape theoretical approaches to morphology and syntax, particularly through the development and application of the Nanosyntax framework.

• Psychology
• General Psychology
• Health Psychology
• +۳ مورد دیگر

Helena Klimusová serves as Assistant Professor at the Institute of Psychology within the Faculty of Arts at Masaryk University in Brno, Czech Republic, while concurrently holding the position of Admissions Coordinator at the university Rectorate. Her office is located in building C/C.528 at Arna Nováka 1, Brno, with direct contact via phone (549 49 4035) and email (klimusova@rect.muni.cz). She maintains active engagement in academic administration, teaching, and research across multiple institutional contexts. Her research program centers on General Psychology with specialized expertise in ethical research practices , adolescent mental health , and health psychology interventions . Key investigations examine depression measurement in youth, pain perception in elite sports (particularly ballet), and community-based approaches to childhood obesity. Her methodology integrates psychometric rigor with practical applications, frequently addressing measurement challenges in sensitive research domains including AI ethics and trauma studies. Analysis of her 145+ publications reveals consistent thematic evolution from foundational psychometric work (evident in her 2014 habilitation thesis on psychological measurement) toward contemporary ethical challenges in digital research and community health implementation. Recent outputs demonstrate interdisciplinary synthesis across developmental psychology, public health, and sport science, with increasing emphasis on methodological innovation for complex real-world problems like adolescent mental health prediction and ballet injury prevention. Dr. Klimusová supervises graduate theses on career competency development, procrastination dynamics, victimization impacts, and behavioral game theory applications. Her research portfolio includes significant Czech Science Foundation projects including 'Depression in childhood and adolescence' (2016-2018) and 'Health-promoting behaviors' (2013-2016), often collaborating with senior researchers like Assoc. Prof. Iva Burešová across institutions in the Czech Republic and Slovakia. Within Masaryk University's Institute of Psychology, she contributes to interdisciplinary teams developing community health programs and ethical research frameworks, maintaining active connections with clinical practitioners, public health officials, and international academic collaborators to translate psychological research into practical health interventions.

• Constraint satisfaction problems
• Graph homomorphisms
• Algorithms and complexity
• +۵ مورد دیگر

Jan Bok is a postdoctoral researcher in the ERC Synergy grant POCOCOP at the Department of Algebra, Faculty of Mathematics and Physics, Charles University. Previously, he held postdoctoral positions at LIMOS laboratory (University of Clermont Auvergne) and was a PhD student/researcher at the Computer Science Institute, Charles University under advisor Jaroslav Nešetřil. His research focuses on constraint satisfaction problems, graph homomorphisms, algorithms, complexity, and cooperative game theory. He has authored/co-authored over 30 publications, with recent work addressing multigraph covering, cooperative game extensions, and signed graph homomorphisms. His research also includes studies on universal algebra, combinatorial methods, and chemical graph theory. He collaborates widely and maintains active profiles on arXiv, Google Scholar, and zbMATH.