M. Delest

661 total citations
14 papers, 356 citations indexed

About

M. Delest is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Geometry and Topology. According to data from OpenAlex, M. Delest has authored 14 papers receiving a total of 356 indexed citations (citations by other indexed papers that have themselves been cited), including 9 papers in Discrete Mathematics and Combinatorics, 6 papers in Computational Theory and Mathematics and 4 papers in Geometry and Topology. Recurrent topics in M. Delest's work include Advanced Combinatorial Mathematics (9 papers), semigroups and automata theory (5 papers) and Data Visualization and Analytics (2 papers). M. Delest is often cited by papers focused on Advanced Combinatorial Mathematics (9 papers), semigroups and automata theory (5 papers) and Data Visualization and Analytics (2 papers). M. Delest collaborates with scholars based in France, Australia and Canada. M. Delest's co-authors include Gérard Viennot, Jean‐Philippe Domenger, Dominique Gouyou-Beauchamps, Jenny Benois‐Pineau, Fanny Chevalier, David Auber, Tamara Munzner, Andrew Conway, A J Guttmann and Serge Dulucq and has published in prestigious journals such as Pattern Recognition Letters, Theoretical Computer Science and Mathematical and Computer Modelling.

In The Last Decade

M. Delest

14 papers receiving 329 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
M. Delest France 9 217 126 76 68 65 14 356
Dominique Gouyou-Beauchamps France 7 213 1.0× 157 1.2× 82 1.1× 77 1.1× 38 0.6× 17 332
Criel Merino Mexico 9 135 0.6× 154 1.2× 92 1.2× 30 0.4× 114 1.8× 23 293
Svante Linusson Sweden 10 201 0.9× 137 1.1× 120 1.6× 68 1.0× 77 1.2× 40 334
Martin Loebl Czechia 11 119 0.5× 222 1.8× 62 0.8× 12 0.2× 79 1.2× 58 414
Caroline J. Klivans United States 9 117 0.5× 229 1.8× 55 0.7× 70 1.0× 153 2.4× 22 320
Art M. Duval United States 11 145 0.7× 220 1.7× 68 0.9× 111 1.6× 164 2.5× 27 386
Olivier Bernardi United States 13 185 0.9× 93 0.7× 210 2.8× 49 0.7× 90 1.4× 34 357
Cyril Banderier France 9 317 1.5× 175 1.4× 203 2.7× 132 1.9× 80 1.2× 24 542
Dirk Vertigan United States 15 298 1.4× 543 4.3× 96 1.3× 45 0.7× 227 3.5× 30 752
Serguei Norine United States 10 255 1.2× 374 3.0× 69 0.9× 60 0.9× 245 3.8× 27 492

Countries citing papers authored by M. Delest

Since Specialization
Citations

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

Fields of papers citing papers by M. Delest

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of M. Delest

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

All Works

14 of 14 papers shown
1.
Chevalier, Fanny, Jean‐Philippe Domenger, Jenny Benois‐Pineau, & M. Delest. (2007). Retrieval of objects in video by similarity based on graph matching. Pattern Recognition Letters. 28(8). 939–949. 18 indexed citations
2.
Delest, M., Tamara Munzner, David Auber, & Jean‐Philippe Domenger. (2005). Exploring InfoVis Publication History with Tulip. r10–r10. 11 indexed citations
3.
Auber, David & M. Delest. (2003). A clustering algorithm for huge trees. Advances in Applied Mathematics. 31(1). 46–60. 3 indexed citations
4.
Conway, Andrew, A J Guttmann, & M. Delest. (1997). The number of three-choice polygons. Mathematical and Computer Modelling. 26(8-10). 51–58. 10 indexed citations
5.
Delest, M., et al.. (1995). Parallelogram Polyominoes and Corners. Journal of Symbolic Computation. 20(5-6). 503–515. 4 indexed citations
6.
Delest, M., et al.. (1993). Enumeration of skew Ferrers diagrams. Discrete Mathematics. 112(1-3). 65–79. 34 indexed citations
7.
Delest, M., et al.. (1992). Attribute grammars are useful for combinatorics. Theoretical Computer Science. 98(1). 65–76. 12 indexed citations
8.
Delest, M.. (1991). Polyominoes and animals: Some recent results. Journal of Mathematical Chemistry. 8(1). 3–18. 26 indexed citations
9.
Delest, M.. (1991). Enumeration of polyominoes using Macsyma. Theoretical Computer Science. 79(1). 209–226. 2 indexed citations
10.
Delest, M., et al.. (1991). Introduction aux polyèdres en combinatoire d'après E. Ehrhart et R. Stanley. RAIRO - Theoretical Informatics and Applications. 25(3). 273–292. 1 indexed citations
11.
Delest, M., et al.. (1988). An analogue to Robinson-Schensted correspondence for oscillating tableaux.. 20. 7 indexed citations
12.
Delest, M.. (1988). Generating functions for column-convex polyominoes. Journal of Combinatorial Theory Series A. 48(1). 12–31. 24 indexed citations
13.
Delest, M., et al.. (1987). Enumeration of parallelogram polyominoes with given bond and site perimeter. Graphs and Combinatorics. 3(1). 325–339. 19 indexed citations
14.
Delest, M. & Gérard Viennot. (1984). Algebraic languages and polyominoes enumeration. Theoretical Computer Science. 34(1-2). 169–206. 185 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