Philippe Jégou

According to our database, Philippe Jégou authored at least 53 papers between 1989 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Computing partial hypergraphs of bounded width.

Nabil Adrar, Philippe Jégou, Cyril Terrioux

Discret. Appl. Math., April, 2023

2018

On the Relevance of Optimal Tree Decompositions for Constraint Networks.

Philippe Jégou, Hélène Kanso, Cyril Terrioux

Proceedings of the IEEE 30th International Conference on Tools with Artificial Intelligence, 2018

2017

Combining restarts, nogoods and bag-connected decompositions for solving CSPs.

Philippe Jégou, Cyril Terrioux

Constraints An Int. J., 2017

Adaptive and Opportunistic Exploitation of Tree-Decompositions for Weighted CSPs.

Philippe Jégou, Helene Kanso, Cyril Terrioux

Proceedings of the 29th IEEE International Conference on Tools with Artificial Intelligence, 2017

Weather Routing Optimization: A New Shortest Path Algorithm.

Estelle Chauveau, Philippe Jégou, Nicolas Prcovic

Proceedings of the 29th IEEE International Conference on Tools with Artificial Intelligence, 2017

2016

Improving Exact Solution Counting for Decomposition Methods.

Philippe Jégou, Hanan Kanso, Cyril Terrioux

Proceedings of the 28th IEEE International Conference on Tools with Artificial Intelligence, 2016

Towards a Dynamic Decomposition of CSPs with Separators of Bounded Size.

Philippe Jégou, Hanan Kanso, Cyril Terrioux

Proceedings of the Principles and Practice of Constraint Programming, 2016

2015

A hybrid tractable class for non-binary CSPs.

Achref El Mouelhi, Philippe Jégou, Cyril Terrioux

Constraints An Int. J., 2015

An Algorithmic Framework for Decomposing Constraint Networks.

Philippe Jégou, Hanan Kanso, Cyril Terrioux

Proceedings of the 27th IEEE International Conference on Tools with Artificial Intelligence, 2015

A Microstructure-Based Family of Tractable Classes for CSPs.

Martin C. Cooper, Philippe Jégou, Cyril Terrioux

Proceedings of the Principles and Practice of Constraint Programming, 2015

The Extendable-Triple Property: A New CSP Tractable Class beyond BTP.

Philippe Jégou, Cyril Terrioux

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Bag-Connected Tree-Width: A New Parameter for Graph Decomposition.

Philippe Jégou, Cyril Terrioux

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2014

Hidden Tractable Classes: From Theory to Practice.

Achref El Mouelhi, Philippe Jégou, Cyril Terrioux

Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

Combining Restarts, Nogoods and Decompositions for Solving CSPs.

Philippe Jégou, Cyril Terrioux

Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

Tree-Decompositions with Connected Clusters for Solving Constraint Networks.

Philippe Jégou, Cyril Terrioux

Proceedings of the Principles and Practice of Constraint Programming, 2014

2013

Microstructures for CSPs with Constraints of Arbitrary Arity.

Achref El Mouelhi, Philippe Jégou, Cyril Terrioux

Proceedings of the Tenth Symposium on Abstraction, Reformulation, and Approximation, 2013

Different Classes of Graphs to Represent Microstructures for CSPs.

Achref El Mouelhi, Philippe Jégou, Cyril Terrioux

Proceedings of the Graph Structures for Knowledge Representation and Reasoning, 2013

Structural Consistency: A New Filtering Approach for Constraint Networks.

Philippe Jégou, Cyril Terrioux

Proceedings of the Graph Structures for Knowledge Representation and Reasoning, 2013

Some New Tractable Classes of CSPs and Their Relations with Backtracking Algorithms.

Achref El Mouelhi, Philippe Jégou, Cyril Terrioux, Bruno Zanuttini

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

2012

On the Efficiency of Backtracking Algorithms for Binary Constraint Satisfaction Problems.

Achref El Mouelhi, Philippe Jégou, Cyril Terrioux, Bruno Zanuttini

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2012

2010

A New Filtering Based on Decomposition of Constraint Sub-Networks.

Philippe Jégou, Cyril Terrioux

Proceedings of the 22nd IEEE International Conference on Tools with Artificial Intelligence, 2010

Toward a Generalization and a Reformulation of Goods in SAT - Preliminary Report.

Djamal Habet, Philippe Jégou

Proceedings of the Abstraction, 2010

2009

On the notion of cycles in hypergraphs.

Philippe Jégou, Samba Ndojh Ndiaye

Discret. Math., 2009

A New Formula Rewriting by Reasoning on a Graphical Representation of SAT Instances.

Philippe Jégou, Lionel Paris

Proceedings of the Eighth Symposium on Abstraction, Reformulation, and Approximation, 2009

Combined Strategies for Decomposition-Based Methods for Solving CSPs.

Philippe Jégou, Samba Ndiaye, Cyril Terrioux

Proceedings of the ICTAI 2009, 2009

Exploiting Problem Structure for Solution Counting.

Aurélie Favier, Simon de Givry, Philippe Jégou

Proceedings of the Principles and Practice of Constraint Programming, 2009

2008

Extending to Soft and Preference Constraints a Framework for Solving Efficiently Structured Problems.

Samba Ndiaye, Philippe Jégou, Cyril Terrioux

Proceedings of the 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2008), 2008

A New Evaluation of Forward Checking and Its Consequences on Efficiency of Tools for Decomposition of CSPs.

Philippe Jégou, Samba Ndiaye, Cyril Terrioux

Proceedings of the 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2008), 2008

2007

Dynamic Heuristics for Backtrack Search on Tree-Decomposition of CSPs.

Philippe Jégou, Samba Ndiaye, Cyril Terrioux

Proceedings of the IJCAI 2007, 2007

Dynamic Management of Heuristics for Solving Structured CSPs.

Philippe Jégou, Samba Ndiaye, Cyril Terrioux

Proceedings of the Principles and Practice of Constraint Programming, 2007

2006

(No)good Recording and ROBDDs for Solving Structured (V)CSPs.

Karim Boutaleb, Philippe Jégou, Cyril Terrioux

Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2006), 2006

An Extension of Complexity Bounds and Dynamic Heuristics for Tree-Decompositions of CSP.

Philippe Jégou, Samba Ndiaye, Cyril Terrioux

Proceedings of the Principles and Practice of Constraint Programming, 2006

2005

Proving Graph Un-Colorability with a Consistency Check of CSP.

Jean-Nicolas Bès, Philippe Jégou

Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2005), 2005

Computing and Exploiting Tree-Decompositions for Solving Constraint Networks.

Philippe Jégou, Samba Ndiaye, Cyril Terrioux

Proceedings of the Principles and Practice of Constraint Programming, 2005

2004

A Time-Space Trade-Off for Constraint Networks Decomposition.

Philippe Jégou, Cyril Terrioux

Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004), 2004

Decomposition and Good Recording for Solving Max-CSPs.

Philippe Jégou, Cyril Terrioux

Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004

2003

Hybrid backtracking bounded by tree-decomposition of constraint networks.

Philippe Jégou, Cyril Terrioux

Artif. Intell., 2003

On a generalization of triangulated graphs for domains decomposition of CSPs.

Assef Chmeiss, Philippe Jégou, Lamia Keddar

Proceedings of the IJCAI-03, 2003

Bounded Backtracking for the Valued Constraint Satisfaction Problems.

Cyril Terrioux, Philippe Jégou

Proceedings of the Principles and Practice of Constraint Programming, 2003

2000

On the relations between SAT and CSP enumerative algorithms.

Richard Génisson, Philippe Jégou

Discret. Appl. Math., 2000

1998

Efficient Path-Consistency Propagation.

Assef Chmeiss, Philippe Jégou

Int. J. Artif. Intell. Tools, 1998

1997

A Generalization of Chordal Graphs and the Maximum Clique Problem.

Assef Chmeiss, Philippe Jégou

Inf. Process. Lett., 1997

Using OBDDs to Handle Dynamic Constraints.

Fabrice Bouquet, Philippe Jégou

Inf. Process. Lett., 1997

1996

Two New Donstraint Propagation Algorithms Requiring Small Space Complexity.

Assef Chmeiss, Philippe Jégou

Proceedings of the Eigth International Conference on Tools with Artificial Intelligence, 1996

Davis and Putnam were Already Checking Forward.

Richard Génisson, Philippe Jégou

Proceedings of the 12th European Conference on Artificial Intelligence, 1996

Efficient Constraint Propagation With Good Space Complexity.

Assef Chmeiss, Philippe Jégou

Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, 1996

Path-Consistency: When Space Misses Time.

Assef Chmeiss, Philippe Jégou

Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996

1995

Solving Over-Constrained CSPs Using Weighted OBDDs.

Fabrice Bouquet, Philippe Jégou

Proceedings of the Over-Constrained Systems, 1995

1993

On some partial line graphs of a hypergraph and the associated matroid.

Philippe Jégou, Marie-Catherine Vilarem

Discret. Math., 1993

Decomposition of Domains Based on the Micro-Structure of Finite Constraint-Satisfaction Problems.

Philippe Jégou

Proceedings of the 11th National Conference on Artificial Intelligence. Washington, 1993

On the Consistency of General Constraint-Satisfaction Problems.

Philippe Jégou

Proceedings of the 11th National Conference on Artificial Intelligence. Washington, 1993

1990

Cyclic-Clustering: A Compromise between Tree-Clustering and Cycle-Cutset Method for Improving Search Efficiency.

Philippe Jégou

Proceedings of the 9th European Conference on Artificial Intelligence, 1990

1989

A filtering process for general constraint-satisfaction problems: achieving pairwise-consistency using an associated binary representation.

P. Janssen, Philippe Jégou, B. Nouguier, Marie-Catherine Vilarem

Proceedings of the IEEE International Workshop on Tools for Artificial Intelligence: Architectures, 1989