Find Academic Supervisors

Maya RamanathView profile

Associate Professor

• Database Systems
• Information Retrieval
• Semantic Web Data Management
• +3 more

Maya Ramanath is an Associate Professor in the Department of Computer Science and Engineering at Indian Institute of Technology (IIT) Delhi. She joined IIT Delhi in 2011 after a postdoctoral research stint at the Max-Planck Institute for Informatics in Germany. Her research interests focus on database systems, information retrieval, semantic web technologies, and knowledge graph construction and applications. Education: PhD in Computer Science, Indian Institute of Science, Bangalore M.Sc.(Engg.) in Computer Science, Indian Institute of Science, Bangalore B.E. in Computer Science and Engineering, Bangalore University, Bangalore Her recent work emphasizes efficient query processing over large-scale graphs, knowledge graph applications, and natural language interfaces for semantic data. Notable contributions include algorithms for reachability approximation in web-scale graphs, speculative query planning for knowledge graphs, and exploratory querying techniques. She has collaborated extensively on projects like NAGA, ESTHETE, and KlusTree, advancing the state of the art in graph-based data management and semantic search. Publications span conferences such as ICDE, ECIR, EDBT, and VLDB, reflecting a strong focus on database systems, graph algorithms, and semantic web applications. Her work bridges theoretical foundations with practical implementations, addressing scalability and efficiency challenges in modern data management systems. Research and advising activities include supervision of projects on distributed graph processing, query optimization, and knowledge representation. She has contributed to open-source tools like LegoDB and StatiX, and her lab focuses on interdisciplinary approaches to data-centric AI.

Fabian SuchanekView profile

Professor

• Artificial Intelligence
• Knowledge Bases
• Natural Language Processing
• +3 more

Fabian Suchanek is a full professor at Institut Polytechnique de Paris, specifically affiliated with Télécom Paris. He leads research in the Data, Intelligence, and Graphs (DIG) team within the Computer Science department. His academic career focuses on bridging artificial intelligence with structured knowledge representations. Suchanek's research interests span artificial intelligence, knowledge bases, and natural language processing, with particular emphasis on knowledge graph construction , rule mining , knowledge-based language models , and explainable AI . His work demonstrates how structured knowledge can enhance machine learning systems, particularly large language models, by providing factual grounding and interpretability. The research group he leads develops practical systems that address real-world knowledge management challenges. His recent publications showcase a strong trajectory in knowledge-intensive AI, with notable contributions to knowledge graph completion, rule mining techniques, and neural approaches to knowledge base validation. The research demonstrates increasing integration between symbolic and neural approaches to AI. Best Student Paper Award at KR 2024 for work on contextual reasoning Best Demo Award of IJCAI 2024 for rule mining in knowledge graphs French Open Research Award for the YAGO project Best Paper Award of ESWC 2021 for Neural Knowledge Base Repairs Suchanek has secured significant research funding, evidenced by his active recruitment of PhD students for knowledge-based language model research. He has held visiting positions, including at Nanyang Technological University (June-September 2023), and is recognized internationally through keynote invitations such as the Singapore ACM SIGKDD Symposium 2023. He has deliberately stepped back from administrative duties at Institut Polytechnique de Paris to focus on research. His laboratory maintains strong industry connections through open-source software projects including the YAGO knowledge base, AMIE for rule mining, STACI for explainable AI, and several other tools that have become standard in knowledge representation research.

Stefania DumbravaView profile

Associate Professor

• Formal methods for databases
• Graph databases
• Property graphs
• +7 more

Stefania Dumbrava is an Associate Professor of Computer Science at ENSIIE (École Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise) and a permanent member of the ACMES team in the SAMOVAR laboratory at Télécom SudParis, Institut Polytechnique de Paris. She is also actively involved in the Property Graph Schema Working Group and the European Research Network on Formal Proofs (EuroProofNet). Education PhD in Computer Science, Université Paris-Sud (2016) MSc in Computer Science, Jacobs University Bremen (2012) BSc in Mathematics, Jacobs University Bremen (2010) Research Interests Dumbrava's research lies at the intersection of formal methods and data management . She designs and verifies algorithms and systems for graph databases , with emphasis on property graphs , schema discovery , query optimization , and distributed graph processing . Recently, her work focuses on certifying large-scale distributed graph systems under the ANR JCJC VERDI project (2025–2029). Awards & Honors SIGMOD Best Paper Award 2023 – “PG-Schema: Schemas for Property Graphs” SIGMOD Research Highlight Award 2023 – “Threshold Queries” VLDB 2022 Best Regular Research Paper Runner-Up – “Threshold Queries in Theory and in the Wild” SIGMOD 2025 Distinguished Reviewer Award ICDE 2025 Best Program Committee Member Award EASST Best Software Science Paper Award, ICGT 2025 Students & Grants Dumbrava has supervised numerous research interns and is actively recruiting PhD students for her ANR VERDI project on verified foundations of large-scale distributed graph systems. She has also served on six PhD thesis committees as examiner since 2021. Labs & Teams She leads the ACMES research group within the SAMOVAR laboratory (Télécom SudParis, Institut Polytechnique de Paris), where her team develops formally verified graph-database engines and tools such as GRASP, VerDILog, and DatalogCert.

• Formal Verification
• Software Testing
• Programming Languages
• +12 more

Alastair F. Donaldson is a Professor and Director of Research in the Department of Computing at Imperial College London, where he leads the FastPL research group. His work bridges formal methods, software testing, and programming languages, with a focus on enhancing the reliability of high-performance and parallel software systems. He has held key roles including Director of Research (since 2023) and previously served as Lecturer (2011–2014), Senior Lecturer (2014–2017), and Reader (2017–2020) before being promoted to Professor in 2020. His research interests include formal verification, compiler testing, GPU programming, concurrency, and fuzzing. He has made significant contributions to the verification of GPU kernels, metamorphic testing of graphics drivers, and the development of tools like GPUVerify and GraphicsFuzz. His work combines theoretical rigor with practical impact, demonstrated by the acquisition of his startup GraphicsFuzz by Google in 2018 and his subsequent roles as Senior Software Engineer and Visiting Researcher at Google. His recent publications reflect a sustained focus on compiler and system reliability, with trends in fuzzing, formal specification, and automated testing of complex systems such as WebGPU, CXL cache coherence, and large language models for code generation. His work increasingly integrates empirical validation with formal techniques to uncover subtle bugs in real-world systems. Scientific awards and recognitions include: 2017 BCS Roger Needham Award EPSRC Early Career Fellowship Fellow of the British Computer Society Best Paper awards at EuroSys 2024, MET 2021, IISWC 2019, IWOCL 2019, and ICST 2016 Best Industry Paper at ICST 2024 ACM SIGSOFT Distinguished Paper at ISSTA 2023 ACM SIGPLAN Most Influential OOPSLA Paper Award (2012 paper), awarded in 2022 Best Student Paper at PPoPP 2014 He has advised numerous PhD students and leads a vibrant research group. He has secured significant research funding and collaborates extensively with industry and academia. His service includes leadership roles such as General Chair of PLDI 2020, PC Chair of ECOOP 2019, and Steering Committee Chair of PLDI (2022–2025). He also serves on the advisory board of PACM-PL and on program committees for top venues including POPL, OOPSLA, PLDI, ICSE, and ISSTA. He leads the FastPL research group, which focuses on the design and implementation of programming tools and techniques for reliable software. The group conducts cutting-edge research in compiler testing, formal methods, and high-performance systems, fostering collaboration across academia and industry.

Pierre-Henri ParisView profile

Associate Professor

• Artificial Intelligence
• Knowledge Graphs
• Information Extraction
• +2 more

Pierre-Henri Paris is an Associate Professor (Maître de Conférences) at Paris-Saclay University since September 2024. Previously, he worked as a Postdoctoral Researcher at Telecom Paris (Institut Polytechnique de Paris) from September 2020 to August 2024. His academic journey includes a PhD in Artificial Intelligence from Sorbonne University and CNAM (Conservatoire National des Arts et Métiers) completed in 2020. Education: PhD in Artificial Intelligence, 2020, Sorbonne University and CNAM M.Sc. in Artificial Intelligence, 2016, CNAM M.Sc. in Mathematics, 2008, CY Cergy Paris University (incomplete) Pierre-Henri Paris's research focuses on the intersection of artificial intelligence, knowledge representation, and natural language processing. His work particularly emphasizes knowledge graphs, entity linking, and data quality. He has made significant contributions to projects like YAGO 4.5, which enhances knowledge bases with cleaner, logically consistent structures, and MAFALDA, a benchmark for fallacy classification. His research often bridges theoretical foundations with practical applications, particularly in how knowledge can be effectively represented, extracted, and utilized in complex systems. His recent publications reveal a strong focus on knowledge graph enhancement, semantic representation, and natural language understanding. The work on YAGO 4.5 demonstrates his commitment to creating more robust knowledge bases, while MAFALDA shows his interest in the intersection of language understanding and logical reasoning. His research trajectory indicates a consistent exploration of how structured knowledge can be integrated with linguistic analysis to create more intelligent systems. Advising: PhD students: Simon Coumes (2022-), Chadi Helwe (2022-2024), François Amat (2022-) Master's students: Syrine El Aoud (2021), Ayoub Mountassir (2013-2015) Bachelor's students: Khalil Halloul (2013-2014) Pierre-Henri Paris is actively involved in teaching at Paris-Saclay University, where he instructs courses including Introduction to Machine Learning, Introduction to Neural Networks, Algorithms for Data Science, Databases, and Data Warehousing. His teaching reflects his research expertise, providing students with both theoretical foundations and practical applications in artificial intelligence and data science.

Paolo PapottiView profile

Associate Professor

• Data Management
• Data Integration
• Data Cleaning
• +3 more

Paolo Papotti is an Associate Professor of Computer Science at EURECOM (France) since 2017, affiliated with the Data Science department. Previously, he was a senior scientist at QCRI (Qatar) and an assistant professor at Arizona State University (USA). He earned his PhD in Computer Science from the University of Roma Tre (Italy) in 2007, following an MEng in Computer Engineering from the same institution in 2003. His research focuses on scalable data management, data integration, data cleaning, and computational fact-checking. Notable contributions include work on knowledge graph rule discovery (Rudik), fact-checking frameworks (Scrutinizer), and data quality systems. His research has been supported by awards such as the 2020 Google Faculty Research Fellowship. Key publications include advancements in table representation learning, LLM-based data querying, and crowdsourced fact-checking validation. His work spans theoretical foundations and practical tools for improving data quality and information trustworthiness.

Marc PlantevitView profile

Professor

• Data Mining
• Machine Learning
• Artificial Intelligence
• +7 more

Marc Plantevit is a Full Professor at EPITA, member of the Laboratoire LRDE (LRDE). Previously, he served as an Associate Professor at University Claude Bernard Lyon 1 (2010–2021), leading the Data Mining & Machine Learning group at LIRIS lab. He holds a PhD in Computer Science from the University of Montpellier (2008), supervised by Maguelonne Teisseire and Anne Laurent at LIRMM Lab. His research focuses on foundational data mining, graph mining, subgroup discovery, and explainable AI. He is an editorial board member of Data Mining and Knowledge Discovery Journal and has held roles such as CAPES NSI jury member and former head of the Data Mining & Machine Learning group at LIRIS. Research Interests : Data Mining, Machine Learning, Explainable AI, Graph Mining, Subgroup Discovery, Exceptional Model Mining, Constraint-based Pattern Mining, and applications in neuroscience and energy systems. His work explores interpretable AI, GNN explainability, and interdisciplinary applications like odor perception modeling and electricity price forecasting. Key Contributions : Best Paper Award at EGC'22 for work on GNN representations. Active in program committees for ECMLPKDD, IJCAI, and IEEE ICDM . Supervised PhD students working on GNN explainability, electricity forecasting, and machine learning in exposome studies. Labs & Teams : LRDE (EPITA), previously involved with LIRIS (UMR CNRS 5205) and collaborative projects with institutions like INSA Lyon and ISGlobal (Barcelona).

• Software Engineering
• Programming Languages
• Systems
• +4 more

Manuel Rigger is an Assistant Professor at the National University of Singapore (NUS), leading the TEST Lab (Trustworthy Engineering of Software Technologies) within the PL/SE group at the School of Computing. His research focuses on improving the reliability of data-centric systems through automated testing frameworks and formal methods. Education : PhD from Johannes Kepler University Linz (supervised by Hanspeter Mössenböck), postdoctoral work at ETH Zurich (Advanced Software Technologies Lab under Zhendong Su). Research Interests : Automated testing of database systems Programming language design and verification Incremental build systems Formal methods for software reliability Key Contributions : Developed tools like SQLancer (for finding bugs in databases) and CERT (performance issue detection). His work has uncovered over 800 bugs in real-world systems. Awards : Recipient of the ERC Consolidator Grant (2025) for groundbreaking research in software security and testing. Service Roles : Organizer of ICFP/SPLASH 2025 Outdoor Activities, committee member for OOPSLA Review, PLDI Artifact Evaluation, and ICSE Program Committee. Also actively involved in organizing workshops (e.g., Fuzzing & Software Security Summer School 2025).

Nofar CarmeliView profile

Researcher

• Database Query Optimization
• Fine-Grained Complexity
• Enumeration Complexity
• +2 more

Nofar Carmeli is a researcher at Inria , affiliated with the Boreal joint project-team (LIRMM, Inria, University of Montpellier, CNRS) in Montpellier, France. Her work focuses on theoretical aspects of database query optimization, particularly through the lenses of fine-grained complexity and enumeration complexity. PhD from Technion (2015-2020), advised by Prof. Benny Kimelfeld Postdoctoral Researcher at ENS Paris (2021-2022) and Inria's Valda project-team Holds the Schmidt Postdoctoral Award (2021-2022) Her research explores optimal algorithms for database query answering, including direct access to ranked answers, quantile computation, and handling of conjunctive queries with self-joins or negation. She investigates how structural properties of queries and data constraints like functional dependencies affect computational complexity. Key contributions include: Establishing tractability boundaries for direct access to conjunctive queries Developing efficient algorithms for minimal triangulation enumeration Advancing probabilistic database representations for infinite domains Creating explainable opinion graph frameworks for review summarization Scientific awards: Google PhD Fellowship (2019) Schmidt Postdoctoral Award (2021-2022) PODS Best Student Paper (2019) She has served on program committees for STACS (2025), PODS (2023-2025), and ICDT (2022-2024), and contributed to open-access research dissemination through Arxiv and dblp.

Vassilis ChristophidesView profile

Professor

• Databases
• Web Information Systems
• Big Data Processing
• +9 more

Vassilis Christophides is a Professor of Computer Science at the University of Crete and holds an advanced research position at Inria Paris, where he leads work in the MiMove team. His research spans databases, web information systems, big data processing, and IoT analytics, with a strong emphasis on entity resolution, data integration, and scalable data mining. He has supervised numerous research projects funded by the European Union and the Greek State, and has published over 130 articles in top-tier conferences and journals. Research Interests: His primary research areas include Databases, Web Information Systems, Big Data Processing and Analytics, and Information Systems for the Internet of Things. He also focuses on entity resolution, knowledge graphs, streaming data, and explainable AI, particularly in the context of anomaly detection and fairness-aware data systems. His recent work explores hybrid attention models for entity alignment and causal analysis in time series classification. Recent Research Trends: Analysis of his recent publications (2021–2025) reveals a strong focus on entity resolution with fairness constraints, explainable anomaly detection, and adaptive scheduling in IoT edge analytics. He also investigates deepfake detection, crop type mapping using satellite data, and structural bias in knowledge graphs, demonstrating a broad and impactful research portfolio at the intersection of data management and machine learning. Scientific Awards: 2004 SIGMOD Test of Time Award Best Paper Award, ISWC 2003 Best Paper Award, ISWC 2007 Advising and Grants: While specific student names are not listed in the provided texts, Christophides has co-authored numerous papers with researchers such as Vasilis Efthymiou, Ioannis Tsamardinos, and Nikolaos Myrtakis, suggesting active mentorship. He has been the scientific coordinator of multiple EU and national research projects, indicating substantial grant leadership and project management experience. Labs and Teams: He is affiliated with the MiMove team at Inria Paris, a research group focused on mobility and data-intensive systems. His work bridges academic and applied research, leveraging Inria’s infrastructure for large-scale data experimentation and innovation in IoT and edge computing environments.

Amin MesmoudiView profile

Associate Professor

• Data Engineering
• Machine Learning
• Anomaly Detection
• +5 more

Amin Mesmoudi serves as Associate Professor in Data Engineering at the University of Poitiers' IUT (Institut Universitaire de Technologie), with dual laboratory affiliations at LIAS-ENSIP (Poitiers campus) and LIAS-ISAE-ENSMA (Chasseneuil campus). His research bridges theoretical database systems with practical large-scale data engineering challenges, particularly in semantic web technologies and machine learning applications. The laboratory maintains physical presences at both ENSIP's Bâtiment B25 in Poitiers and ISAE-ENSMA's Téléport 2 facility in Chasseneuil, facilitating cross-institutional collaboration. Mesmoudi's research program centers on scalable data management systems, with three interconnected pillars: (1) RDF and graph-based query optimization techniques for billion-triple datasets, (2) machine learning integration for spatial query performance and anomaly detection, and (3) explainability frameworks for complex black-box models. His work demonstrates consistent evolution from foundational database systems (2011-2016) toward contemporary AI-driven data engineering, particularly evident in his 2023-2025 publications on temporal dependency preservation and co-selection explainability. The Data Engineering team within LIAS laboratory provides the primary research context for these investigations. Publication analysis reveals strong methodological continuity in addressing scalability bottlenecks across database paradigms. Early work focused on SQL-on-MapReduce benchmarking for astronomy databases (2015-2016), transitioning to specialized RDF processing frameworks (2019-2021), and culminating in current hybrid approaches combining temporal modeling with machine learning (2023-2025). Key technical themes include fragmentation strategies for distributed data, optimizer feedback mechanisms, and graph-based query acceleration - all targeting real-world performance constraints in big data environments. As a core member of LIAS laboratory's Data Engineering team, Mesmoudi contributes to France's national research infrastructure in computer science and automation systems. The laboratory's dual-university structure enables unique cross-pollination between University of Poitiers' academic programs and ISAE-ENSMA's engineering specialization, with Mesmoudi's work exemplifying this synergy through applications spanning astronomy databases to wireless sensor networks.

• Computer Science
• Databases
• Knowledge Representation & Reasoning
• +7 more

Dr. Yacine Sam is a Lecturer in Computer Science at the Polytechnic School of the University of Tours (EPU), affiliated with the Fundamental and Applied Computer Science Laboratory of Tours (LIFAT). His research focuses on databases, knowledge representation & reasoning, web services, and semantic web technologies. Doctorate in Computer Science, Paul Cézanne University Aix-Marseille 3 (2008) Master 2 Research in Computer Science, Claude Bernard University Lyon 1 (2005) Dr. Sam's research spans multiple subfields including: Trustworthy execution of adaptive business processes Privacy ontologies for Web of Things Deep learning applications in personalized service recommendations Linked open data frameworks for semantic integration Blockchain implementations in distributed systems Health analytics using collaborative IoT data Contact: yacine.sam@univ-tours.fr

Ioan TodincaView profile

Professor

• Graph Algorithms
• Theoretical Computer Science
• Exact Algorithms
• +6 more

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.

Hanan SametView profile

Professor

• Spatial Data Structures
• Geographic Information Systems (GIS)
• Computer Vision
• +3 more

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

Romain RaveauxView profile

Associate Professor

• Image Analysis
• Machine Learning
• Structural Pattern Recognition
• +5 more

Romain Raveaux is an Associate Professor at the LIFAT Computer Science Laboratory, University of Tours, affiliated with Polytech Tours. His research focuses on Image Analysis, Machine Learning, Structural Pattern Recognition, Graph Matching, Graph Neural Networks, Discrete Optimization, Reinforcement Learning, and Transfer Learning . Email: romain.raveaux@gmail.com , romain.raveaux@laposte.net Address: 64 av. Jean Portalis, Tours, France, 37200 Phone: +33 (0)2 47 36 14 27 Research Interests Graph Matching and Neural Networks Discrete Optimization for Pattern Recognition Transfer Learning in Graph-Based Models Historical Document Analysis Scientific Trends His recent work bridges Graph Neural Networks with Mixed-Integer Programming , focusing on Image Semantic Segmentation and Graph Cycle Detection . Earlier studies emphasize Genetic Algorithms for graph classification and Graph Edit Distance optimization in pattern recognition.