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

• Low-dimensional Topology
• Geometric Group Theory
• Mapping Class Groups
• +۲ مورد دیگر

Sebastian Hensel is a Professor of Pure Mathematics at the Mathematical Institute of Ludwig Maximilian University of Munich (LMU), where he also serves as the Dean of Studies. His research focuses on the intersection of low-dimensional topology and geometric group theory, with emphasis on mapping class groups, handlebody groups, and diffeomorphism groups of surfaces. He leads the Geometry and Topology Working Group and is actively involved in teaching advanced seminars. Hensel received his PhD from the University of Bonn in 2011 under Ursula Hamenstädt. Before joining LMU, he held positions as a Dickson Instructor at the University of Chicago and as a temporary academic councilor in Bonn. His research employs geometric methods to study algebraic structures in topological spaces, particularly surfaces and 3-manifolds. Scientific Awards: Dickson Instructor Fellowship, University of Chicago Teaching & Advising: Hensel regularly teaches courses on Riemannian geometry, geometric group theory, and manifold topology. He currently advises bachelor and master's theses in geometry/topology and organizes block seminars. As Dean of Studies, he oversees academic programs at the Mathematical Institute. Affiliations: Member of the Geometry and Topology Group at LMU, with collaborations spanning multiple institutions including TUM and international partners.

Johannes Carmesinمشاهده پروفایل

استاد

• Graph Theory
• Combinatorics
• Topology
• +۳ مورد دیگر

Prof. Johannes Carmesin is a Professor at the Faculty for Mathematics and Computer Science, Technische Universität Bergakademie Freiberg. His research focuses on advanced topics in Graph Theory, Combinatorics, and Topology, with notable contributions to 3-dimensional Kuratowski-type theorems and the extension of Structural Graph Theory to simplicial complexes. He leads the Discrete Structures group, which explores areas including Graph Minors, Matroid Theory, and Infinite Graphs. Education and Career: He holds a PhD (2015) and Habilitation (2018) in Mathematics, with earlier work on harmonic functions in networks (Master's 2012). His academic journey includes research on infinite matroids and tree-decompositions. Research Interests: Carmesin’s work bridges discrete mathematics and topology, emphasizing structural properties of graphs and their embeddings. Key areas include 3D graph embeddings, connectivity in infinite graphs, and matroid characterizations. He has pioneered methods for analyzing 2-dimensional simplicial complexes and their topological representations. Recent Trends in Publications: His recent work extends Graph Minor Theory to temporal networks and 3D spaces, with a focus on canonical decompositions, tangle theory, and applications in large-scale network analysis. His 2023 European Prize in Combinatorics recognizes breakthroughs in 3D Kuratowski analogues. Awards: European Prize in Combinatorics (2023) Advising and Team: Supervised PhD students Emily Nevinson and Tsvetomir Mihaylov, and mentored master’s students like Will J. Turner. His research team includes Dr. Jan Kurkofka and Dr. Matthew Kroeker. Notable collaborations address infinite graph connectivity and Stallings-type theorems for finite groups. Labs/Groups: Directs the Discrete Structures research group, which hosts regular seminars and collaborates internationally. Past members include Georgios Kontogeorgiou and Lyuben Lichev as interns.

Sven Scheweمشاهده پروفایل

استاد

• Automata Theory
• Game Theory
• Formal Verification
• +۱۲ مورد دیگر

Sven Schewe is a Professor in the Department of Computer Science at the University of Liverpool, affiliated with the School of Electrical Engineering, Electronics and Computer Science. He leads the AI Section and is a founding member and former leader of the Verification Group. He also has secondary affiliations with the Algorithms, Complexity Theory and Optimisation Group and the Institute for Risk and Uncertainty. Research Interests: His research centers on automata theory and game theory, particularly their applications in the verification and synthesis of reactive and safety-critical systems. He investigates infinite-duration games, automata over infinite words and trees, and develops algorithms and tools for automated verification, synthesis, and learning of optimal control strategies. His work extends to reinforcement learning with formal guarantees, cyber-physical systems, and AI safety. Recent Research Trends: His recent publications demonstrate a strong integration of formal methods with machine learning, particularly in adversarial training, neural network robustness, and model-free reinforcement learning under omega-regular objectives. He also applies formal reasoning to interdisciplinary domains such as chemical space exploration and materials science. Scientific Awards: Finalist for the ERCIM Cor Baayen Award 2010 Dr. Eduard Martin Preis 2009 GI Dissertation Award 2008 Advising and Grants: He actively supervises numerous PhD students and postdoctoral researchers. He is Principal Investigator (PI) or Co-Investigator (CI) on multiple major grants, including EPSRC Programme Grants, Royal Society Fellowships, and Horizon Europe projects. His funded research spans topics such as game theory, verification, synthesis, reinforcement learning, and risk analysis. He has hosted visiting researchers and collaborated internationally with institutions in Germany, France, India, Taiwan, and the US. Labs and Teams: He co-founded and led the Verification Group and previously led the AI Section at the University of Liverpool. These groups focus on formal methods, automata, games, and their applications in AI and safety-critical systems.

Henning Bruhn-Fujimotoمشاهده پروفایل

استاد

• Optimization
• Graph Theory
• Operations Research
• +۳ مورد دیگر

Prof. Henning Bruhn-Fujimoto is a faculty member at the Institute for Optimization and Operations Research at Ulm University. His research focuses on graph theory, combinatorial optimization, and discrete mathematics , with notable contributions to Erdős-Pósa properties, cycle packing, and algorithmic graph theory. He teaches courses in mathematical foundations of machine learning and combinatorics. Academic Background: - Habilitationsschrift : Graphs and their Circuits (2009) - PhD Thesis: Infinite circuits in locally finite graphs (2005) - Diploma Thesis: Generating the cycle space by induced non-separating cycles (2001) Research Interests: - Structural graph theory and algorithm design - Optimization in discrete systems - Applications of combinatorial mathematics Thesis Supervision: He regularly oversees bachelor's and master's theses in optimization, graph theory, and related fields. Notable past thesis topics include elevator system optimization, Erdős-Posa properties in graphs, and container ship unloading algorithms. Labs/Teams: His work is centered within the Institute's optimization group, collaborating with researchers on projects involving graph algorithms and combinatorial optimization.

• Algorithms
• Computational Geometry
• Discrete Mathematics
• +۸ مورد دیگر

Mordecai J Golin is a Professor in the Department of Computer Science and Engineering at The Hong Kong University of Science and Technology (HKUST), School of Engineering. His research lies at the intersection of theoretical computer science, algorithms, and discrete mathematics, with strong applications in information theory and computational geometry. His research interests include algorithms , computational geometry , data structures , dynamic programming , coding theory , and combinatorics . He has made significant contributions to the design and analysis of optimal search trees, prefix-free coding, and minmax regret optimization in dynamic flow networks. His work often combines probabilistic analysis with algorithmic efficiency. The recent publications highlight a sustained focus on optimization problems in graphs and trees, particularly in dynamic flow networks for applications like evacuation modeling, and in data compression via advanced Huffman and AIFV coding techniques. The research spans from theoretical foundations to algorithmic innovation, with recurring themes of efficiency, robustness, and structural analysis. Scientific Awards No specific awards mentioned in the provided text. Advising and Grants : While specific students and grants are not listed, Dr. Golin has an extensive record of collaborative research with colleagues at HKUST and internationally, suggesting active supervision and project leadership. His frequent publications in top-tier venues indicate sustained funding and research activity. Labs and Teams : Though not explicitly named, his work is likely conducted within theoretical computer science or algorithms research groups at HKUST, possibly associated with centers focusing on discrete mathematics or information sciences.

Nathanaël Fijalkowمشاهده پروفایل

پژوهشگر

• Games
• Machine Learning
• Automata Theory
• +۹ مورد دیگر

Nathanaël Fijalkow is a Researcher at CNRS in LaBRI (Bordeaux) and a Research Fellow at The Alan Turing Institute in London. His primary research fields include games , machine learning , automata theory , and dynamical systems , with a focus on synthesizing programs from logical specifications and probabilistic models. Research Interests span program synthesis (programming by example), controller synthesis (temporal logic specifications), games on graphs (parity/mean payoff games), probabilistic automata (bounded ambiguity), and invariants for linear dynamical systems. He bridges formal methods with machine learning through projects like DeepSynth . Scientific Contributions include: Undecidability results for probabilistic automata Advances in parity game algorithms (quasi-polynomial lower bounds) Foundations of probabilistic modal logics Efficient synthesis techniques using SMT solvers and distributional learning Supervision involves guiding postdocs and PhD students such as Guillaume Lagarde, Antonio Casares, and Pierre Ohlmann. He has secured grants like the Momentum DeepSynth project (2019-2021) , aiming to merge formal methods with ML for program synthesis.

Jan Kurkofkaمشاهده پروفایل

استادیار

• Graph Minor Theory
• Connectivity Theory
• Topological Graph Theory
• +۴ مورد دیگر

Dr. Jan Kurkofka is an Assistant Professor in the Department of Mathematics at Freiberg University of Mining and Technology. His research focuses on graph theory, particularly in areas such as Graph Minor Theory, Connectivity Theory, Topological Graph Theory, and Infinite Graph Theory. He actively contributes to the academic community through publications, conference presentations, and organizing the Research Seminar in Discrete Mathematics and Algebra. Dr. Kurkofka completed his Master's thesis in 2017 with a grade of 1.0 on "On the tangle compactification of infinite graphs." He earned his Ph.D. in 2020 summa cum laude with the dissertation "Ends and tangles, stars and combs, minors and the Farey graph." In 2023, he completed his habilitation, further establishing his expertise in graph theory. Dr. Kurkofka's research interests span Graph Minor Theory, Connectivity Theory, Topological Graph Theory, and Infinite Graph Theory. His work explores structural aspects of graphs, including explicit structure theorems for low connectivity, local-global invariants of graphs and groups, and the role of the Farey graph in infinite edge-connectivity. He has made significant contributions to understanding the connectivity properties of graphs and their applications across various mathematical fields. His publication record demonstrates a strong focus on connectivity theory and graph minors. Dr. Kurkofka has published in prestigious journals including Mathematische Annalen, Journal of Combinatorial Theory, and Transactions of the American Mathematical Society. His work often involves collaborations with leading researchers in the field, such as Johannes Carmesin and Reinhard Diestel, reflecting the interdisciplinary nature of modern graph theory research. Dr. Kurkofka has received research funding from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under grants 566118291 and 546892829. He serves as an organizer for the Research Seminar in Discrete Mathematics and Algebra alongside Professors Johannes Carmesin and Friedrich Martin Schneider, fostering academic exchange in his field. Dr. Kurkofka teaches courses including Algorithmic and Structural Graph Theory II and has been involved in various teaching activities across multiple semesters. He supervises Master's theses through his seminar on infinite graph theory, preparing students for advanced research in the field. His teaching spans from undergraduate to graduate levels, including specialized topics like Bass-Serre Theory and Graph Minors.

Artem Sapozhnikovمشاهده پروفایل

استاد

• Probability theory
• percolation
• random walks
• +۱ مورد دیگر

Artem Sapozhnikov is a Professor at the Mathematisches Institut of Universität Leipzig, Germany. His research focuses on probability theory, particularly percolation, random walks, and random graphs. He maintains an active research program with numerous publications and supervises PhD students and postdocs. Professor Sapozhnikov teaches a range of mathematics courses for physicists, including Mathematics for Physicists 1-4, Probability Theory I & II, and specialized courses on percolation. His teaching spans both undergraduate and graduate levels, demonstrating his commitment to mathematical education. His research interests center around probability theory , with specific focus on: Percolation theory and phase transitions Random walks and their properties on various structures Random interlacements and Brownian motion Boolean models and geometric probability Models with long-range correlations His work bridges theoretical probability with applications in statistical physics. Analysis of his recent publications shows a strong focus on the properties of random interlacements, Brownian motion, and percolation models. His research examines connectivity properties, phase transitions, and geometric aspects of these stochastic processes. Recent work with Yingxin Mu has explored visibility windows and indistinguishability of components in various models. Earlier collaborations with Caio Alves, Deepan Basu, and Yinshan Chang investigated decoupling inequalities, crossing probabilities, and loop percolation. Professor Sapozhnikov has supervised several PhD students and postdocs, including: Deepan Basu (PhD 2013-2017) Caio Alves (postdoc 2016, 2017-2020) Yinshan Chang (postdoc 2013-2016) Lorenzo Taggi (PhD 2012-2015) Yingxin Mu (postdoc 2021-2023) He currently has open positions for PhD students through the IMPRS program.

• Sustainable Energy Systems
• Numerical Optimization
• Deep Learning
• +۳ مورد دیگر

Dr. Manuel Dahmen serves as Head of Department at the Institute of Climate and Energy Systems (ICE-1) within the Research Center Jülich. His research focuses on designing sustainable and cost-efficient energy systems through numerical optimization and deep learning techniques. He leads efforts in advancing energy system technology, particularly in optimizing renewable energy integration, process network analysis, and the co-design of fuels and engines. His work emphasizes innovative applications of machine learning, such as physics-informed neural networks and reinforcement learning, to address challenges in energy system design and operation. Key areas include reducing greenhouse gas emissions in industrial processes, optimizing energy networks, and developing data-driven models for dynamic process control. Dr. Dahmen’s contributions span algorithm development (e.g., MUSE-BB decomposition algorithms), energy system scenario generation, and robust design methodologies under uncertainty. His research bridges computational methods with practical energy solutions, aiming to achieve decarbonization in industries like copper production and transportation. Publications highlight advancements in renewable energy integration, fuel design for spark-ignition engines, and the application of graph neural networks for molecular property prediction. His interdisciplinary approach fosters collaboration across chemical engineering, computer science, and energy economics to tackle global sustainability challenges.

Laurent Doyenمشاهده پروفایل

پژوهشگر

• Game Theory
• Automata Theory
• Formal Verification
• +۷ مورد دیگر

Laurent Doyen is a CNRS Researcher at the Laboratoire Méthodes Formelles (LMF), ENS Paris-Saclay. He holds a PhD from the Université Libre de Bruxelles (2006) and an HDR from ENS Cachan (2012). His research focuses on formal methods, game theory, automata, and verification of quantitative and probabilistic systems. PhD: Université Libre de Bruxelles, 2006 HDR: ENS Cachan, 2012 Research Interests: Laurent's work centers on algorithms and tools for the verification and synthesis of reliable software, hardware, and embedded systems. His primary areas include game and automata theory, with a focus on discrete quantitative and probabilistic systems, timed and hybrid systems. He investigates synchronization, mean-payoff objectives, and imperfect information in games, contributing significantly to theoretical foundations and practical tools. The recent publications highlight a strong trend in stochastic games, synchronization in Markov decision processes, and quantitative verification. His work spans theoretical computer science, formal methods, and practical applications in system design, often appearing in top venues like LICS, ICALP, and CONCUR. Scientific Awards: No specific awards mentioned in the provided text. Advising and Grants: Laurent has advised several PhD students including Mahsa Shirmohammadi, Julien Reichert, Thomas Soullard, and Pranshu Gaba. He leads and participates in multiple research projects such as QuaVerif (PI), IFCPAR SMILeS (coPI), Cassting, ARiSE, and Quasimodo. He has been a Rutherford Visiting Fellow at the University of Warwick and is involved in various academic communities like GAMES, CFV, and GDR-IM. Labs and Teams: He is a key member of the Laboratoire Méthodes Formelles (LMF) at ENS Paris-Saclay and has been associated with the LSV (Laboratoire Spécification et Vérification) in the past. He contributes to the development of tools like Alaska and Alpaga for automata analysis and model checking.

• Automata Theory
• Concurrency Theory
• Formal Verification
• +۱ مورد دیگر

Slawek Lasota is a Professor at the Automata Theory Group within the Faculty of Mathematics, Informatics and Mechanics, University of Warsaw. His research focuses on automata theory, concurrency theory, formal verification, and systems biology, with a strong emphasis on computational complexity and algorithmic analysis of systems with infinite-state spaces. Research Interests : Automata theory (infinite alphabets, nominal sets), concurrency theory (timed automata, vector addition systems), formal verification (reachability problems, model checking), systems biology (computational models of biological systems). Grants : Coordinator of NCN grants on data-enriched models and automatic analysis of concurrent systems; participant in ERC projects Lipa and FOX . Community Service : Managing editor of Fundamenta Informaticae (2018-), member of EATCS Council (2019-), and Rada Doskonalosci Naukowej (2019-). His work has received recognition including the STOC'19 Best Paper Award and EATCS BEST ETAPS PAPER AWARD . He supervises PhD students in topics ranging from Petri nets to timed automata and has contributed extensively to advancing verification techniques for systems with data, timed models, and concurrency.

• Graph Theory
• Infinite Graphs
• Structural Graph Theory
• +۵ مورد دیگر

Paul Knappe is a researcher at the University of Hamburg within the Faculty of Mathematics, Computer Science and Natural Sciences, specifically the Department of Mathematics. His work centers on structural graph theory, infinite graphs, and discrete mathematics. Supervised by Reinhard Diestel Recipient of a doctoral scholarship from the Studienstiftung des Deutschen Volkes Focus areas: tree-decompositions, edge-connectivity, tangle-tree duality, and local-global aspects in graphs His research includes groundbreaking contributions to the classification of typical infinitely edge-connected graphs via strong immersion, the extension of tangle-tree duality to infinite graphs, and new insights into cyclic structures in edge-connected graphs. He has published in journals like the Journal of Graph Theory and Journal of Combinatorial Theory, Series B , with recent work on Farey graphs and Cantor-Bernstein theorems in infinite graph settings. Paul actively disseminates his findings through open-access summaries and preprints, collaborating with scholars such as Max Pitz, Jan Kurkofka, and Raphael W. Jacobs. He maintains a personal website for project updates and correspondence.

Sam Hughesمشاهده پروفایل

پژوهشگر ارشد

• Group Theory
• Topology
• Algebraic Topology
• +۷ مورد دیگر

Sam Hughes is a Humboldt Research Fellow at the Mathematisches Institut of Rheinische Friedrich-Wilhelms-Universität Bonn, hosted by Professor Giles Gardam. His research focuses on interactions between group theory and topology, with interests in profinite rigidity, Kähler groups, ℓ²-invariants, and geometric group theory. He previously held positions at the University of Oxford (Postdoctoral Research Associate under Dawid Kielak) and the University of Southampton (PhD student under Ian Leary). His academic journey includes a PhD from the University of Southampton (2018–2021) and an MMath from the University of South Wales (2014–2018). He has been recognized with awards such as the Baer Prize (2022) and the BMC–BAMC 2021 poster prize. Hughes is actively involved in organizing conferences, including 'Modern Methods in Infinite Groups' and 'Profinite and Residual Methods Around Geometric Group Theory'. He has received grants from the Humboldt Foundation, Heilbronn Institute, and others. His teaching contributions include developing courses on profinite methods in geometric group theory and tutoring in algebraic topology and homological algebra. He has advised numerous students at the Oxford Master's and Part C levels, including award-winning projects. His research spans topics like lattices in CAT(0) spaces, BNSR invariants, and homological growth, with over 20 published works in top journals and venues.

• Group Theory
• Topology
• Set Theory
• +۳ مورد دیگر

Sam Corson is a Ramon y Cajal Fellow (Research Fellow) at the Technical University of Madrid, specializing in the construction of unconventional mathematical structures at the intersection of group theory, topology, and set theory. His work resolves longstanding conjectures, such as the Cannon-Conner problem on fundamental groups of the harmonic archipelago and Griffiths double cone, and introduces novel objects like Artinian groups of arbitrary cardinality and Jonsson groups satisfying Babai’s infinitary edge orbit conjecture. His research interests emphasize automatic continuity (proving open kernels for homomorphisms from topological groups to hyperbolic/braid groups), wild topology (analyzing fundamental groups of non-locally simply connected spaces), and set-theoretic group theory (constructing groups under ZF axioms without choice). Key contributions include models of ZF where metric spaces fail paracompactness or torsion-free abelian groups lack bi-orderings, demonstrating deep interactions between logic and algebra. Recent publications (2021–2025) reveal a trend toward profinite rigidity in Coxeter groups, cardinality constraints in infinite groups, and geometric realizations of permutation actions. His work spans journals like Bulletin of the London Mathematical Society and Proceedings of the American Mathematical Society , often coauthored with Saharon Shelah and Olga Varghese. Scientific recognition includes: Ramon y Cajal Fellowship (prestigious Spanish postdoctoral award) With an Erdős number of 2, Corson collaborates extensively but has no documented advisees, teaching roles, or grants. His research operates within pure mathematics frameworks without applied lab structures or institutional teams beyond coauthor networks.

Karl Magnus Heuerمشاهده پروفایل

دانشیار

• Graph Theory
• Directed Graph Theory
• Infinite Graph Theory
• +۱۴ مورد دیگر

Karl Magnus Heuer is an Associate Professor in Discrete Mathematics at the Department of Applied Mathematics and Computer Science (DTU Compute), Technical University of Denmark (DTU), where he is a member of the AlgoLoG (Algorithms, Logic and Graphs) section. He obtained his Habilitation in Mathematics from the University of Hamburg in 2023 and his Dr. rer. nat. (PhD) in Mathematics under Prof. Dr. Reinhard Diestel at the same university in 2018. His research lies primarily in Graph Theory, with a strong focus on Directed and Infinite Graphs. Key interests include structural properties of directed graphs, connectivity, unavoidable substructures, directed cycles and cuts, feedback arc sets, dijoins (in relation to Woodall’s Conjecture), packing and covering problems, and the analysis of width parameters and duality theorems. He also investigates topological aspects of infinite graphs, such as the existence of Hamilton cycles, tangles, and the structure of infinite cycle and cut spaces. His work extends into Matroid Theory, particularly the Even Dicircuit Problem in Oriented Matroids, and he is interested in applications to Logic and Data Science. Karl Heuer has held postdoctoral positions at the University of Hamburg, the Technical University of Berlin (on the ERC project DISTRUCT under Prof. Dr. Kreutzer), and a DAAD-funded research fellowship at DTU. He served as an assistant professor (tenure track) at DTU from May 2022 to February 2025 before being promoted to associate professor. He is also interested in Mathematical Education. No scientific awards or publications were listed in the provided text. He has advised no students listed in the text and no information on grants or research teams is available. His research is theoretical and deeply mathematical, contributing to foundational aspects of discrete mathematics.