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

• Algorithmic Game Theory
• Computational Social Choice
• Fair Division
• +۴ مورد دیگر

Warut Suksompong is an Assistant Professor in the School of Computing at the National University of Singapore (NUS), where he holds the NUS Presidential Young Professorship. Previously, he was a postdoctoral researcher at the University of Oxford, hosted by Edith Elkind, and completed his PhD at Stanford University under Tim Roughgarden. He holds bachelor's and master's degrees from MIT. His research focuses on algorithmic game theory, computational social choice, mechanism design, and interdisciplinary problems at the intersection of computer science, economics, mathematics, and operations research. He is particularly known for contributions to fair division, including envy-freeness, proportionality, and maximin fairness in both divisible and indivisible resource allocation contexts. Key awards include the IJCAI 2021 Distinguished Paper Award for work on dividing land with geometric constraints and the WINE 2021 Best Student Paper Award for research on funding public projects via the Nash product rule. His work bridges theoretical foundations with practical applications, addressing challenges such as connectivity constraints, budget allocation, and social choice mechanisms. He has authored over 100 publications in top conferences and journals, including SIAM Journal on Discrete Mathematics, Artificial Intelligence, and Games and Economic Behavior. His research has been supported by grants from NUS and international collaborations.

• Computer Science
• Software Engineering
• Artificial Intelligence
• +۵ مورد دیگر

Dongwoo Kim is a researcher affiliated with Hanyang University, ERICA Campus (Department of Electronics and Communication Engineering) and has previously collaborated with institutions like POSTECH , Chungnam National University , and Microsoft . His work spans interdisciplinary domains in Computer Science and Engineering . Hanyang University, ERICA Campus - Department of Electronics and Communication Engineering POSTECH - Power Analog Electronics & Semiconductor Devices Lab Microsoft Chungnam National University Kim's research focuses on formal verification of automotive control software, deep learning applications in environmental monitoring, 3D modeling for indoor positioning, and machine learning for signal processing. His recent publications highlight advancements in graph neural networks (GNNs), including analyzing oversmoothing and gradient dynamics, as well as developing geometric vision-language models with domain-agnostic encoders. His 15 most recent articles (2023-2025) address topics like: Optimizing hybrid electric vehicle engine performance 3D modeling for indoor localization GNN training stability UAV-based environmental monitoring Algorithm difficulty prediction for programming problems Millimeter-wave antenna design Kim collaborates with researchers in software engineering , signal processing , and environmental science domains. His work intersects formal methods , applied machine learning , and embedded systems research.

Ron Peledمشاهده پروفایل

استاد

• Probability Theory
• Statistical Physics
• Mathematical Physics
• +۷ مورد دیگر

Ron Peled is a Full Professor in the School of Mathematical Sciences at Tel Aviv University , currently on leave to serve as the Brin Professor in the Department of Mathematics at the University of Maryland starting summer 2024. During 2022–2024 he was a Member at Princeton University and the Institute for Advanced Study . Education & Career: While explicit degrees are not listed, his trajectory shows appointments at NYU (2009–2010), UC Berkeley and Tel Aviv University as a teaching assistant, followed by faculty positions culminating in full professorship. Research Interests: His work lies at the intersection of probability theory, statistical physics, and combinatorics . Key themes include: Disordered systems and random environments (random-field Ising, spin glasses) First-passage percolation and random metrics Random surfaces and height functions Loop models and critical phenomena Random matrices and band matrices Geometric probability and allocation problems Publications & Impact: With over 70 papers in top journals such as Annals of Mathematics , Annals of Probability , Inventiones Mathematicae , and Communications in Mathematical Physics , his recent work explores minimal surfaces in random environments, localization in random band matrices, and quantitative disorder effects in low-dimensional spin systems. Grants & Awards: Research has been continuously funded by: Israel Science Foundation (grants 1048/11, 861/15, 1971/19, 2340/23) ERC Starting Grant LocalOrder ERC Consolidator Grant Transitions Marie Skłodowska-Curie International Reintegration Grant SPTRF Teaching & Mentoring: Prof. Peled has taught a broad spectrum of courses at Tel Aviv University (Brownian motion, probability, percolation, random matrices, stochastic calculus) and NYU (combinatorics, discrete mathematics). He has supervised 13 post-doctoral fellows and 8 graduate students (PhD & MSc) to date. Service & Outreach: He co-organizes the Joint Israeli Probability Seminar and has organized numerous international workshops and conferences including at Oberwolfach, Technion, and Tel Aviv University.

Gerd Stummeمشاهده پروفایل

استاد

• Data Science
• Artificial Intelligence
• Formal Concept Analysis
• +۶ مورد دیگر

Gerd Stumme is a Full Professor of Computer Science at University of Kassel , leading the Chair on Knowledge and Data Engineering . He serves as Executive Director of the Research Center for Information Systems Design (ITeG) , director of the International Centre for Higher Education Research (INCHER) , and founding member of the Hessian Institute for Artificial Intelligence (hessian.AI) . His research spans the intersection of Data Science, AI, and Mathematics , focusing on semantic/structural analysis of social networks, concept hierarchies, and mathematical structures (graphs, ordered sets) for knowledge acquisition. He pioneered work on Semantic Web, Web Mining, Social Bookmarking , and Recommender Systems , and has recently revisited mathematical foundations for knowledge representation. Recent publications analyze ordinal motifs in lattices , controversy mapping , and social network structures , with applications to business models, journalism, and AI. His work often integrates graph theory and formal concept analysis . He is a core developer of BibSonomy , a social bookmarking and publication-sharing system, and has contributed to FolkRank and TriAS algorithms for collaborative knowledge management.

Daniel Hugمشاهده پروفایل

استاد

• Probability
• Geometry
• (Convex) geometric analysis
• +۳ مورد دیگر

Prof. Dr. Daniel Hug is a Professor at the Karlsruhe Institute of Technology (KIT) , affiliated with the Department of Mathematics and the Institute of Stochastics . His research focuses on Probability , Geometry , Convex geometric analysis , Stochastic geometry , and Educational mathematics . He contributes to the DFG Priority Program Random Geometric Systems and previously participated in the DFG research unit Geometry and Physics of Spatial Random Systems . Prof. Hug has co-authored two influential monographs: Poisson Hyperplane Tessellations (Springer Monographs in Mathematics) and Lectures on Convex Geometry (Springer Graduate Texts in Mathematics, 2020). His work spans theoretical advancements in convex and stochastic geometry , including integral geometry, random mosaics, and tensor valuations, alongside applied studies in digital microstructures and Minkowski tensors . His publications from 2025–2024 emphasize hyperbolic space , Boolean models , and Minkowski tensor estimators , reflecting ongoing collaborations with researchers like M. Klatt, C. Thäle, and R. Schneider. Prof. Hug leads courses such as Stochastic Geometry and seminars on Random graphs and tessellations , and is actively involved in working groups like AG Stochastische Geometrie and AG Stochastik .

Stefan Glockمشاهده پروفایل

استادیار

• Discrete Mathematics
• Extremal Combinatorics
• Probabilistic Combinatorics
• +۴ مورد دیگر

Professor Stefan Glock is an Assistant Professor of Discrete Mathematics at the University of Passau's Faculty of Computer Science and Mathematics, a position he has held since September 2022. Prior to this appointment, he spent three years as a Junior Fellow at the Institute for Theoretical Studies at ETH Zurich, following the completion of his doctorate at the University of Birmingham. Stefan Glock received his mathematics education at Technische Universität Ilmenau from 2009 to 2014, then pursued his PhD at the University of Birmingham, which he completed in 2018. His doctoral dissertation, "Decompositions of Graphs and Hypergraphs," was the runner-up for the Richard-Rado-Preis 2018. Professor Glock's research focuses on discrete mathematical structures, with particular emphasis on their asymptotic properties. His work spans several interconnected fields of combinatorics: Extremal Combinatorics : Investigating the maximum or minimum possible size of mathematical structures satisfying certain properties Probabilistic Combinatorics : Applying probability theory to solve combinatorial problems Graph Theory : Studying properties of graphs and networks Ramsey Theory : Examining conditions under which order must appear in large structures Design Theory : Creating arrangements of elements satisfying specific balance properties Discrete Geometry : Analyzing geometric problems with discrete structures Analysis of Professor Glock's recent publications reveals a consistent focus on solving long-standing open problems in combinatorics using innovative methods that combine probabilistic techniques with structural insights. His work often bridges theoretical mathematics with applications in theoretical computer science, particularly in the analysis of algorithms and network structures. A significant portion of his research addresses fundamental questions about graph and hypergraph decompositions, which have implications for coding theory, cryptography, and network design. Professor Glock has received notable recognition for his contributions to mathematics: Runner-up for the Richard-Rado-Preis 2018 for his dissertation "Decompositions of Graphs and Hypergraphs" Awarded funding through the prestigious DFG Emmy Noether Programme in 2024 for his research group on "the interplay of structure and randomness in mathematics" As a faculty member at the University of Passau, Professor Glock leads the Discrete Mathematics research group and actively collaborates with mathematicians worldwide. He has established a strong research program that has attracted funding for academic visitors and supports multiple research projects. His approach to mathematical problems emphasizes developing new methods that have far-reaching implications beyond the specific problems being solved. Professor Glock's research group at the University of Passau focuses on the interplay between structure and randomness in discrete mathematics. The group maintains active collaborations with leading institutions including ETH Zurich, University of Birmingham, and various research centers across Europe. Through the DFG Emmy Noether Programme funding, his group is expanding its research on combinatorial structures and their applications.

Stefan Hougardyمشاهده پروفایل

استاد

• Discrete Mathematics
• Combinatorial Optimization
• Approximation Algorithms
• +۶ مورد دیگر

Stefan Hougardy is a Professor at the Research Institute for Discrete Mathematics, part of the Mathematisch-Naturwissenschaftliche Fakultät at the University of Bonn. He is actively engaged in research and teaching, with a focus on discrete mathematics and combinatorial optimization. He contributes to academic governance through roles in examination boards, teaching mentoring, and faculty committees. Stefan Hougardy's research lies at the intersection of theoretical computer science and practical optimization. His primary interests include approximation algorithms, the Traveling Salesman Problem (TSP), Steiner trees, graph theory, and VLSI design automation. He develops efficient algorithms for NP-hard problems and analyzes their theoretical performance guarantees. His work often bridges theory and application, particularly in electronic design automation and mathematical programming. His recent publications demonstrate a strong focus on the complexity and approximation of combinatorial optimization problems. Key themes include the analysis of local search heuristics like k-opt for TSP, edge elimination techniques, fast matching algorithms, and optimal legalization in chip design. His work combines rigorous theoretical analysis with practical implementation and computational experiments. MPC 'Outstanding Paper of the Year' Award 2024 Stefan Hougardy supervises graduate students and leads seminars on discrete mathematics and optimization. He is involved in the Bonn International Graduate School of Mathematics and the Hausdorff Center for Mathematics, contributing to doctoral education and mentoring. While specific grant details are not listed, his sustained research output and leadership roles suggest active funding support. He also contributes to curriculum development and academic quality assurance through various institutional committees. He is affiliated with the Research Institute for Discrete Mathematics at the University of Bonn, a leading center for combinatorial optimization and algorithmic research. The institute is closely linked with the Hausdorff Center for Mathematics, fostering collaboration in discrete and applied mathematics.

• Applied Geometry
• Discrete Differential Geometry
• Numerical Analysis
• +۳ مورد دیگر

Max Wardetzky is a Professor at the Institute for Numerical and Applied Mathematics within the Faculty of Mathematics and Computer Science at the University of Göttingen, Germany. His office is located at Lotzestraße 16-18, 37083 Göttingen, and he can be reached via email at wardetzky@math.uni-goettingen.de or by phone at +49 551 39 26778. Professor Wardetzky leads the Discrete Differential Geometry Lab at the University of Göttingen, where he conducts research at the intersection of mathematics, computer science, and geometry processing. His work bridges theoretical foundations with practical applications in computer graphics and scientific computing. His primary research interests include: Applied Geometry Discrete Differential Geometry Numerical Analysis Geometry Processing Physical Simulation Computer Graphics Professor Wardetzky's extensive publication record demonstrates significant contributions to the field of discrete differential geometry and its applications. His work shows a consistent focus on developing mathematically rigorous yet computationally efficient methods for geometric problems. Key trends in his research include the development of discrete analogues of smooth geometric objects, the study of convergence properties between discrete and continuous models, and the application of these methods to problems in computer graphics and physical simulation. Professor Wardetzky has made substantial contributions to the theoretical foundations of discrete differential geometry while maintaining strong connections to practical applications. His work on discrete Laplacians, curvature approximations, and geometric flows has influenced both theoretical mathematics and practical geometry processing algorithms.

László Kozmaمشاهده پروفایل

استادیار

• Data Structures
• Algorithms
• Algorithmic Adaptivity
• +۷ مورد دیگر

László Kozma is an Assistant Professor at the Theoretical Computer Science group of the Institute of Computer Science (Freie Universität Berlin). He obtained his PhD from Saarland University under Raimund Seidel, followed by postdoctoral positions at Tel Aviv University and TU Eindhoven. His research focuses on self-adjusting data structures , adaptive algorithms , and combinatorial optimization with applications to problems like the Traveling Salesman Problem, binary search trees, and geometric data structures. Academic Affiliation: Freie Universität Berlin (since 2018) Education: PhD in Computer Science (Saarland University, 2016); postdoc at Tel Aviv University and TU Eindhoven. His work explores the intersection of data structures, combinatorial algorithms, and geometric methods. He has made significant contributions to problems involving pattern-avoidance in inputs, saddlepoint detection , and self-adjusting heaps . Key areas include: Adaptive algorithms for pattern-avoiding inputs Optimal tree and heap structures Geometric and stochastic approaches to optimization Complexity analysis of classical algorithms Recent publications highlight efficient solutions for exponential cut problems (ESA 2025), balanced TSP partitioning (EuroCG 2025), and randomized saddlepoint algorithms (ESA 2024). His research often bridges theory and practice, exemplified by the smooth heap implementation and fun projects like Recursi and Cuckoo Hashing visualization.

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

• Structural Graph Theory
• Combinatorics of Posets
• Geometric Intersection Graphs
• +۴ مورد دیگر

Piotr Micek is a professor in the Theoretical Computer Science Department at the Faculty of Mathematics and Computer Science, Jagiellonian University , Kraków, Poland. He is an active researcher in combinatorics, particularly in structural graph theory and poset combinatorics, and maintains extensive international collaborations. University: Jagiellonian University School: Faculty of Mathematics and Computer Science Department: Theoretical Computer Science Department Email: firstname.lastname@gmail.com Office: Room 3151, Łojasiewicza Street 6, 30-348 Kraków Phone: +48 12 664 7594 Duty hours: Wednesdays 11:00–13:00 His main research interests include structural graph theory, combinatorics of partially ordered sets (posets), geometric intersection graphs, graph coloring and choosability, and the entropy compression method. He also works on approximation and on-line algorithms and combinatorial geometry. His work often bridges deep theoretical insights with algorithmic applications. The recent publications highlight a strong focus on graph structure and coloring problems. Key themes include product structure of planar graphs, poset dimension and its relation to height and planarity, weak coloring numbers, and adjacency labelling. His work frequently appears in top venues such as Journal of the ACM , Combinatorica , SIAM Journal on Discrete Mathematics , and SODA, indicating sustained high-impact contributions. Associate Editor, SIAM Journal on Discrete Mathematics (2025–) Former Associate Editor, Discrete Mathematics (2010–2022) Former Associate Editor, Discrete Mathematics & Theoretical Computer Science (2012–2020) He has supervised numerous students at all levels, including PhD candidates Jędrzej Hodor , Marcin Briański , and Michał T. Seweryn , and has led major research grants such as OPUS 24 and WEAVE-UNISONO funded by NCN. He has also been involved in significant trilateral projects with researchers from Belgium and Germany. His recent talks include tutorials on product structure theory and centered colorings, reflecting his leadership in these areas. He actively participates in the academic community, having served on program committees (e.g., SODA 2021, WG 2022) and organized workshops such as the Order & Geometry series. His research is supported by substantial funding, including over 900,000 PLN for current projects.

Christoph Schweigertمشاهده پروفایل

استاد

• Tensor categories
• Hopf algebras
• Topological field theories
• +۵ مورد دیگر

Christoph Schweigert is full Professor (W3) of Mathematics at the University of Hamburg , based in the Department of Mathematics within the Faculty of Mathematics, Informatics and Natural Sciences (MIN-Fakultät). Since 2003 he has held this permanent chair, and he currently serves as a Principal Investigator and Area Coordinator for Quantum Theories in the Cluster of Excellence “Quantum Universe” . In addition he is a member of the Centre for Mathematical Physics , the DFG Collaborative Research Centre SFB 1624 and the Research Training Group 1670 “Mathematics inspired by string theory and quantum field theory” . Education & Career Path: 1987–1992: Degree in Physics, Universität Heidelberg 1995: PhD in Mathematics, University of Amsterdam (supervisor: Robbert Dijkgraaf) 1995–1996: Postdoc, IHÉS, Bures-sur-Yvette 1997–1998: Fellow, CERN, Geneva 1999–2002: Lecturer (tenured), LPTHE, Université Paris 6; Habilitation 2000 2002–2003: Professor (C3) for Physics, RWTH Aachen Since 2003: Professor (W3) for Mathematics, Universität Hamburg Research Interests: Schweigert’s work lies at the intersection of algebra, category theory, topology and mathematical physics . He focuses on tensor categories , Hopf algebras and quantum groups , topological and conformal field theories , string-net models , and modular functors . These structures find applications in quantum topology, knot theory, 3-manifold invariants, quantum codes and quantum information theory . Editorial & Service Roles: Editor, Communications in Mathematical Physics (since 2017) Editor, Letters in Mathematical Physics (since 2009) Editor, Journal of Mathematical Physics (since 2006) Editor, Springer book series Algebra and Applications (since 2005) Spokesperson/Deputy spokesperson, DFG-RTG 1670 Member, steering committee, DFG Priority Program “Representation theory” Henriette-Herz scout for the Humboldt Foundation (since 2020) Teaching & Supervision: Schweigert regularly teaches advanced courses in linear algebra, Hopf algebras, quantum groups and topological field theory at bachelor, master and graduate levels. He organises the research seminar Algebra and Mathematical Physics and the joint seminar Quantum Physics and Geometry . Office hours are by appointment via email. Laboratory & Research Group: He leads an active research group based in the Geomatikum building (Room 313), collaborating closely with PhD students, postdocs and visiting researchers on projects in tensor categories, TQFT and related areas.

Felix Seifertمشاهده پروفایل

پژوهشگر

• Calculus of Variations
• Nonlocal Analysis
• Abstract Harmonic Analysis
• +۱ مورد دیگر

Felix Seifert is a Researcher at the Chair of Analysis within the Department of Mathematics, Faculty of Mathematics and Geography at the Catholic University of Eichstätt-Ingolstadt (KU). Based in room KGB-102 of KG Building B, he can be contacted via telephone +49 8421-93-21501 or email felix.seifert@ku.de. His research focuses on calculus of variations with nonlocal gradients, abstract harmonic analysis, and graph theory. This interdisciplinary work bridges discrete and continuous mathematical structures, particularly examining geometric properties of graphs through nonlocal analytical frameworks. His investigations into intrinsic metrics on graphs demonstrate innovative approaches to metric space theory in discrete settings. Seifert's publication record centers on graph-theoretic geometry, with his 2024 Mathematische Nachrichten paper establishing foundational connections between intrinsic metrics and nonlocal operators. This work reflects broader trends in applying variational methods to discrete structures, contributing to emerging fields at the intersection of combinatorics and analysis. He actively collaborates within the Chair of Analysis research team at KU, notably with D. Lenz and M. Schmidt on graph theory projects. His current work extends to developing analytical tools for nonlocal phenomena on discrete spaces, with potential applications in network theory and geometric modeling.

Bernd Sturmfelsمشاهده پروفایل

استاد

• Algebraic Geometry
• Combinatorics
• Commutative Algebra
• +۴ مورد دیگر

Bernd Sturmfels is a leading mathematician serving as Director of the Max Planck Institute for Mathematics in the Sciences in Leipzig since 2017. He is also Professor Emeritus of Mathematics, Statistics, and Computer Science at the University of California, Berkeley, and holds honorary professorships at the Technical University of Berlin and the University of Leipzig. His research bridges pure and applied mathematics, with foundational contributions to algebraic geometry, combinatorics, and computational biology. Education: Sturmfels earned dual Ph.D. degrees in 1987 from the University of Washington and Technische Universität Darmstadt, followed by an honorary doctorate from Goethe University Frankfurt in 2015 and additional honorary doctorates from the University of Bern (2023) and the University of Chicago (2024). Research Interests: His work spans algebraic geometry , combinatorics , commutative algebra , algebraic statistics , convex optimization , and computational biology . He explores deep connections between abstract algebraic structures and practical applications in statistics, optimization, and the life sciences. Publications and Trends: With over 300 research articles and 11 books, his recent work (2022–2025) focuses on advanced topics like Grassmannian geometry, tropical implicitization, quantum chemistry applications, and algebraic statistics. His research increasingly integrates computational methods with theoretical insights, addressing problems in machine learning, phylogenetics, and optimization. Awards and Honors: Sturmfels has received numerous prestigious awards, including: George David Birkhoff Prize in Applied Mathematics (2018) SIAM von Neumann Lecturership (2010) Humboldt Senior Research Prize (2007–2008) David and Lucile Packard Fellowship (1992–1997) Fellowships of the AMS and SIAM Membership in the Berlin-Brandenburg Academy of Sciences and Humanities Mentoring and Grants: He has supervised 60 doctoral students and numerous postdocs, with many securing positions at leading institutions. His mentoring philosophy emphasizes diversity and excellence, as highlighted in his Notices of the AMS article. Funding sources include the NSF, DARPA, and the German National Science Foundation (DFG). Labs and Teams: At the Max Planck Institute, he leads the Nonlinear Algebra group, fostering interdisciplinary collaboration between mathematics and the sciences. His team focuses on developing algebraic methods for data analysis, optimization, and theoretical physics.

Torsten Ueckerdtمشاهده پروفایل

استاد

• Graph Theory
• Geometric Graph Theory
• Discrete Mathematics
• +۸ مورد دیگر

Torsten Ueckerdt is an Interim Professor in the Algorithmics I group at the Institute of Theoretical Informatics, Karlsruher Institut für Technologie (KIT). He has held academic positions since 2012, including postdoctoral roles and habilitation in Discrete Mathematics. His research focuses on combinatorial objects like graphs, posets, and hypergraphs in geometric settings, exploring structural properties, colorings, and geometric representations. Holds a PhD from TU Berlin (2011) and habilitation from KIT (2017). Professional service includes editorial roles (Annals of Combinatorics) and program committees for conferences like Graph Drawing, SoCG, and EuroCG. Supervised numerous students across Bachelor's, Master's, and diploma theses. Research interests span structural graph theory, geometric graph theory, Ramsey theory, discrete geometry, and combinatorial games. Active in graph drawing and algorithm design, with contributions to queue layouts, graph representations, and optimization problems like cartograms and wind farm cabling.