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

Jack Snoeyinkمشاهده پروفایل

استاد

• Computational geometry
• Algorithms for geographical information systems (GIS)
• Structural biology
• +۳ مورد دیگر

Jack Snoeyink is a Professor at the University of North Carolina at Chapel Hill, holding joint appointments in the Department of Computer Science (College of Arts & Sciences) and the School of Data Science and Society. His research focuses on computational geometry, with applications in molecular biology, geographic information systems (GIS), and geometric modeling. His work in computational geometry explores algorithmic design and analysis for problems in solid modeling, computer graphics, and robotics. Key application areas include terrain modeling in GIS, molecular structure validation in biochemistry, and computational topology. He has contributed to output-sensitive algorithms for convex hulls and Voronoi diagrams, and geometric search problems. Articles highlight his expertise in computational geometry, with trends spanning 1999-2000. Topics include contour tree algorithms (SODA'00), watershed extraction (ASPRS'99), and skeleton generation (Crust.pdf). His work bridges theoretical advancements with practical implementations in GIS and structural biology. Jack Snoeyink has collaborated with researchers like Marc van Kreveld, Christopher Gold, and Bettina Speckmann on projects related to Delaunay triangulation, regression depth computation, and geometric assembly problems. He previously served as a program director at the National Science Foundation's CISE division (2015-2018) and co-founded the TRIPODS program for data science foundations.

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

• Theoretical Computer Science
• Distributed Algorithms
• Parallel Algorithms
• +۳ مورد دیگر

Yi-Jun Chang is an Assistant Professor in the Department of Computer Science at the National University of Singapore (NUS). He previously held a Junior Fellow position at the Institute for Theoretical Studies, ETH Zurich (2019–2021), and earned his Ph.D. in Computer Science and Engineering from the University of Michigan (2019). His research focuses on theoretical computer science, particularly distributed, parallel, and sublinear graph algorithms. Ph.D., University of Michigan (2019) M.S., National Taiwan University (2015) B.S., National Taiwan University (2013) Chang’s research explores the complexity and optimization of algorithms in distributed systems, including leader election, graph shattering, expander decomposition, and subgraph detection. His work addresses fundamental challenges in time-energy trade-offs, communication efficiency, and deterministic vs. randomized approaches in models like LOCAL and CONGEST. Recent publications highlight advancements in distributed triangle enumeration, optimal coloring, shortest path computation, and certification in bounded pathwidth graphs. Awards include the PODC 2019 Best Paper and Best Student Paper Awards, followed by the 2020 PODC Doctoral Dissertation Award. PODC 2019 Best Paper Award PODC 2019 Best Student Paper Award 2020 PODC Doctoral Dissertation Award Chang teaches courses such as CS3230 (Design and Analysis of Algorithms) and CS5275 (The Algorithm Designer's Toolkit). He advises Ph.D. students Hung Thuan Nguyen and Haoran Zhou, and has collaborated with postdoctoral researchers including Gopinath Mishra and Dean Leitersdorf.

Asaf Shapiraمشاهده پروفایل

استاد

• Extremal Combinatorics
• Graph Theory
• Property Testing
• +۴ مورد دیگر

Professor Asaf Shapira is a faculty member in the Department of Theoretical Mathematics at Tel Aviv University's School of Mathematical Sciences. He has been actively contributing to combinatorics and graph theory research for over a decade, with numerous publications in top journals including Journal of the ACM, Advances in Mathematics, and Geometric and Functional Analysis. Professor Shapira's research focuses on extremal combinatorics, graph theory, and property testing. His work explores fundamental questions in Ramsey theory, hypergraph theory, and probabilistic methods in combinatorics. He has made significant contributions to the study of graph regularity, removal lemmas, and extremal problems in dense and sparse graphs. His recent publications demonstrate a consistent focus on theoretical aspects of combinatorics with connections to theoretical computer science. A notable trend is his work on developing polynomial bounds for various combinatorial theorems and exploring connections between combinatorial structures and computational complexity. His research often bridges pure mathematics with theoretical computer science applications. Professor Shapira teaches advanced courses at Tel Aviv University including Extremal Graph Theory, Basic Combinatorics, and seminars on specialized topics in combinatorics. His teaching spans undergraduate and graduate levels, reflecting his commitment to educating the next generation of mathematicians.

Paul Hornمشاهده پروفایل

استاد

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

Paul Horn is a Professor and Associate Chair of Graduate Studies in the Department of Mathematics at the University of Denver, within the College of Natural Sciences and Mathematics. He earned his Ph.D. in Mathematics from the University of California, San Diego (2009), under the supervision of Fan Chung. Prior to joining DU in 2013, he held postdoctoral positions at Emory University and Harvard University. His research focuses on combinatorics, graph theory, and probability, with a particular emphasis on applying probabilistic, algebraic, and geometric methods to analyze networks and graphs. Dr. Horn co-organizes the Rocky Mountains-Great Plains Graduate Research Workshop in Combinatorics (GRWC) and contributes to the graph theory section of the Masamu Advanced Studies Institute in southern Africa. He also serves as the graduate coordinator in the Mathematics Department, overseeing graduate student advising and program administration. His work spans theoretical contributions to graph structure, stochastic processes on networks, and applications in multi-agent systems and sensor networks. Publications highlight his expertise in graph curvature, network robustness, and combinatorial optimization, reflecting his interdisciplinary approach to discrete mathematics and its real-world applications. His research bridges pure and applied mathematics, addressing challenges in algorithm design, network dynamics, and geometric graph theory. Horn’s advising and mentorship activities include guiding graduate and undergraduate students in mathematics, emphasizing hands-on research experiences through workshops and collaborative projects. His contributions to academic leadership and research dissemination are evident through editorial roles and conference organization in combinatorics and graph theory.

Gourab Rayمشاهده پروفایل

دانشیار

• Probability Theory
• Statistical Physics
• Stochastic Processes
• +۳ مورد دیگر

Gourab Ray is an Associate Professor in the Department of Mathematics and Statistics at the University of Victoria, Faculty of Science. He holds a PhD from the University of British Columbia, Vancouver. His research focuses on the intersection of probability theory, geometry, and mathematical physics, particularly large-scale patterns in stochastic models inspired by physics. Key areas include random planar maps, random walks, lattice spin models, dimer models, Gaussian free field properties, and Liouville quantum gravity. Recent work emphasizes establishing Gaussian free field-like behaviors in dimer models across various graphs and surfaces. He teaches courses such as MATH 236: Introduction to Real Analysis and MATH 555: Topics in Probability. His publications span leading journals including Inventiones Mathematicae , Annals of Probability , and Probability Theory and Related Fields . Notable contributions include studies on unimodular hyperbolic triangulations, half-planar map classifications, and conformal invariance in dimer models. No specific awards are listed for Dr. Ray, though his work has been recognized in peer-reviewed venues. He actively contributes to academic service, including roles on graduate committees and research collaborations. His research group engages with theoretical and applied aspects of probability theory, often bridging discrete and continuous mathematical frameworks.

Julia Chuzhoyمشاهده پروفایل

استاد

• Theoretical Computer Science
• Graph Theory
• Approximation Algorithms
• +۵ مورد دیگر

Julia Chuzhoy is the Manuel Blum Professor at the Toyota Technological Institute at Chicago (TTIC) and holds a part-time Professor appointment in the Department of Computer Science at the University of Chicago . She completed her Ph.D. at the Technion under the supervision of Seffi Naor , followed by postdoctoral positions at MIT , University of Pennsylvania , and the Institute for Advanced Study . She also served as a Weizmann Institute Weston Visiting Professor in 2018-2019. Her research in theoretical computer science focuses on graph-related optimization problems , including approximation algorithms, dynamic algorithms, fast graph algorithms, and hardness of approximation. She has received major funding through NSF grants (CCF-1318242, CCF-1616584, CCF-2006464, CCF-2402283) and the NSF HDR TRIPODS award (2216899). Her recent publications highlight advancements in approximation algorithms (e.g., maximum bipartite matching), dynamic graph algorithms (e.g., decremental shortest paths), and structural graph theory (e.g., excluded grid theorem). These works span both algorithmic improvements and theoretical lower bounds. Scientific recognition includes NSF Career Award (2013) Alfred P. Sloan Research Fellowship (2011) She has advised numerous TTIC and University of Chicago Ph.D. students, including Rachit Nimavat , Zihan Tan , and Parinya Chalermsook (now faculty at Aalto University ).

• Algorithms
• Computational Complexity
• Convex Optimization
• +۴ مورد دیگر

James R. Lee is a Professor in the Department of Computer Science at the University of Washington. His research spans theoretical computer science, probability, and geometry. He has held visiting scientist roles at Microsoft Research (2023, 2018, 2017) and participated in programs at the Simons Institute (2023, 2020, 2018, 2017, 2014). Research Interests: Algorithms, complexity theory, convex optimization, metric embeddings, spectral graph theory, probability, stochastic processes, and the interplay between discrete and continuous analysis. Teaching: Courses on modern algorithms, quantum computing, optimization theory, and spectral methods in theoretical computer science. Scientific Contributions: Developed sparsification algorithms for generalized linear models and norms with near-linear size guarantees (STOC'24, FOCS'23). Extended Cheeger-type inequalities to higher eigenvalues (STOC'12, STOC'18). Proved super-polynomial lower bounds for LP/SDP relaxations in constraint satisfaction (STOC'15, FOCS'13). Disproved Benjamini-Papasoglou conjectures on annular separators (Discrete Comp. Geom. 2024). Advanced understanding of random walks in geometric and unimodular graphs (Israel J. Math. 2023, GAFA 2023). Scientific Awards: Best Paper Award, STOC 2015

David Mountمشاهده پروفایل

استاد

• Computational Geometry
• Algorithms
• Data Structures
• +۷ مورد دیگر

David Mount is a Professor in the Department of Computer Science at the University of Maryland, with an additional appointment at the University of Maryland Institute for Advanced Computer Studies (UMIACS). His primary research focus is Computational Geometry, particularly in designing, analyzing, and implementing data structures and algorithms for geometric problems. Applications of his work span image processing , pattern recognition , information retrieval , and computer graphics . He is a Fellow of the ACM and has received the ACM Recognition of Service Award twice. A member of the Algorithms and Theory Group, Mount has authored over 200 publications, many of which are available on Google Scholar, DBLP, and ArXiV. Research Focus Computational Geometry Algorithm Design and Analysis Geometric Data Structures Nearest Neighbor and Range Searching Clustering Algorithms Recent Publications Mount's recent publications (2023-2025) emphasize non-Euclidean geometry (e.g., Hilbert metric), dynamic geometric structures , and approximation algorithms for polytopes, Voronoi diagrams, and Delaunay triangulations. Collaborative works with students and researchers address challenges in kinetic data compression , label tracking , and geometric software development (e.g., Ipelets for polygonal geometry). Professional Activities Editorial Board Member, TheoretiCS (2021-present) Senior Associate Editor, ACM Trans. on Spatial Algorithms and Systems (2013-2020) Program Committee Member, FOCS , ESA , SODA , and other major conferences Awards ACM Fellow ACM Recognition of Service Award (twice)

Yu Zhangمشاهده پروفایل

مدرس

• Text Mining
• Information Management
• Social Computing
• +۱۲ مورد دیگر

Dr. Yu Zhang is a Lecturer of Data Science at the School of Business, UNSW Canberra. His academic career focuses on text mining, knowledge and information management, social computing, and bibliometric analysis, with interdisciplinary applications in areas such as sustainable logistics, supply chain management, and net-zero energy solutions. Fields of Interest: Text Mining, Information Management, Social Computing, Bibliometric Analysis, Machine Learning for Information Systems, Heterogeneous Network Analysis, Data Mining for Asset Management, Sustainable Logistics, Supply Chain Management, Net-zero Energy in Green Buildings, and Transportation. Grants: Served as CI in projects like "Online health monitoring in Li-ion batteries via trustworthy AI" (ACT Government, $1.22M) and "Delivering net-zero energy buildings" (TRaCE Lab to Market, $1.05M). Awards: Best Paper Award (Runner-up) at ADMA 2024 and Excellent Paper Award at ICEBE 2024. Teaching: Coordinated courses in Data Analytics, Workforce Planning Research, Business Capstone, and Logistics Intelligence with Big Data Analysis. Supervision: Guided research on topics like federated learning for healthcare fraud detection, blockchain-based carbon offset management, and tier-based supply chain visibility. His publications span materials science and photovoltaic technologies, with a focus on thin-film solar cells and defect passivation methods. For collaboration or supervision inquiries, contact him at m.yuzhang@unsw.edu.au .

Erik Demaineمشاهده پروفایل

استاد

• Algorithms
• Computational Geometry
• Complexity Theory
• +۵ مورد دیگر

Erik Demaine is a Professor in the Department of Electrical Engineering and Computer Science at MIT, affiliated with the Computer Science and Artificial Intelligence Laboratory (CSAIL), the Theory of Computation group, and the Algorithms Group. His research spans algorithms, computational geometry, folding, robotics, complexity theory, and interdisciplinary connections between mathematics and art. He received the MacArthur Fellowship ("genius grant") for his work on folding and computation. Demaine's work includes co-authoring books such as Geometric Folding Algorithms and Games, Puzzles, and Computation . His art collaborations with his father Martin Demaine, including curved-crease sculptures, are in the permanent collections of the Museum of Modern Art (MoMA) and the Renwick Gallery. He is also involved in software projects like Coauthor and Cocreate, supporting collaborative research and education. His research interests include folding and unfolding of geometric structures, computational complexity of games, protein folding, and algorithm design. He has contributed to areas like data structures, robotics, and network computing, with a focus on bridging theoretical computer science and tangible applications. Demaine holds patents and has been recognized with numerous awards, including the NSERC Doctoral Prize and the Gödel Prize. His work often involves supercollaboration, emphasizing open problem-solving and interdisciplinary approaches.

• Theoretical Computer Science
• Algorithm Design
• Distributed Computing
• +۶ مورد دیگر

Yannic Maus is a University Professor at the Faculty of Computer Science and Biomedical Engineering at Graz University of Technology (TU Graz), Austria, where he heads the newly founded Institute of Algorithms and Theory (established in 2025). He also serves as co-leader of one of the five fields of expertise at TU Graz (FoE Information, Communication & Computation). His academic journey includes: PhD in Computer Science from University of Freiburg, Germany (2014-2018) MSc in Mathematics from RWTH Aachen, Germany BSc in Mathematics and Computer Science from RWTH Aachen, Germany (with a year at National University of Singapore) Professor Maus specializes in theoretical computer science and algorithm design, with a particular focus on distributed computing. His research spans distributed graph algorithms, efficient algorithms, data structures, complexity theory, and geometric algorithms. He approaches problems with both theoretical rigor and practical applications in mind, seeking clean mathematical solutions to questions motivated by real-world systems. His recent publications show a strong focus on distributed and parallel algorithms, particularly in graph theory. The research trends include distributed graph coloring, symmetry breaking, vertex cover problems, and massively parallel computing models. His work often bridges theoretical computer science with practical distributed systems considerations, with applications to large-scale networks and highly parallel systems. Professor Maus has received numerous accolades for his research: 2020 Principles of Distributed Computing Doctoral Dissertation Award Wolfgang-Gentner-Nachwuchsförderpreis 2019 GI Dissertationspreis 2018 Best Paper Awards at SIROCCO 2016, DISC 2016, and DISC 2017 Professor Maus actively mentors PhD students and has secured significant research funding, including FWF grants P36280-N (2023-2027), DOC 183 (2024-2028), I6915 (2024-2028), and FFG grant No. 59263962. His research group maintains strong international collaborations with institutions across Germany, Finland, Iceland, Israel, and beyond, providing students with opportunities for international research visits. He leads the Algorithms & Complexity research group at TU Graz, which includes PhD students Manuel Jakob, Florian Schager, Malte Baumecker, and Kritika Kashyap, as well as postdoc Tijn de Vos. The group is actively involved in theoretical computer science research with a focus on distributed and parallel algorithms, particularly for large-scale networks and highly parallel systems.

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

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

استاد پژوهشی

• Categorical Representation Theory
• 2-Representation Theory
• Modular Representation Theory
• +۶ مورد دیگر

Dr. Daniel Tubbenhauer is an ARC Future Fellow at the University of Sydney's School of Mathematics and Statistics, specializing in categorical representation theory, 2-representation theory, and their applications to topology, cryptography, and machine learning. His research bridges algebra, category theory, and low-dimensional topology, with a focus on modular representation theory and diagrammatic algebra. Education: PhD in Mathematics (2013), supported by extensive postdoctoral research globally. Research Interests: He explores categorical structures in representation theory, including categorification of quantum groups, link homologies, and applications in cryptography. His work emphasizes diagrammatic methods and computational approaches to algebraic problems. Publications: Over 30 peer-reviewed articles, including foundational work on web categories, Soergel bimodules, and applications of representation theory to machine learning. Recent projects analyze growth rates in tensor powers and fractal behavior in algebraic structures. Awards: Australian Research Council Future Fellowship (2023), supporting his research on categorical representation theory. Teaching & Supervision: Taught courses on quantum topology, category theory, and representation theory. Current student: Daniel Collison (PhD). Advises on projects linking representation theory to AI and cryptography. Labs/Teams: Collaborates with global networks in algebraic topology and categorification, including projects at the Sydney Mathematical Research Institute. Maintains an active YouTube channel ( VisualMath ) for outreach.

Noga Alonمشاهده پروفایل

استاد

• Combinatorics
• Graph Theory
• Theoretical Computer Science
• +۵ مورد دیگر

Noga Alon is a Professor of Mathematics at Princeton University, affiliated with the Mathematics Department. He is renowned for his contributions to Combinatorics, Graph Theory, and Theoretical Computer Science. His research emphasizes algebraic and probabilistic methods, with applications in circuit complexity and combinatorial geometry. Education & Affiliations Current position: Professor at Princeton University. Active in the Princeton Discrete Mathematics Seminar and has led conferences like the Noga60 Birthday Conference. Research Interests Focus areas include Combinatorics (e.g., Ramsey Theory, Graph Coloring), Theoretical Computer Science (e.g., Algorithms, Complexity), and probabilistic and algebraic methods in discrete mathematics. His work bridges combinatorial structures and algorithmic applications, with contributions to expander graphs, randomized algorithms, and extremal graph theory. Publications Over 300 papers, including foundational work on the probabilistic method, expander graphs, and combinatorial algorithms. Notable recent topics include graph coloring, path-finding algorithms (e.g., Color-coding), and spectral techniques for graph problems. Grants & Awards No specific grants or awards listed in available texts, though his academic stature implies prestigious recognition in combinatorics and computer science. Labs & Collaborations Involved in collaborative research through Princeton’s Mathematics Department and international conferences. Leads seminars and co-authors work with prominent researchers like M. Naor, J. Spencer, and others.