Find Academic Supervisors

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
• +5 more

Dr Nursen Aydin is an Associate Professor of Operational Research at Warwick Business School (WBS), affiliated with the ISM-Analytics (ISMA) Group. She holds a PhD in Industrial Engineering from Sabanci University, Turkey, with a prior visit to Cornell University for airline revenue management research. Her career includes roles as a Marie Curie Research Fellow at Brunel Business School and as an assistant revenue management analyst at Pegasus Airlines. Research Interests: Revenue Management and Pricing Stochastic Dynamic Programming Sustainable Transport Planning Large-Scale Applications Awards and Fellowships: Turing Fellow, Alan Turing Institute (2021–2023) Marie Curie Research Fellowship, Brunel Business School (2015–2016) Teaching: She teaches Business Analytics (IB1220) across multiple BSc programs and Analytics in Practice (IB9BW0) at the MSc level. Research Group: Active member of the ISM-Analytics (ISMA) Group, focusing on advanced analytics and operational research methodologies.

• Revenue Management and Pricing
• Stochastic Dynamic Programming
• Sustainable Transport Planning
• +1 more

Kai Arras is a Professor at the Institute for Artificial Intelligence (KI) at the University of Stuttgart and heads the Socially Intelligent Robotics (SIR) Lab. His research lies at the intersection of robotics, machine learning, and human-robot interaction (HRI), with a focus on open-world embodied intelligence, sustainably engaging interactive robots, and AI-based industrial robotics. He is also a Cyber Valley Endowed Chair for Autonomous Systems and leads collaborations with institutions like the Fraunhofer Society and the University of Bonn.

• Robotics
• Machine Learning
• Human-Robot Interaction
• +6 more

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.

• Discrete Optimization
• Approximation Algorithms
• Combinatorial Optimization
• +4 more

Guido Perboli is a Full Professor in the Department of Management and Production Engineering (DIGEP) at the Polytechnic University of Turin, where he also serves as Logistics Coordinator and Project Coordinator for activities supporting relationships with government bodies. He is a member of the Interdepartmental Center CARS@PoliTO (Center for Automotive Research and Sustainable Mobility) and serves as Director of the ICT for City Logistics and Enterprises (ICElab@Polito) research center, which he founded in 2016. His research interests span a broad range of topics including Operations Research, Logistics, Last-mile Delivery, Sustainable Logistics, Combinatorial Optimization, Stochastic Programming, Business Development, and Lean Business methodologies. His work particularly focuses on City Logistics, Green Logistics, and the application of emerging technologies like Blockchain and AI in supply chain management. He has developed GUEST, a Lean Business methodology for innovation processes from early idea definition to implementation. Professor Perboli's recent publications demonstrate a strong focus on urban logistics, last-mile delivery optimization, blockchain applications in supply chains, and the integration of AI techniques in transportation systems. His work shows an increasing trend toward interdisciplinary research that combines optimization methods with emerging technologies to address sustainable urban mobility challenges. Professional Recognition: CASE Best Paper award from IEEE Conference on Automation Science and Engineering (2011) Effective member of INFORMS (2019-present) Effective member of EURO (1995-present) Effective member of AIRO (1995-present) Associate Editor for Journal of Applied Research and Technology (2020-present) Associate Editor for Sustainability (2018-present) Professor Perboli actively advises PhD students and has supervised numerous research projects, including EU-funded initiatives like SINFONICA, HESTER, and 5G-LOGINNOV. He serves as Scientific Director for multiple commercial research projects focused on blockchain, IoT, and AI applications in logistics. Beyond academia, he is Chief Scientific Officer of Arisk S.p.A., a fintech company specializing in business crisis prediction using AI and machine learning. His research group, ICElab@Polito, focuses on two main areas supporting urban growth: logistics and enterprises. The center collaborates with numerous companies including Amazon, DHL, and FCA, addressing real-world challenges in urban logistics and supply chain management through innovative research approaches.

• Operations Research
• Logistics
• Last-mile Delivery
• +9 more

Stefan Hougardy is a Professor at the Research Institute for Discrete Mathematics, part of the Mathematisch-Naturwissenschaftliche Fakultät at the University of Bonn. He is actively engaged in research and teaching, with a focus on discrete mathematics and combinatorial optimization. He contributes to academic governance through roles in examination boards, teaching mentoring, and faculty committees. Stefan Hougardy's research lies at the intersection of theoretical computer science and practical optimization. His primary interests include approximation algorithms, the Traveling Salesman Problem (TSP), Steiner trees, graph theory, and VLSI design automation. He develops efficient algorithms for NP-hard problems and analyzes their theoretical performance guarantees. His work often bridges theory and application, particularly in electronic design automation and mathematical programming. His recent publications demonstrate a strong focus on the complexity and approximation of combinatorial optimization problems. Key themes include the analysis of local search heuristics like k-opt for TSP, edge elimination techniques, fast matching algorithms, and optimal legalization in chip design. His work combines rigorous theoretical analysis with practical implementation and computational experiments. MPC 'Outstanding Paper of the Year' Award 2024 Stefan Hougardy supervises graduate students and leads seminars on discrete mathematics and optimization. He is involved in the Bonn International Graduate School of Mathematics and the Hausdorff Center for Mathematics, contributing to doctoral education and mentoring. While specific grant details are not listed, his sustained research output and leadership roles suggest active funding support. He also contributes to curriculum development and academic quality assurance through various institutional committees. He is affiliated with the Research Institute for Discrete Mathematics at the University of Bonn, a leading center for combinatorial optimization and algorithmic research. The institute is closely linked with the Hausdorff Center for Mathematics, fostering collaboration in discrete and applied mathematics.

• Discrete Mathematics
• Combinatorial Optimization
• Approximation Algorithms
• +6 more

Samir Elhedhli is a Professor in the Department of Management Sciences at the University of Waterloo, within the Faculty of Engineering. His research focuses on Large-scale Optimization, Logistics, Supply Chain Design, Healthcare Operations, Airline Scheduling, and Data Analytics. He has held grants from NSERC, CFI, OCE, and MITACS, collaborating with industries in aircraft manufacturing, airline scheduling, and warehouse management. Education: PhD in Management Science, McGill University (2001) Master's in Industrial Engineering, Bilkent University (1996) Bachelor's in Industrial Engineering, Bilkent University (1994) Research Interests: Data Analytics & Data Science Large-scale Optimization (Interior-point methods, decomposition, column generation) Supply-chain Analytics (Logistics, warehousing, routing, scheduling) Environmental Sustainability in Supply Chains Key Awards: CORS Service Award (2013) University of Waterloo Distinguished and Outstanding Performance Awards (2005–2019) Grants & Advising: Active grants from NSERC, CFI, OCE, and MITACS Currently accepting graduate student applications Administration & Service: Chair, Department of Management Sciences (2014–2018) President, Canadian Operational Research Society (2011–2012) Co-Editor-in-Chief, INFOR Journal (2014–present) Labs & Teams: Leads the WanOpt research group focused on optimization methodologies and applications.

• Large-scale Optimization
• Logistics
• Supply Chain Management
• +11 more

Fabio Furini is an Associate Professor at the Department of Computer Science, Automatics, and Management (DIAG) at Sapienza University of Rome since September 2021. Prior to this position, he served as a CNR researcher at IASI-CNR in Rome (2020-2021), Maître de Conférences at Université Paris-Dauphine, France (2013-2019), postdoctoral researcher at Université Paris-13, France (2012-2013), and research fellow at the University of Bologna (2011-2012). His educational background includes a Ph.D. in Control Engineering and Operations Research from the University of Bologna in 2011. He further obtained the Habilitation à Diriger des Recherches (HDR) in France in 2017 and the National Scientific Qualification for Full Professor in Operations Research in Italy in 2019. Fabio Furini conducts theoretical and methodological research on Combinatorial Optimization and Operations Research. His primary focus is on developing exact algorithms based on decomposition and reformulation techniques for integer linear programming problems. His research spans various applications including network optimization, graph theory, and combinatorial problems such as the maximum clique problem, bin packing problem, and vertex separator problem. His work often bridges theoretical developments with practical applications in transportation, logistics, and network security. His recent publications demonstrate a strong focus on exact algorithms for combinatorial optimization problems, particularly in network interdiction, bin packing with temporal constraints, and graph-based problems. His work consistently combines integer programming techniques with combinatorial search methods to develop novel formulations and efficient solution approaches that advance the state-of-the-art in these domains. Among his notable scientific awards are the Prime d'encadrement doctoral et de recherche (PEDR), which he received annually from 2014 to 2020, recognizing him among the top 15% of researchers in the French university system. He also holds the prestigious Habilitation à Diriger des Recherches from France (2017) and the National Scientific Qualification for Full Professor in Operations Research from Italy (2019). Fabio Furini has been actively involved in supervising PhD students and has served as principal investigator for numerous national and international research projects. His extensive network includes over 60 co-authors across European and American universities. He is also a member of the editorial boards for three prestigious international journals: Omega, Annals of Operations Research, and Discrete Applied Mathematics. His research activities include collaborations with various institutions across Europe and the United States, including Imperial College London and the University of Colorado. These collaborations have resulted in a robust research program focused on advancing the theoretical foundations and practical applications of combinatorial optimization.

• Combinatorial Optimization
• Operations Research
• Integer Linear Programming
• +3 more

Remco M. Dijkman serves as Full Professor in Information Systems at Eindhoven University of Technology (TU/e), chairing the Information Systems group within the Industrial Engineering and Innovation Sciences school. He additionally holds a Full Professor position at EAISI High Tech Systems and acts as research director for high-tech supply chains at the European Supply Chain Forum—a network of over 50 multinational companies. His research centers on Business Process Management with emphasis on data-driven optimization of business processes. His academic background includes both PhD and Master's degrees in Computer Science from the University of Twente. Publications span Information Systems, Computers in Industry, and Transactions on Software Engineering and Methodology, with over 100 papers and service on the editorial board of Information Systems. He has held visiting positions at New York University, Hasso Plattner Institute, IBM Zurich Research Lab, Humboldt-University Berlin, and Queensland University of Technology. Dijkman's research interests focus on detecting, diagnosing, and predicting optimal execution scenarios in business processes, developing mathematical models for quantitative process analysis , and resource assignment optimization . These are primarily applied in transportation logistics and high-tech supply chains, where he investigates data-driven predictions for transport order assignment and supply chain planning. His work bridges artificial intelligence with practical business applications. Recent publications (2024-2025) reveal concentrated efforts in deep reinforcement learning for resource allocation, process pattern discovery, and software library development (GymPN, SimPN). Key trends include predictive process monitoring for healthcare applications, event data enrichment frameworks, and uncertainty handling in logistics planning—demonstrating strong interdisciplinary integration. Scientific recognition includes: Best Demo Award (2019) Best Reviewer Award (2016) Test of Time Award (2019) He has supervised 150 students, including Lotte Vugs who received the Dow Chemical Best OML Master Thesis Award in 2020. Grant leadership spans eight projects: NXTGEN Smart Industry (2023-2030), CollChain (2023-2029), CERTIF-AI (2020-2025), FENIX (2019-2023), and DynaPlex (2021-2024), focusing on digital twins, federated networks, and AI-driven supply chain solutions. Dijkman directs the Information Systems group at TU/e and leads the European Supply Chain Forum's high-tech supply chain research. His work integrates with semiconductor manufacturing and transportation logistics through collaborations with industry partners, while his 2023 invited talks at Technical University of Munich and Humboldt University Berlin highlight his international engagement.

• Business Process Management
• Data-Driven Process Optimization
• Supply Chain Management
• +3 more

Sonia Vanier is a Professor in the Department of Computer Science at École Polytechnique, where she holds multiple leadership positions: Head of the 'Trusted and Responsible AI' Chair (X/Crédit Agricole), Head of the 'Optimization and AI for Mobility' Chair (X/SNCF), Head of 3A, and Scientific Manager of Industrial Relations for both the Department and the Computer Science Laboratory (LIX). She coordinates the GdT OR (Network Optimization) working group and leads the REST (Energy, Services and Transport Networks) research axis of the CNRS GDROD, while serving on its scientific council. Her research develops decision support tools for complex industrial problems through hybrid approaches combining Artificial Intelligence and Operations Research , with focus areas including Network Optimization, ethical AI systems, sustainable computing, and trustworthy AI frameworks. Her work bridges theoretical foundations with applications in telecommunications, transportation, and cybersecurity. Publications demonstrate strong emphasis on optimization techniques (branch-and-price, cutting planes) applied to wireless networks, AI safety, and security challenges. Recent works explore LLM memorization, signomial programming, and multi-commodity flow problems, showing consistent integration of OR with machine learning for industrial-scale problems. Awards: Research Award and Innovation Award, Telecom Valley Association ALOES Orange Innovation Project She leads major industrial-academic partnerships through the Crédit Agricole and SNCF chairs, managing research grants focused on responsible AI deployment and mobility optimization. As Scientific Manager of Industrial Relations, she oversees industry collaborations for LIX laboratory. Affiliated with the Computer Science Laboratory (LIX), she directs the 3A research group and contributes to national initiatives through CNRS GDROD, coordinating research in network optimization and sustainable systems.

• Artificial Intelligence
• Operations Research
• Network Optimization
• +4 more

Shahin Kamali is an Associate Professor in the Department of Electrical Engineering & Computer Science at York University's Lassonde School of Engineering. Previously, he served as an Assistant Professor at York University (2022-2024) and the University of Manitoba (2017-2022), where he continues to hold an Adjunct Professor position. He completed his Ph.D. in Computer Science at the University of Waterloo in 2014 and was a postdoctoral fellow at MIT's CSAIL lab from 2015-2017. Dr. Kamali received his B.Sc. from the University of Tehran and his M.Sc. from Concordia University, both in Computer Science. He has earned teaching certifications including the Kaufman Teaching Certificate Program from MIT and the Certificate in University Teaching from the University of Waterloo. His research focuses on algorithms' design, analysis, and limitations, with particular emphasis on online problems such as bin packing, paging, list update, and k-Server. His work extends to big-data applications of algorithms in data compression, graph partitioning, resource allocation in the cloud, and algorithmic aspects of blockchain technology. His recent publications (2023-2025) demonstrate a strong focus on learning-augmented algorithms, online computation with predictions, and novel applications in blockchain and graph theory. His research has been supported by multiple NSERC grants since 2010, with recent projects investigating models, applications, and limitations of online algorithms. He has successfully supervised numerous graduate students and serves on various committees related to algorithms conferences and academic governance. University of Waterloo Doctoral Thesis Completion Award (2014) University of Waterloo Mathematics Graduate Experience Award (2008) Dr. Kamali teaches advanced courses in algorithms and data structures and is scheduled to teach Design and Analysis of Algorithms (EECS 3101) in Fall 2025 and Advanced Data Structures (EECS 4101/5101) in Winter 2026. He is actively involved in organizing major conferences, including CCCG and WADS 2025 at York University.

• Algorithms Design
• Algorithms Analysis
• Online Algorithms
• +9 more

Betül Boz is an Assistant Professor at the Department of Computer Hardware, Faculty of Engineering, Marmara University. She holds a B.Sc. and M.Sc. in Computer Engineering from Marmara University, and a Ph.D. in Computer Engineering from Boğaziçi University. Her research focuses on computer architecture, optimization, and evolutionary computing. B.Sc., M.Sc., and Ph.D. in Computer Engineering Her research interests include computer architecture, parallel algorithms, optimization techniques, and evolutionary algorithms applied to graph coloring and scheduling. Recent work explores cloud computing scheduling, register allocation, and bioinformatics applications like circRNA-disease prediction. She has published extensively in these areas, utilizing evolutionary computing and machine learning. Key trends in her publications include evolutionary algorithms for graph coloring (2015–2025), register allocation (2004–2024), and cloud computing optimization (2023). She also investigates biomedical applications such as circRNA-disease association prediction. She has advised one thesis, managed one project, and her work aligns with UN Sustainable Development Goals. Her research outputs include 14 WoS-indexed publications, 11 WoS citations, and an h-index of 25 on WoS.

• Computer Architecture
• Parallel Algorithms
• Optimization
• +4 more

Riccardo Lancellotti is an Associate Professor at the Department of Engineering 'Enzo Ferrari' of the University of Modena and Reggio Emilia. His research focuses on Edge/Fog/Cloud Computing, Cyber Security, and Resource Management in distributed systems. He has extensive contributions in optimizing infrastructure performance, load balancing, and energy efficiency in cloud and fog environments. His work often combines theoretical models with practical simulations, addressing challenges like stale information in edge systems and heterogeneous resource allocation in smart cities. Key research areas include: Fog/Edge computing infrastructure design and optimization Cloud resource provisioning and SLA compliance Security for Industry 4.0 and automotive systems Genetic algorithms for service placement Scalable VM clustering and resource allocation Publications highlight trends in cloud/fog integration, robust game theory for microservices, and distributed load balancing under dynamic conditions. His work emphasizes practical applications, such as pharmaceutical distribution routing and smart city sensor management. No awards are explicitly listed, but his extensive publication record reflects recognition in the field.

• Edge Computing
• Fog Computing
• Cloud Computing
• +7 more

Davi De Castro Silva is a Researcher at the University of Cambridge, affiliated with the Department of Computer Science and Technology and the Centre for Quantum Information and Foundations. His current work is advised by Tom Gur and Sergii Strelchuk. Previously, he was a postdoc at CWI (Amsterdam) in QuSoft, advised by Jop Briët, and completed his PhD in Applied Mathematics at the University of Cologne under Frank Vallentin and Fernando de Oliveira Filho. He holds a Master's from IMPA (Brazil) under Roberto Imbuzeiro Oliveira and a BSc/MSc from École Polytechnique (France). His research focuses on theoretical computer science, quantum computing, and combinatorics, with recent emphasis on quantum speedups' structural foundations, such as symmetry's role. Key areas include additive combinatorics (e.g., higher-order Fourier analysis), computational complexity (lower bounds), combinatorial optimization (semidefinite programming), and quantum information theory. Notable contributions include studies on quasirandomness in additive groups, quantum algorithms' limitations, and tensor analysis. His work bridges combinatorial methods with quantum computing, exploring algorithmic efficiency and structural properties. He has published in journals like Discrete Analysis , Combinatorica , and Forum of Mathematics, Sigma , with preprints addressing quantum computation symmetry, Goldreich-Levin algorithms, and hypergraph quasirandomness. His research highlights interdisciplinary approaches to foundational questions in computing and mathematics.

• Theoretical Computer Science
• Quantum Computing
• Combinatorics
• +5 more

Matthias Mnich is a Professor and Head of the Institute for Algorithms and Complexity at Hamburg University of Technology (TUHH), within the School of Electrical Engineering, Computer Science and Mathematics. He also serves as Deputy Dean International, reflecting his leadership in academic administration and international collaboration. He is a principal investigator at the Helmholtz Graduate School for the Structure of Matter, further emphasizing his interdisciplinary impact. His research lies at the intersection of theoretical computer science and practical algorithm design, focusing on parameterized algorithms , approximation algorithms , combinatorial optimization , scheduling , and algorithmic game theory . His work often bridges theoretical guarantees with real-world applications in energy systems, quantum computing, and logistics. The recent publications (2023–2025) highlight his sustained excellence in top-tier venues such as FOCS, ICALP, ESA, STACS, and journals like Mathematical Programming and ACM Transactions on Algorithms . These works explore foundational problems in vector bin packing , integer programming , graph algorithms , and kernelization , while also applying algorithmic techniques to microgrid energy optimization and quantum algorithm engineering . He is deeply embedded in the theoretical computer science community, having served on program committees of major conferences including: STACS 2023 ESA 2024 FOCS 2023 ICALP 2024 IJCAI 2019–2025 AAAI 2018 SWAT 2018 He has successfully supervised several PhD students to completion, including Matthias Kaul , Roland Vincze , and Alexander Göke , many of whom have taken postdoctoral positions at institutions like the University of Bonn and University of Augsburg. His current research projects include PATTERN (2025–2031) , Hamburg Quantum Computing (2024–2029) , and Kernelization for Big Data , indicating long-term funding and strategic research directions. He leads the Institute for Algorithms and Complexity (E-11) , fostering a research environment focused on high-impact algorithmic research.

• Algorithms and Complexity
• Parameterized Algorithms
• Approximation Algorithms
• +7 more