Philippe Jégou

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