André Raspaud

3.2k total citations
132 papers, 1.8k citations indexed

About

André Raspaud is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Electrical and Electronic Engineering. According to data from OpenAlex, André Raspaud has authored 132 papers receiving a total of 1.8k indexed citations (citations by other indexed papers that have themselves been cited), including 122 papers in Computational Theory and Mathematics, 48 papers in Discrete Mathematics and Combinatorics and 25 papers in Electrical and Electronic Engineering. Recurrent topics in André Raspaud's work include Advanced Graph Theory Research (113 papers), Graph Labeling and Dimension Problems (65 papers) and Limits and Structures in Graph Theory (46 papers). André Raspaud is often cited by papers focused on Advanced Graph Theory Research (113 papers), Graph Labeling and Dimension Problems (65 papers) and Limits and Structures in Graph Theory (46 papers). André Raspaud collaborates with scholars based in France, China and Russia. André Raspaud's co-authors include Mickaël Montassier, Éric Sopena, Guillaume Fertin, O. V. Borodin, Weifan Wang, Jaroslav Nešetřil, A. N. Glebov, Min Chen, Xuding Zhu and Alexandr Kostochka and has published in prestigious journals such as Applied Mathematics and Computation, IEEE Transactions on Parallel and Distributed Systems and Discrete Applied Mathematics.

In The Last Decade

André Raspaud

128 papers receiving 1.7k citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
André Raspaud France 24 1.6k 680 374 296 289 132 1.8k
Michael D. Plummer United States 20 1.3k 0.8× 520 0.8× 229 0.6× 138 0.5× 358 1.2× 92 1.5k
Andreas Brandstädt Germany 25 2.3k 1.4× 657 1.0× 272 0.7× 120 0.4× 690 2.4× 110 2.5k
Xuding Zhu Taiwan 29 3.1k 1.9× 1.6k 2.3× 567 1.5× 139 0.5× 251 0.9× 261 3.3k
Van Bang Lê Germany 14 1.3k 0.8× 329 0.5× 154 0.4× 99 0.3× 419 1.4× 77 1.5k
Gerhard Ringel United States 18 1.0k 0.6× 427 0.6× 390 1.0× 361 1.2× 119 0.4× 48 1.5k
Arthur T. White United States 16 624 0.4× 410 0.6× 337 0.9× 128 0.4× 150 0.5× 52 1.1k
Fǎnicǎ Gavril Israel 17 1.2k 0.8× 199 0.3× 183 0.5× 138 0.5× 575 2.0× 35 1.5k
James Oxley United States 19 1.2k 0.7× 547 0.8× 657 1.8× 47 0.2× 279 1.0× 142 1.6k
Jozef Širáň Slovakia 21 704 0.4× 885 1.3× 635 1.7× 86 0.3× 287 1.0× 142 1.5k
Maria Chudnovsky United States 21 1.7k 1.1× 937 1.4× 277 0.7× 84 0.3× 225 0.8× 135 1.9k

Countries citing papers authored by André Raspaud

Since Specialization
Citations

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

Fields of papers citing papers by André Raspaud

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of André Raspaud

This figure shows the co-authorship network connecting the top 25 collaborators of André Raspaud. A scholar is included among the top collaborators of André Raspaud 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 André Raspaud. André Raspaud 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.
Raspaud, André, et al.. (2019). Induced star arboricity and injective edge-coloring of graphs. arXiv (Cornell University). 1 indexed citations
2.
Raspaud, André, et al.. (2018). List star chromatic index of sparse graphs. Discrete Mathematics. 341(7). 1835–1849. 4 indexed citations
3.
Chang, Gerard J., Paul Dorbec, Mickaël Montassier, & André Raspaud. (2012). Generalized power domination of graphs. Discrete Applied Mathematics. 160(12). 1691–1698. 29 indexed citations
4.
Chen, Min & André Raspaud. (2012). Planar graphs without 4- and 5-cycles are acyclically 4-choosable. Discrete Applied Mathematics. 161(7-8). 921–931. 11 indexed citations
5.
Chen, Min, et al.. (2011). Some structural properties of planar graphs and their applications to 3-choosability. Discrete Mathematics. 312(2). 362–373. 1 indexed citations
6.
Borodin, O. V., A. O. Ivanova, Mickaël Montassier, & André Raspaud. (2011). (k,j)-coloring of sparse graphs. Discrete Applied Mathematics. 159(17). 1947–1953. 11 indexed citations
7.
Chen, Min & André Raspaud. (2010). On acyclic 4-choosability of planar graphs without short cycles. Discrete Mathematics. 310(15-16). 2113–2118. 14 indexed citations
8.
Li, Chao, Weifan Wang, & André Raspaud. (2010). Upper bounds on the linear chromatic number of a graph. Discrete Mathematics. 311(4). 232–238. 4 indexed citations
9.
Raspaud, André & Weifan Wang. (2008). On the vertex-arboricity of planar graphs. European Journal of Combinatorics. 29(4). 1064–1075. 37 indexed citations
10.
Montassier, Mickaël, et al.. (2007). (d,1)-total labelling of planar graphs with large girth and high maximum degree. Discrete Mathematics. 307(16). 2141–2151. 21 indexed citations
11.
Esperet, Louis, Mickaël Montassier, & André Raspaud. (2007). Linear choosability of graphs. Discrete Mathematics. 308(17). 3938–3950. 14 indexed citations
12.
Fertin, Guillaume & André Raspaud. (2006). L(p,q) labeling of d-dimensional grids. Discrete Mathematics. 307(16). 2132–2140. 6 indexed citations
13.
Montassier, Mickaël & André Raspaud. (2005). (d,1)‐total labeling of graphs with a given maximum average degree. Journal of Graph Theory. 51(2). 93–109. 25 indexed citations
14.
Comellas, Francesc, Guillaume Fertin, & André Raspaud. (2004). Recursive graphs with small-world scale-free properties. Physical Review E. 69(3). 37104–37104. 69 indexed citations
15.
Fertin, Guillaume & André Raspaud. (2001). k-Neighborhood Broadcasting.. 133–146. 2 indexed citations
16.
Raspaud, André, et al.. (2001). All-to-all wavelength-routing in all-optical compound networks. Discrete Mathematics. 235(1-3). 353–363. 15 indexed citations
17.
Raspaud, André, Ondřej Sýkora, & Imrich Vrt’o. (2000). Congestion and dilation, similarities and differences: A survey.. 269–280. 5 indexed citations
18.
Kostochka, Alexandr, et al.. (1999). On the maximum average degree and the oriented chromatic number of a graph. Discrete Mathematics. 206(1-3). 77–89. 63 indexed citations
19.
Nešetřil, Jaroslav, et al.. (1998). On universal graphs for planar oriented graphs of a given girth. Discrete Mathematics. 188(1-3). 73–85. 11 indexed citations
20.
Nešetřil, Jaroslav, André Raspaud, & Éric Sopena. (1997). Colorings and girth of oriented planar graphs. Discrete Mathematics. 165-166. 519–530. 49 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