Philippe Jégou

737 total citations
25 papers, 203 citations indexed

About

Philippe Jégou is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Signal Processing. According to data from OpenAlex, Philippe Jégou has authored 25 papers receiving a total of 203 indexed citations (citations by other indexed papers that have themselves been cited), including 21 papers in Computer Networks and Communications, 15 papers in Computational Theory and Mathematics and 11 papers in Signal Processing. Recurrent topics in Philippe Jégou's work include Constraint Satisfaction and Optimization (21 papers), Advanced Graph Theory Research (12 papers) and Data Management and Algorithms (11 papers). Philippe Jégou is often cited by papers focused on Constraint Satisfaction and Optimization (21 papers), Advanced Graph Theory Research (12 papers) and Data Management and Algorithms (11 papers). Philippe Jégou collaborates with scholars based in France. Philippe Jégou's co-authors include Cyril Terrioux and Fabrice Bouquet and has published in prestigious journals such as Artificial Intelligence, Discrete Applied Mathematics and Discrete Mathematics.

In The Last Decade

Philippe Jégou

21 papers receiving 180 citations

Peers

Philippe Jégou
Romuald Debruyne France
Nicolas Beldiceanu France
Bertrand Mazure France
Andrew B. Baker United States
Michel de Rougemont France
Andrea Formisano Italy
Monika Rauch United States
Tian Sang United States
Carlo Sartiani Italy
Oded Lachish United Kingdom
Romuald Debruyne France
Philippe Jégou
Citations per year, relative to Philippe Jégou Philippe Jégou (= 1×) peers Romuald Debruyne

Countries citing papers authored by Philippe Jégou

Since Specialization
Citations

This map shows the geographic impact of Philippe Jégou's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Philippe Jégou with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Philippe Jégou more than expected).

Fields of papers citing papers by Philippe Jégou

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Philippe Jégou. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Philippe Jégou. The network helps show where Philippe Jégou may publish in the future.

Co-authorship network of co-authors of Philippe Jégou

This figure shows the co-authorship network connecting the top 25 collaborators of Philippe Jégou. A scholar is included among the top collaborators of Philippe Jégou based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Philippe Jégou. Philippe Jégou is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Jégou, Philippe, et al.. (2022). Computing partial hypergraphs of bounded width. Discrete Applied Mathematics. 329. 1–22. 1 indexed citations
2.
Jégou, Philippe & Cyril Terrioux. (2016). Combining restarts, nogoods and bag-connected decompositions for solving CSPs. Constraints. 22(2). 191–229. 1 indexed citations
3.
Jégou, Philippe, et al.. (2015). A hybrid tractable class for non-binary CSPs. Constraints. 20(4). 383–413. 3 indexed citations
4.
Jégou, Philippe, et al.. (2015). An Algorithmic Framework for Decomposing Constraint Networks. 1–8.
5.
Jégou, Philippe & Cyril Terrioux. (2014). Bag-Connected Tree-Width: A New Parameter for Graph Decomposition.. 2 indexed citations
6.
Jégou, Philippe, et al.. (2013). Microstructures for CSPs with Constraints of Arbitrary Arity.. 4 indexed citations
7.
Jégou, Philippe, et al.. (2009). A New Formula Rewriting by Reasoning on a Graphical Representation of SAT Instances.
8.
Jégou, Philippe, et al.. (2009). On the notion of cycles in hypergraphs. Discrete Mathematics. 309(23-24). 6535–6543. 7 indexed citations
9.
10.
Jégou, Philippe, et al.. (2007). Dynamic heuristics for backtrack search on tree-decomposition of CSPs. International Joint Conference on Artificial Intelligence. 112–117. 6 indexed citations
11.
Jégou, Philippe, et al.. (2006). (No)good Recording and ROBDDs for Solving Structured (V)CSPs. 146. 297–304.
12.
Jégou, Philippe & Cyril Terrioux. (2004). Decomposition and good recording for solving Max-CSPs. European Conference on Artificial Intelligence. 196–200. 15 indexed citations
13.
Jégou, Philippe & Cyril Terrioux. (2003). Hybrid backtracking bounded by tree-decomposition of constraint networks. Artificial Intelligence. 146(1). 43–75. 46 indexed citations
14.
Jégou, Philippe, et al.. (2000). On the relations between SAT and CSP enumerative algorithms. Discrete Applied Mathematics. 107(1-3). 27–40. 2 indexed citations
15.
Jégou, Philippe, et al.. (1997). A generalization of chordal graphs and the maximum clique problem. Information Processing Letters. 62(2). 61–66. 2 indexed citations
16.
Jégou, Philippe, et al.. (1996). Davis and Putnam were Already Checking Forward.. European Conference on Artificial Intelligence. 180–184. 6 indexed citations
17.
Jégou, Philippe. (1993). On the consistency of general constraint-satisfaction problems. National Conference on Artificial Intelligence. 114–119. 19 indexed citations
18.
Jégou, Philippe. (1993). Decomposition of domains based on the micro-structure of finite constraint-satisfaction problems. National Conference on Artificial Intelligence. 731–736. 39 indexed citations
19.
Jégou, Philippe, et al.. (1993). On some partial line graphs of a hypergraph and the associated matroid. Discrete Mathematics. 111(1-3). 333–344. 3 indexed citations
20.
Jégou, Philippe. (1990). Cyclic-clustering: a compromise between tree-clustering and cycle-cutset method for improving search efficiency. European Conference on Artificial Intelligence. 369–371. 4 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Romuald Debruyne Breakdown of academic impact, for papers by Nicolas Beldiceanu Breakdown of academic impact, for papers by Bertrand Mazure Breakdown of academic impact, for papers by Andrew B. Baker Breakdown of academic impact, for papers by Michel de Rougemont Breakdown of academic impact, for papers by Andrea Formisano Breakdown of academic impact, for papers by Monika Rauch Breakdown of academic impact, for papers by Tian Sang Breakdown of academic impact, for papers by Carlo Sartiani Breakdown of academic impact, for papers by Oded Lachish
Rankless by CCL
2026