The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Philippe Jégou: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  25. Exploiting Problem Structure for Solution Counting. [Citation Graph (, )][DBLP]


  26. A New Evaluation of Forward Checking and Its Consequences on Efficiency of Tools for Decomposition of CSPs. [Citation Graph (, )][DBLP]


  27. Extending to Soft and Preference Constraints a Framework for Solving Efficiently Structured Problems. [Citation Graph (, )][DBLP]


  28. Combined Strategies for Decomposition-Based Methods for Solving CSPs. [Citation Graph (, )][DBLP]


  29. A New Formula Rewriting by Reasoning on a Graphical Representation of SAT Instances. [Citation Graph (, )][DBLP]


  30. On the notion of cycles in hypergraphs. [Citation Graph (, )][DBLP]


Search in 0.057secs, Finished in 0.058secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002