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

• Nanotechnology
• Materials Science
• Photovoltaics
• +۴ مورد دیگر

Professor Thomas Bein is affiliated with the Department of Chemistry at Ludwig-Maximilians-Universität München (LMU) , where he leads the Functional Nanosystems research group. His work focuses on synthesizing and characterizing nanostructured materials with applications in energy, catalysis, and biomedical delivery. Mesoporous nanoparticles for drug delivery Semiconductor nano-morphologies for photovoltaics Photoelectrochemical water splitting Metal-organic frameworks (MOFs) Electroactive networks His research emphasizes atomic-scale control of material architectures using self-assembly, hydrogen bonding, and covalent interactions, enabling precise tuning of electronic, optical, and catalytic properties. A review of his recent publications reveals cutting-edge investigations into covalent organic frameworks (COFs), perovskite-inspired solar materials, and functional nanoparticle systems. Key trends include optimizing energy conversion efficiency, enhancing stability in optoelectronic devices, and exploring bio-compatible nanocarriers for targeted therapies. Professor Bein’s group actively contributes to interdisciplinary projects at the intersection of chemistry, physics, and biomedical engineering, with ongoing collaborations in solar energy, sustainable materials, and nanomedicine.

Paul Gölzمشاهده پروفایل

استادیار

• Social Choice Theory
• Algorithmic Fairness
• AI Ethics
• +۳ مورد دیگر

Paul Gölz is an Assistant Professor at Cornell University's School of Operations Research and Information Engineering (ORIE), with affiliations in Computer Science. His research focuses on computational social choice, algorithmic fairness, and AI ethics, addressing topics like democratic innovation, fair resource allocation, and AI systems for diverse users. Education: Undergraduate studies at Saarland University (Germany), PhD in Computer Science from Carnegie Mellon University, followed by postdoctoral research at Harvard University, UC Berkeley, and the Simons Laufer Mathematical Sciences Institute. His work has been recognized with awards including the JPMorgan Chase AI Research Fellowship (2021) and honorable mentions for prestigious dissertation awards (Dantzig and ACM SIGecom). Research Highlights : Developed Panelot, a tool for selecting citizens' assemblies using state-of-the-art algorithms. His work on fair refugee resettlement and apportionment methods has been featured in Operations Research and Nature . Recent projects include AI alignment distortion analysis and generative social choice mechanisms. Teaching : Teaches Optimized Democracy (Spring 2025) and Mathematical Programming (Fall 2024). Supervises PhD students in ORIE, focusing on interdisciplinary applications of optimization and social choice. Awards & Grants : Received a $40K Structural Democracy Fellowship (Crankstart) and an OpenAI grant for Democratic Inputs to AI. Active in policy briefs (e.g., mini-public selection strategies). Labs/Tools : Co-developed Panelot.org , a nonprofit platform for fair citizen assembly selection. Active in open-source tool development for social choice applications.

Ashley Montanaroمشاهده پروفایل

استاد

• Quantum Computation
• Quantum Algorithms
• Quantum Information Theory
• +۳ مورد دیگر

Ashley Montanaro is Professor of Quantum Computation in the School of Mathematics at the University of Bristol, and co-founder of the quantum software startup Phasecraft. He is a member of the Quantum Information Theory research group at Bristol. His research focuses on the theory of quantum computing, with particular interest in quantum algorithms, computational complexity, quantum query and communication complexity, and classical algorithms. His work spans both theoretical foundations and practical applications of quantum computing. Montanaro's research output shows significant trends toward quantum algorithms for optimization problems, quantum computational supremacy, and bridging theoretical advances with practical implementation challenges. His publications span foundational quantum information theory to applied quantum algorithms, demonstrating a versatile research program that connects computer science with quantum physics. Among his professional activities, Montanaro served on the QIP steering committee (2016-2018) and was an editor for the Quantum journal until 2019. He has been active in conference organization, serving on program committees for ITCS 2018, AQIS 2017 and 2015, QIP 2015, and TQC 2014 and 2013, reflecting his standing in the quantum computing research community. He has supervised numerous PhD students including Josh Blake, Jorja Kirk, Sheila Perez Garcia, Sami Boulebnane, Jan Lukas Bosse, Lana Mineh, Joao F. Doriguello, Chris Cade, Sam Pallister, and Stephen Piddock. His teaching includes Quantum Computation (MATHM0023) which he has taught since 2014 and Advanced Quantum Information Theory which he taught in 2015 and 2016. As co-founder of Phasecraft, Montanaro is actively translating theoretical quantum computing advances into practical software solutions, positioning him at the intersection of academic research and quantum technology commercialization.

Christopher Morrisمشاهده پروفایل

استادیار

• Machine Learning
• Graph Neural Networks
• Computer Science Theory
• +۳ مورد دیگر

Christopher Morris is a tenure-track Assistant Professor at RWTH Aachen University and a DFG Emmy Noether fellow. He leads the Learning on Graphs (LoG) research group, focusing on machine learning methods for structured data, particularly graph neural networks. His work bridges machine learning, computer science theory, and discrete mathematics, addressing challenges in generalization, expressivity, and algorithmic efficiency. Education: PhD in Computer Science from TU Dortmund University (advised by Petra Mutzel and Kristian Kersting), postdoctoral research at Mila - Quebec AI Institute (Siamak Ravanbakhsh) and McGill University, and Polytechnique Montréal (Andrea Lodi). Research interests emphasize graph machine learning, including generalization theory, combinatorial optimization, and scalable graph embeddings. Notable contributions include analyzing Weisfeiler-Leman algorithms' impact on GNNs' expressivity and generalization (VC dimension connections). Awards: DFG Emmy Noether Fellowship. Supervises six PhD students in Aachen. Active in teaching, offering courses on graph-based machine learning foundations and applications since 2022. Labs/Teams: LoG group at RWTH Aachen, collaborating with institutions like Mila and Polytechnique Montréal. Erdős number 3 through Petra Mutzel’s collaboration network.

Lars Rohwedderمشاهده پروفایل

دانشیار

• Algorithms
• Approximation Algorithms
• Online Algorithms
• +۳ مورد دیگر

Lars Rohwedder is an Associate Professor in the Algorithms Group at the University of Southern Denmark (SDU) in Odense. He previously held positions as an Assistant Professor at Maastricht University (Netherlands) and postdoc researcher at EPFL, Lausanne (Switzerland). He earned his Ph.D. in Computer Science from CAU Kiel (Germany), advised by Klaus Jansen, and is a recipient of the 2019 PhD of the year award from Förderverein der TF of Kiel University. His research focuses on algorithms for combinatorial optimization, including approximation algorithms, online algorithms, parameterized algorithms, and integer programming. He has contributed to solving scheduling problems, resource allocation, and optimization under uncertainty. Rohwedder has served on program committees for conferences like MAPSP, SODA, STACS, and ICALP. He is funded by NWO's Open Competition M1 project on quasi-polynomial time algorithms. His teaching includes courses on advanced algorithms, operations management, and optimization at SDU and Maastricht University. Key achievements include a quasi-polynomial approximation for the restricted assignment problem, FPT algorithms for scheduling, and contributions to the Submodular Santa Claus problem. His work bridges theoretical foundations and practical applications, with a focus on algorithmic efficiency and robustness.

Igors Gorbovickisمشاهده پروفایل

دانشیار

• Dynamical Systems
• Complex Analysis
• Discrete Geometry
• +۳ مورد دیگر

Prof. Igors Gorbovickis is an Associate Professor of Mathematics at the Department of Mathematics, School of Computer Science and Engineering, Constructor University (formerly Jacobs University Bremen). His research focuses on complex dynamical systems, including topics such as renormalization theory, bifurcation analysis, Julia sets, and applications to mathematical physics. He also contributes to discrete geometry, particularly exploring conjectures like the Kneser-Poulsen problem. His work bridges pure mathematics with interdisciplinary applications, emphasizing rigorous analysis of nonlinear systems and geometric configurations. Key areas of investigation include critical point accumulations, Hausdorff dimension estimates, and equidistribution phenomena in parameter spaces. Recent publications highlight advancements in understanding chaotic systems, circle maps, and the interplay between algebraic structures and dynamical behavior. Prof. Gorbovickis collaborates internationally, with co-authored papers appearing in journals like Advances in Mathematics , Ergodic Theory and Dynamical Systems , and Nonlinearity . His office is located at Research I, Room 128 on the Constructor University campus in Bremen, Germany.

• Finite Model Theory
• Graph Structure Theory
• Computational Complexity
• +۳ مورد دیگر

Kord Eickmeyer is a Lecturer at Technische Universität Darmstadt in the Department of Mathematics, specializing in the mathematical logic group. He holds a PhD in mathematics from Humboldt University Berlin and has held postdoctoral positions at TU Darmstadt (2011–2017) and the National Institute of Informatics in Tokyo (2011–2013). His research focuses on finite model theory, graph structure theory, and computational complexity, particularly in descriptive and parameterized complexity, as well as randomization and derandomization techniques. Research interests include exploring the boundaries of computational complexity through logical frameworks, analyzing graph structures for efficient algorithm design, and investigating the role of randomness in computation. His work bridges theoretical computer science and mathematical logic, with applications in algorithm design and formal methods. Publications span topics from model-checking on ordered structures to gap-planar graphs and randomized logics. Collaborations include prominent institutions like the National Institute of Informatics and Humboldt University Berlin. No scientific awards are explicitly listed, but his extensive academic contributions reflect a strong research trajectory. Advising and grants are not detailed in the provided text, though his academic career includes supervision roles during his PhD and postdoctoral phases. His involvement with the mathematical logic group at TU Darmstadt highlights collaborative research efforts in foundational areas of computer science and mathematics.

Mathias Niepertمشاهده پروفایل

استاد

• Artificial Intelligence
• Machine Learning
• Graph Neural Networks
• +۵ مورد دیگر

Mathias Niepert is a Professor at the Institute for Artificial Intelligence within the Faculty of Computer Science, Electrical Engineering and Information Technology at the University of Stuttgart. His research focuses on advancing machine learning techniques with applications in scientific computing, graph neural networks, and medical imaging. He is particularly known for contributions to physics-informed neural networks, equivariant models, and graph learning frameworks. Key research areas include: Scientific Machine Learning for PDEs and molecular modeling Graph neural networks and their theoretical limitations Medical vision-language models and multimodal learning Efficient neural network architectures (transformers, FNOs) Domain knowledge integration in deep learning His work often bridges theoretical foundations with practical applications, as evidenced by extensive publications (2018–2025) on topics like adaptive message passing, equivariant networks, and medical imaging systems. He has contributed to benchmark development through initiatives like PDEBench and pioneered methods for equivariant diffusion models and molecular representation learning. His current projects emphasize: Improving generalization in Fourier Neural Operators Addressing oversmoothing in graph networks Combining physics principles with neural architectures Medical AI applications through multimodal fusion

• Theoretical Computer Science
• Computational Geometry
• Algorithms
• +۳ مورد دیگر

Günter Rote is a Professor in the Department of Computer Science at Freie Universität Berlin, specifically within the Theoretical Computer Science group (Arbeitsgruppe Theoretische Informatik). He holds a formal academic title of Professor Dr. and is affiliated with the Faculty of Mathematics and Computer Science. His research focuses on theoretical computer science, computational geometry, algorithms, and discrete mathematics. Key research interests include geometric algorithms, optimization problems (e.g., shortest paths, traveling salesman problems), and algorithm design for parallel computing systems. His work spans topics such as systolic arrays, convex hulls, and combinatorial optimization. Rote’s contributions include foundational studies on computational geometry problems, algorithmic complexity, and practical applications in energy equity and infrastructure design. Publications highlight contributions to solving extremal equations, polygon transformations, and the quadratic assignment problem. He has been active in academic leadership, mentoring students, and contributing to computational science communities. His email is rote@inf.fu-berlin.de, and his office is located at Takustraße 9 in Berlin.

• Database Systems
• Graph Databases
• Data Management
• +۷ مورد دیگر

Amol Deshpande is a Professor in the Department of Electrical Engineering and Computer Sciences at the University of California, Berkeley, College of Engineering. With over 160 publications spanning from 2000 to 2025, his research has significantly impacted the database systems community. His work bridges theoretical foundations with practical systems, evidenced by numerous publications in top-tier venues including SIGMOD, VLDB, and ICDE. Professor Deshpande's research focuses on database systems, with particular expertise in graph databases, data management, probabilistic databases, query optimization, and data provenance. His work addresses fundamental challenges in managing complex data, including efficient graph analytics, dataset versioning, streaming data processing, and privacy-preserving data management. Recent research directions include entity-relationship abstractions beyond traditional relations, standalone catalog engines for large data systems, and graph theoretical approaches to dataset versioning. His publication trends show a consistent focus on evolving database technologies, with early work on probabilistic databases and query optimization, transitioning to graph analytics and data provenance, and more recently addressing modern challenges in data cataloging, privacy-first data management, and serverless stream processing. His research spans both theoretical contributions (e.g., approximation algorithms for stochastic optimization) and practical systems building (e.g., RStore, TreeCat). Professor Deshpande has mentored numerous PhD students who have become active researchers in the database community, including Hui Miao, Souvik Bhattacherjee, and Konstantinos Xirogiannopoulos. His collaborative work spans across institutions, with frequent collaborations with researchers from MIT, University of Maryland, and other leading institutions. His research has been supported by major funding agencies and has influenced both academic research and industry practices in data management. The evolution of his work reflects the changing landscape of data management, from traditional relational systems to modern graph and streaming data challenges.

Ignasi Sau Vallsمشاهده پروفایل

پژوهشگر

• Graph Theory
• Parameterized Complexity
• Algorithmic Graph Theory
• +۵ مورد دیگر

Ignasi Sau Valls is a Directeur de Recherche (DR2) at CNRS, affiliated with the LIRMM laboratory at Université de Montpellier, France. He is a member of the AlGCo team, focusing on algorithms for graphs and combinatorics. His academic background includes dual degrees in Mathematics and Telecommunications Engineering from UPC (Barcelona), a PhD in joint supervision between UPC and Projet Mascotte (Sophia Antipolis), and a postdoctoral position at the Technion (Israel). He has been with CNRS since 2010 and was promoted to his current role in October 2024. He also served as a Visiting Professor at UFC (Brazil) from 2016–2017. His research interests lie primarily in Graph Theory and Parameterized Complexity , with a focus on structural graph properties, kernelization, and algorithm design. He has made significant contributions to problems involving minor-closed graph classes, treewidth, and graph modification. His work bridges theoretical foundations with algorithmic applications, particularly in discrete optimization and network problems. The recent articles highlight a strong trend in parameterized algorithms, especially for graph modification, kernelization, and structural graph problems. Topics such as hitting minors, dynamic programming on tree decompositions, and edge contractions reflect a deep engagement with structural parameterizations and fixed-parameter tractability. His publications frequently appear in top-tier journals like SIAM Journal on Computing, Journal of Combinatorial Theory, and Algorithmica, as well as major conferences such as ICALP, SODA, and IPEC. Best paper award of Track C of ICALP'10 Best student paper award of WG'09 Ignasi Sau has been a principal investigator of the ANR JCJC project ELIT (ANR-20-CE48-0008-01), funded with 169k€ from 2021 to 2026. He serves as an editor for DMTCS and Information and Computation , and has held significant organizational roles, including PC member of numerous conferences (MFCS, WG, IPEC, COCOON) and as co-chair and main organizer of WG 2019, ICGT 2022, and JCALM 2023. He has delivered invited courses at international schools in France, Argentina, and Brazil. He is actively involved in the research community through editorial duties, conference organization, and collaborative research. His lab affiliation is the AlGCo team at LIRMM, a leading group in algorithmic graph theory and combinatorics.

Jürg Kramerمشاهده پروفایل

استاد

• Arakelov Geometry
• Automorphic Forms
• Modular Forms
• +۵ مورد دیگر

Prof. Jürg Kramer is a Professor of Mathematics at Humboldt University of Berlin, affiliated with the Faculty of Mathematics and Natural Sciences and the Institute of Mathematics. His research focuses on Arakelov geometry, automorphic forms (particularly modular forms), and their intersections. Notable contributions include advancements in arithmetic intersection theory with logarithmic singularities and sup-norm bounds for modular forms. He is also deeply engaged in mathematics education, leading initiatives for teacher training and promoting mathematical talent through networks like the Berlin School Mathematics Network. Active in academic service, he served as EMS Education Committee Chair (2017–2022) and President of the German Mathematical Society (2013/14). His work bridges pure mathematics with pedagogical innovation, emphasizing public understanding through popular science publications. Research: Arakelov geometry, modular forms, L-functions, hyperbolic geometry methods Education: Teacher training programs, math talent promotion, textbook authorship Affiliations: Leibniz Institute for Science and Mathematics Education (IPN), EMS, Deutsche Akademie der Technikwissenschaften Key educational contributions include Felix-Klein teacher training programs and co-authoring standards for mathematics teacher education. His publications span advanced mathematical research and accessible expositions on topics like Fermat’s Last Theorem and Riemann Hypothesis.

• Distributed Machine Learning
• Privacy Preserving Computing
• Federated Learning
• +۳ مورد دیگر

Maximilian Egger is a Doctoral Researcher at the Institute for Communications Engineering under Prof. Antonia Wachter-Zeh at the Technical University of Munich (TUM). His research focuses on distributed machine learning, privacy-preserving computing, and information theory. He holds an M.Sc. in Electrical Engineering and Information Technology (2022, TUM) and a B.Eng. in Electrical Engineering (2020). He has conducted research stays at École Polytechnique Fédérale de Lausanne (2024) and Imperial College London (2023). Egger has received several awards, including the DAAD Scholarship (2023) and the VDE Award Bavaria (2020). His work emphasizes secure federated learning, Byzantine-resilient systems, and efficient distributed algorithms. He is affiliated with the Chair of Coding and Cryptography and actively contributes to advancements in decentralized learning systems. Recent publications highlight breakthroughs in privacy preservation, channel capacity estimation, and scalable federated edge learning.

• Algorithmic Game Theory
• Combinatorial Optimization
• Traffic Flow Equilibria
• +۴ مورد دیگر

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.

Thomas Kesselheimمشاهده پروفایل

استاد

• Online Algorithms
• Algorithmic Game Theory
• Algorithms and Uncertainty
• +۳ مورد دیگر

Thomas Kesselheim is a Professor for Theoretical Computer Science at the University of Bonn, Department of Computer Science (Institute V). He is based in room 2.058 at Friedrich-Hirzebruch-Allee 8, D-53115 Bonn, Germany. His contact email is thomas.kesselheim@uni-bonn.de and he holds virtual office hours via Zoom (Meeting ID: 685 2407 0922, Passcode: 305903). Professor Kesselheim's research focuses on Online Algorithms , Algorithmic Game Theory , and Algorithms and Uncertainty . His work examines how algorithms perform in environments with strategic participants such as internet service providers, cloud infrastructure markets, and advertising platforms. Key research areas include congestion games, price of anarchy, mechanism design, revenue maximization, and optimization under incomplete information. His teaching portfolio spans multiple semesters with courses including Randomized Algorithms & Probabilistic Analysis, Algorithmic Game Theory, and Algorithms and Uncertainty. He regularly offers specialized seminars on Online Algorithms and Optimization under Uncertainty where students explore cutting-edge topics like online stochastic matching and combinatorial auctions via posted prices. Professor Kesselheim's career trajectory shows steady progression from PhD studies at RWTH Aachen University through postdoctoral positions at Cornell University and Max Planck Institute for Informatics, a fellowship at the Simons Institute for the Theory of Computing, a Junior Professorship at TU Dortmund, and his current professorship at the University of Bonn since April 2018. He actively supervises labs and seminars where students implement and evaluate algorithms for optimization under uncertainty, focusing on both theoretical guarantees and practical performance. His research group participates in joint research seminars with other groups at the University of Bonn, discussing topics in computational geometry and algorithm design.