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

• 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.

• Artificial Intelligence
• Multi-Agent Path Finding
• Robotics
• +۴ مورد دیگر

Jiří Švancara is a Lecturer at the Department of Theoretical Computer Science and Mathematical Logic (KTIML) within the Faculty of Mathematics and Physics at Charles University in Prague. His academic career focuses on Artificial Intelligence, particularly Multi-Agent Path Finding (MAPF), where he has established himself as a prominent researcher with numerous publications in top-tier conferences. His research interests span across Multi-Agent Path Finding , Robotics , Algorithm Design , and Constraint Satisfaction Problems . Švancara has made significant contributions to the field of MAPF, developing novel approaches for large-scale maps, temporal uncertainty handling, and efficient solving methods. His work bridges theoretical foundations with practical applications in robotics and transportation systems. Analysis of his recent publications reveals a strong focus on improving the scalability and robustness of MAPF algorithms. His research explores graph pruning techniques for large maps, handling temporal uncertainty in path execution, and comparing different objective functions for optimization. He has also investigated applications of MAPF in autonomous intersections and train routing systems, demonstrating the practical relevance of his theoretical work. Best Paper Award for 'Multi-agent Path Finding on Real Robots: First Experience with Ozobots' at IBERAMIA 2018 Švancara actively teaches multiple courses including Introduction to Artificial Intelligence, Propositional and Predicate Logic, and Algorithms and Data Structures. His teaching spans both theoretical foundations and practical implementation, with students engaging in programming assignments that reflect current AI challenges. His research collaborations are extensive, with frequent co-authorship with Roman Barták and other researchers in the field, indicating strong integration within the international AI research community. His laboratory work involves practical implementations of MAPF algorithms, including testing on real robots as evidenced by several publications describing experiments with Ozobots and other robotic platforms. This hands-on approach connects theoretical research with tangible robotic applications, providing valuable validation for his algorithmic contributions.

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

دانشیار

• Theoretical Computer Science
• Combinatorial Optimization
• Graph Theory
• +۷ مورد دیگر

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 .

• 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.

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.

• Theoretical Computer Science
• Computational Complexity
• Data Structures
• +۳ مورد دیگر

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.