Total Order Planning is More Efficient than we Thought. - Vincent Vidal 001; Pierre Régnier (AAAI/IAAI, 1999)

New Results about LCGP, a Least Committed GraphPlan. - Michel Cayrol; Pierre Régnier; Vincent Vidal 001 (AIPS, 2000)

Least commitment in Graphplan. - Michel Cayrol; Pierre Régnier; Vincent Vidal 001 (Artif. Intell., 2001)

A lookahead strategy for solving large planning problems. - Vincent Vidal 001 (IJCAI, 2003)

Branching and Pruning: An Optimal Temporal POCL Planner Based on Constraint Programming. - Vincent Vidal 001; Hector Geffner (AAAI, 2004)

A Lookahead Strategy for Heuristic Search Planning. - Vincent Vidal 001 (ICAPS, 2004)

Solving Simple Planning Problems with More Inference and No Search. - Vincent Vidal 001; Hector Geffner (CP, 2005)

Last Conflict Based Reasoning. - Christophe Lecoutre; Lakhdar Sais; Sébastien Tabary; Vincent Vidal 001 (ECAI, 2006)

Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning. - Marc Schoenauer; Pierre Savéant; Vincent Vidal 001 (EvoCOP, 2006)

Les ressources et la planification temporelle. - Zied Loukil; Abdelmajid Ben Hamadou; Pierre Marquis; Vincent Vidal 001 (INFORSID, 2006)

Transposition Tables for Constraint Satisfaction. - Christophe Lecoutre; Lakhdar Sais; Sébastien Tabary; Vincent Vidal 001 (AAAI, 2007)

Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance. - Christophe Lecoutre; Lakhdar Sais; Sébastien Tabary; Vincent Vidal 001 (CP, 2007)

Nogood Recording from Restarts. - Christophe Lecoutre; Lakhdar Sais; Sébastien Tabary; Vincent Vidal 001 (IJCAI, 2007)

Recording and Minimizing Nogoods from Restarts. - Christophe Lecoutre; Lakhdar Sais; Sébastien Tabary; Vincent Vidal 001 (J. Satisf. Boolean Model. Comput., 2007)

Divide-and-Evolve: a Sequential Hybridization Strategy Using Evolutionary Algorithms. - Marc Schoenauer; Pierre Savéant; Vincent Vidal 001 (Advances in Metaheuristics for Hard Optimization, 2008)

Reasoning from last conflict(s) in constraint programming. - Christophe Lecoutre; Lakhdar Sais; Sébastien Tabary; Vincent Vidal 001 (Artif. Intell., 2009)

An Evolutionary Metaheuristic Based on State Decomposition for Domain-Independent Satisficing Planning. - Jacques Bibai; Pierre Savéant; Marc Schoenauer; Vincent Vidal 001 (ICAPS, 2010)

On the Benefit of Sub-optimality within the Divide-and-Evolve Scheme. - Jacques Bibai; Pierre Savéant; Marc Schoenauer; Vincent Vidal 001 (EvoCOP, 2010)

On the generality of parameter tuning in evolutionary planning. - Jacques Bibai; Pierre Savéant; Marc Schoenauer; Vincent Vidal 001 (GECCO, 2010)

Adaptive K-Parallel Best-First Search: A Simple but Efficient Algorithm for Multi-Core Domain-Independent Planning. - Vincent Vidal 001; Lucas Bordeaux; Youssef Hamadi (SOCS, 2010)

Extending Classical Planning Heuristics to Probabilistic Planning with Dead-Ends. - Florent Teichteil-Königsbuch; Vincent Vidal 001; Guillaume Infantes (AAAI, 2011)

Parallel divide-and-evolve: experiments with OpenMP on a multicore machine. - Caner Candan; Johann Dréo; Pierre Savéant; Vincent Vidal 001 (GECCO, 2011)

The Landmark-based Meta Best-First Search Algorithm for Classical Planning. - Simon Vernhes; Guillaume Infantes; Vincent Vidal 001 (STAIRS, 2012)

Multi-objective AI Planning: Evaluating DaE YAHSP on a Tunable Benchmark. - Mostepha Redouane Khouadjia; Marc Schoenauer; Vincent Vidal 001; Johann Dréo; Pierre Savéant (EMO, 2013)

Multi-objective AI Planning: Comparing Aggregation and Pareto Approaches. - Mostepha Redouane Khouadjia; Marc Schoenauer; Vincent Vidal 001; Johann Dréo; Pierre Savéant (EvoCOP, 2013)

Pareto-Based Multiobjective AI Planning. - Mostepha Redouane Khouadjia; Marc Schoenauer; Vincent Vidal 001; Johann Dréo; Pierre Savéant (IJCAI, 2013)

Problem Splitting Using Heuristic Search in Landmark Orderings. - Simon Vernhes; Guillaume Infantes; Vincent Vidal 001 (IJCAI, 2013)

Quality Measures of Parameter Tuning for Aggregated Multi-Objective Temporal Planning. - Mostepha Redouane Khouadjia; Marc Schoenauer; Vincent Vidal 001; Johann Dréo; Pierre Savéant (LION, 2013)

HiPOP: Hierarchical Partial-Order Planning. - Patrick Bechon; Magali Barbier; Guillaume Infantes; Charles Lesire; Vincent Vidal 001 (STAIRS, 2014)

Using hybrid planning for plan reparation. - Patrick Bechon; Magali Barbier; Charles Lesire; Guillaume Infantes; Vincent Vidal 001 (ECMR, 2015)

Solving Large MultiZenoTravel Benchmarks with Divide-and-Evolve. - Alexandre Quemy; Marc Schoenauer; Vincent Vidal 001; Johann Dréo; Pierre Savéant (LION, 2015)

Designing Spacecraft Command Loops Using Two-Dimension Vehicle Routing. - Eliott Roynette; Bertrand Cabon; Cédric Pralet; Vincent Vidal 001 (CPAIOR, 2016)

Planning in Artificial Intelligence. - Régis Sabbadin; Florent Teichteil-Königsbuch; Vincent Vidal 001 (A Guided Tour of Artificial Intelligence Research (2) (II), 2020)

Optimal Pipe Routing Techniques in an Obstacle-Free 3D Space. - Marvin Stanczak; Cédric Pralet; Vincent Vidal 001; Vincent Baudoui (ICORES, 2020)

A Pipe Routing Hybrid Approach Based on A-Star Search and Linear Programming. - Marvin Stanczak; Cédric Pralet; Vincent Vidal 001; Vincent Baudoui (CPAIOR, 2021)