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

Hung Leمشاهده پروفایل

دانشیار

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

Hung Le is an Associate Professor in the College of Information & Computer Sciences at the University of Massachusetts Amherst. He leads research in theoretical computer science with a focus on graph algorithms, spanners, and metric embeddings. He is a member of the UMass Theory Group and serves as Chair of PhD Admissions. PhD in Computer Science, Oregon State University, 2018 BS in Computer Science, Hanoi University of Science and Technology Hung Le's research centers on algorithm design for graph problems, especially understanding structural properties of graphs in theoretical settings. His work spans approximation algorithms, spanners, fault tolerance, metric embeddings, and computational geometry. He has made significant contributions to light spanners, tree covers, and distance oracles, particularly in planar and doubling metrics. His recent publications show a strong trend in designing efficient, sparse, and light structures for geometric and minor-free graphs, with a focus on optimal tradeoffs and lower bounds. Key themes include locality-sensitive orderings, shortcut partitions, and tree covers with constant stretch and size. NSF CAREER Award Google Research Scholar Program (2024) PIMS Postdoctoral Fellowship Hung Le has advised numerous students and postdocs, including An La and Cuong Than, whose work has led to STOC and FOCS publications. His research is funded by multiple NSF grants (CCF-2121952, CCF-2237288, CCF-2517033) and a Google Research Scholar Award. He has served on program committees (e.g., WADS 2025) and co-chaired SOSA 2021. He is actively involved in the theoretical computer science community, maintains a technical blog 'Rambling on Graphs', and contributes to open problems in graph theory and algorithm design.

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.

Vijay K Gargمشاهده پروفایل

استاد

• Distributed Algorithms
• Fault Tolerance
• Multicore Computing
• +۷ مورد دیگر

Vijay K Garg is a Professor at the University of Texas at Austin , holding positions in both the Department of Electrical and Computer Engineering and the Department of Computer Sciences . He serves as the Director of the Parallel and Distributed Systems Laboratory and has made significant contributions to distributed computing. Ph.D. in Electrical Engineering and Computer Science from University of California at Berkeley (1988) M.S. in Electrical Engineering and Computer Science from University of California at Berkeley (1985) B.Tech. in Computer Science & Engineering from Indian Institute of Technology, Kanpur (1984) His research focuses on Distributed Algorithms , Fault Tolerance , Multicore Computing , and Lattice Theory applied to computing problems. He has also contributed to areas like Distributed Debugging , Simulation , and Supervisory Control of Discrete Event Systems . His publications show a consistent focus on applying Lattice Theory to Distributed Systems , with recent work on Predicate Detection algorithms, Lattice Agreement , and applications to problems like Stable Marriage and Matching . His work bridges theoretical computer science with practical implementations in distributed systems. Among his scientific awards are: IEEE Fellow (2004) UT Outstanding Inventor (2011) Best Paper Award at 17th International Conference on Runtime Verification (RV'2017) Best Paper Award at 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems (2010) Dean’s Fellowship at UT Austin (2002) Faculty Research Award at UT Austin (2000) Vijay has served on numerous program committees including ICDCS 2022 , SRDS 2021 , ICDCN 2020 , and DISC 2019 . He has also delivered keynote and invited talks at major conferences.

Rolf Wankaمشاهده پروفایل

استاد

• Algorithms
• Combinatorial Optimization
• Swarm Intelligence
• +۳ مورد دیگر

Prof. Dr. Rolf Wanka is a Professor at the Department of Computer Science, Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU), specializing in efficient algorithms and combinatorial optimization. His research focuses on swarm intelligence, discrete optimization algorithms, and scheduling problems, particularly in timetabling and robotics applications. Education : Sc.D. (Dr. rer. nat.) in Computer Science His work includes theoretical and experimental analyses of particle swarm optimization (PSO) algorithms, addressing runtime complexity, stagnation behavior, and convergence properties. He has developed novel heuristics for timetabling and sorting problems, with applications in multi-robot systems and medical imaging. Notable collaborations include studies on Markov chain-based PSO and fairness in academic scheduling. Key trends in his recent publications span swarm intelligence , discrete optimization , and scheduling heuristics , with a focus on robust timetabling , runtime analysis , and stochastic algorithm behavior . While no explicit scientific awards are listed, his mentorship in the Max Weber-Programm highlights his advisory role in academia. His publications demonstrate interdisciplinary applications of algorithms in robotics , medical imaging , and parallel computing , leveraging both theoretical rigor and practical experimentation. The full description below provides exhaustive details on his academic contributions and affiliations.

• Algorithms
• Graph Theory
• Fault-Tolerant Networks
• +۳ مورد دیگر

Greg Bodwin is an Assistant Professor in the Department of Computer Science and Engineering at the University of Michigan, College of Engineering. His research focuses on theoretical computer science, particularly in algorithms, graph theory, and fault-tolerant network design. He emphasizes mentoring PhD students through structured weekly meetings, aiming for them to identify their research niche and produce peer-reviewed publications. His advising style evolves as students progress, transitioning from guided problem-setting to encouraging independent research direction. Research expectations include active participation in conferences (with travel funding) and maintaining productivity through flexible work arrangements. Authorship follows alphabetical convention in CS Theory. Students may occasionally serve as Graduate Student Instructors, contingent on funding. Bodwin encourages internships, though uncommon in theory-focused roles, and vacation time with advance notice near submission deadlines. Key research areas include spanners, fault-tolerant networks, shortest path algorithms, and graph sparsification. Over 30 publications since 2011 reflect his contributions to these fields. Funding and grants are tied to his research projects, though specifics are not detailed here.

Ioan Todincaمشاهده پروفایل

استاد

• Graph Algorithms
• Theoretical Computer Science
• Exact Algorithms
• +۶ مورد دیگر

Ioan Todinca is a Professor of Computer Science at the University of Orléans, France, affiliated with the LIFO (Laboratoire d'Informatique Fondamentale d'Orléans) research laboratory. His academic career spans over two decades, with significant contributions to theoretical computer science, particularly in graph algorithms and distributed computing. Faculty of Science, University of Orléans LIFO Research Laboratory Member of Institut thématique pluridisciplinaire Modélisation, Systèmes, Langages (since 2014) Former director of MIPTIS doctoral school (2012-2014) Former head of Computer Science degree program (2007-2011) Former leader of LIFO Graphs, Algorithms and Computational Models team (2008-2012) Todinca's research focuses primarily on graph algorithms, with expertise in exact algorithms (moderately exponential), parameterized algorithms, and algorithms for specific graph classes. He has made significant contributions to techniques involving tree decompositions, treewidth, minimal separators, and potential maximal cliques. More recently, his work has expanded into distributed algorithms, especially in communication-constrained models like the broadcast congested clique. His research bridges theoretical foundations with practical algorithmic approaches for NP-hard problems. The analysis of his recent publications reveals a strong trend toward distributed computing problems, particularly in congested network models. His work spans from fundamental graph theory problems (cycle detection, graph modification) to applications in quantum computing and model checking. The consistent focus on communication complexity, verification, and efficient algorithms across different computational models demonstrates his ability to adapt theoretical computer science principles to emerging computational paradigms. Todinca has supervised numerous PhD students and has been actively involved in the theoretical computer science community through conference organization and editorial work. His publications appear consistently in top-tier venues including SIAM Journal on Computing, Algorithmica, and proceedings of major conferences like STACS, WG, and DISC. Teaching responsibilities include algorithms, graph theory, and discrete structures for undergraduate and graduate students, with previous experience teaching databases, programming, and software engineering. His educational materials are hosted on the university's Celene platform.

• Graph Theory
• Combinatorial Optimization
• Operations Research
• +۴ مورد دیگر

Cristina Bazgan is a University Professor at Université Paris-Dauphine, affiliated with LAMSADE (Laboratoire d'Analyse et Modélisation de Systèmes pour l'Aide à la Décision) within PSL University. Her office is located at P 409 with contact number 01 44 05 40 90. She maintains an active research profile with numerous publications spanning graph theory, combinatorial optimization, and multi-objective optimization. Professor Bazgan's research primarily focuses on graph theory and combinatorial optimization , with significant contributions to domination theory, network analysis, approximation algorithms, and multi-objective optimization. Her work bridges theoretical computer science and operations research, addressing fundamental problems in computational complexity while developing practical algorithmic solutions. She has made notable contributions to understanding graph partitions, community detection in networks, and the complexity of various optimization problems. Analysis of her recent publications reveals a strong trend in multi-objective optimization and parameterized complexity . Her work often explores the interface between theoretical computer science and operations research, with applications to network analysis and decision support systems. A significant portion of her research addresses the complexity and approximability of graph-theoretic problems, particularly those related to domination, community structure, and anonymization in networks. Professor Bazgan has co-authored the book Combinatorial Algorithms (2022) with H. Fernau and contributed chapters to authoritative works on combinatorial optimization. While specific scientific awards aren't mentioned in the available information, her extensive publication record in top-tier journals demonstrates significant recognition in her field. She maintains an active collaboration network, frequently working with researchers such as Vanderpooten D., Tuza Z., Chlebíková J., and Herzel A. Her research has practical applications in network security, social network analysis, and decision support systems. The LAMSADE laboratory, where she is based, focuses on decision support systems and operations research, providing an interdisciplinary environment for her theoretical and applied work.

Shaun Fallatمشاهده پروفایل

استاد

• Combinatorial Matrix Theory
• Algebraic Graph Theory
• Matrix Positivity
• +۳ مورد دیگر

Shaun Fallat is a Professor in the Mathematics and Statistics Department at the University of Regina, within the Faculty of Science. He holds a Ph.D. in Applied Mathematics from the College of William and Mary (1999) and degrees from the University of Victoria (BSc and MSc). His research focuses on combinatorial matrix theory, algebraic graph theory, matrix positivity, and total positivity, with over 90 publications and a co-authored book on totally nonnegative matrices. He has supervised numerous graduate and undergraduate students, postdoctoral fellows, and visiting scholars, fostering a collaborative research environment. Fallat has delivered lectures globally and organized conferences, including the Western Canada Linear Algebra Meeting. His awards include the U. Regina Alumni Association Teaching Award, Olga Taussky-Todd Lecturer (2014), and Inaugural Hans Schneider Lecturer (2015). He serves as an Associate Editor for Linear Algebra and its Applications and the Canadian Journal of Mathematics . His research spans topics such as zero forcing parameters, spectral graph theory, and matrix inequalities. Recent work includes studies on hypertrees, graph complements, and applications of combinatorial matrix analysis. Fallat is actively involved in mentoring and promoting mathematics education at all levels, including outreach to K-12 students.

Hanan Sametمشاهده پروفایل

استاد

• Spatial Data Structures
• Geographic Information Systems (GIS)
• Computer Vision
• +۳ مورد دیگر

Hanan Samet is a Distinguished University Professor in the Computer Science Department at the University of Maryland, College Park. He holds affiliations with the Center for Automation Research and the Institute for Advanced Computer Studies (UMIACS). His academic journey includes a PhD from Stanford University (1975) in Computer Science, following degrees in Engineering (UCLA) and Operations Research/Computer Science (Stanford). Affiliations: University of Maryland, College Park (since 1975) Roles: Professor, Founding Editor-in-Chief of ACM Transactions on Spatial Algorithms and Systems, Founder of ACM SIGSPATIAL Samet's research focuses on spatial data structures, spatial databases, GIS, computer vision, and information retrieval. His seminal work includes the Foundations of Multidimensional and Metric Data Structures , an award-winning book addressing spatial indexing and query optimization. He pioneered frameworks like NewsStand for map-based news exploration and Coronaviz for pandemic visualization. Key contributions span spatial synonyms for approximate search, SAND spatial browser for digital government, and trajectory analysis systems for aviation safety and urban mobility. His work bridges theory and practice, influencing databases, graphics, and geographic systems. Education: B.S. Engineering, UCLA M.S. Operations Research, Stanford M.S./Ph.D. Computer Science, Stanford Samet has advised numerous students and led NSF-funded projects on spatio-textual data, similarity search, and spreadsheet analysis. His honors include the ACM Paris Kanellakis Award (2011), IEEE Wallace McDowell Award (2014), and UCGIS Research Award (2009). His labs and teams focus on spatial algorithms, visualization, and GIS applications. Notable projects include VASCO (spatial index demo), MARCO (image databases), and CHOLERA (disease tracking).

Aaron Bernsteinمشاهده پروفایل

دانشیار

• Graph Algorithms
• Dynamic Algorithms
• Sublinear Algorithms
• +۲ مورد دیگر

Aaron Bernstein is Charles S. Baylis Associate Professor in Computer Science at NYU Tandon School of Engineering. His research advances theoretical foundations of graph algorithms, with breakthroughs in dynamic algorithms, shortest path problems, and distributed computing. Research contributions: Pioneering work on near-linear time algorithms for shortest paths with negative weights Fundamental advances in dynamic graph algorithms for connectivity and matching Innovative frameworks for distributed load balancing and network optimization Breakthroughs in maximum flow and matching problems Publications demonstrate consistent theoretical innovation with numerous best paper awards at top theory conferences. Recent work resolves long-standing open problems in graph algorithms and establishes new algorithmic paradigms. Current research group includes PhD students working on graph algorithms and distributed computing. Recipient of prestigious awards including Presburger Award and Sloan Research Fellowship. Research funded by NSF CAREER grant and Google Research Scholar award.

Fedor Fominمشاهده پروفایل

استاد

• Theoretical Computer Science
• Graph Algorithms
• Parameterized Complexity
• +۳ مورد دیگر

Fedor Fomin is a Professor in the Department of Informatics at the University of Bergen. His research focuses on Theoretical Computer Science, including Graph Algorithms, Parameterized Complexity, Combinatorics, and Combinatorial Games. He is affiliated with the Norwegian Academy of Science and Letters, the Norwegian Academy of Technological Sciences, and the Academia Europaea, and holds fellowships from ACM and EATCS. His work has been recognized with the EATCS Nerode Prize in 2015 and 2017. Dr. Fomin has authored influential books such as Kernelization: Theory of Parameterized Preprocessing and Parameterized Algorithms , which are foundational in the field of algorithm design. His recent publications explore cutting-edge topics in parameterized complexity, graph theory, and distributed computing, with contributions to approximation algorithms, kernelization, and combinatorial optimization. His awards and honors reflect his significant impact on theoretical computer science. Fomin has been awarded an ERC Advanced Grant and has mentored numerous researchers, contributing to the advancement of algorithmic techniques and their applications.

• Optimization under Uncertainty
• Robust Optimization
• Combinatorial Optimization
• +۷ مورد دیگر

Christina Büsing is a Professor in Combinatorial Optimization at RWTH Aachen University. She leads the Teaching and Research Group on Combinatorial Optimization and is a principal investigator in the UnRAVeL Graduate College. Her research focuses on optimization under uncertainty , robust optimization , and combinatorial optimization , with applications to healthcare , energy systems , and transportation logistics . Alumni of TU Berlin, WWU Münster, and Universidad Complutense de Madrid Junior Professor for Robust Planning in Medical Care at RWTH Aachen (2016-2021) Her methodological expertise spans exact algorithms , heuristics , and complexity theory , with recent publications addressing network flows, facility location, and healthcare scheduling. She has received awards for teaching excellence and gender equality advocacy. 2022 Brigitte Gilles Award for women in science 2019 FAMOS Award for family-friendly leadership 2018 Best Teaching Award at RWTH Aachen Her work combines theoretical rigor with practical applications in urban railway traffic management , solar power systems , and agent-based pandemic response modeling .

Hoang Xuan Phuمشاهده پروفایل

استاد

• Optimization
• Optimal Control
• Functional Analysis
• +۶ مورد دیگر

Professor Hoang Xuan Phu is a renowned mathematician affiliated with the Institute of Mathematics , Vietnam Academy of Science and Technology , where he has served since 1984 (Researcher), 1992 (Associate Professor), and 1996 (Professor). He is an elected member of multiple prestigious academies: the Heidelberg Academy of Sciences and Humanities (2004), Bavarian Academy of Sciences and Humanities (2010), TWAS - The World Academy of Sciences (2013), and acatech - National Academy of Science and Engineering, Germany (2019). His email contact is hxphu@math.ac.vn and phu@iwr.uni-heidelberg.de . Education : University of Leipzig (Diploma 1979, PhD 1983, Habilitation 1987) Research Areas : Optimization, Optimal Control, Functional Analysis, Numerical Analysis, Rough Analysis Applications : Inventory Problems, Hydroelectric Power Plant Control, Robotics, Open Channel Hydraulics Editorial Roles : Editor-in-Chief of Vietnam Journal of Mathematics (2011-2022), Honorary Editor-in-Chief (2023-present), Associate Editor for multiple journals His recent publications focus on convex hull algorithms, optimal path planning, and function perturbation analysis, reflecting his expertise in mathematical optimization and computational methods. He has organized numerous international conferences on High Performance Scientific Computing in Hanoi (2000-2024) and Optimization & Scientific Computing (2003-2024).

Jonathan A. Kelnerمشاهده پروفایل

استاد

• Algorithms
• Complexity Theory
• Spectral Graph Theory
• +۴ مورد دیگر

Jonathan A. Kelner is a Professor of Applied Mathematics at the Massachusetts Institute of Technology (MIT) and a member of the Computer Science and Artificial Intelligence Laboratory (CSAIL) . His research bridges pure mathematics and algorithms, focusing on spectral graph theory, combinatorial optimization, and distributed computing.

• Computer Science
• Algorithms
• Graph Theory
• +۴ مورد دیگر

Virginia Vassilevska Williams is a Professor at the Massachusetts Institute of Technology (MIT) Department of Electrical Engineering and Computer Science (EECS), affiliated with MIT CSAIL. She earned her Ph.D. in Computer Science from Carnegie Mellon University in 2008 and held postdoctoral positions at the Institute for Advanced Study (Princeton), UC Berkeley, and Stanford. Education: B.S. in Mathematics and Engineering from Caltech (2003); Ph.D. in Computer Science from CMU (2008) Her research focuses on combinatorial and graph-theoretic approaches to computational problems, including shortest paths , pattern detection , fine-grained complexity , and computational social choice for analyzing election manipulation and tournament structures. Recent publications highlight advances in sparse graph algorithms , cycle detection , and approximate counting using matrix multiplication techniques. She co-organized programs at the Simons Institute (2023) and Dagstuhl Seminars (2016). Scientific Awards NSF CAREER Award Google Research Fellowship Alfred P. Sloan Research Fellowship Thornton Family Faculty Research Innovation Fellowship Invited Speaker at ICM 2018 She advises current Ph.D. students including John Kuszmaul , Yael Kirkpatrick , and Zixuan Xu . Former students like Amir Abboud (Weizmann Institute) and Nicole Wein (U. Michigan) have achieved academic and industry positions.