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

David B. Shmoysمشاهده پروفایل

استاد

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

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

Alexandre Jacquillatمشاهده پروفایل

دانشیار

• Data-driven decision-making
• Stochastic optimization
• Integer optimization
• +۶ مورد دیگر

Alexandre Jacquillat is the Maurice F. Strong Career Development Associate Professor and Associate Professor of Operations Research and Statistics at MIT Sloan School of Management. His research focuses on data-driven decision-making with applications in air traffic management, urban mobility, and decarbonization. He holds a PhD in Engineering and MS degrees from MIT and École Polytechnique. Education PhD in Engineering, MIT MS in Technology and Policy, MIT MS in Applied Mathematics, École Polytechnique Research Interests His work develops scalable optimization models for efficient, equitable, and sustainable operations. Key areas include stochastic optimization, large-scale systems design, and machine learning applications in transportation and public policy. Recent projects explore vertiport planning for urban aerial mobility and prescriptive analytics for pandemic response. Awards Harold W. Kuhn Award (2024) INFORMS Harvey Greenberg Research Award (2023) MIT Jamieson Prize for Excellence in Teaching (2023) Multiple INFORMS Best Paper Awards (2015-2023) Named Leading Academic Data Leader by Chief Data Officer Magazine (2021-2022) Teaching & Grants Teaches courses in optimization (15.093, 15.083) and analytics (15.072). His grants support work in robotic warehousing, air traffic scheduling, and disaster response logistics. Advises on transportation analytics for industry and government. Labs/Teams Leads MIT Sloan's operations research group, collaborating with industry partners like McKinsey & Co. and Booz Allen Hamilton on transportation analytics and optimization projects.

Allan Larsenمشاهده پروفایل

استاد

• Operations Research
• Supply Chain Management
• Logistics
• +۴ مورد دیگر

Allan Larsen is a Professor and Deputy Head of Division at the Department of Technology, Management and Economics (DTU Management) at the Technical University of Denmark. He heads the Operations and Supply Chain Management Section. His academic background includes an MSc in Applied Mathematics and a PhD in Operations Research, both from DTU. He teaches courses in Operations Management and Simulation at both undergraduate and graduate levels. Research Focus: His work applies operations research methodologies to complex planning problems in supply chain management, logistics, healthcare operations, and public transport. Key areas include urban freight transport, healthcare supply chains, and optimization of public transport resources like crew and fleets. Collaborations with industries, especially in freight transport, have been extensive. He previously co-directed the Transport DTU research center and co-chaired Denmark’s Transport Innovation Network. Education: MSc in Applied Mathematics (1989–1995), PhD in Operations Research (1997–1999), both from DTU. Recognition: Recipient of the Hedorf’s transportpris award in 2022 for contributions to transport research. Research Projects: Supervises multiple PhD students (e.g., on electric freight transport, healthcare resource optimization, and Industry 4.0 applications). Active in projects like 'Pioneering Electric Heavy-Duty Freight Transport' and 'Resource optimization in healthcare.' Labs/Teams: Leads the Operations and Supply Chain Management research group and collaborates in initiatives like the Transport Innovation Network, focusing on sustainable transport solutions.

Amit Kumarمشاهده پروفایل

استاد

• Combinatorial Optimization
• Online Algorithms
• Clustering Algorithms
• +۵ مورد دیگر

Amit Kumar is the Jaswinder and Tarwinder Chadha Chair Professor in the Department of Computer Science and Engineering at IIT Delhi. His research focuses on combinatorial optimization, online algorithms, and algorithmic fairness. He has taught courses such as Approximation Algorithms (COL 754), Design and Analysis of Algorithms (COL 351), and Numerical Analysis (COL 726). His work spans theoretical computer science with applications to clustering, scheduling, and fairness in evaluation processes. Research Interests Kumar's research emphasizes developing efficient algorithms for online and dynamic settings, particularly in constrained optimization and biased evaluation systems. He explores theoretical foundations of clustering, load balancing, and resource allocation, with recent contributions to fair food delivery systems and coreset constructions. Publications His recent work includes advancements in online convex paging (STOC 2025), consensus clustering (SODA 2025), and fairness-aware algorithms (AAAI 2024). Over 70 papers across top venues like STOC, SODA, and ICML reflect his expertise in algorithm design and analysis. Awards Best Paper Award at ISAAC 2023 for 'Clustering What Matters in Constrained Settings' Teaching & Mentorship Kumar instructs graduate and undergraduate courses in algorithms, data structures, and numerical methods. He advises students through these courses and collaborates with researchers on NSF-funded projects related to approximation algorithms and streaming systems.

Chaitanya Swamyمشاهده پروفایل

استاد

• Combinatorial Optimization
• Approximation Algorithms
• Algorithmic Game Theory
• +۴ مورد دیگر

Chaitanya Swamy is a Professor and University Research Chair in the Department of Combinatorics & Optimization at the University of Waterloo, Canada. His primary affiliation is within the Faculty of Mathematics, and he holds positions in both the Department of Combinatorics & Optimization and the School of Computer Science. He obtained his Ph.D. in Computer Science from Cornell University under the supervision of David Shmoys, followed by postdoctoral research at Caltech's Center for the Mathematics of Information. Swamy’s research focuses on algorithms, particularly in combinatorial optimization, approximation algorithms, algorithmic game theory, stochastic optimization, network design, scheduling, and online algorithms. His work spans theoretical contributions and practical applications, including algorithm design for facility location, network routing, and mechanism design. He has contributed to foundational results in approximation algorithms, such as the development of primal-dual methods and LP-rounding techniques. Swamy has held significant editorial roles, including as an associate editor for Discrete Optimization and SIAM Journal on Computing . He has organized major conferences like CanaDAM 2021 and sessions at ISMP 2018. His teaching record includes courses on combinatorial optimization, scheduling, and algorithmic game theory. He has advised numerous Ph.D. and Master’s students, many of whom have gone on to prestigious academic and industry positions. Swamy’s research has been recognized through awards for his students, including the University of Waterloo Alumni Gold Medal. He actively contributes to the academic community through committee work for conferences like STOC, APPROX, and SODA, and his publications reflect a deep engagement with both theoretical and applied aspects of algorithms and optimization.

Manish Vermaمشاهده پروفایل

استاد

• Multimodal transportation
• Dangerous goods transportation
• Risk assessment
• +۵ مورد دیگر

Manish Verma is Professor of Operations Management and Associate Dean, Graduate Studies at the DeGroote School of Business, McMaster University. His academic journey began with an MBA and PhD in Business Administration with Operations Management/Management Science specialization from Desautels Faculty of Management at McGill University. Dr. Verma's research focuses on multimodal transportation of dangerous goods, risk assessment, network design and planning in transportation, humanitarian logistics, green supply chain management, and disruption/resilience in transportation systems. His current research engagements center on safety and security issues in freight transportation and humanitarian logistics, funded by NSERC and SSHRC grants. He has been frequently approached by media to comment on railroad accidents involving dangerous goods. An analysis of his recent publications reveals a strong emphasis on hazardous materials transportation risk management, with significant contributions to rail-truck intermodal systems, hazmat risk modeling using value-at-risk methodologies, and emergency response planning for transportation networks. His work bridges theoretical operations research with practical transportation safety applications. $245K research grant for rail safety research from Government of Canada As an educator, Dr. Verma has taught courses including Predictive Analytics for Managers, Network Design Issues in Freight Transportation, and Management Science Research Issues. His scholarly impact is evidenced by publications in leading journals such as Transportation Research Part E, European Journal of Operational Research, and Safety Science. He actively contributes to real-world transportation safety through media commentary and research that informs policy decisions regarding dangerous goods transportation.

J. Cole Smithمشاهده پروفایل

استاد

• Integer programming
• Combinatorial optimization
• Network flows
• +۹ مورد دیگر

J. Cole Smith is the Dean of the College of Engineering and Computer Science at Syracuse University and holds the academic rank of Professor. He joined Syracuse in 2019 with a focus on advancing undergraduate and graduate education, research initiatives, and diversity, equity, and inclusion efforts. Previously, he earned a PhD in Industrial and Systems Engineering from Virginia Tech (2000) and a BS in Mathematical Sciences from Clemson University (1996). His research focuses on mathematical optimization, particularly mixed-integer programming and combinatorial optimization, with applications in network interdiction, logistics, national security, healthcare, and sports. His work has been supported by agencies such as the National Science Foundation, Office of Naval Research, and Defense Advanced Research Projects Agency. Recent research trends emphasize network interdiction under uncertainty, bilevel optimization, and large-scale optimization challenges. His publications in top journals like Operations Research and Mathematical Programming reflect these themes. Awards include INFORMS Fellow (2023) and recognition from Virginia Tech's Grado Department of Industrial and Systems Engineering. While his dean duties reduce direct research involvement, he remains active through collaboration with PhD students. His team's work addresses real-world problems in security, logistics, and healthcare, leveraging advanced algorithmic techniques.

• Algorithms on Discrete Structures
• Parameterized Algorithms
• Structural Graph Theory
• +۴ مورد دیگر

Michał Pilipczuk is an Associate Professor at the Institute of Informatics, Faculty of Mathematics, Informatics and Mechanics of the University of Warsaw. His research focuses on theoretical computer science, particularly algorithms on discrete structures, parameterized algorithms, structural graph theory, and logic in computer science. He leads the ERC-funded project "BOBR: Decomposition Method for Discrete Problems" and previously led a grant on optimality in parameterized complexity funded by the Polish National Science Center. His research interests include parameterized algorithms , structural graph theory , graph algorithms , and computational complexity . He has made significant contributions to the understanding of problems such as Independent Set in restricted graph classes, graph editing problems, and structural decompositions. The recent publications highlight a strong focus on structural graph theory and exact algorithms . Key themes include quasi-polynomial time algorithms for Independent Set in claw-free graphs, diameter computation in bounded genus graphs, and kernelization in trivially perfect graphs. His work often bridges combinatorial insights with algorithmic applications, particularly in the context of parameterized complexity. Principal Investigator, ERC Grant BOBR: Decomposition Method for Discrete Problems (2021–2026) Principal Investigator, Polish National Science Center Grant on Optimality in Parameterized Complexity (2014–2017) He has advised or collaborated with several researchers, including Marcin Wrochna and Marcin Pilipczuk. His work is published in top venues such as STOC, SODA, ESA, and ICALP.

Euiwoong Leeمشاهده پروفایل

استادیار

• Approximation Algorithms
• Hardness of Approximation
• Discrete Optimization
• +۳ مورد دیگر

Euiwoong Lee is an Assistant Professor in the Computer Science and Engineering Division at the University of Michigan. He holds a PhD from Carnegie Mellon University, advised by Venkatesan Guruswami, and has held postdoctoral positions at New York University and the Simons Institute for the Theory of Computing. His research focuses on approximation algorithms, hardness of approximation, and parameterized complexity. **Education:** PhD in Computer Science, Carnegie Mellon University (2017), advised by Venkatesan Guruswami Postdoctoral Fellowships: NYU (2017–2020), Simons Institute (2017–2020) **Research Interests:** Approximation Algorithms & Hardness of Approximation Convex Hierarchies (e.g., Sum-of-Squares) Clustering Algorithms (e.g., Correlation Clustering) Parameterized Complexity Facility Location & Metric Optimization **Awards:** Edmund M. Clarke Doctoral Dissertation Award (2017) Simons Award for Graduate Students in Theoretical Computer Science **Advising & Grants:** PhD Students: Anthony Della Pella, Aditya Anand, Amatya Sharma, Ian DeHaan Co-organizes the Michigan Theory Seminar **Labs/Teams:** Collaborates with researchers in approximation algorithms, optimization, and theoretical computer science at the University of Michigan and beyond.

Andre Bergerمشاهده پروفایل

دانشیار

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

Andre Berger is an Associate Professor of Operations Research at Maastricht University, affiliated with the QE Operations Research department within the School of Business and Economics. He holds a PhD in Mathematics from Emory University (2006) and completed a postdoc at Technical University Berlin. His research focuses on optimization algorithms, combinatorial optimization, and their applications in scheduling, network design, and operations research. Notable contributions include work on the many-visits Traveling Salesman Problem and cluster editing algorithms. Berger’s recent publications span scheduling theory, MRI-based clinical research collaborations, and theoretical advancements in facility location models. He is based at Tongersestraat 53, Maastricht, and can be reached via a.berger@maastrichtuniversity.nl. Education: MSc in Mathematics, Emory University (2003) PhD in Mathematics, Emory University (2006) Research Interests: Berger’s work bridges theoretical computer science and practical applications in operations research, emphasizing algorithm design for complex optimization problems. Key areas include scheduling algorithms, network flow optimization, and geometric optimization challenges such as the Apollonius problem in facility location. His interdisciplinary approach integrates mathematical programming with real-world scenarios in telecommunications and healthcare.

Vipul Jainمشاهده پروفایل

دانشیار

• Supply Chain Management
• Sustainability and Circular Economy
• Innovation and ICT
• +۵ مورد دیگر

About Vipul Jain: Associate Professor Vipul Jain leads Supply Chain and Logistics Management at RMIT University’s School of Accounting, Information and Supply Chain Management. With over 20 years of academic experience, he has held senior roles at institutions like Victoria University of Wellington (NZ) and IIT Delhi (India), contributing to curriculum development, research strategy, and academic-industry collaboration. His international collaborations span over 20 global institutions, emphasizing interdisciplinary research in supply chain resilience, sustainability, and Industry 4.0. Education & Academic Leadership: Previously served as Programme Director for Master of Technology (Industrial Engineering) at IIT Delhi, leading the establishment of the Modelling and Analysis of Supply Chain (MASC) Lab. Holds editorial roles for journals like International Journal of Intelligent Enterprise and Computers & Industrial Engineering . Research Focus: Specializes in supply chain design, sustainability, circular economy, and business analytics. His work integrates ICT and big data to address complex supply chain challenges, with notable contributions to vaccine distribution, blockchain adoption, and post-pandemic resilience. Over 145 peer-reviewed publications, including high-impact journals like OMEGA and International Journal of Production Economics , reflect his prolific output. Industry Impact: Conducted management training for organizations like JCB and IBM. Served as an expert assessor for New Zealand’s Ministry of Business and Industry and advised the Indian Railways. His research has been funded by the Department of Science and Technology (India) and EU initiatives like FP6 I*PROMS. Awards & Recognition: Ranked #7 in India’s top logistics academics (2018), recipient of Literati Awards (2024, 2020), and multiple editorial leadership roles. Active in global conferences, including co-chairing ANZAM 2023. Labs & Collaborations: Founded MASC Lab at IIT Delhi. Collaborates with Coventry University, Monash University, Hong Kong Polytechnic, and institutions in Switzerland, Spain, Canada, and the U.S. Focus areas include sustainable supply chains, digital transformation, and crisis resilience.

Yanchao Liuمشاهده پروفایل

دانشیار

• Industrial Engineering
• Operations Research
• Transportation Systems Optimization
• +۴ مورد دیگر

Dr. Yanchao Liu is an Associate Professor at Wayne State University's College of Engineering, Department of Industrial and Systems Engineering. He has received research funding from the National Science Foundation and the State of Michigan, including the NSF Career Award. His academic career spans prior industry roles as a Data Scientist and Manager of Advanced Analytics at Sears Holdings Corporation (2016-2017) and Director of Brand Marketing Analytics at Catalina Marketing Corporation (2017). He teaches courses in data science, IoT, and stochastic processes. B.S. Industrial Engineering, Huazhong University of Science and Technology (2006) M.S. Industrial Engineering, University of Arkansas (2008) Ph.D. Industrial and Systems Engineering, University of Wisconsin-Madison (2014) Dr. Liu's research focuses on mathematical modeling for transportation systems, industrial AI, and data analytics. His work addresses drone traffic management, battery-constrained delivery routing, and optimization algorithms for urban mobility. He has developed novel methods for UAV safety diagnostics, random forest implementations, and fairness-aware path planning in urban air mobility. His publications span journals like Journal of Guidance, Control and Dynamics , Transportation Research Part C , and IEEE Transactions on Intelligent Transportation Systems , with conference contributions at IISE and FAIM. His research combines theoretical advancements with practical applications in smart cities and logistics. NSF Career Award (2020) Faculty Research Excellence Award (2021) IEEE PES Best Conference Paper (2015) IEEE Transactions on Smart Grid Best Reviewer (2015) Hubei Province Distinguished Bachelor’s Thesis Award (2006) Dr. Liu advises PhD students like Zhenyu Zhou and J. Chen. He has contributed to energy market modeling (with M.C. Ferris) and published extensively on drone operations, machine learning algorithms, and stochastic processes. His work includes U.S. patent pending applications for UAV safety systems.

Mohit Singhمشاهده پروفایل

استاد

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

Mohit Singh is the Coca-Cola Foundation Professor at the H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology. He previously held positions at Microsoft Research (2011-2016) and as an Assistant Professor at McGill University (2010-2012). PhD in Algorithms, Combinatorics, and Optimization (ACO) at Carnegie Mellon University His research focuses on discrete optimization , approximation algorithms , and convex optimization , with applications to combinatorial optimization, submodular functions, and network design. He has contributed to topics like Sticky Brownian Rounding, integrality gaps, and online adaptive algorithms. His recent work includes theoretical advancements in matroid constraints, dimensionality reduction, and submodular maximization. He has published extensively in top conferences such as FOCS, SODA, ICML, and NeurIPS. He has been recognized with the Coca-Cola Foundation Professorship and served as Director of the Algorithms and Randomness Center at Georgia Tech (2019-2023). He has also held editorial roles and organized key academic workshops like the Bellairs Workshop on Approximation Algorithms (2011). His teaching includes advanced courses on approximation algorithms, combinatorial optimization, and linear inequalities. He has collaborated with institutions such as Microsoft Research and McGill University.

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

Nicole Wein is an Assistant Professor in the Department of Electrical Engineering and Computer Science at the University of Michigan, where she is a member of the Theory of Computation Lab within the Computer Science and Engineering Division. Her research focuses on theoretical computer science, particularly graph algorithms and lower bounds across various domains including distance-estimation, dynamic, parameterized, distributed, and online algorithms. Education: PhD in Computer Science from MIT, advised by Virginia Vassilevska Williams Master's in Computer Science from Stanford University B.S. in Computer Science/Mathematics from Harvey Mudd College Nicole's research centers on theoretical aspects of graph algorithms and computational complexity. She investigates fundamental questions about how algorithms can efficiently handle changing data, extract information from graphs in linear time, and understand the structure of shortest paths, especially in directed graphs. Her work spans multiple algorithmic paradigms including dynamic algorithms that adapt to changing inputs, parameterized approaches for hard problems, and fine-grained complexity that establishes precise relationships between problem difficulty. Analysis of Nicole's recent publications reveals a strong focus on graph algorithms, particularly shortest path problems, spanners, and hardness results. Her work often bridges theoretical insights with practical implications, developing novel techniques for distance estimation, dynamic graph processing, and approximation algorithms. A significant portion of her research examines the structural properties of graphs that enable or constrain efficient computation, with applications across computer science. Nicole actively mentors students at various levels. She currently advises PhD student Jubayer Nirjhor and has worked with undergraduate researchers including Sam Hiken (now a pre-doc at MIT), Michael Wang, and Tony Zhang. Her teaching includes foundational courses like EECS 376: Foundations of Computer Science and specialized courses such as EECS 598: Graph Algorithms. Nicole contributes to the academic community through service as a program committee member for major conferences including SOSA 2025, FOCS 2025, SODA 2025, and others. She co-organized the June 2023 DIMACS workshop on Modern Techniques in Graph Algorithms and previously organized Algorithms Office Hours at MIT to improve communication between theory and applications of algorithms.

Ryan Preston-Roedderمشاهده پروفایل

استاد

• moral philosophy
• political philosophy
• moral psychology
• +۳ مورد دیگر

Ryan Preston-Roedder serves as a Professor of Philosophy at Occidental College, appointed in 2017. His academic credentials include a B.A. from Rice University and a Ph.D. from New York University (2007). His campus office is located in Swan Hall #204, and he was on academic leave during Fall 2024 semester. Education: B.A., Rice University Ph.D., New York University (2007) His research program centers on moral and political philosophy, moral psychology, and philosophy of religion, with significant contributions to Africana philosophy and philosophy-literature intersections. Current investigations explore meaning in life, the problem of the absurd, religious outlooks, and love's moral-political dimensions, reflecting a sustained engagement with existential and ethical questions at the individual and societal levels. Analysis of his 2013-2023 publications reveals a cohesive trajectory examining faith (both religious and civic), emotional responses to existential conditions, and utopian political thought. His work consistently bridges analytic philosophy with continental concerns, particularly in addressing how humans navigate meaning, trust, and vulnerability in complex social landscapes. Scientific Awards: 2014 APA Article Prize Honorable Mention No available information exists regarding graduate student advising, research grant funding, or sponsored projects. Similarly, there are no disclosed details about laboratory facilities, research teams, or collaborative institutional partnerships.