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

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.

• Database Query Optimization
• Fine-Grained Complexity
• Enumeration Complexity
• +۲ مورد دیگر

Weiqiang Wen is an assistant professor at Telecom Paris , affiliated with the Cybersecurity and Cryptography (C²) team within the Information Processing and Communication Laboratory (LTCI) . His academic journey includes a PhD from ENS Lyon under Damien Stehlé (2019), postdoctoral work at IRISA (2019-2021), and a research engineer role at TII (2021). Research Interests: Weiqiang Wen specializes in post-quantum cryptography and lattice-based cryptography . His work explores the hardness of lattice problems and their implications for cryptographic security , particularly in quantum-resistant systems. He has contributed to advancements in Module-NTRU , LWE , and cryptanalysis . Publications: Wen’s research spans lattice reduction algorithms (e.g., BKZ, uSVP), cryptographic constructions (e.g., threshold ring signatures, NIZK), and quantum verification protocols. His work bridges theoretical lattice problems with practical cryptographic implementations, focusing on security reductions , zero-knowledge proofs , and key exposure attacks .

• Post-Quantum Cryptography
• Lattice-Based Cryptography
• Computational Complexity
• +۴ مورد دیگر

Phong Nguyen is a Research Professor at Inria (Directeur de recherche) and a part-time professor at the Computer Science Department (DI ENS) of École Normale Supérieure (ENS), PSL University in Paris. He leads the ENS Crypto Team (Inria Equipe Projet Cascade) and serves as the principal investigator for the ERC Advanced Grant PARQ (2020) focused on lattices in parallel and quantum computing. He holds a PhD (1999) and Habilitation (2007) from ENS-Lyon, with an agrégation de mathématiques (1997). His research integrates cryptography, algorithmic number theory, and lattice-based computations, emphasizing: Cryptanalysis : Deconstructing cryptographic protocols, especially lattice-based systems Post-quantum cryptography : Developing quantum-resistant solutions Lattice algorithms : Optimization of reduction, enumeration, and sieving techniques Real-world applications : Bridging theoretical constructs with practical security implementations His publications (spanning Eurocrypt, Asiacrypt, and Journal of Cryptology) demonstrate deep expertise in lattice cryptography, with recurring themes in algorithm efficiency, cryptanalysis of NTRU/GGH systems, and theoretical advancements in lattice reduction. Recent work (2024) continues this trajectory with improved BKZ analysis and hypercubic lattice optimizations. Awards include : ERC Advanced Grant (2020) for PARQ project Best Paper Award at EUROCRYPT 2006 Cor Baayen Award (2001) He advises PhD students (e.g., Henry Bambury, Leo Ducas) and interns from institutions like École Polytechnique and ENS. He directs the ENS Crypto Team and previously held leadership roles as: French Director of the Japanese-French Laboratory for Informatics (2015-2019) European Director of LIAMA (Sino-European Computer Science Lab, 2013-2015) Coordinator of ECRYPT II virtual labs (2008-2012)

• Cryptography
• Cryptanalysis
• Post-quantum Cryptography
• +۵ مورد دیگر

Ramin Javadi is an Associate Professor of Mathematics at Isfahan University of Technology and a Visiting Professor at the Laboratoire de l'Informatique du Parallélisme (LIP) at ENS Lyon from June to July 2025. His research focuses on graph theory and combinatorics, with notable contributions to structural graph theory and algorithm design. He holds a Ph.D. in Mathematics from Sharif University of Technology (thesis: 'Isoperimetric problems on graphs'), and an M.Sc. from Isfahan University of Technology (thesis: 'Chip-firing game and b-coloring of graphs'). His collaboration with LIP aims to strengthen scientific exchange in structural graph theory and expand institutional ties. Key research areas include parameterized complexity, Ramsey numbers, and graph coloring. Despite no explicit mention of awards, his extensive publication record reflects impactful contributions to discrete mathematics. He has advised multiple students from Isfahan University of Technology, though specific names are not listed. His work bridges theoretical computer science and pure mathematics, particularly through interdisciplinary studies in graph algorithms and combinatorial optimization.

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

Luc Segoufin is a Research Professor at INRIA (French National Institute for Research in Computer Science and Automation), affiliated with the Department of Computer Science at École Normale Supérieure (ENS) in Paris. He leads the VALDA research team, focusing on theoretical computer science foundations. His research spans: Database theory: Query answering, consistency, and enumeration complexity Logic and automata: Finite model theory, automata over data structures Computational complexity: Fine-grained analysis and lower bounds Formal methods: Verification and logic-based modeling His recent publications (2022–2024) concentrate on: Dichotomy theorems for query answering under constraints Constant-delay enumeration algorithms for structured data Decidability in logic fragments over trees and graphs Connections between automata, algebra, and complexity No scientific awards are mentioned in available sources. He collaborates extensively within the VALDA team and international researchers on projects involving database theory, logic, and automata. No student advising details are provided.

• Database theory
• Verification
• Logic in computer science
• +۳ مورد دیگر

Stéphan Thomassé is a Professor in the Computer Science Department at Ecole Normale Supérieure de Lyon, where he is affiliated with the Parallel Computing Laboratory (LIP) and leads the Computational Models, Complexity, Combinatorics (MC2) research team (2023-2025). He was a Member of the University Institute of France from 2016-2021 and has held significant administrative roles including Head of M2 Fundamental Computer Science (2013-2015) and Deputy Director of the Computer Science Department (2013-2015). Thomassé's research focuses on graph theory, combinatorics, algorithms, and theoretical computer science. His work spans structural graph theory , parameterized complexity , graph coloring , and combinatorial optimization . He is particularly known for his groundbreaking work on twin-width, a graph parameter that has revolutionized understanding of sparse and dense graph classes and their algorithmic properties. His research connects combinatorial structures with computational complexity, often bridging theoretical insights with practical algorithmic applications. His recent publications demonstrate a strong focus on structural graph theory, with the twin-width series representing a major contribution to the field. These papers have established connections between graph parameters, model theory, and algorithm design, particularly for problems that were previously thought to be intractable on dense graph classes. Thomassé's work on graph coloring, particularly regarding dense triangle-free graphs and the Erdős-Hajnal conjecture, has resolved long-standing open problems. Member of University Institute of France (2016-2021) ANR projects: GRAAL, AGAPE, STINT, COMPA, Digraphs, TWIN-WIDTH, GODASse As an advisor and educator, Thomassé has taught numerous advanced courses including Algorithmics, Optimization and Approximation, Tree Decompositions and FPT Algorithms, and Graph Decompositions. His teaching reflects his research expertise, emphasizing both theoretical foundations and practical applications of discrete mathematics. His administrative leadership in the MC2 team and the Computer Science Department demonstrates his commitment to advancing research and education in theoretical computer science. Thomassé maintains active collaborations with researchers worldwide, as evidenced by his extensive publication record with co-authors from various institutions. His work continues to shape the landscape of structural graph theory and parameterized algorithms, with recent results opening new avenues for research in combinatorics and theoretical computer science.

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

Tatiana Starikovskaya is an Assistant Professor (Maître de Conférences) in the Computer Science Department at École normale supérieure (ENS), Paris, France. She leads the PARSe project (ANR-20-CE48-0001) focusing on approximation and randomized string processing, and participates in AlgoriDAM (ANR-19-CE48-0016). Co-supervises PhD students T. El Ghazi and Gabriel Bathie Co-chaired CPM 2021; served on program committees for STACS, ESA, ICALP, and others Organized CPM summer school (2023) and 'New Horizons of Stringology' workshop (2024) Research Focus Her work centers on algorithms on strings , small-space algorithms , and streaming models , with applications in bioinformatics and data security. Recent research explores trade-offs between time/space complexity in pattern matching, wildcards, and error-tolerant string analysis. Publications Trends Her recent work spans streaming algorithms , compressed data processing , and approximate pattern matching , with collaborations on challenges like k-mismatch problems, Dyck edit distances, and language distance estimation. Education PhD in Mathematics, Lomonosov Moscow State University (2013) M.Sc. in Data Science (Moscow Institute of Physics and Technology/Yandex, 2009) M.Sc. in Mathematics, Lomonosov Moscow State University (2009)

• Algorithms on strings
• Small-space algorithms
• Data structures
• +۴ مورد دیگر

Carl Esswein is a Lecturer-researcher in the Computer Science Department of the Polytechnic School of the University of Tours (EPU), affiliated with the Fundamental and Applied Computer Science Laboratory of Tours (LIFAT). His work focuses on scheduling problems with objectives centered on flexibility and robustness. Doctoral thesis, François Rabelais University of Tours (2003) DEA Computer Science, François Rabelais University of Tours (2001) Diploma in Computer Science Engineering for Industry (DIII), François Rabelais University of Tours (2001) Esswein's research explores the intersection of scheduling, flexibility, and robustness in operational research. His publications address multi-criteria optimization, robust shop scheduling, and algorithm design for complex scheduling scenarios. He has contributed to methodological advancements such as revisiting Branch and Bound strategies and analyzing trade-offs between flexibility and makespan efficiency. His work spans theoretical and applied domains, including enumeration complexity in multicriteria scheduling, optimization algorithms for production planning, and computational methods for constraint satisfaction in manufacturing systems. Publications highlight interdisciplinary applications in industrial engineering and computer science. Carl Esswein is actively associated with the LIFAT laboratory, where he collaborates on fundamental and applied research in computer science. His affiliations include the Computer Science Department of Polytech'Tours and the University of Tours.

• Scheduling
• Flexibility
• Robustness
• +۳ مورد دیگر

Seamus Dufurrena serves as an Assistant Professor in the Department of Management Control, Accounting, and Audit at TBS Education, a prominent business school with international campuses in Toulouse (Lascrosses and Entiore), Paris, Barcelona, Casablanca, London, and online learning divisions. His academic appointment bridges theoretical frameworks with practical applications in business administration across undergraduate and graduate programs. His research focuses on Management Control systems, Accounting methodologies, and Auditing practices within complex organizational structures. Key interests include financial governance mechanisms, regulatory compliance frameworks, and performance measurement systems in multinational enterprises. His work addresses critical challenges in corporate transparency and risk management. No scientific awards were documented in the available profile. Professional engagement is evidenced through active Research Gate and LinkedIn scholarly networks where he disseminates expertise in financial oversight disciplines. As an academic advisor, Dufurrena mentors students in accounting and audit specializations, though specific advisees were not enumerated. His teaching portfolio encompasses management control systems, financial auditing protocols, and compliance training within TBS Education's business administration curriculum.

• Management Control
• Accounting
• Auditing
• +۲ مورد دیگر

Louis Jachiet is an Assistant Professor in Computer Science at Télécom Paris, affiliated with the Data, Intelligence and Graphs (DIG) team within the Information Processing and Communication Laboratory (LTCI) and the Computer Sciences and Networks (Infres) department. His research focuses on algorithms, databases, programming languages, and logic. His work spans query optimization distributed SPARQL evaluation graph algorithms formal language theory program synthesis data provenance with a strong emphasis on bridging theoretical and applied research. Analysis of his publications reveals expertise in database systems graph processing automata theory query enumeration SPARQL optimization probabilistic databases across both theoretical and practical applications.

• Algorithms
• Databases
• Programming Languages
• +۳ مورد دیگر

Antoine Dailly is a Research Fellow at INRAE within the TSCF research unit. Previously, he held postdoctoral positions at LIMOS (2022–2024) under Florent Foucaud, UNAM Juriquilla (2019–2021), and teaching roles (ATER) at IUT2 Grenoble (2021–2022) and University of Grenoble Alpes (2018–2019). He completed his PhD at Université Claude Bernard Lyon 1 (2015–2018) in the LIRIS laboratory. Research Focus: Dailly specializes in graph algorithms, combinatorial optimization, and sensor networks. His work includes: Algorithmic approaches to metric problems in graphs, uncertainty representation, and autonomous agent trajectory optimization. Combinatorial games, graph criticality, and structural/algorithmic challenges in vertex deletion, coloring, and equilibrability. Current projects: ANR GRALMECO (metric covering in graphs) and ConnecSenS (sensor networks). Publication Trends: His 15 most recent articles (2017–2025) primarily explore combinatorics, discrete mathematics, and algorithmic theory. Key themes include: Planar graphs, geodetic games, and temporal graph resolving sets. Complexity of Arc-Kayles, path covers in DAGs, and digraph metric dimensions. Applications in game theory, optimization, and information theory. Teaching & Outreach: Dailly has taught algorithms, programming (C/Python/XML), and graph theory at ISIMA, IUT, UNAM, and Grenoble. He co-leads the ISO group, promoting computer science education without computers. Affiliations: Member of AlCoLoCo (algorithmic research group) and labs including G-SCOP, LIRIS, and LIMOS.

• Graph Algorithms
• Combinatorial Optimization
• Sensor Networks
• +۳ مورد دیگر

Dr. Vincent T'KINDT is a Researcher in the Computer Science Department at the Polytechnic School of the University of Tours. He serves as Head of the "Scheduling and Management" axis at the Fundamental and Applied Computer Science Laboratory of Tours (LIFAT, UR 6300) and as Head of Corporate Relations for his department. His research focuses on Scheduling , Multi-criteria Optimization , and Operational Research , contributing to theoretical and applied advancements in these fields. Recent publications highlight his work on Multi-objective scheduling for parallel machines Heuristic algorithms for dynamic scheduling Just-in-Time scheduling models Rescheduling with setup times His research combines exact and approximate methods to solve complex industrial scheduling challenges. He has authored key works in journals like the Journal of Scheduling , Computers & Operations Research , and European Journal of Operational Research , with notable contributions including the book Multicriteria Scheduling: Theory, Models and Algorithms (Springer, 2006). Dr. T'KINDT collaborates with the LIFAT laboratory (UR 6300) and has participated in international conferences such as PMS'08, MISTA'07, and MAPSP2007. His methodological approaches include Integer Programming, Beam Search algorithms, and Pareto optima enumeration.

• Scheduling
• Multi-criteria Optimization
• Operational Research
• +۱ مورد دیگر

Bénédicte Haas is a Professor in the Department of Mathematics at Sorbonne Paris Nord University, affiliated with the Galileo Institute and LAGA laboratory (Laboratoire Analyse, Géométrie et Applications). Her research focuses on probabilistic structures including random trees, fragmentation processes, and self-similar Markov processes, with applications spanning mathematical physics and combinatorial theory. Her academic credentials include a PhD (2005) on Fragmentation and mass loss and an Habilitation à diriger les recherches (2010) on Random trees and fragmentations , both from Sorbonne Paris Nord University. These qualifications established her expertise in stochastic processes and tree-valued structures. Haas investigates scaling limits , asymptotic behaviors , and dust formation in fragmentation models, with recent work extending to stable graphs and multi-type branching structures. Her research bridges theoretical probability with concrete applications in evolutionary biology and statistical physics, characterized by rigorous mathematical analysis of discrete-to-continuum transitions. Publication trends (2010-2023) reveal sustained focus on fragmentation kinetics and tree models, evolving toward tail asymptotics and complex graph structures. Key themes include extinction time analysis, line-breaking constructions, and multi-type branching dynamics, demonstrating increasing mathematical sophistication while maintaining core probabilistic foundations. prix des Annales de l'IHP Proba. Stat. 2010 (for work on self-similar fragmentations) As an Associate Editor for ESAIM Probability and Statistics and member of the ANR GRAAL project (GRaphes and Random Trees), Haas contributes to collaborative research networks. Her teaching spans undergraduate algebra/probability courses to graduate seminars on random trees, reflecting comprehensive pedagogical engagement. Current grants support interdisciplinary work on graph-theoretic approaches to stochastic processes. Within LAGA's Probability and Statistics Team, Haas co-leads research on continuum random trees and fragmentation kinetics, maintaining active collaboration with international probabilists through the ANR GRAAL consortium and editorial responsibilities.

• Probability
• Random Trees
• Random Graphs
• +۳ مورد دیگر

Mathieu Liedloff is a Professor at the Université d'Orléans, affiliated with the Department of Computer Science (UFR Sciences et Techniques) and the LIFO lab (Laboratoire d'Informatique Fondamentale d'Orléans). He is a member of the GAMoC research team, the Informatique-Centre Val de Loire federation, and the GDR Informatique Fondamentale et ses Mathématiques. His research focuses on algorithmics, particularly exact and exponential-time algorithms for NP-hard problems in graph theory and scheduling. He is also involved in educational initiatives for teaching computer science in secondary schools.

• Algorithmics
• Graph Theory
• Scheduling (Computing)
• +۳ مورد دیگر

Badran Raddaoui is a Senior Lecturer (Maître de Conférences) at Telecom SudParis, where he conducts extensive research in artificial intelligence with a focus on knowledge representation, reasoning under uncertainty, and data mining. His work bridges theoretical foundations with practical applications in knowledge management and pattern discovery. His primary research interests include: Argumentation frameworks and logical reasoning systems Measurement and quantification of inconsistencies in knowledge bases SAT-based approaches for data mining problems Ontology reasoning under uncertainty Community detection in complex networks High utility itemset mining from transaction databases Dr. Raddaoui's recent publications demonstrate a strong emphasis on symbolic AI techniques for pattern extraction and robust reasoning with imperfect information. His work on inconsistency measurement through minimal inconsistent subsets and prime implicates has established him as a notable contributor to the field. He frequently applies constraint programming and SAT solving to problems in data mining and knowledge representation. His publication record shows consistent output from 2010 through 2024, with numerous papers in top-tier AI venues including IEEE Intelligent Systems, IJCAI, ECAI, and AAMAS. His research often involves collaborations with Saïd Jabbour and other researchers across multiple institutions. As an academic, Dr. Raddaoui contributes to the scholarly community through conference reviewing and participation in research projects focused on AI theory and applications. His current work continues to advance frameworks for knowledge base repair and conceptual clustering through pattern mining techniques.

• Artificial Intelligence
• Knowledge Representation and Reasoning
• Argumentation Frameworks
• +۷ مورد دیگر