جستجوی استاد راهنمای دانشگاهی

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.

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.

Jiří Fialaمشاهده پروفایل

دانشیار

• Graph algorithms
• Computational complexity
• Restricted graph classes
• +۴ مورد دیگر

Jiří Fiala is an Associate Professor at the Department of Applied Mathematics (KAM), Faculty of Mathematics and Physics, Charles University in Prague, Czech Republic. His academic career spans over two decades with significant contributions to graph theory and computational complexity. He has held positions at prestigious institutions including University of Kiel (Germany), University of Bergen (Norway), and University of Oregon (USA) as a Fulbright fellow. Dr. Fiala completed his Master's degree (Mgr.) at Charles University in 1997 followed by his PhD in 2000. His academic journey progressed from research and teaching assistant (2000-2008) to his current position as Associate Professor since 2008. His research focuses on graph algorithms and their computational complexity , with particular emphasis on restricted graph classes including bounded width structures, topological restrictions, and geometric intersection graphs. He has made significant contributions to algebraic graph theory , especially in homomorphisms and covering projections, as well as graph coloring and distance labeling problems. His work on Hamiltonian properties of graphs represents another important research direction. Analysis of his recent publications (2021-2025) reveals a continued focus on computational complexity of graph covering problems across various graph structures including regular trees, multigraphs with semi-edges, and disconnected multigraphs. His work frequently intersects with computational geometry, particularly in graph drawing problems related to outerplanar graphs and forest structures. The consistent publication record across top venues demonstrates sustained research productivity in theoretical computer science and discrete mathematics. Scientific recognition includes being awarded a Fulbright fellowship for research at the University of Oregon (2012-2013). His habilitation thesis Structure and Complexity of Locally Constrained Graph Homomorphisms (2007) represents a significant scholarly achievement. Dr. Fiala maintains active research collaborations, particularly with Jan Kratochvíl (45 joint publications), Daniël Paulusma (19), and Jan Bok (12), among others. His teaching responsibilities include advanced courses such as Introduction to Parameterized Algorithms for the winter term 2025-2026. His work is well-documented through comprehensive publication records available via DBLP, ResearcherID, ORCID, and Scopus.

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

استاد

• Computational Chemistry
• Quantum Chemical Modeling
• Biomolecular Interactions
• +۵ مورد دیگر

Jaroslav Burda is a full Professor at the Department of Chemical Physics and Optics , Faculty of Mathematics and Physics , Charles University in Prague, Czech Republic. His career spans over three decades, marked by significant contributions to computational chemistry and quantum chemical modeling of biomolecular systems. Education: 1983: M.Sc.(Eng.) in Chemistry, Institute of Chemical Technology, Prague 1989: M.Sc. in Physics, Charles University 1989: PhD. (CSc.), Institute of Chemical Technology 1999: Habilitation, Faculty of Mathematics and Physics, Charles University 2008: DrSc., Comenius University in Bratislava 2011: Professorship, Charles University Research Interests: Professor Burda's research focuses on computational chemistry , particularly quantum chemical modeling of interactions between metal complexes and biomolecules. His work extensively covers platinum and ruthenium anticancer agents , DNA base pairing , solvent effects , and reaction mechanisms in biological systems. He employs advanced DFT and ab initio methods to elucidate the electronic properties, thermodynamics, and kinetics of these interactions. Scientific Contributions: With over 100 peer-reviewed publications, his work has significantly advanced the understanding of metal-DNA interactions , platinum drug activation , and redox processes in transition metal complexes. His studies on cisplatin-DNA adducts and mercury-mediated base pairs are particularly noteworthy. Teaching and Mentorship: Professor Burda has been instrumental in teaching General Chemistry , Quantum Theory of Molecules , and Computational Methods in Chemical Physics . He has supervised numerous diploma and doctoral students, including Michal Zeizinger , Matěj Pavelka , Tomáš Zimmermann , Zdeněk Futera , and Filip Šebesta . International Collaboration: His research has been enriched by collaborations with institutions worldwide, including universities in Germany, Spain, the USA, and Finland, fostering a global perspective in his scientific endeavors.

Petr Hliněnýمشاهده پروفایل

استاد

• Graph Theory
• Discrete Mathematics
• Theoretical Computer Science
• +۱۳ مورد دیگر

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.