default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhilippe Jégou
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c45]Philippe Jégou:
Extending the Tractability of the Clique Problem via Graph Classes Generalizing Treewidth. ISAIM 2024: 94-106- 2023
- [j10]Nabil Adrar, Philippe Jégou, Cyril Terrioux
:
Computing partial hypergraphs of bounded width. Discret. Appl. Math. 329: 1-22 (2023)
2010 – 2019
- 2018
- [c44]Philippe Jégou, Hélène Kanso, Cyril Terrioux:
On the Relevance of Optimal Tree Decompositions for Constraint Networks. ICTAI 2018: 738-743 - 2017
- [j9]Philippe Jégou, Cyril Terrioux:
Combining restarts, nogoods and bag-connected decompositions for solving CSPs. Constraints An Int. J. 22(2): 191-229 (2017) - [c43]Philippe Jégou, Helene Kanso, Cyril Terrioux:
Adaptive and Opportunistic Exploitation of Tree-Decompositions for Weighted CSPs. ICTAI 2017: 366-373 - [c42]Estelle Chauveau, Philippe Jégou, Nicolas Prcovic:
Weather Routing Optimization: A New Shortest Path Algorithm. ICTAI 2017: 687-694 - 2016
- [c41]Philippe Jégou, Hanan Kanso, Cyril Terrioux:
Towards a Dynamic Decomposition of CSPs with Separators of Bounded Size. CP 2016: 298-315 - [c40]Philippe Jégou, Hanan Kanso, Cyril Terrioux:
Improving Exact Solution Counting for Decomposition Methods. ICTAI 2016: 327-334 - 2015
- [j8]Achref El Mouelhi, Philippe Jégou, Cyril Terrioux:
A hybrid tractable class for non-binary CSPs. Constraints An Int. J. 20(4): 383-413 (2015) - [c39]Philippe Jégou, Cyril Terrioux:
The Extendable-Triple Property: A New CSP Tractable Class beyond BTP. AAAI 2015: 3746-3754 - [c38]Martin C. Cooper, Philippe Jégou, Cyril Terrioux:
A Microstructure-Based Family of Tractable Classes for CSPs. CP 2015: 74-88 - [c37]Philippe Jégou, Hanan Kanso, Cyril Terrioux:
An Algorithmic Framework for Decomposing Constraint Networks. ICTAI 2015: 1-8 - 2014
- [c36]Philippe Jégou, Cyril Terrioux:
Tree-Decompositions with Connected Clusters for Solving Constraint Networks. CP 2014: 407-423 - [c35]Philippe Jégou, Cyril Terrioux:
Combining Restarts, Nogoods and Decompositions for Solving CSPs. ECAI 2014: 465-470 - [c34]Achref El Mouelhi, Philippe Jégou, Cyril Terrioux:
Hidden Tractable Classes: From Theory to Practice. ICTAI 2014: 437-445 - [c33]Philippe Jégou, Cyril Terrioux:
Bag-Connected Tree-Width: A New Parameter for Graph Decomposition. ISAIM 2014 - 2013
- [c32]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 - [c31]Achref El Mouelhi, Philippe Jégou, Cyril Terrioux:
Different Classes of Graphs to Represent Microstructures for CSPs. GKR 2013: 21-38 - [c30]Philippe Jégou, Cyril Terrioux:
Structural Consistency: A New Filtering Approach for Constraint Networks. GKR 2013: 74-91 - [c29]Achref El Mouelhi, Philippe Jégou, Cyril Terrioux:
A Hybrid Tractable Class for Non-binary CSPs. ICTAI 2013: 947-954 - [c28]Achref El Mouelhi, Philippe Jégou, Cyril Terrioux:
Microstructures for CSPs with Constraints of Arbitrary Arity. SARA 2013 - 2012
- [c27]Achref El Mouelhi, Philippe Jégou, Cyril Terrioux, Bruno Zanuttini:
On the Efficiency of Backtracking Algorithms for Binary Constraint Satisfaction Problems. ISAIM 2012 - 2010
- [c26]Djamal Habet, Philippe Jégou:
Toward a Generalization and a Reformulation of Goods in SAT - Preliminary Report. Abstraction, Reformulation, and Approximation 2010 - [c25]Philippe Jégou, Cyril Terrioux:
A New Filtering Based on Decomposition of Constraint Sub-Networks. ICTAI (1) 2010: 263-270
2000 – 2009
- 2009
- [j7]Philippe Jégou, Samba Ndojh Ndiaye:
On the notion of cycles in hypergraphs. Discret. Math. 309(23-24): 6535-6543 (2009) - [c24]Aurélie Favier, Simon de Givry, Philippe Jégou:
Exploiting Problem Structure for Solution Counting. CP 2009: 335-343 - [c23]Philippe Jégou, Samba Ndiaye, Cyril Terrioux:
Combined Strategies for Decomposition-Based Methods for Solving CSPs. ICTAI 2009: 184-192 - [c22]Philippe Jégou, Lionel Paris:
A New Formula Rewriting by Reasoning on a Graphical Representation of SAT Instances. SARA 2009 - 2008
- [c21]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 - [c20]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
- [c19]Philippe Jégou, Samba Ndiaye, Cyril Terrioux:
Dynamic Management of Heuristics for Solving Structured CSPs. CP 2007: 364-378 - [c18]Philippe Jégou, Samba Ndiaye, Cyril Terrioux:
Dynamic Heuristics for Backtrack Search on Tree-Decomposition of CSPs. IJCAI 2007: 112-117 - 2006
- [c17]Philippe Jégou, Samba Ndiaye, Cyril Terrioux:
An Extension of Complexity Bounds and Dynamic Heuristics for Tree-Decompositions of CSP. CP 2006: 741-745 - [c16]Karim Boutaleb, Philippe Jégou, Cyril Terrioux:
(No)good Recording and ROBDDs for Solving Structured (V)CSPs. ICTAI 2006: 297-304 - 2005
- [c15]Philippe Jégou, Samba Ndiaye, Cyril Terrioux:
Computing and Exploiting Tree-Decompositions for Solving Constraint Networks. CP 2005: 777-781 - [c14]Jean-Nicolas Bès, Philippe Jégou:
Proving Graph Un-Colorability with a Consistency Check of CSP. ICTAI 2005: 693-694 - 2004
- [c13]Philippe Jégou, Cyril Terrioux:
Decomposition and Good Recording for Solving Max-CSPs. ECAI 2004: 196-200 - [c12]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) - [c11]Cyril Terrioux, Philippe Jégou:
Bounded Backtracking for the Valued Constraint Satisfaction Problems. CP 2003: 709-723 - [c10]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. Discret. Appl. Math. 107(1-3): 27-40 (2000)
1990 – 1999
- 1998
- [j4]Assef Chmeiss, Philippe Jégou:
Efficient Path-Consistency Propagation. Int. J. Artif. Intell. 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
- [c9]Assef Chmeiss, Philippe Jégou:
Path-Consistency: When Space Misses Time. AAAI/IAAI, Vol. 1 1996: 196-201 - [c8]Assef Chmeiss, Philippe Jégou:
Efficient Constraint Propagation With Good Space Complexity. CP 1996: 533-534 - [c7]Richard Génisson, Philippe Jégou:
Davis and Putnam were Already Checking Forward. ECAI 1996: 180-184 - [c6]Assef Chmeiss, Philippe Jégou:
Two New Donstraint Propagation Algorithms Requiring Small Space Complexity. ICTAI 1996: 286-289 - 1995
- [c5]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. Discret. Math. 111(1-3): 333-344 (1993) - [c4]Philippe Jégou:
On the Consistency of General Constraint-Satisfaction Problems. AAAI 1993: 114-119 - [c3]Philippe Jégou:
Decomposition of Domains Based on the Micro-Structure of Finite Constraint-Satisfaction Problems. AAAI 1993: 731-736 - 1990
- [c2]Philippe Jégou:
Cyclic-Clustering: A Compromise between Tree-Clustering and Cycle-Cutset Method for Improving Search Efficiency. ECAI 1990: 369-371
1980 – 1989
- 1989
- [c1]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: 420-427
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-07 22:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
