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

• Quantum Topology
• Low-Dimensional Topology
• Hyperbolic Geometry
• +۳ مورد دیگر

Dr. Tian Yang is an Associate Professor in the Department of Mathematics at Texas A&M University , part of the College of Arts & Sciences . His research focuses on Quantum Topology, Hyperbolic Geometry, and Low-Dimensional Topology , with significant contributions to the study of quantum invariants, Turaev-Viro invariants, and geometric structures of 3-manifolds. Education & Professional Background: While specific degree details are not explicitly provided, his academic trajectory is reflected through extensive involvement in global research collaborations and teaching roles at Texas A&M. He has taught specialized courses like Quantum Topology and Geometric Topology . Research Interests: Dr. Yang’s work bridges algebraic and geometric topology, emphasizing: Quantum Invariants: Analysis of Turaev-Viro and Reshetikhin-Turaev invariants, their asymptotic behavior, and connections to hyperbolic volume. Hyperbolic Geometry: Investigations into hyperbolic polyhedral manifolds, cone metrics, and geometric rigidity. Topological Dynamics: Exploring surface diffeomorphism groups and their quantum invariant asymptotics. Publications: His recent work includes groundbreaking studies on the Volume Conjecture , asymptotics of 6j-symbols, and geometric-topological applications of quantum field theory. Key papers appear in Advances in Mathematics , Journal of Differential Geometry , and Communications in Mathematical Physics . Professional Engagement: He has delivered over 50 invited lectures globally, including at the International Congress of Basic Science (2025) and the Banff International Research Station . His research has been supported through collaborations with institutions like the Chern Institute of Mathematics and the Mathematical Sciences Center at Tsinghua University. Teaching & Mentorship: While specific student advisees are not listed, his courses reflect advanced topics in topology and geometry. He has organized summer schools and workshops in China and the U.S., fostering global academic exchange.

Jürgen Hausenمشاهده پروفایل

استاد

• Algebraic Geometry
• Combinatorial Algebraic Geometry
• Toric Varieties
• +۳ مورد دیگر

Prof. Dr. Jürgen Hausen is a Professor in the Department of Mathematics at Eberhard Karls University of Tübingen, specializing in Algebraic Geometry with a focus on toric varieties, Cox rings, and geometric invariant theory. His research explores combinatorial structures in algebraic geometry, including the classification of algebraic varieties with torus actions, log del Pezzo surfaces, and Fano varieties. He has developed influential software tools like TorDiv for computations in toric geometry. His work bridges abstract algebraic theory with practical computational methods, contributing to the understanding of geometric structures and their applications. Key Research Themes: Toric varieties, Cox rings, geometric invariant theory, Fano varieties, and polyhedral divisors. Software Contributions: TorDiv (Maple package), compcox (Singular package), and MDS (Maple package for Mori dream spaces). Education: Extensive academic career with a focus on algebraic geometry, including foundational work on Mori dream spaces and the theory of Cox rings. His publications span over three decades, addressing topics such as degenerations of projective planes, automorphism groups of varieties, and the interplay between algebraic geometry and combinatorics. He actively contributes to teaching, authoring textbooks like Lineare Algebra I & II , and offers open-access course materials and video lectures.

Abraham Punnenمشاهده پروفایل

استاد

• Operations Research
• Discrete Optimization
• Combinatorial Optimization
• +۵ مورد دیگر

Abraham Punnen is a Professor of Operations Research at the Department of Mathematics, Simon Fraser University (SFU), Surrey. He holds a Ph.D. in Operations Research from the Indian Institute of Technology, Kanpur (1990). His research focuses on discrete optimization, combinatorial optimization, and their applications in transportation, logistics, healthcare, and satellite systems. He has supervised numerous graduate students and postdoctoral fellows, contributing to impactful projects like satellite downlink scheduling and fiber optic network design. Education: Ph.D. in Operations Research, Indian Institute of Technology, Kanpur (1990). Research Interests: Operations Research, Combinatorial Optimization, Scheduling, Transportation Logistics, Healthcare Optimization, Satellite Mission Planning, and Network Design. Grants/Projects: Completed projects include satellite downlink scheduling, ferry scheduling, and fiber optic network design. He collaborates with industries on optimization challenges. Students/Advising: Supervised over 20 M.Sc., Ph.D., and postdoctoral researchers, many of whom now work in academia, industry, and consulting.

• Theoretical Computer Science
• Algorithms and Data Structures
• Computational Geometry
• +۵ مورد دیگر

Raimund Seidel is a Professor in the Department of Computer Science at Universität des Saarlandes, leading the Chair of Theoretical Computer Science. He is actively involved in research and teaching, focusing on foundational aspects of algorithms and data structures, particularly in computational geometry. His primary research interests include theoretical computer science , design and analysis of efficient algorithms , geometric data structures , randomized algorithms , and combinatorial geometry . His work addresses fundamental problems such as planar point location, convex hull computation, and efficient encoding of triangulations. He also investigates geometric algorithms under the transdichotomous model, leveraging word-level parallelism. The selected publications reflect a long-standing contribution to computational geometry and data structure theory , with a focus on randomized methods and exact complexity analysis. His research combines theoretical rigor with practical implications for algorithm design. Award or honor not found in the provided text. Prof. Seidel has advised several students, including Alexander Malkis , Ralf Osbild , Udo Adamy , Christian Sohler , and others, many of whom have gone on to academic and research careers. No explicit information about grants or funding is available in the text. He leads a research group within the Department of Computer Science at Universität des Saarlandes, mentoring current staff such as László Kozma , Giorgi Nadiradze , and Lavinia Dinu . The group maintains active research in theoretical computer science and computational geometry.

Pavel Galashinمشاهده پروفایل

دانشیار

• Algebraic Combinatorics
• Total Positivity
• Cluster Algebras
• +۵ مورد دیگر

Pavel Galashin is an Associate Professor in the Department of Mathematics at the University of California, Los Angeles, where he joined in 2019 after completing his PhD at MIT under Alex Postnikov. His research focuses on algebraic combinatorics with emphasis on total positivity and cluster algebras. His primary research interests include algebraic combinatorics, total positivity, cluster algebras, amplituhedra, plabic graphs, positroids, and connections to mathematical physics. His work bridges combinatorics with algebraic geometry, representation theory, and theoretical physics, particularly in scattering amplitudes and integrable systems. Galashin's recent publications reveal a strong focus on braid varieties, positroid varieties, and their connections to cluster structures. His research shows significant interdisciplinary impact across combinatorics, algebraic geometry, and mathematical physics, with particular attention to geometric structures in scattering amplitudes and connections to knot theory. He has received an Alfred P. Sloan Research Fellowship and NSF funding through grants DMS-1954121 and DMS-2046915 (CAREER). Galashin advises multiple PhD students including Matthew Tyler, Ariana Chin, Thomas Martinez, and Olha Shevchenko, and co-mentors postdocs such as Terrence George and Colleen Robichaux. Together with Anton Bernshteyn, Terrence George, Igor Pak, and Colleen Robichaux, he organizes the UCLA Combinatorics Forum.

Seth Sullivantمشاهده پروفایل

استاد

• Algebraic Statistics
• Computational Algebra
• Combinatorics
• +۳ مورد دیگر

Seth Sullivant is a Distinguished Professor in the Department of Mathematics at North Carolina State University (NC State), within the College of Sciences. His research focuses on algebraic statistics, computational and combinatorial algebra, and mathematical phylogenetics. He holds a Ph.D. in Mathematics from the University of California, Berkeley (2005). His expertise spans interdisciplinary areas, including algebraic approaches to statistical problems, combinatorial methods in phylogenetics, and the development of algebraic tools for graphical models. He is affiliated with research groups in Algebra and Combinatorics, Mathematical Biology, and Symbolic Computation at NC State. Recent research trends in his publications emphasize the application of algebraic geometry and combinatorics to statistical models, phylogenetic network analysis, and identifiability problems in systems biology. His work bridges abstract mathematical concepts with practical statistical methodologies, addressing challenges in data analysis and model interpretation. No specific scientific awards are listed in the provided texts. His advising and grant activities are not detailed here, though his extensive publication record suggests active research collaborations. He is part of research teams focused on advancing algebraic methods in statistics and computational biology.

Ciriaco D'Ambrosioمشاهده پروفایل

پژوهشگر

• Combinatorial Optimization
• Heuristics
• Metaheuristics
• +۴ مورد دیگر

Ciriaco D'Ambrosio is a Research Fellow at the Department of Mathematics, University of Salerno, specializing in combinatorial optimization and its applications to wireless sensor networks. He teaches courses in operations research and maintains regular reception hours for students on Tuesdays (3:00-5:00 PM) and Wednesdays (4:00-5:00 PM), conducted both in-person and via Microsoft Teams. Education: PhD in Computer Science, University of Salerno (2015) - Thesis: models and algorithms for coverage in Wireless Sensor Network Laurea cum laude in Computer Science, University of Salerno (2011) Research Focus: D'Ambrosio specializes in combinatorial optimization, developing heuristics, metaheuristics, and math-heuristics for mixed integer linear programming problems. His work addresses challenging optimization problems in wireless sensor networks, particularly network lifetime maximization under coverage, connectivity, and interference constraints. His research bridges theoretical computer science with practical applications in sensor network design, seismic monitoring systems, and resource allocation problems. His methodology often combines exact approaches with sophisticated heuristic techniques to solve computationally difficult problems. Publication Trends: Analysis of D'Ambrosio's publications (2017-2025) reveals a progression from foundational work on sensor network lifetime problems toward increasingly sophisticated algorithmic approaches for combinatorial optimization. His recent work shows expansion into seismic monitoring applications while maintaining strong focus on knapsack problem variants and network optimization. His publications appear in high-quality journals including Soft Computing, Computers & Operations Research, and Networks, demonstrating both theoretical rigor and practical relevance of his research. Professional Activities: Member of the Italian Operations Research Society (AIRO) Associate Editor for Soft Computing, A Fusion of Foundations, Methodologies and Applications Active collaborator with researchers including Andrea Raiconi, Raffaele Cerulli, and Francesco Carrabs Research Infrastructure: D'Ambrosio works within the Department of Mathematics at University of Salerno's Fisciano Campus (Building F2, Room 040). His research contributes to the university's growing expertise in computational optimization and has practical applications in environmental monitoring systems like SEISMONOISY.

Rudi A. Pendavinghمشاهده پروفایل

استادیار

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

Rudi A. Pendavingh is an Assistant Professor at Eindhoven University of Technology's Mathematics and Computer Science department, specializing in Combinatorial Optimization. He earned his PhD at the University of Amsterdam in topological graph theory and has since contributed to diverse areas of combinatorics and geometry, with recent focus on matroid theory. His teaching spans mathematical programming topics including linear, integer, and semidefinite optimization. Education: PhD in Topological Graph Theory (University of Amsterdam) His research integrates combinatorial structures with geometric and algebraic methods, particularly in matroid theory, graph embeddings, and tropical geometry. Key publication themes include optimization algorithms, excluded matroid minors, and geometric invariants. Collaborations extend to institutions in mathematics and applied sciences, with notable academic output (67 research items) and external partnerships. Recent research outputs (2022-2025) highlight his work on the Colin de Verdière parameter, Dressian bounds, and tropical amoebas. While no explicit awards are mentioned in the provided text, his contributions to combinatorial optimization and network collaborations underscore his academic impact. He has supervised 29 students and contributed to 7 courses, including Discrete Optimization Modeling and Mathematics II.

Faiz Hamidمشاهده پروفایل

دانشیار

• Operations Research
• Combinatorial Optimization
• Network Optimization
• +۳ مورد دیگر

Faiz Hamid serves as an Associate Professor in the Department of Management Sciences at Indian Institute of Technology Kanpur. With a Ph.D. in Decision Sciences & Information Systems from IIM Lucknow (2012) and a B.Tech. in Computer Science and Engineering from Institute of Engineering & Management (2007), he brings strong technical and analytical expertise to his academic position. His research interests span Operations Research, Combinatorial Optimization, Network Optimization, and Data Science, with particular focus on transportation systems, pandemic response modeling, and revenue management applications. Dr. Hamid's scholarly work demonstrates consistent publication in high-impact journals including European Journal of Operational Research, Omega, Transportation Research, and IEEE Transactions on Signal Processing. His recent publications reveal a strong trend toward applying optimization techniques to real-world problems, particularly addressing pandemic-related challenges in transportation systems and developing sophisticated mathematical models for railway operations. His 2024 edited volume 'Optimization Essentials: Theory, Tools, and Applications' demonstrates his leadership in the field. Ph.D. Thesis recognized as runner-up for 2014 Best Dissertation Award by The INFORMS Technical Section in Telecommunications Best Paper Award at COSMAR 2010 Doctoral Conference, Indian Institute of Science, Bangalore Professor Dipak C Jain Best Paper Award at IMR Doctoral Conference 2010, IIM Bangalore Silver Medal, National Mathematics Olympiad 2002 Dr. Hamid has advised numerous students and collaborated extensively with researchers globally, particularly in transportation optimization problems. His professional journey includes industry experience as Associate Functional Architect at JDA Software and post-doctoral research at Telecom SudParis, France, before joining IIT Kanpur's faculty.

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.

R Raviمشاهده پروفایل

استاد

• Discrete Optimization
• Operations Research
• Computer Science
• +۴ مورد دیگر

R Ravi is the Vasantrao Dempo Professor of Operations Research and Computer Science at Carnegie Mellon University's Tepper School of Business. He holds a B.E. from IIT Madras and M.S./Ph.D. from Brown University. Active since 1995, he served as Associate Dean for Intellectual Strategy and Chair of the Future Educational Delivery Committee. He currently directs Analytics Strategy and leads the Center for Intelligent Business. His research focuses on discrete optimization, network optimization, and applications in supply chain logistics and online advertising, supported by NSF, Google, and others. He has advised over two dozen doctoral students and developed graduate courses like Network Optimization. He received the 30-year Test of Time Award (2023) and is an INFORMS Fellow. His academic roles include editorial leadership in Operations Research and FOCS chairmanship.

Marika Karbsteinمشاهده پروفایل

پژوهشگر

• Operations Research
• Mathematical Optimization
• Public Transport Planning
• +۳ مورد دیگر

Dr. Marika Karbstein is a Researcher at the Zuse Institute Berlin (ZIB), where she has been employed since April 2006. Affiliated with the DFG Research Center Matheon "Mathematics for key technologies" from 2006-2014, she earned her doctoral degree in Mathematics from Technische Universität Berlin in 2013. Her work bridges theoretical optimization and practical public transport applications. Her academic background includes: 1999-2005: Studies of Applied Mathematics (Wirtschaftsmathematik) at Technische Universität Berlin 2003-2006: Student assistant at Konrad-Zuse-Zentrum Berlin 2013: Doctoral degree in Mathematics (Dr. rer. nat), Technische Universität Berlin Dr. Karbstein specializes in mathematical optimization for public transport systems, focusing on strategic planning, service design, and passenger behavior modeling. Her research integrates timetabling, line planning, and passenger routing through advanced integer programming and network optimization techniques. She develops practical solutions for infrastructure design, crew scheduling, and fare planning, emphasizing real-world applicability in urban transport networks. Her methodology combines theoretical rigor with implementation-focused approaches to improve system efficiency and user experience. Her publication record shows consistent innovation in periodic timetable optimization and integrated transport modeling. Early work established foundations in Steiner tree problems for transport networks, evolving into sophisticated frameworks for passenger routing and line planning. Recent contributions emphasize direct connections and transfer minimization, reflecting industry needs for seamless passenger journeys. The research demonstrates strong interdisciplinary connections between operations research, computer science, and transportation engineering. Her scientific recognition includes: Diploma Thesis Award of the German Operations Research Society (2006) Runner-Up for Richard-Rado-Prize (2014) Dissertation Award of German Operations Research Society (2014) VBKI Wissenschaftspreis (2014) Tucker Prize Finalist (2015) Best Paper Award at ATMOS 2013 As a core member of the DFG Research Center Matheon, Dr. Karbstein contributed to major collaborative projects funded by the German Research Foundation. Her work with Ralf Borndörfer at ZIB has led to practical implementations including Potsdam's 2010 line plan optimization. While specific grants aren't detailed, her research has been sustained through institutional support at ZIB and Matheon's interdisciplinary framework. She actively collaborates with transport operators to translate theoretical advances into operational improvements. Dr. Karbstein operates within ZIB's renowned applied mathematics environment, leveraging its high-performance computing resources. Her work extends through Matheon's consortium connecting Berlin's mathematics community. Current research focuses on integrating passenger behavior models with real-time scheduling systems, advancing the frontier of data-driven transport optimization.

• Mixed-Integer Optimization
• Combinatorial Optimization
• Discrete Mathematics
• +۳ مورد دیگر

Timm Oertel is a Professor in the Department of Data Science at Friedrich Alexander University Erlangen-Nuremberg (FAU), holding the Chair of Analytics & Mixed-Integer Optimization. His office is located in Room 03.344 at Cauerstraße 11, Erlangen, and he can be contacted via email at timm.oertel@fau.de or phone at +49 9131 85-67313. His research focuses on mixed-integer optimization, combinatorial optimization, and discrete mathematics, with significant contributions to sparse solutions in lattices and semigroups, integer Carathéodory rank, knapsack polyhedra, and parametric integer optimization. His work bridges theoretical computer science, operations research, and discrete geometry, emphasizing structural properties of integer solutions and algorithmic efficiency. Professor Oertel's publication record (2013-2025) reveals consistent trends in theoretical integer programming, with recent work (2020-2025) concentrating on sparsity patterns, approximation in algebraic structures, and complexity bounds. He frequently collaborates with leading researchers including Iskander Aliev, Robert Weismantel, and Joseph Paat, publishing in top venues like Mathematical Programming and SIAM Journal on Optimization. His research demonstrates deep connections between combinatorial geometry and optimization theory.

Yuri Faenzaمشاهده پروفایل

دانشیار

• Discrete Optimization
• Operations Research
• Mathematical Programming
• +۴ مورد دیگر

Yuri Faenza is an Associate Professor in the Department of Industrial Engineering and Operations Research at Columbia Engineering, with affiliations to the Data Science Institute (DSI) and Foundations of Data Science Center. His research bridges Discrete Optimization, Operations Research, and Computer Science, focusing on algorithmic theory and applications to Market Design (particularly School Choice) and Machine Learning. Key research areas include Knapsack , Matching , and Extended Formulations , with methodological work on polytope structures, greedy algorithms, and stochastic or semi-random models. His recent publications emphasize stable matching, optimization under uncertainty, and the intersection of discrete mathematics with data science. Scientific awards include the NSF CAREER award Meta Research Award . He has served on program committees for major conferences like ALGA, EC, APPROX, and IPCO, and is an Associate Editor for journals including Mathematical Programming and Discrete Optimization . Prior to Columbia, he held postdoctoral positions at the University of Brussels, EPFL, and University of Padua.

• Geometry
• Group Theory
• Metric Geometry
• +۳ مورد دیگر

Petra Schwer is a full professor of Geometry at Heidelberg University, holding the position since February 2024. Previously, she was a professor at Otto von Guericke University Magdeburg (2018–2024) and the Karlsruhe Institute of Technology (2014–2018). She has also held research and academic positions at institutions including the University of Münster and UC Davis. Education: She earned her PhD in Mathematics from Westfälische Wilhelms-Universität Münster in 2009, supported by a stipend from the Studienstiftung des deutschen Volkes. Prior to that, she received her Diplom in Mathematics from the University of Bonn in 2005. Research Interests : Her work focuses on the interplay between geometric structures and group theory, particularly in metric spaces of nonpositive curvature, polyhedral complexes, and Coxeter groups. She explores geometric and combinatorial aspects of buildings, including Bruhat-Tits buildings and their generalizations, using methods from geometric group theory and metric geometry. Key Contributions : Recent publications include studies on folded galleries in affine buildings, the geometry of Coxeter groups, and the application of cube complexes in computational geometry. These contributions highlight her expertise in nonpositive curvature and geometric group theory. Grants and Funding : Dr. Schwer has secured grants such as DFG projects on buildings and symmetric spaces, collaborative grants in mathematical complexity reduction, and initiatives like the Young Investigator Network exploring geometric data analysis. Students and Advising : She has advised doctoral and master’s students including Isobel Davies, Marco Lotz, and Anna Michael (OVGU); Julia Heller and Annette Karrer (KIT). Her teaching includes advanced topics in geometry and group theory.