Philippe Duchon

682 total citations
12 papers, 233 citations indexed

About

Philippe Duchon is a scholar working on Discrete Mathematics and Combinatorics, Mathematical Physics and Computational Theory and Mathematics. According to data from OpenAlex, Philippe Duchon has authored 12 papers receiving a total of 233 indexed citations (citations by other indexed papers that have themselves been cited), including 4 papers in Discrete Mathematics and Combinatorics, 4 papers in Mathematical Physics and 4 papers in Computational Theory and Mathematics. Recurrent topics in Philippe Duchon's work include Advanced Combinatorial Mathematics (4 papers), Complex Network Analysis Techniques (3 papers) and Peer-to-Peer Network Technologies (2 papers). Philippe Duchon is often cited by papers focused on Advanced Combinatorial Mathematics (4 papers), Complex Network Analysis Techniques (3 papers) and Peer-to-Peer Network Technologies (2 papers). Philippe Duchon collaborates with scholars based in France, Belgium and Poland. Philippe Duchon's co-authors include Philippe Flajolet, Guy Louchard, Gilles Schaeffer, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel, Jean-Christophe Aval, Nicolas Bonichon, Olivier Beaumont and Akka Zemmari and has published in prestigious journals such as Theoretical Computer Science, Discrete Mathematics and Information and Computation.

In The Last Decade

Philippe Duchon

12 papers receiving 208 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Philippe Duchon France 5 113 92 68 66 28 12 233
Michèle Soria France 7 111 1.0× 86 0.9× 138 2.0× 106 1.6× 8 0.3× 17 271
Bernhard Gittenberger Austria 10 56 0.5× 85 0.9× 167 2.5× 71 1.1× 11 0.4× 42 284
Dudley Stark United Kingdom 9 119 1.1× 72 0.8× 130 1.9× 67 1.0× 22 0.8× 35 275
Jerzy Jaworski Poland 11 66 0.6× 68 0.7× 136 2.0× 55 0.8× 93 3.3× 35 283
Wen-Ching Winnie Li United States 8 84 0.7× 94 1.0× 57 0.8× 48 0.7× 24 0.9× 22 259
Svante Linusson Sweden 10 201 1.8× 137 1.5× 120 1.8× 42 0.6× 16 0.6× 40 334
Rainer Kemp Germany 8 121 1.1× 136 1.5× 88 1.3× 113 1.7× 17 0.6× 47 290
V. F. Kolchin Russia 12 68 0.6× 65 0.7× 154 2.3× 133 2.0× 36 1.3× 33 383
Hua‐Huai Chern Taiwan 10 44 0.4× 65 0.7× 157 2.3× 93 1.4× 12 0.4× 16 245
Dominique Gouyou-Beauchamps France 7 213 1.9× 157 1.7× 82 1.2× 88 1.3× 6 0.2× 17 332

Countries citing papers authored by Philippe Duchon

Since Specialization
Citations

This map shows the geographic impact of Philippe Duchon'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 Duchon with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Philippe Duchon more than expected).

Fields of papers citing papers by Philippe Duchon

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Philippe Duchon. 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 Duchon. The network helps show where Philippe Duchon may publish in the future.

Co-authorship network of co-authors of Philippe Duchon

This figure shows the co-authorship network connecting the top 25 collaborators of Philippe Duchon. A scholar is included among the top collaborators of Philippe Duchon 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 Duchon. Philippe Duchon is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

12 of 12 papers shown
1.
Duchon, Philippe. (2011). Random generation of combinatorial structures: Boltzmann samplers and beyond. 27. 120–132. 1 indexed citations
2.
Beaumont, Olivier, et al.. (2011). Use of Internet Embedding Tools for Heterogeneous Resources Aggregation. 5058. 114–124. 2 indexed citations
3.
Aval, Jean-Christophe & Philippe Duchon. (2010). Enumeration of Alternating Sign Matrices of Even Size (Quasi-)Invariant under a Quarter-Turn Rotation. The Electronic Journal of Combinatorics. 17(1). 4 indexed citations
4.
Aval, Jean-Christophe & Philippe Duchon. (2009). Enumeration of alternating sign matrices of even size (quasi)-invariant under a quarter-turn rotation. Discrete Mathematics & Theoretical Computer Science. DMTCS Proceedings vol. AK,...(Proceedings). 1 indexed citations
5.
Beaumont, Olivier, et al.. (2008). Heterogenous dating service with application to rumor spreading. Proceedings - IEEE International Parallel and Distributed Processing Symposium. 2218. 1–10. 1 indexed citations
6.
Duchon, Philippe. (2008). On the link pattern distribution of quarter-turn symmetric FPL configurations. Discrete Mathematics & Theoretical Computer Science. DMTCS Proceedings vol. AJ,...(Proceedings). 3 indexed citations
7.
Duchon, Philippe, et al.. (2006). Broadcast in the rendezvous model. Information and Computation. 204(5). 697–712. 3 indexed citations
8.
Duchon, Philippe, Nicolas Hanusse, Emmanuelle Lebhar, & Nicolas Schabanel. (2006). Could any graph be turned into a small-world?. Theoretical Computer Science. 355(1). 96–103. 27 indexed citations
9.
Duchon, Philippe, Philippe Flajolet, Guy Louchard, & Gilles Schaeffer. (2004). Boltzmann Samplers for the Random Generation of Combinatorial Structures. Combinatorics Probability Computing. 13(4-5). 577–625. 128 indexed citations
10.
Duchon, Philippe. (2000). On the enumeration and generation of generalized Dyck words. Discrete Mathematics. 225(1-3). 121–135. 38 indexed citations
11.
Duchon, Philippe. (1999). Q-grammars and wall polyominoes. Annals of Combinatorics. 3(2-4). 311–321. 24 indexed citations
12.
Duchon, Philippe. (1998). Right-cancellability of a family of operations on binary trees. Discrete Mathematics & Theoretical Computer Science. Vol. 2. 1 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

Rankless by CCL
2026