Find Academic Supervisors

Felix KrahmerView profile

Assistant Professor

• Compressed Sensing
• Signal Processing
• Optimization
• +4 more

Prof. Felix Krahmer is a TUM Tenure Track Assistant Professor of Optimization and Data Analysis at the Department of Mathematics, Technische Universität München (TUM), part of the School of Computation, Information and Technology. Previously, he held a Junior Professorship (W1) for Mathematical Data Analysis at the University of Göttingen (2012–2015). His research focuses on mathematical foundations of data science, including compressed sensing, signal quantization, uncertainty quantification, and optimization algorithms. He has led an Emmy Noether research group and contributed to the ZeMat interdisciplinary project. Education : PhD in Mathematics (2009), New York University, advisors: Percy Deift & Sinan Güntürk MSc in Mathematics (2007), New York University BSc in Mathematics (2004), Jacobs University Bremen Research Interests : Krahmer’s work bridges theoretical mathematics and applied data science. Key areas include compressed sensing algorithms, high-dimensional signal reconstruction, quantization theory for analog-to-digital conversion, and optimization methods for inverse problems. He also explores applications in imaging (e.g., MRI reconstruction) and stochastic processes. Key Contributions : His research on phase retrieval, sigma-delta quantization, and compressed sensing recovery has advanced signal processing techniques. Recent efforts focus on uncertainty quantification for high-dimensional inverse problems and the mathematical analysis of consensus-based optimization. Grants & Awards : Emmy Noether Research Group Grant (DFG) Funding from BMBF (ZeMat project) Teaching & Outreach : Krahmer has taught advanced courses on compressed sensing, functional analysis, and random matrix theory. He co-organized workshops on probabilistic techniques and clinical risk prediction, emphasizing interdisciplinary collaboration. Labs/Teams : Member of the TUM Data Science Research Group, focusing on optimization, imaging, and uncertainty quantification. Active in the Munich Center for Quantum Science and Technology (MCQST).

• Algorithmic Game Theory
• Combinatorial Optimization
• Traffic Flow Equilibria
• +4 more

Prof. Laura Vargas Koch serves as Junior Professor at RWTH Aachen University, leading the Teaching and Research Unit of Algorithmic Game Theory and Discrete Mathematics (GDM). Her interdisciplinary work bridges mathematics, computer science, and economics through rigorous theoretical frameworks. Her research focuses on: Algorithmic Game Theory : Analyzing fair pricing mechanisms and equilibrium structures in traffic flow systems Combinatorial Optimization : Developing approximation algorithms for clustering problems and graph-based optimization Analysis of her 2021-2025 publications reveals evolving expertise in dynamic traffic modeling, routing game equilibria, and auction mechanism design. Her work consistently addresses theoretical foundations while maintaining practical relevance to transportation networks and resource allocation systems. The GDM unit under her direction provides specialized coursework and fosters collaborative research at the intersection of discrete mathematics and economic modeling.

Mahsa GhasemiView profile

Assistant Professor

• Reinforcement Learning
• Control Theory
• Active Perception
• +3 more

Mahsa Ghasemi is an Assistant Professor in the Elmore Family School of Electrical and Computer Engineering at Purdue University, leading the AKADEMI Group. Her research focuses on theoretical advancements in trustworthy sequential decision-making for autonomous systems, emphasizing human-aware collaboration and adaptation to dynamic environments. She is affiliated with the Institute for Control, Optimization and Networks (ICON). Education: PhD in Electrical and Computer Engineering from The University of Texas at Austin (2021), MSE in Mechanical Engineering (2017), and BSc in Mechanical Engineering from Sharif University of Technology (2014). Research Interests: Reinforcement learning, control theory, active perception, multi-agent systems, robotics, and online learning. Applications span disaster response, healthcare, and autonomous systems design. Key methodological directions include compositional learning, human-AI collaboration, and adaptive decision-making under uncertainty. Teaching: Courses include Reinforcement Learning Theory (ECE 59500), Introduction to Reinforcement Learning (ECE 49595), and Python for Data Science (ECE 20875). Awards: Finalist for Student Best Paper Award at the 2018 American Control Conference (ACC). Students: Current advisees include Maheed H. Ahmed, Jayanth Bhargav, and Somtochukwu Oguchienti. Past members include Lai Wei and Juan Sebastian Mateo Ruiz Bulla. Service: Editorial roles at ICRA, ICCPS, and IFAC workshops. Reviewer for top conferences (NeurIPS, ICML) and journals (Automatica, IEEE TAC). Labs/Teams: Leads the AKADEMI Group, focusing on algorithmic and theoretical research in autonomous decision-making systems.

Karsten UrbanView profile

Professor

• Numerical Mathematics
• Scientific Computing
• Partial Differential Equations
• +9 more

Prof. Karsten Urban is a Full Professor of Numerical Mathematics at the University of Ulm, leading the Institute for Numerical Mathematics. He holds roles such as Dean of Studies in Computational Science and Engineering (CSE) and Deputy Spokesman for the Research Association for Scientific Computing in Baden-Württemberg. He is an active member of prestigious societies including the Deutsche Mathematikervereinigung (DMV) and SIAM. His academic journey includes a PhD from RWTH Aachen (1995), Habilitation (2001), and a full professorship at Ulm since 2005. Research focuses on numerical methods for PDEs, reduced basis techniques, multiscale simulations in fluid mechanics, biomechanics, quantum sciences, and financial mathematics. He has pioneered wavelet-based methods and collaborated with industries on ship propulsion and energy trading models. His work integrates mathematical rigor with real-world applications, emphasizing model reduction and computational efficiency. Editorial Roles: Managing Editor of Advances in Computational Mathematics , Editor of SN Partial Differential Equations and Applications . Awards: Teaching award of Baden-Württemberg (2005), Science-Economy Cooperation Awards (2004, 2008). Administrative Roles: Member of the University Council and ASIIN expert committee. Supervises doctoral students in numerical analysis, quantum simulations, and biomechanics. Active in interdisciplinary projects, including quantum systems (IQST) and fracture healing modeling in collaboration with biomechanics experts. His contributions bridge academia and industry, driving innovation in computational methods.

Martin GreplView profile

Professor

• Numerical Methods for Partial Differential Equations (PDEs)
• Model Order Reduction
• Reduced Basis Methods
• +4 more

Professor Dr. Martin Grepl is a faculty member at RWTH Aachen University, where he holds the Lehr- und Forschungsgebiet Optimierung mit partiellen Differentialgleichungen (Teaching and Research Area in Optimization with Partial Differential Equations). He has been affiliated with RWTH Aachen since 2009, first as a Professor (W1) and since 2014 as a Professor (W2). Education: Diplom-Ingenieur (Aerospace Engineering), University of Stuttgart (2000) Master of Science (Mechanical Engineering), MIT (2001) Doctor of Philosophy (Mechanical Engineering), MIT (2005) His research focuses on numerical methods for partial differential equations (PDEs) , particularly model order reduction , reduced basis methods , finite element methods , and optimal control for parametrized PDEs. He also investigates parameter estimation , inverse problems , and control constraints in elliptic and parabolic PDE systems. The scientific awards he has received include the Studienstiftung des deutschen Volkes (1997-2000), a Fellowship from the Dr. Jürgen Ulderup-Stiftung (1998-1999), and the Lehrpreis der Fachschaft Mathematik/Physik/Informatik (2011). His work spans applications in manufacturing , medical physics , and fluid dynamics , as evidenced by his patents and collaborative research. His publications demonstrate expertise in reduced basis methods for nonaffine/nonlinear PDEs , trust region optimization , and error bounds for real-time and many-query scenarios. His collaborations often involve interdisciplinary applications, including thermal conduction , welding processes , and glomerular filtration modeling .

Yann DisserView profile

Professor

• Combinatorial Optimization
• Online Algorithms
• Graph Theory
• +6 more

Professor Yann Disser is a faculty member in the Department of Mathematics at TU Darmstadt since 2021. He previously held an Assistant Professor (tenure-track) position at TU Darmstadt (2016-2021), a PostDoc position at TU Berlin (2012-2016), and a Visiting Professor role at Augsburg University (2015). His research spans Combinatorial Optimization , Online Algorithms , Graph Exploration , Computational Complexity , and Robust Optimization . Current position: Professor (W2), TU Darmstadt Previous: Assistant Professor (2016-2021), TU Darmstadt PostDoc & Habilitation: TU Berlin (2012-2016) His research focuses on algorithmic approaches to optimization problems, including: Combinatorial Optimization for problems like Steiner trees and knapsack variants Online Algorithms with applications to scheduling and transportation Graph Exploration by mobile agents and complexity bounds Computational Complexity of linear programming pivot rules Network Flows and geometric reconstruction Recent publications analyze incremental maximization with greedy methods, lower bounds for active-set methods , and universal circuit designs . His work appears in top venues like IPCO , ESA , and SODA . He advises a team of researchers including David Weckbecker, Farehe Soheil, and Alexander Birx. Current and past advisees often focus on algorithmic theory, with placements at institutions like HPI Potsdam and Merck.

• Theorem Proving
• Automated Reasoning
• Formal Methods
• +14 more

Jasmin Blanchette is a Professor of Theoretical Computer Science and Theorem Proving at the Institute for Informatics, Ludwig-Maximilians-Universität München (LMU), where he also serves as Dean of Studies for Computer Science since January 2024. He is additionally affiliated as a guest researcher with the VeriDis group at Loria in Nancy, France. His research lies at the intersection of automated and interactive theorem proving, with a focus on higher-order logic and proof automation. Key projects include the development of tools like Sledgehammer, Nitpick, and Zipperposition, and foundational work on (co)datatypes and higher-order superposition. His recent publications reflect a strong trend in formalizing and verifying automated reasoning techniques, especially in higher-order logic, with applications in proof automation, SMT solving, and logical verification. Articles frequently appear in top venues such as CADE, ITP, and the Journal of Automated Reasoning. CADE 2023 Best Paper Award for 'Verified given clause procedures' FroCoS 2023 Best Paper Award (with Visa Nummelin and Sander Dahmen) IPA Dissertation Award (awarded to his student Petar Vukmirović) Dutch 'cum laude' distinction (awarded to his student Anne Baanen) Dutch Prize for ICT Research 2022 Blanchette has advised numerous PhD and postdoctoral researchers, many of whom are now active contributors to the formal methods community. He has received significant research grants through projects like Matryoshka and Nekoka. He is also the editor-in-chief of the Journal of Automated Reasoning and plays a central role in organizing key conferences such as ITP, CADE, and CPP. He leads an active research group at LMU, consisting of postdocs and PhD students working on topics such as higher-order superposition, formalization of voting systems, categorical logic, and proof search heuristics. The team collaborates closely with international groups, including those at Inria and TU Wien.

Mathias WellerView profile

Professor

• Parameterized Algorithmics
• Genome Scaffolding
• Phylogenetic Networks
• +3 more

Mathias Weller is a Professor and Chair of the AKT group at Université Gustave Eiffel (Paris), France. Previously, he held a Full-Time Researcher position at CNRS/LIGM (2018–2022) and postdoctoral roles at LIRMM (2013–2017). He earned his PhD in Theoretical Computer Science from TU Berlin (2012) and a Diploma in Computer Science from Friedrich Schiller University Jena (2009). His research focuses on Parameterized Algorithmics, Genome Scaffolding, Phylogenetic Networks, and Structural Parameterization. He has contributed extensively to algorithm design for computational biology, including preprocessing techniques and kernelization concepts. Weller’s work bridges theoretical computer science and applied bioinformatics, addressing challenges in phylogenetic analysis, genome assembly, and combinatorial optimization. His publications span algorithmic efficiency, network analysis, and complexity theory, with a focus on practical applications in genomics and phylogenetics.

Max WillseyView profile

Assistant Professor

• Program Optimization
• Programming Languages
• Databases
• +5 more

Max Willsey is an Assistant Professor in the Department of Electrical Engineering and Computer Sciences at the University of California, Berkeley, since 2024. He specializes in program optimization, leveraging techniques from programming languages, databases, and systems to develop robust and accessible compiler frameworks. His research focuses on equality saturation, E-Graphs, and the integration of Datalog with compiler optimizations. He has contributed to advancements in unifying algorithmic approaches, enabling faster and more extensible program analysis. Teaching: CS 164 (Programming Languages and Compilers, Spring 2025), CS 265 (Compiler Optimization, Fall 2024), and CS 294-260 (Declarative Program Analysis and Optimization, Spring 2024). Research Highlights: Development of the egg and egglog projects, co-organizing the EGRAPHS workshop, and leading the EGRAPHS Community for e-graphs researchers. His recent articles highlight trends in unifying traditional hash joins with worst-case optimal joins, applying equality saturation to diverse domains like Datalog and tensor graph optimization, and advancing E-Graphs for program synthesis and formal verification. Scientific Awards: SIGMOD Record Research Highlight, 2024 MIT PL Review Selection, 2024 Distinguished Paper, OOPSLA 2021 and POPL 2021 NSF Graduate Research Fellowship Honorable Mention, 2018 Qualcomm Innovation Fellow, 2019 Service: Committee Member, PLDI 2025, POPL 2025, ASPLOS 2025 Co-organizer, EGRAPHS 2024 and 2023 workshops Interviewer, UC Berkeley Graduate Admissions Committee, 2024

Bernard HaasdonkView profile

Professor

• Model Reduction
• Parametrized Partial Differential Equations (PDEs)
• Kernel Methods
• +7 more

Bernard Haasdonk is a Professor at the University of Stuttgart, affiliated with the Institute of Applied Analysis and Numerical Simulation (IANS), part of the Faculty of Mathematics and Computer Science. His research focuses on model reduction techniques for parametrized partial differential equations (PDEs), kernel-based methods, numerical analysis, and machine learning applications in scientific computing. He leads a research group in numerical mathematics and has contributed to software tools like RBMatlab and KerMor. Affiliations: Institute of Applied Analysis and Numerical Simulation, University of Stuttgart Roles: Academic Researcher, Software Developer, Grant Principal Investigator His work bridges numerical simulation, machine learning, and reduced basis methods, addressing challenges in optimal control, fluid dynamics, and biomechanics. Haasdonk has held multiple funded projects, including those on kernel methods for model reduction and certified RB-ML-ROM surrogate models. Research Interests: Model reduction for PDEs, kernel methods, greedy algorithms, numerical analysis, optimal control, and applications in fluid dynamics and porous media. He emphasizes structure-preserving methods for Hamiltonian systems and data-driven approaches for surrogate modeling. Publications: Over 200 articles in journals like SIAM, BIT Numerical Mathematics, and Physica D, focusing on convergence analysis, kernel-based approximation, and reduced-order modeling. Recent trends include adaptive greedy algorithms, symplectic model reduction, and energy-conserving surrogates. Awards: IEEE PerCom 2017 Best Paper Award, Teaching Excellence Awards (2012-2017), and early-career research grants. Grants: DFG-funded projects on model reduction, SimTech Cluster contributions, and collaborations on fuel cells and biomechanics. Teams: Leads the Numerical Mathematics Research Group at IANS, collaborating with interdisciplinary teams on projects like MORCOS (Model Order Reduction of Coupled Systems) and KerMor (Kernel Methods for Model Reduction).

Roderich GroßView profile

Professor

• swarm robotics
• multi-robot-systems
• modular and reconfigurable robotics
• +1 more

Professor Roderich Groß is a faculty member at Technical University of Darmstadt, where he serves as Head of the RCPS Lab (Robotics, Control, and Physical Systems Laboratory). His extensive research career spans over two decades with publications dating back to 2006, establishing him as a leading figure in swarm robotics. His work appears in top-tier robotics journals including IEEE Transactions on Robotics, Nature Communications, and The International Journal of Robotics Research. Professor Groß's research focuses on swarm robotics, multi-robot systems, modular and reconfigurable robotics, and human-robot interaction. His work explores how groups of relatively simple robots can collectively perform complex tasks through decentralized control mechanisms. He investigates modular systems that can adapt their physical structure to different tasks and develops human-robot interaction paradigms that enable effective collaboration between humans and robot swarms. His research has practical applications in search and rescue, environmental monitoring, construction, and industrial automation. Analysis of Professor Groß's recent publications reveals a clear evolution from foundational swarm behaviors toward increasingly sophisticated applications. His work addresses critical challenges including energy management in robot swarms (CapBot), multi-operator control interfaces, heterogeneous systems for industrial applications, and bio-inspired collective behaviors. His research bridges theoretical swarm intelligence principles with practical implementation on physical robot platforms like Kilobots, with recent work integrating artificial intelligence techniques such as language models for swarm control. As Head of the RCPS Lab, Professor Groß leads a productive research group with extensive international collaborations. The lab works with various robot platforms focusing on both theoretical modeling and practical implementation of swarm behaviors, contributing significantly to advancing the field of swarm robotics from theoretical foundations to real-world applications.

André UschmajewView profile

Professor

• Numerical Analysis
• Tensor Methods
• Low-Rank Approximation
• +7 more

Prof. Dr. André Uschmajew is a full professor and holds the Chair of Mathematical Data Science at the Institute of Mathematics, Faculty of Mathematics, Natural Sciences, and Materials Engineering, University of Augsburg, Germany. He has held prominent research and academic positions at institutions including the Max Planck Institute for Mathematics in the Sciences (Leipzig), University of Bonn, and EPF Lausanne. 2022–present: Chair of Mathematical Data Science, University of Augsburg 2017–2022: Research Group Leader, Max Planck Institute MiS Leipzig 2014–2017: Bonn Junior Fellow Professorship, University of Bonn 2013: Ph.D. in Mathematics, TU Berlin His research centers on the theoretical and computational aspects of low-rank tensor and matrix approximations, with deep connections to Riemannian optimization, functional analysis, and high-dimensional scientific computing. He investigates the geometry of low-rank varieties, convergence of alternating algorithms, and applications in data science and dynamical systems. His work combines rigorous mathematical analysis with algorithmic innovation. The recent publications (2023–2025) reflect a strong focus on optimization methods for low-rank structures, dynamical low-rank approximation for PDEs like the Vlasov-Poisson equation, randomized SVD, Sinkhorn-type algorithms with overrelaxation, and Kronecker product operator approximation. Key themes include convergence analysis, algorithmic acceleration, and applications in scientific computing and signal processing. Although no specific awards are listed, his publication record in top-tier journals such as Numerische Mathematik , SIAM Journal on Optimization , and Foundations of Computational Mathematics indicates significant recognition in applied mathematics and numerical analysis. He advises students and researchers in mathematical data science and numerical analysis, though specific advisees are not named. He teaches courses such as Kernel Methods and Linear Algebra II. He has collaborated with leading researchers including Bart Vandereycken, Daniel Kressner, and Wolfgang Hackbusch. His work is supported through institutional affiliations and likely research grants, though specific grants are not listed. He is actively involved in the development of numerical methods for high-dimensional problems, particularly using tensor networks and manifold optimization. He is affiliated with research teams at the University of Augsburg and previously led a group at the Max Planck Institute MiS Leipzig, focusing on mathematical aspects of data science and tensor methods.

• Blockchain Technology
• Distributed Systems
• Cryptography
• +3 more

Lucianna Kiffer is a researcher at ETH Zurich, Switzerland, specializing in blockchain technology, distributed systems, and cybersecurity. Her work focuses on peer-to-peer networks, consensus mechanisms, and cryptographic protocols within blockchain systems. Notably, she has contributed to studies on Ethereum's architecture, including analyses of Proposer-Builder Separation and the post-Merge PoW landscape. Her research also explores network stability, latency optimization, and adversarial scenarios in decentralized systems. Her publications span conferences like CCS, FC, and SIGMETRICS, addressing topics such as Nakamoto consensus under resource constraints and strategic behavior in P2P networks. Collaborations with experts like Roger Wattenhofer and Ari Juels highlight her engagement with cutting-edge challenges in distributed systems and cryptocurrency infrastructure.

Armin IskeView profile

Professor

• Numerical Approximation
• Applied Mathematics
• Kernel Methods
• +4 more

Prof. Dr. Armin Iske is a Full Professor of Numerical Approximation at the University of Hamburg's Department of Mathematics, within the Faculty of Mathematics, Computer Science and Natural Sciences. He holds a PhD from the University of Göttingen (1994) and habilitation from TU Munich (2002). His research focuses on numerical approximation, kernel-based methods, computational fluid dynamics, and medical imaging. He has held academic positions globally, including visiting roles at ANU (Australia) and the University of Leicester (UK). Research interests include scattered data approximation, adaptive particle methods for flow simulation, and high-dimensional data analysis. He has authored 118+ publications, including works on kernel interpolation, medical imaging reconstruction, and machine learning applications. He serves on editorial boards for journals like Advances in Computational Mathematics and Sampling Theory . His contributions span interdisciplinary projects, such as SFB/TRR 181 on energy transfer in atmosphere and ocean, and collaborations in nanotechnology for brain interfaces. His work bridges theoretical mathematics with practical applications in engineering and biosciences.

• Mathematical Statistics
• Stochastic Processes
• Machine Learning Theory
• +4 more

Dr. Mahsa Taheri is a Scientific Associate (faculty-level researcher) in the Department of Mathematics at the University of Hamburg , embedded within the Faculty of Mathematics, Computer Science and Natural Sciences. She belongs to the research section Mathematical Statistics and Stochastic Processes and focuses on the emerging area Mathematics of data-based methods . Research Interests: Her work sits at the intersection of mathematical statistics, stochastic processes, and machine-learning theory . She develops non-asymptotic guarantees for modern learning algorithms, studies regularization and sparsity in deep neural networks, and quantifies statistical-computational trade-offs in high-dimensional regimes. Publication Trends: Across 13 peer-reviewed contributions (2016-2025) she consistently addresses the theoretical foundations of learning algorithms, with a marked emphasis on sample complexity, regularization, sparsity, and efficiency in neural networks and high-dimensional regression. The 2025 preprints extend this agenda to diffusion models and tail-index estimation. Scientific Awards: None explicitly reported in the available material. Advising & Grants: No advisee list or grant information was provided in the source text. Labs & Teams: She is part of the Mathematics of data-based methods research team within the Mathematical Statistics and Stochastic Processes unit; no dedicated laboratory name is mentioned.