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

David B. Shmoys is the Laibe/Acheson Professor of Business Management & Leadership Studies at Cornell University's School of Operations Research and Information Engineering (ORIE) and holds a joint appointment in the Department of Computer Science. He is a leading researcher in approximation algorithms, stochastic optimization, and computational sustainability. His work emphasizes data-driven decision-making in enterprise and society, with applications ranging from healthcare logistics to environmental conservation. Shmoys has advised 27 Ph.D. students and served as an editorial board member for top journals like Operations Research and Mathematics of Operations Research. Education: Ph.D. in Computer Science, University of California, Berkeley (1984). Postdoctoral positions at MSRI and Harvard University, followed by faculty roles at MIT before joining Cornell. Research Interests: Design and analysis of approximation algorithms for NP-hard problems, stochastic optimization, scheduling, facility location, and inventory management. Applications include computational sustainability, epidemiological modeling, and political districting optimization. Articles Trends: Focus on optimization under uncertainty, computational sustainability, and real-world applications like air ambulance routing, bike-sharing systems, and gerrymandering analysis. Notable works include the 2018 Wagner Prize-winning paper on bike-sharing analytics and the 2013 Lanchester Prize-winning textbook on approximation algorithms. Awards: Lanchester Prize (2013), Daniel H. Wagner Prize (2018), Fellowships from ACM, INFORMS, and SIAM, NSF Presidential Young Investigator (1987). Advising & Grants: Over 27 advised Ph.D. students, with former students at MIT, Waterloo, Brown, and D-Wave. Active in grants related to data science and sustainability. Labs/Teams: Involved in the Institute of Computational Sustainability at Cornell, focusing on applying algorithms to environmental challenges. Collaborates with organizations like Motivate (bike-sharing) and Ornge (air ambulance services).

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

Sicun Gao is an Associate Professor in the Computer Science and Engineering department at the University of California, San Diego. His research focuses on practical algorithms for NP-hard search and optimization problems in computational systems, emphasizing combinatorial perspectives in numerical and statistical contexts to achieve reliable autonomy. Research Interests: Automated reasoning, Hamilton-Jacobi reachability, safe reinforcement learning, control barrier functions, and optimization in cyber-physical systems. Teaching: Courses on AI search, optimization, and graduate research seminars. The 15 most recent publications highlight advancements in safe AI control, motion planning, and policy optimization, often integrating neural networks with formal verification. Awards include the IEEE Power & Energy Society Technical Committee Prize Paper Award and the IROS RoboCup Best Paper Award. He advises PhD students working on AI-driven control and robotics, with alumni placed at institutions like Seoul National University, Amazon, and Apple. Grants include NSF Career, Air Force Young Investigator, and DARPA Assured Autonomy funding. His lab develops tools like dReal for automated reasoning in nonlinear theories over the reals.

• Algorithms and Optimization
• Automated Reasoning
• Cyber-Physical Systems
• +۳ مورد دیگر

Daniel Dominic Kaplan Sleator is a Professor of Computer Science at Carnegie Mellon University's School of Computer Science. He maintains an office in the Gates-Hillman Center (7205 Gates-Hillman) and teaches various courses in algorithms and theoretical computer science. Professor Sleator's research spans several areas of theoretical computer science and algorithms. His primary interests include: Algorithms and Data Structures Amortized Analysis and Competitive Analysis Persistent and Self-Adjusting Data Structures Computational Geometry and Combinatorial Optimization Combinatorial Game Theory and Mathematical Games Music Analysis using Computational Methods His extensive publication record shows a consistent focus on efficient data structures and algorithms. Over the years, his work has evolved from foundational data structures like splay trees and skew heaps to applications in diverse areas such as music analysis and combinatorial games. A notable trend in his work is the development of self-adjusting data structures that achieve excellent amortized performance without maintaining explicit structural constraints. His papers on splay trees, skew heaps, and persistent data structures have become classics in the field. Professor Sleator has made significant contributions across multiple domains of computer science. His work on competitive algorithms for paging and list update problems has been particularly influential, establishing fundamental results in online algorithms. His research extends beyond traditional computer science into interdisciplinary areas like computational music theory, demonstrating the broad applicability of algorithmic thinking. He teaches a variety of courses including Algorithms 15-451/651, Competition Programming 15-295, and specialized topics like mathematical games.

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

Illya V. Hicks is a Professor in the Computational and Applied Mathematics Department at Rice University. He holds a PhD from Rice University (2000) and a BS from Texas State University (1995). His research focuses on combinatorial optimization, integer programming, graph theory, and matroid theory, with applications in social networks, cancer treatment, and network design. He has advised numerous doctoral, post-doctoral, and masters students. Education: PhD and MA in Computational and Applied Mathematics, Rice University, 2000 BS in Mathematics, Texas State University, 1995 Research Interests: Utilizing graph decomposition techniques to solve NP-complete problems, including branch decompositions and matroid circuit problems. Applications include sensor network design, healthcare logistics, and algorithmic graph theory. Awards: Recognized with the 2015 Presidential Mentoring Award (Rice University), 2010 Forum Moving Spirit Award (INFORMS), and the 2005 Optimization Prize for Young Researchers. Grants and Projects: Includes NSF-funded research on branch decomposition techniques, submodular optimization, and healthcare service distribution. Active in promoting minority participation in operations research through travel grants and mentoring initiatives. Labs/Teams: Engaged in collaborative research on graph algorithms, combinatorial optimization, and interdisciplinary applications in healthcare and engineering.

• Combinatorial Optimization
• Integer Programming
• Graph Theory
• +۵ مورد دیگر

Amir Ali Ahmadi is a Professor at Princeton University's Department of Operations Research and Financial Engineering (ORFE), with affiliations across multiple disciplines including PACM, Computer Science, Mechanical & Aerospace Engineering, Electrical Engineering, and the Center for Statistics and Machine Learning. He serves as Director of Princeton's Optimization and Quantitative Decision Science Certificate Program and has taken temporary roles at Citadel GQS (2021-2022) and Google Brain (2020-2021). His research bridges optimization theory , dynamical systems , and control theory , focusing on scalable algorithms for complex problems in robotics, autonomous systems, and machine learning. He has pioneered DSOS/SDSOS relaxations as alternatives to traditional sum-of-squares methods, enabling faster solutions through linear/second-order cone programming. Recent publications explore: Higher-order Newton methods for socially responsible investment Data-efficient learning of dynamical systems Computational complexity of local minima Robust-to-dynamics optimization frameworks Award highlights include: 2024 Egon Balas Prize in Optimization 2024 Princeton Engineering Council Teaching Award 2023 Distinguished Teaching Award (Princeton SEAS) 2019 NSF CAREER Award 2017 DARPA Young Faculty Award 2017 Sloan Fellowship in Computer Science He advises prominent researchers like Georgina Hall (Tucker Prize finalist) and Bachir El Khadir (Goldstine Fellow), and leads the Princeton Optimization Seminar and MURI project on Control-Oriented Learning on the Fly.

• Optimization Theory
• Control Theory
• Dynamical Systems
• +۷ مورد دیگر

Maria Chudnovsky is a Professor of Mathematics at Princeton University and a former Professor of IEOR and Mathematics at Columbia University (2006-2014). Her research focuses on graph theory and combinatorics, with significant contributions to structural graph theory, perfect graphs, and algorithmic applications. Education: B.A. Summa Cum Laude (1996) and M.Sc. (1999) from Technion, Ph.D. (2003) from Princeton University Her work addresses fundamental problems in graph coloring, forbidden induced subgraphs, and combinatorial optimization, including the proof of the Strong Perfect Graph Theorem and development of algorithms for detecting graph structures. Notable awards include the MacArthur Foundation Fellowship (2013-2017), D.R. Fulkerson Prize (2009), and Henry Burchard Fine Professor of Mathematics (2022). She has held prestigious fellowships such as the Clay Mathematics Institute Research Fellowship (2003-2008). Grants: NSF DMS-EPSRC Grant DMS-2120644 (2021-2024), US Army Research Office Grant W911NF-16-1-0404 (2016-2020), and multiple NSF grants She has advised numerous PhD/MSc students and postdocs, including Sophie Spirkl, Mingxian Zhong, and Tara Abrishami. Her outreach includes popular science communication on YouTube's Numberphile and participation in initiatives promoting women in STEM.

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

Shiyu Su is an Assistant Professor in the Department of Electrical and Computer Engineering at the University of Waterloo. His research focuses on high-speed data converters, wireless transceivers, digital phase-locked loops (PLL), and AI-assisted analog/mixed-signal design automation. He holds a Ph.D. from the University of Southern California (2019) and teaches courses such as ECE 340 (Electronic Circuits 2) and ECE 432 (Radio Frequency Integrated Devices and Circuits). Education: B.S. from Beijing University of Post and Telecommunication (China) and Queen Mary, University of London (UK), 2011; M.S. and Ph.D. from USC, 2013 and 2019, all in electrical engineering. Research Interests: High-speed ADCs/DACs RF/mm-wave transceivers Time-approximation filters (TAF) Analog/mixed-signal design automation Memristor-based computing Biomedical interfaces Key Awards: IEEE SSCS Predoctoral Achievement Award (2017–2018) Best Student Paper Award at IEEE RFIC (2022) Ming Hsieh Institute Scholar (2019–2020) Lab Focus: The Shiyu Su Lab develops integrated circuits for communications, sensing, and computing, with a focus on AI-driven methodologies and digital-analog co-design. Collaborations include work with Prof. Wei Wu (USC) on memristor-based systems.

• High-speed data converters
• Wireless transceivers
• Digital phase-locked loops
• +۷ مورد دیگر

Chandra Chekuri is the Paul and Cynthia Saylor Professor in the Department of Computer Science at the University of Illinois Urbana-Champaign, situated within the Grainger College of Engineering. He has been actively contributing to theoretical computer science for over two decades, with significant leadership roles including serving as Editor-in-Chief of the prestigious SIAM Journal on Computing since May 2025. His academic journey began with a B.Tech in Computer Science from the Indian Institute of Technology, Madras in 1993, followed by a Ph.D. in Computer Science from Stanford University in 1998. Prior to joining UIUC, he spent eight years as a Member of Technical Staff at Bell Labs, Lucent Technologies. Chekuri's research focuses on theoretical computer science with particular emphasis on the design and analysis of algorithms, discrete and combinatorial optimization, approximation algorithms, mathematical programming, and graph theory. His work explores fundamental connections between discrete structures and optimization problems, with applications spanning network design, data analysis, and computational complexity. His recent publications demonstrate a continued focus on hypergraph algorithms, submodular function optimization, and graph partitioning problems, showing how theoretical insights can yield practical algorithmic improvements. His approach often combines continuous relaxations with discrete rounding techniques to develop approximation algorithms for NP-hard problems. As Editor-in-Chief of SIAM Journal on Computing, Chekuri leads one of theoretical computer science's most respected publications, which covers analysis and design of algorithms, algorithmic game theory, computational complexity, and other mathematical aspects of computer science. His editorial leadership follows previous service as Associate Editor for several major journals including SIAM Journal on Computing, Mathematics of Operations Research, and Mathematical Programming. ACM Fellow (January 2024) Scott Fisher Teaching Award (for year 2022-23) from CS Department Chekuri has advised numerous PhD students to completion, including Kent Quanrud, Vivek Madan, Shalmoli Gupta, and Chao Xu, with several currently in progress such as Tanvi Bajpai, ElFarouk Harb, Rhea Jain, and Weihao Zhu. His teaching portfolio includes graduate courses on Randomized Algorithms, Approximation Algorithms, Algorithms for Big Data, and Combinatorial Optimization. He has served as Director of the Graduate Program in the Department of Computer Science from May 2014 to August 2017, demonstrating significant administrative leadership within the department.

• Theoretical Computer Science
• Design and Analysis of Algorithms
• Discrete and Combinatorial Optimization
• +۶ مورد دیگر

Nicole Wein is an Assistant Professor in the Computer Science and Engineering Division of the Department of Electrical Engineering and Computer Science (EECS) at the University of Michigan, College of Engineering. Her research lies in theoretical computer science, focusing on graph algorithms, dynamic algorithms, parameterized algorithms, distributed algorithms, online algorithms, and fine-grained complexity. She is part of the Theory of Computation Lab and advises both PhD and undergraduate researchers. PhD, Massachusetts Institute of Technology (MIT), advised by Virginia Vassilevska Williams Postdoctoral Fellow, DIMACS Research Fellow, Simons Institute, UC Berkeley MS, Stanford University BS, Computer Science/Math, Harvey Mudd College Her research explores fundamental algorithmic questions in combinatorial settings, particularly how algorithms handle dynamic data, extract information efficiently (e.g., in linear time), and understand shortest path structures in graphs—especially directed ones. She investigates problems in distance estimation, spanners, hopsets, dynamic graph algorithms, and hardness of approximation. Her work combines theoretical depth with practical implications for algorithm design. The recent publications reflect a strong trend in fine-grained complexity and graph algorithm design, with a focus on proving tight bounds, developing efficient approximations, and understanding structural limitations in directed and dynamic graphs. Her work frequently appears in top venues such as STOC, FOCS, SODA, and ICALP, often in collaboration with leading researchers in the field. Scientific Awards and Recognition: Invited to special issue of SIAM Journal on Computing (SICOMP) (FOCS 2022 paper) Invited to Highlights of Algorithms (HALG) (FOCS 2022 paper) Invited to minisymposium at CANADAM (ESA 2022 paper) Work featured in Quanta Magazine Nicole Wein actively mentors students, including current PhD student Jubayer Nirjhor and former undergraduate researchers like Sam Hiken (now pre-doc at MIT). She has served on program committees for major conferences including SODA, FOCS, ICALP, and ITCS, and co-organized the DIMACS workshop on Modern Techniques in Graph Algorithms (2023). She also contributes to the academic community through outreach, such as her article offering reassurance to early-stage PhD students in theoretical computer science. She leads and participates in collaborative research groups and workshops, emphasizing supercollaboration and interdisciplinary communication in algorithms. Her lab fosters a strong research environment in theoretical computer science at the University of Michigan.

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

David Eppstein is a Distinguished Professor of Computer Science at the University of California, Irvine (UCI), affiliated with the Donald Bren School of Information & Computer Sciences. He holds academic leadership roles as director of the Center for Algorithms and Theory of Computation and associate director of the Center for Algorithms, Combinatorics, and Optimization. His research focuses on graph algorithms, computational geometry, discrete mathematics, and geometric graph theory. Eppstein earned a B.S. in Mathematics from Stanford University (1984) and a Ph.D. in Computer Science from Columbia University (1989). Research Interests: Graph drawing, information visualization, dynamic graph algorithms, mesh generation, optimal triangulation, K-shortest paths, subgraph isomorphism, data depth, exponential-time algorithms for NP-hard problems. Awards: ACM Fellow (2012), AAAS Fellow (2017), Distinguished Professor (2020), Best Paper Awards (2023, 2022), and SIAM recognition. Grants: Co-PI on a $1.2M NSF grant (2022) for geometric graph research, and previous NSF grants for algorithm studies (2016). His work bridges theoretical computer science and practical applications, including contributions to graph visualization, geometric algorithms, and combinatorial optimization. Notable recent achievements include resolving open questions in graph biplanarity and authoring the book Forbidden Configurations in Discrete Geometry (2018).

• Graph Algorithms
• Computational Geometry
• Graph Theory
• +۳ مورد دیگر

Sanjay Jain is a Provost's Chair Professor in the Department of Computer Science at the School of Computing, National University of Singapore (NUS). His research focuses on theoretical computer science with particular emphasis on inductive inference, recursion theory, complexity theory, and computational learning theory. Education: B.Tech. in Computer Science from Indian Institute of Technology Kharagpur, India (1986) M.S. in Computer Science from University of Rochester, USA (1988) Ph.D. in Computer Science from University of Rochester, USA (1990) Professor Jain's research spans multiple areas of theoretical computer science. His primary contributions are in computational learning theory, where he has made significant advances in understanding the intrinsic complexity of language identification and the limits of inductive inference. His work on recursion theory explores fundamental questions about computability and complexity, while his research in complexity theory addresses structural aspects of computational problems. A notable achievement was his work on "Deciding Parity Games in Quasipolynomial Time," which won the prestigious STOC 2017 best paper award and later the EATCS-IPEC Nerode Prize. Professor Jain's publication record shows a consistent focus on theoretical foundations of computer science, particularly in learning theory and computational complexity. His recent work has expanded into automatic structures, semiautomatic models, and connections between computational learning and algebraic structures. There is a clear progression from foundational work on language identification to more complex models involving automatic functions, transducers, and connections to mathematical logic. Scientific Awards: STOC 2017 Best Paper Award for "Deciding Parity Games in Quasipolynomial Time" EATCS-IPEC Nerode Prize (2021) Professor Jain has served on the editorial board of Information and Computation and has been actively involved in the academic community through program committee memberships for major conferences including COLT, ALT, LATA, TAMC, and PRICAI. He has held leadership roles as program co-chair for ALT 2000 and ALT 2013, and conference chair for ALT 2005. His work has been supported by various research grants, though specific details are not provided in the available materials. Professor Jain leads research in theoretical computer science at NUS, where he has built a strong research group focused on computational learning theory and related areas. His work often involves collaborations with researchers from around the world, particularly with Frank Stephan, with whom he has co-authored numerous papers. His research group has made significant contributions to understanding the fundamental limits and possibilities of computational learning models.

• Inductive Inference
• Recursion Theory
• Complexity Theory
• +۳ مورد دیگر

Ola Svensson is an Associate Professor at the School of Computer and Communication Sciences , EPFL. His research spans approximation algorithms, combinatorial optimization, computational complexity, and scheduling. He holds an ERC Consolidator Grant (2023–) and previously received an ERC Starting Grant (2014–2019) and SNF grant (2019–2023). Education: PhD in Computer Science from IDSIA, Università della Svizzera italiana (2009) M.Sc. from Uppsala University (2005) Research Focus: Svensson develops novel techniques for NP-hard problems, with emphasis on primal-dual methods, LP/SDP hierarchies, and hardness proofs. His work applies to clustering, scheduling, network design, and submodular optimization. Publications: His 15 most recent works (2018–2021) focus on learning-augmented algorithms, robust optimization, and improved approximations for clustering/TSP. Key trends include integration of ML with classical algorithms and quasi-polynomial methods for combinatorial problems. Awards: Best Paper Awards at FOCS (2011, 2017) and STOC (2018) I&C Teaching Award at EPFL Advising & Grants: He advises 6 current PhD students and graduated 8 others. Major grants include ERC Starting Grant 'OptApprox' (€1.4M) and ERC Consolidator Grant 'POTCO' (€2M). Teaching: Leads courses in Advanced Algorithms, Computational Complexity, and Approximation Algorithms. He developed pedagogical frameworks for scribe notes and project-based learning in theoretical computer science.

• Approximation Algorithms
• Combinatorial Optimization
• Computational Complexity
• +۳ مورد دیگر

Minsu Kim is a CIFAR AI Safety Post-doc Fellow at KAIST and Mila, collaborating with Prof. Yoshua Bengio, Prof. Sungjin Ahn, and Prof. Sungsoo Ahn. His work bridges System 2 Deep Learning, Bayesian posterior inference, and combinatorial optimization. Ph.D., Industrial Engineering, KAIST (2025) M.S., Electrical Engineering, KAIST (2022) B.S., Mathematics and Computer Science (Dual Degree), KAIST (2020) Kim's research focuses on enabling AI systems to measure uncertainty, represent causality, and perform sequential reasoning for safety-guaranteed planning. His methodology integrates GFlowNets and diffusion models with off-policy amortized inference, targeting applications in scientific discovery , hardware design optimization , and large language model alignment . Recent work explores Bayesian posterior inference through GFlowNets, aiming to unify deep learning with probabilistic reasoning. His 15 most recent publications (2025–2024) reveal a trend of combining combinatorial optimization with generative models for tasks like molecular graph discovery, vehicle routing, and neural architecture search. He also investigates diffusion samplers for Bayesian inverse problems and symmetry-based neural methods (Sym-NCO) to enhance sample efficiency. Jang Yeong Sil Fellowship (2025) KAIST Presidential Best Ph.D. Thesis Award (2025) Qualcomm Innovation Fellowship (2023) DesignCon Best Paper Awards (2021–2022) Kim's collaborations span KAIST's Industrial Engineering department and Mila's AI research groups. He actively contributes to academic peer review for top conferences (NeurIPS, ICML, ICLR) and journals (IEEE TNNLS, TPAMI), emphasizing the intersection of AI safety , uncertainty quantification , and systemic reasoning .

• Artificial Intelligence
• Deep Learning
• Combinatorial Optimization
• +۷ مورد دیگر

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

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

Magnus Bakke Botnan is an Assistant Professor at the Department of Mathematics, Vrije Universiteit Amsterdam, holding a VIDI career grant (€850,000) since 2018. His research bridges pure and applied mathematics within topological data analysis (TDA), focusing on multiparameter persistence, computational topology, and applications to sciences. PhD in Mathematics, Norwegian University of Science and Technology (NTNU), 2015 Postdoc at TU Munich, 2016-2018 His research group includes postdocs Hannah Rocio Santa Cruz Baur and Rui Dong, and PhD student Enes Devecioğlu. Recent work involves signed barcodes, rank decompositions, and stability of persistence modules. He co-authored the first comprehensive tutorial on multiparameter persistence with Mike Lesnick. Notable contributions include proving the NP-hardness of computing interleaving distance, establishing universality of bottleneck distance for extended persistence diagrams, and developing computational methods for non-branching complexes. Publications span journals like Foundations of Computational Mathematics , Discrete & Computational Geometry , and conferences SoCG, NeurIPS, and ICRA. Scientific Awards: VIDI Career Grant (€850,000) He has taught courses including Complex Analysis, Calculus, Topological Data Analysis, and seminars on analysis and dynamical systems. Actively organizes Applied Topology Days and collaborates on projects integrating TDA with physics, computer science, and statistics.

• Topological Data Analysis
• Representation Theory of Quivers
• Computational Topology
• +۳ مورد دیگر