| 2008 |
|---|
| 26 | EE | 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 |
| 25 | EE | 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 |
|---|
| 24 | EE | Philippe Jégou,
Samba Ndiaye,
Cyril Terrioux:
Dynamic Management of Heuristics for Solving Structured CSPs.
CP 2007: 364-378 |
| 23 | EE | Philippe Jégou,
Samba Ndiaye,
Cyril Terrioux:
Dynamic Heuristics for Backtrack Search on Tree-Decomposition of CSPs.
IJCAI 2007: 112-117 |
| 2006 |
|---|
| 22 | EE | Philippe Jégou,
Samba Ndiaye,
Cyril Terrioux:
An Extension of Complexity Bounds and Dynamic Heuristics for Tree-Decompositions of CSP.
CP 2006: 741-745 |
| 21 | EE | Karim Boutaleb,
Philippe Jégou,
Cyril Terrioux:
(No)good Recording and ROBDDs for Solving Structured (V)CSPs.
ICTAI 2006: 297-304 |
| 2005 |
|---|
| 20 | EE | Philippe Jégou,
Samba Ndiaye,
Cyril Terrioux:
Computing and Exploiting Tree-Decompositions for Solving Constraint Networks.
CP 2005: 777-781 |
| 19 | EE | Jean-Nicolas Bès,
Philippe Jégou:
Proving Graph Un-Colorability with a Consistency Check of CSP.
ICTAI 2005: 693-694 |
| 2004 |
|---|
| 18 | | Philippe Jégou,
Cyril Terrioux:
Decomposition and Good Recording for Solving Max-CSPs.
ECAI 2004: 196-200 |
| 17 | EE | Philippe Jégou,
Cyril Terrioux:
A Time-Space Trade-Off for Constraint Networks Decomposition.
ICTAI 2004: 234-239 |
| 2003 |
|---|
| 16 | EE | Cyril Terrioux,
Philippe Jégou:
Bounded Backtracking for the Valued Constraint Satisfaction Problems.
CP 2003: 709-723 |
| 15 | | Assef Chmeiss,
Philippe Jégou,
Lamia Keddar:
On a generalization of triangulated graphs for domains decomposition of CSPs.
IJCAI 2003: 203-208 |
| 14 | EE | Philippe Jégou,
Cyril Terrioux:
Hybrid backtracking bounded by tree-decomposition of constraint networks.
Artif. Intell. 146(1): 43-75 (2003) |
| 2000 |
|---|
| 13 | | 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 |
|---|
| 12 | EE | Assef Chmeiss,
Philippe Jégou:
Efficient Path-Consistency Propagation.
International Journal on Artificial Intelligence Tools 7(2): 121-142 (1998) |
| 1997 |
|---|
| 11 | EE | Assef Chmeiss,
Philippe Jégou:
A Generalization of Chordal Graphs and the Maximum Clique Problem.
Inf. Process. Lett. 62(2): 61-66 (1997) |
| 10 | EE | Fabrice Bouquet,
Philippe Jégou:
Using OBDDs to Handle Dynamic Constraints.
Inf. Process. Lett. 62(3): 111-120 (1997) |
| 1996 |
|---|
| 9 | | Assef Chmeiss,
Philippe Jégou:
Path-Consistency: When Space Misses Time.
AAAI/IAAI, Vol. 1 1996: 196-201 |
| 8 | | Assef Chmeiss,
Philippe Jégou:
Efficient Constraint Propagation With Good Space Complexity.
CP 1996: 533-534 |
| 7 | | Richard Génisson,
Philippe Jégou:
Davis and Putnam were Already Checking Forward.
ECAI 1996: 180-184 |
| 6 | | Assef Chmeiss,
Philippe Jégou:
Two New Donstraint Propagation Algorithms Requiring Small Space Complexity.
ICTAI 1996: 286-289 |
| 1995 |
|---|
| 5 | | Fabrice Bouquet,
Philippe Jégou:
Solving Over-Constrained CSPs Using Weighted OBDDs.
Over-Constrained Systems 1995: 293-308 |
| 1993 |
|---|
| 4 | | Philippe Jégou:
On the Consistency of General Constraint-Satisfaction Problems.
AAAI 1993: 114-119 |
| 3 | | Philippe Jégou:
Decomposition of Domains Based on the Micro-Structure of Finite Constraint-Satisfaction Problems.
AAAI 1993: 731-736 |
| 2 | EE | 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) |
| 1990 |
|---|
| 1 | | Philippe Jégou:
Cyclic-Clustering: A Compromise between Tree-Clustering and Cycle-Cutset Method for Improving Search Efficiency.
ECAI 1990: 369-371 |
