- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| c27 |      | Achref El Mouelhi, Philippe Jégou, Cyril Terrioux, Bruno Zanuttini: Some New Tractable Classes of CSPs and Their Relations with Backtracking Algorithms. CPAIOR 2013: 61-76 |
| 2012 | ||
| c26 | | Achref El Mouelhi, Philippe Jégou, Cyril Terrioux, Bruno Zanuttini: On the Efficiency of Backtracking Algorithms for Binary Constraint Satisfaction Problems. ISAIM 2012 |
| 2010 | ||
| c25 | | Djamal Habet, Philippe Jégou: Toward a Generalization and a Reformulation of Goods in SAT - Preliminary Report. Abstraction, Reformulation, and Approximation 2010 |
| c24 | | Philippe Jégou, Cyril Terrioux: A New Filtering Based on Decomposition of Constraint Sub-Networks. ICTAI (1) 2010: 263-270 |
| 2009 | ||
| j7 | | Philippe Jégou, Samba Ndojh Ndiaye: On the notion of cycles in hypergraphs. Discrete Mathematics 309(23-24): 6535-6543 (2009) |
| c23 | | Aurélie Favier, Simon de Givry, Philippe Jégou: Exploiting Problem Structure for Solution Counting. CP 2009: 335-343 |
| c22 | | Philippe Jégou, Samba Ndiaye, Cyril Terrioux: Combined Strategies for Decomposition-Based Methods for Solving CSPs. ICTAI 2009: 184-192 |
| c21 | | Philippe Jégou, Lionel Paris: A New Formula Rewriting by Reasoning on a Graphical Representation of SAT Instances. SARA 2009 |
| 2008 | ||
| c20 | | Samba Ndiaye, Philippe Jégou, Cyril Terrioux: Extending to Soft and Preference Constraints a Framework for Solving Efficiently Structured Problems. ICTAI (1) 2008: 299-306 |
| c19 | | 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: 486-490 |
| 2007 | ||
| c18 | | Philippe Jégou, Samba Ndiaye, Cyril Terrioux: Dynamic Management of Heuristics for Solving Structured CSPs. CP 2007: 364-378 |
| c17 | | Philippe Jégou, Samba Ndiaye, Cyril Terrioux: Dynamic Heuristics for Backtrack Search on Tree-Decomposition of CSPs. IJCAI 2007: 112-117 |
| 2006 | ||
| c16 | | Philippe Jégou, Samba Ndiaye, Cyril Terrioux: An Extension of Complexity Bounds and Dynamic Heuristics for Tree-Decompositions of CSP. CP 2006: 741-745 |
| c15 | | Karim Boutaleb, Philippe Jégou, Cyril Terrioux: (No)good Recording and ROBDDs for Solving Structured (V)CSPs. ICTAI 2006: 297-304 |
| 2005 | ||
| c14 | | Philippe Jégou, Samba Ndiaye, Cyril Terrioux: Computing and Exploiting Tree-Decompositions for Solving Constraint Networks. CP 2005: 777-781 |
| c13 | | Jean-Nicolas Bès, Philippe Jégou: Proving Graph Un-Colorability with a Consistency Check of CSP. ICTAI 2005: 693-694 |
| 2004 | ||
| c12 |  | Philippe Jégou, Cyril Terrioux: Decomposition and Good Recording for Solving Max-CSPs. ECAI 2004: 196-200 |
| c11 | | Philippe Jégou, Cyril Terrioux: A Time-Space Trade-Off for Constraint Networks Decomposition. ICTAI 2004: 234-239 |
| 2003 | ||
| j6 | | Philippe Jégou, Cyril Terrioux: Hybrid backtracking bounded by tree-decomposition of constraint networks. Artif. Intell. 146(1): 43-75 (2003) |
| c10 | | Cyril Terrioux, Philippe Jégou: Bounded Backtracking for the Valued Constraint Satisfaction Problems. CP 2003: 709-723 |
| c9 | | Assef Chmeiss, Philippe Jégou, Lamia Keddar: On a generalization of triangulated graphs for domains decomposition of CSPs. IJCAI 2003: 203-208 |
| 2000 | ||
| j5 | | Richard Génisson, Philippe Jégou: On the relations between SAT and CSP enumerative algorithms. Discrete Applied Mathematics 107(1-3): 27-40 (2000) |
| 1998 | ||
| j4 | | Assef Chmeiss, Philippe Jégou: Efficient Path-Consistency Propagation. International Journal on Artificial Intelligence Tools 7(2): 121-142 (1998) |
| 1997 | ||
| j3 | | Assef Chmeiss, Philippe Jégou: A Generalization of Chordal Graphs and the Maximum Clique Problem. Inf. Process. Lett. 62(2): 61-66 (1997) |
| j2 | | Fabrice Bouquet, Philippe Jégou: Using OBDDs to Handle Dynamic Constraints. Inf. Process. Lett. 62(3): 111-120 (1997) |
| 1996 | ||
| c8 | | Assef Chmeiss, Philippe Jégou: Path-Consistency: When Space Misses Time. AAAI/IAAI, Vol. 1 1996: 196-201 |
| c7 | | Assef Chmeiss, Philippe Jégou: Efficient Constraint Propagation With Good Space Complexity. CP 1996: 533-534 |
| c6 | | Richard Génisson, Philippe Jégou: Davis and Putnam were Already Checking Forward. ECAI 1996: 180-184 |
| c5 | | Assef Chmeiss, Philippe Jégou: Two New Donstraint Propagation Algorithms Requiring Small Space Complexity. ICTAI 1996: 286-289 |
| 1995 | ||
| c4 | | Fabrice Bouquet, Philippe Jégou: Solving Over-Constrained CSPs Using Weighted OBDDs. Over-Constrained Systems 1995: 293-308 |
| 1993 | ||
| j1 | | Philippe Jégou, Marie-Catherine Vilarem: On some partial line graphs of a hypergraph and the associated matroid. Discrete Mathematics 111(1-3): 333-344 (1993) |
| c3 | | |
| c2 | | Philippe Jégou: Decomposition of Domains Based on the Micro-Structure of Finite Constraint-Satisfaction Problems. AAAI 1993: 731-736 |
| 1990 | ||
| c1 | | Philippe Jégou: Cyclic-Clustering: A Compromise between Tree-Clustering and Cycle-Cutset Method for Improving Search Efficiency. ECAI 1990: 369-371 |
Colors in the list of coauthors
Last update Sat May 25 14:48:53 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page