Philippe Jégou

Publication Activity (10 Years)

Years Active: 1989-2024
Publications (10 Years): 8

Top Topics

Tree Decompositions

Arc Consistency

Decomposition Methods

Constraint Networks

Top Venues

Constraints An Int. J.

Publications

Philippe Jégou
Extending the Tractability of the Clique Problem via Graph Classes Generalizing Treewidth. ISAIM (2024)
Nabil Adrar, Philippe Jégou, Cyril Terrioux
Computing partial hypergraphs of bounded width. Discret. Appl. Math. 329 (2023)
Philippe Jégou, Hélène Kanso, Cyril Terrioux
On the Relevance of Optimal Tree Decompositions for Constraint Networks. ICTAI (2018)
Philippe Jégou, Cyril Terrioux
Combining restarts, nogoods and bag-connected decompositions for solving CSPs. Constraints An Int. J. 22 (2) (2017)
Estelle Chauveau, Philippe Jégou, Nicolas Prcovic
Weather Routing Optimization: A New Shortest Path Algorithm. ICTAI (2017)
Philippe Jégou, Helene Kanso, Cyril Terrioux
Adaptive and Opportunistic Exploitation of Tree-Decompositions for Weighted CSPs. ICTAI (2017)
Philippe Jégou, Hanan Kanso, Cyril Terrioux
Improving Exact Solution Counting for Decomposition Methods. ICTAI (2016)
Philippe Jégou, Hanan Kanso, Cyril Terrioux
Towards a Dynamic Decomposition of CSPs with Separators of Bounded Size. CP (2016)
Philippe Jégou, Hanan Kanso, Cyril Terrioux
An Algorithmic Framework for Decomposing Constraint Networks. ICTAI (2015)
Philippe Jégou, Cyril Terrioux
The Extendable-Triple Property: A New CSP Tractable Class beyond BTP. AAAI (2015)
Achref El Mouelhi, Philippe Jégou, Cyril Terrioux
A hybrid tractable class for non-binary CSPs. Constraints An Int. J. 20 (4) (2015)
Martin C. Cooper, Philippe Jégou, Cyril Terrioux
A Microstructure-Based Family of Tractable Classes for CSPs. CP (2015)
Philippe Jégou, Cyril Terrioux
Bag-Connected Tree-Width: A New Parameter for Graph Decomposition. ISAIM (2014)
Philippe Jégou, Cyril Terrioux
Tree-Decompositions with Connected Clusters for Solving Constraint Networks. CP (2014)
Philippe Jégou, Cyril Terrioux
Combining Restarts, Nogoods and Decompositions for Solving CSPs. ECAI (2014)
Achref El Mouelhi, Philippe Jégou, Cyril Terrioux
Hidden Tractable Classes: From Theory to Practice. ICTAI (2014)
Achref El Mouelhi, Philippe Jégou, Cyril Terrioux
Microstructures for CSPs with Constraints of Arbitrary Arity. SARA (2013)
Achref El Mouelhi, Philippe Jégou, Cyril Terrioux, Bruno Zanuttini
Some New Tractable Classes of CSPs and Their Relations with Backtracking Algorithms. CPAIOR (2013)
Achref El Mouelhi, Philippe Jégou, Cyril Terrioux
Different Classes of Graphs to Represent Microstructures for CSPs. GKR (2013)
Philippe Jégou, Cyril Terrioux
Structural Consistency: A New Filtering Approach for Constraint Networks. GKR (2013)
Achref El Mouelhi, Philippe Jégou, Cyril Terrioux
A Hybrid Tractable Class for Non-binary CSPs. ICTAI (2013)
Achref El Mouelhi, Philippe Jégou, Cyril Terrioux, Bruno Zanuttini
On the Efficiency of Backtracking Algorithms for Binary Constraint Satisfaction Problems. ISAIM (2012)
Philippe Jégou, Cyril Terrioux
A New Filtering Based on Decomposition of Constraint Sub-Networks. ICTAI (1) (2010)
Djamal Habet, Philippe Jégou
Toward a Generalization and a Reformulation of Goods in SAT - Preliminary Report. Abstraction, Reformulation, and Approximation (2010)
Philippe Jégou, Lionel Paris
A New Formula Rewriting by Reasoning on a Graphical Representation of SAT Instances. SARA (2009)
Aurélie Favier, Simon de Givry, Philippe Jégou
Exploiting Problem Structure for Solution Counting. CP (2009)
Philippe Jégou, Samba Ndojh Ndiaye
On the notion of cycles in hypergraphs. Discret. Math. 309 (23-24) (2009)
Philippe Jégou, Samba Ndiaye, Cyril Terrioux
Combined Strategies for Decomposition-Based Methods for Solving CSPs. ICTAI (2009)
Samba Ndiaye, Philippe Jégou, Cyril Terrioux
Extending to Soft and Preference Constraints a Framework for Solving Efficiently Structured Problems. ICTAI (1) (2008)
Philippe Jégou, Samba Ndiaye, Cyril Terrioux
A New Evaluation of Forward Checking and Its Consequences on Efficiency of Tools for Decomposition of CSPs. ICTAI (1) (2008)
Philippe Jégou, Samba Ndiaye, Cyril Terrioux
Dynamic Management of Heuristics for Solving Structured CSPs. CP (2007)
Philippe Jégou, Samba Ndiaye, Cyril Terrioux
Dynamic Heuristics for Backtrack Search on Tree-Decomposition of CSPs. IJCAI (2007)
Karim Boutaleb, Philippe Jégou, Cyril Terrioux
(No)good Recording and ROBDDs for Solving Structured (V)CSPs. ICTAI (2006)
Philippe Jégou, Samba Ndiaye, Cyril Terrioux
An Extension of Complexity Bounds and Dynamic Heuristics for Tree-Decompositions of CSP. CP (2006)
Philippe Jégou, Samba Ndiaye, Cyril Terrioux
Computing and Exploiting Tree-Decompositions for Solving Constraint Networks. CP (2005)
Jean-Nicolas Bès, Philippe Jégou
Proving Graph Un-Colorability with a Consistency Check of CSP. ICTAI (2005)
Philippe Jégou, Cyril Terrioux
A Time-Space Trade-Off for Constraint Networks Decomposition. ICTAI (2004)
Philippe Jégou, Cyril Terrioux
Decomposition and Good Recording for Solving Max-CSPs. ECAI (2004)
Cyril Terrioux, Philippe Jégou
Bounded Backtracking for the Valued Constraint Satisfaction Problems. CP (2003)
Assef Chmeiss, Philippe Jégou, Lamia Keddar
On a generalization of triangulated graphs for domains decomposition of CSPs. IJCAI (2003)
Philippe Jégou, Cyril Terrioux
Hybrid backtracking bounded by tree-decomposition of constraint networks. Artif. Intell. 146 (1) (2003)
Richard Génisson, Philippe Jégou
On the relations between SAT and CSP enumerative algorithms. Discret. Appl. Math. 107 (1-3) (2000)
Assef Chmeiss, Philippe Jégou
Efficient Path-Consistency Propagation. Int. J. Artif. Intell. Tools 7 (2) (1998)
Assef Chmeiss, Philippe Jégou
A Generalization of Chordal Graphs and the Maximum Clique Problem. Inf. Process. Lett. 62 (2) (1997)
Fabrice Bouquet, Philippe Jégou
Using OBDDs to Handle Dynamic Constraints. Inf. Process. Lett. 62 (3) (1997)
Assef Chmeiss, Philippe Jégou
Path-Consistency: When Space Misses Time. AAAI/IAAI, Vol. 1 (1996)
Assef Chmeiss, Philippe Jégou
Two New Donstraint Propagation Algorithms Requiring Small Space Complexity. ICTAI (1996)
Richard Génisson, Philippe Jégou
Davis and Putnam were Already Checking Forward. ECAI (1996)
Assef Chmeiss, Philippe Jégou
Efficient Constraint Propagation With Good Space Complexity. CP (1996)
Fabrice Bouquet, Philippe Jégou
Solving Over-Constrained CSPs Using Weighted OBDDs. Over-Constrained Systems (1995)
Philippe Jégou
Decomposition of Domains Based on the Micro-Structure of Finite Constraint-Satisfaction Problems. AAAI (1993)
Philippe Jégou, Marie-Catherine Vilarem
On some partial line graphs of a hypergraph and the associated matroid. Discret. Math. 111 (1-3) (1993)
Philippe Jégou
On the Consistency of General Constraint-Satisfaction Problems. AAAI (1993)
Philippe Jégou
Cyclic-Clustering: A Compromise between Tree-Clustering and Cycle-Cutset Method for Improving Search Efficiency. ECAI (1990)
P. Janssen, Philippe Jégou, B. Nouguier, Marie-Catherine Vilarem
A filtering process for general constraint-satisfaction problems: achieving pairwise-consistency using an associated binary representation. TAI (1989)