Find Academic Supervisors

Dr. Jakub Opršal is a Research Fellow at the University of Birmingham specializing in the theoretical foundations of computer science and mathematics. His research focuses on the computational complexity of constraint satisfaction problems (CSPs) and their variants. Previously, he held postdoctoral positions at ISTA (2022-23), Oxford (2021-22), Durham University (2018-21), TU Dresden (2016-18), and Jagiellonian University (2016), establishing a strong international research profile. Dr. Opršal received his PhD from Charles University in Prague in 2016 under the supervision of Libor Barto. His doctoral work laid the foundation for his ongoing contributions to universal algebra and computational complexity theory. Dr. Opršal's research integrates advanced mathematical frameworks including universal algebra , homotopy theory , category theory , and mathematical logic to analyze constraint satisfaction problems. He has made significant contributions to understanding the computational complexity of CSPs, particularly through topological methods and algebraic structures. His work often establishes dichotomy theorems and proves hardness results for various CSP variants, with increasing focus on promise constraint satisfaction problems. Analysis of Dr. Opršal's publication record reveals a sophisticated evolution in methodology, with recent work increasingly incorporating category-theoretic approaches and topological techniques to tackle fundamental questions in computational complexity. His research demonstrates a consistent pattern of bridging abstract mathematical concepts with concrete computational problems, particularly in establishing connections between algebraic structures and computational hardness. Dr. Opršal actively seeks PhD students and has organized significant academic events including the Birmingham CSP Meeting (2024). He serves on program committees for major theoretical computer science conferences and collaborates extensively with researchers across Europe, including prominent institutions like Oxford, Durham, and ISTA. As a key organizer of the Birmingham Constraint Satisfaction research group, Dr. Opršal contributes to a vibrant international research community. He participates in the CSP World Congress series and maintains active collaborations that advance the theoretical foundations of constraint satisfaction problems through interdisciplinary approaches combining computer science, mathematics, and logic.

• Constraint Satisfaction Problems
• Computational Complexity
• Universal Algebra
• +4 more

Michał Wrona is a Professor in the Department of Algorithmics at the Faculty of Mathematics and Computer Science, Jagiellonian University. His research focuses on constraint satisfaction problems (CSPs), computational complexity, universal algebra, and model theory, particularly concerning finite and omega-categorical structures. He holds a habilitation and has held postdoctoral positions at École Polytechnique (France) and Linköping University (Sweden). His current grant (2021–2026) investigates constraint satisfaction problems for infinite homogeneous structures. Education: M.Sc. in Computer Science (2004, University of Wrocław), Ph.D. in Mathematics (2009, University of Wrocław). Key Roles: Principal Investigator of the National Science Centre grant on infinite-domain CSPs. His work bridges theoretical computer science and mathematical logic, addressing foundational questions in algorithmic complexity and constraint satisfaction. Notable contributions include advances in quantified CSPs, tractability frontiers, and symmetries in infinite-domain structures. Research has been published in top venues like SIAM Journal on Computing, IEEE LICS, and ACM Transactions on Computational Logic. He actively contributes to the algorithmics research group and collaborates internationally on topics like universal algebra and computational complexity.

• Constraint Satisfaction Problems
• Computational Complexity
• Universal Algebra
• +3 more

Michael Pinsker is a full professor and head of the Research Unit Algebra at the Vienna University of Technology. He is a leading researcher in universal algebra, model theory, and theoretical computer science, with a strong focus on constraint satisfaction problems (CSPs), particularly over infinite domains. He is deeply involved in the Vienna School of Mathematics and serves on the steering committees of the Workshop on General Algebra and the CSP World Congress (CWC), which he regularly co-organizes. Principal Investigator, ERC Synergy Grant POCOCOP (2023–2029) Principal Investigator, FWF-NCN Project on Constraint Satisfaction (2022–2026) Associate Editor, Algebra Universalis (Springer) Member, Executive Board, Vienna School of Mathematics His research lies at the intersection of algebra, logic, and computation, emphasizing the algebraic and model-theoretic analysis of infinite structures to understand the complexity of CSPs. He investigates how symmetry, topology, and polymorphisms govern tractability and hardness. His work often connects Ramsey theory and homogeneous structures with computational problems. His recent publications reveal a sustained focus on infinite-domain CSPs, particularly through algebraic methods like polymorphisms, smooth approximations, and topological clones. Trends include collapsing width hierarchies, establishing hardness criteria for infinite digraphs, and developing new algorithms based on symmetry and consistency. His work bridges finite and infinite model theory, aiming to unify complexity classification frameworks. ERC Synergy Grant POCOCOP (2023) Distinguished Paper Award, LICS 2023 Pinsker actively mentors PhD students and postdoctoral researchers, including current advisees like Johanna Brunar, Moritz Schöbi, Roman Feller, and Christoph Spiess. He has advised former PhD students Clemens Schindler, Tomas Nagy, and Michael Kompatscher. He leads major research projects funded by the European Research Council and national science foundations, indicating significant grant leadership. His collaborative network includes Libor Barto, Manuel Bodirsky, and Marcin Kozik. He leads the Research Unit Algebra at TU Wien, which includes faculty, postdocs, PhD students, and project managers working on universal algebra and CSPs. He co-organizes major annual events like the CSP World Congress and the Early Student Award meetings of the Austrian Mathematical Society, fostering community and collaboration.

• Universal Algebra
• Model Theory
• Theoretical Computer Science
• +7 more

George Osipov is a researcher at Linköping University's Department of Computer and Information Science (IDA), affiliated with the Faculty of Science and Engineering. He holds a PhD in Computer Science from Linköping University, where his thesis focused on the parameterized complexity of constraint satisfaction problems (CSPs) at the intersection of theoretical computer science and artificial intelligence. His work explores efficient algorithms for solving almost-satisfiable CSPs, emphasizing scalability and practical applications in data processing and automatic reasoning. Education: Bachelor's in Computer Science from Free University of Tbilisi, Georgia; Master's in Mathematics from Ilia State University, Georgia (with an Erasmus year in Uppsala University, Sweden). Affiliations: Member of the Wallenberg AI, Autonomous Systems and Software Program (WASP) graduate school; Postdoctoral researcher funded by the Swedish Research Council. Collaborations: Partnered with institutions in the UK (Royal Holloway, Newcastle, Leeds), Germany (Saarbrücken), and Poland (Warsaw). His research interests include parameterized complexity, constraint satisfaction problems, and algorithm design, with a focus on theoretical foundations and practical applications. He has received the prestigious 2023 Lawson Scholarship for excellence in computer science and is currently conducting postdoctoral research at Oxford University and Royal Holloway University of London. His work bridges theoretical computer science and AI, addressing challenges in scalable algorithmic solutions for complex computational problems. George's contributions have been recognized through grants and international collaborations, reflecting his commitment to advancing the frontiers of computational theory and its real-world utility.

• Theoretical Computer Science
• Artificial Intelligence
• Parameterized Complexity
• +3 more

Peter Jonsson is a Professor of Computer Science and Head of Unit at Linköping University's Department of Computer and Information Science (IDA), within the Artificial Intelligence and Integrated Computer Systems (AIICS) division. He holds a PhD in Computer Science from Linköping University (1996) and has been a Professor since 2004. His research focuses on computational complexity, constraint satisfaction problems (CSP), algorithms, and planning. He has advised over 15 PhD students and supervised multiple postdoctoral researchers, contributing significantly to theoretical computer science. His work bridges algorithm design and complexity analysis, with applications in AI and planning systems. Current research interests include parameterized complexity, infinite-domain CSPs, and structural restrictions in planning. Education: PhD (1996), MSc (1993), all from Linköping University. Key publications span CSP theory, planning algorithms, and complexity classification. His advising includes notable students like Biman Roy and Victor Lagerkvist. He has collaborated on projects funded through Swedish research programs and international grants. Labs/teams: Active in the AIICS division, focusing on foundational AI and algorithmic research.

• Computer Science
• Artificial Intelligence
• Constraint Satisfaction Problems
• +3 more

Dr Anton Setzer is a Reader in the Department of Computer Science at Swansea University, part of the School of Mathematics and Computer Science. His research focuses on foundational aspects of type theory, interactive theorem proving, and formal verification, with particular emphasis on dependently typed programming and blockchain technologies. He is affiliated with the Computational Foundry at Bay Campus and supervises PhD students in critical domains like smart contracts and cybersecurity. Research Interests: Setzer’s work spans type theory (especially Martin-Löf variants), coinduction, proof theory, and their applications in dependently typed systems. His recent projects include formal verification of smart contracts (Solidity, Bitcoin Script) using Agda and exploring blockchain-enabled coordination protocols for UAVs. He also investigates foundational topics like predicative Mahlo universes in type theory. Academic Contributions: Setzer has pioneered techniques for integrating automated and interactive theorem proving, developed formal semantics for CSP processes in Agda, and contributed to coalgebraic type theory. His work on inductive-inductive definitions and copatterns has advanced functional programming methodologies. Supervision & Collaboration: Current PhD topics include SMT solving for railway systems, secure UAV coordination, and pharmaceutical supply chain technologies. He collaborates with Prof Arnold Beckmann on blockchain verification and Monika Seisenberger on railway safety systems. His teaching includes critical systems design (CSCM13) and blockchain technology (CSCM29).

• Type Theory
• Interactive Theorem Proving
• Dependently Typed Programming
• +6 more

Dr. Barnaby Martin is an Associate Professor in the Department of Computer Science at Durham University, working within the Algorithms and Complexity Group (ACiD). His research focuses on theoretical computer science, including computational complexity, proof complexity, finite model theory, and constraint satisfaction problems (CSPs), with a particular emphasis on algorithmic graph theory and forbidden subgraph frameworks. He holds a permanent academic position after prior roles at Middlesex University and post-doctoral positions in Durham and Paris. His work explores the boundary between tractable and intractable computational problems, often investigating how structural graph properties influence complexity. Key research directions include developing complexity frameworks for problems restricted to subcubic graphs, analyzing quantified constraint satisfaction problems (QCSP), and studying coloring and partitioning problems for H-free graphs. Recent contributions include advancements in Steiner Forest problem complexity, edge subdivision frameworks, and QCSP classifications over reflexive tournaments. Dr. Martin has supervised postgraduate students Tala Eagling-Vose and Yiming Qiu. His publications span conferences like ISAAC, SWAT, and MFCS, with a strong presence in algorithmic and complexity theory venues. He has contributed to foundational areas such as Sherali-Adams proof systems and the Chen conjecture in QCSP theory.

• Complexity Theory
• Proof Complexity
• Computational Complexity
• +3 more

Florent Madelaine is a Professor at the Laboratoire d'Algorithmique, Complexité et Logique (LACL) at the Université Paris-Est Créteil (UPEC). His academic journey includes a PhD from the University of Leicester (2003) under Iain Stewart and Etienne Grandjean. He has held roles such as Lecturer at Clermont-Ferrand (2007–2018) and Research Associate at Durham University (2003–2007), with visiting positions at Charles University and École Polytechnique. His research focuses on theoretical computer science, particularly finite model theory, computational complexity, and constraint satisfaction problems (CSP/QCSP), with contributions to MMSNP logic and complexity dichotomy conjectures. Currently affiliated with CNRS GdR IM, his work bridges algebraic methods and logical frameworks in computational problems. Education: B.Sc. and M.Sc. in Mathematics (Caen University), M.Sc. in Computer Science (Dresden), PhD in Computer Science (Leicester). Research interests emphasize foundational aspects of computational complexity, with a focus on logical characterizations, algebraic approaches, and constraint satisfaction problem classifications.

• Theoretical Computer Science
• Finite Model Theory
• Computational Complexity
• +4 more

Victor Lagerkvist is an Associate Professor at the Department of Computer Science (IDA) , Linköping University, Sweden. He is affiliated with the Theoretical Computer Science Laboratory (TCSLAB) and the Artificial Intelligence and Integrated Computing Systems (AIICS) division. His research focuses on the algebraic method for analyzing computational complexity , particularly in constraint satisfaction problems (CSPs), SAT, and graph homomorphism problems. PhD in Computer Science (2016, Linköping University) Habilitation (2020, Linköping University) His recent work investigates fine-grained complexity , twin-width , and universal algebra to improve algorithms for NP-hard problems. Publications span topics like propositional abduction, Allen's interval algebra, and semiring-based dynamic programming. His scientific awards include the Swedish Research Council Starting Grant (2020) and the 2017 Young Researcher Prize from the Ruth and Nils-Erik Stenbäck Foundation. He supervises PhD students such as Leif Eriksson and serves as a secondary supervisor for others at Linköping University and Université de Lorraine.

• Computational Complexity
• Constraint Satisfaction Problems (CSP)
• Theoretical Computer Science
• +3 more