Aline Parreau

416 total citations
25 papers, 151 citations indexed

About

Aline Parreau is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Aline Parreau has authored 25 papers receiving a total of 151 indexed citations (citations by other indexed papers that have themselves been cited), including 20 papers in Computational Theory and Mathematics, 11 papers in Artificial Intelligence and 4 papers in Computer Networks and Communications. Recurrent topics in Aline Parreau's work include Advanced Graph Theory Research (14 papers), Graph Labeling and Dimension Problems (12 papers) and Artificial Intelligence in Games (8 papers). Aline Parreau is often cited by papers focused on Advanced Graph Theory Research (14 papers), Graph Labeling and Dimension Problems (12 papers) and Artificial Intelligence in Games (8 papers). Aline Parreau collaborates with scholars based in France, Belgium and Finland. Aline Parreau's co-authors include Louis Esperet, Florent Foucaud, Reza Naserasr, Nicolás Bousquet, Sylvain Gravier, George B. Mertzios, Julien Moncel, Bertrand Rémy, Michel Rigo and Stéphan Thomassé and has published in prestigious journals such as Theoretical Computer Science, Discrete Applied Mathematics and Discrete Mathematics.

In The Last Decade

Aline Parreau

22 papers receiving 141 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Aline Parreau France	7	121	44	33	29	27	25	151
Rudini Sampaio Brazil	8	155 1.3×	84 1.9×	16 0.5×	27 0.9×	31 1.1×	49	198
Rudi Pendavingh Netherlands	7	89 0.7×	43 1.0×	19 0.6×	19 0.7×	24 0.9×	26	138
Nicolas Lichiardopol France	7	86 0.7×	65 1.5×	55 1.7×	13 0.4×	6 0.2×	23	118
Piotr Micek Poland	8	137 1.1×	54 1.2×	21 0.6×	25 0.9×	25 0.9×	41	152
Reza Naserasr France	10	224 1.9×	98 2.2×	57 1.7×	29 1.0×	11 0.4×	45	260
E. Sampathkumar India	9	217 1.8×	52 1.2×	27 0.8×	34 1.2×	9 0.3×	31	241
Bartosz Walczak Poland	7	87 0.7×	42 1.0×	13 0.4×	9 0.3×	15 0.6×	27	110
Cláudia Linhares Sales Brazil	8	194 1.6×	97 2.2×	26 0.8×	25 0.9×	11 0.4×	33	219
David Erwin United States	9	198 1.6×	28 0.6×	55 1.7×	32 1.1×	9 0.3×	16	218
Sergio R. Canoy Philippines	9	286 2.4×	23 0.5×	17 0.5×	47 1.6×	6 0.2×	85	311

Countries citing papers authored by Aline Parreau

Since Specialization

Citations

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

Fields of papers citing papers by Aline Parreau

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Aline Parreau

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

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Duchêne, Éric, et al.. (2024). The Maker–Maker domination game in forests. Discrete Applied Mathematics. 348. 6–34. 1 indexed citations

Duchêne, Éric, et al.. (2024). Complexity of Maker–Breaker games on edge sets of graphs. Discrete Applied Mathematics. 361. 502–522.

Duchêne, Éric, et al.. (2024). Smash and grab: The 0 ⋅ 6 scoring game on graphs. Theoretical Computer Science. 990. 114417–114417. 1 indexed citations

Foucaud, Florent, et al.. (2024). On Three Domination-based Identification Problems in Block Graphs. Fundamenta Informaticae. 191(3-4). 197–229.

Duchêne, Éric, et al.. (2023). Bipartite instances of INFLUENCE. Theoretical Computer Science. 982. 114274–114274. 1 indexed citations

Duchêne, Éric, et al.. (2023). Incidence, a scoring positional game on graphs. Discrete Mathematics. 347(8). 113570–113570. 1 indexed citations

Bonnet, Édouard, et al.. (2023). Neighbourhood complexity of graphs of bounded twin-width. European Journal of Combinatorics. 115. 103772–103772. 3 indexed citations

Lévêque, Benjamin, et al.. (2023). Locating-dominating sets in local tournaments. Discrete Applied Mathematics. 337. 14–24. 1 indexed citations

Bousquet, Nicolás, et al.. (2022). Locating-dominating sets: From graphs to oriented graphs. Discrete Mathematics. 346(1). 113124–113124. 6 indexed citations

10.

Foucaud, Florent, et al.. (2020). Domination and location in twin-free digraphs. Discrete Applied Mathematics. 284. 42–52. 5 indexed citations

11.

Dankelmann, Peter, et al.. (2018). Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension. SIAM Journal on Discrete Mathematics. 32(2). 902–918. 6 indexed citations

12.

Duchêne, Éric, et al.. (2017). The switch operators and push-the-button games: a sequential compound\n over rulesets. arXiv (Cornell University).

13.

Foucaud, Florent, et al.. (2017). Identification, location–domination and metric dimension on interval and permutation graphs. I. Bounds. Theoretical Computer Science. 668. 43–58. 16 indexed citations

14.

Gravier, Sylvain, et al.. (2014). Identifying codes in vertex-transitive graphs and strongly regular\n graphs. arXiv (Cornell University). 6 indexed citations

15.

Esperet, Louis & Aline Parreau. (2013). Acyclic edge-coloring using entropy compression. European Journal of Combinatorics. 34(6). 1019–1027. 39 indexed citations

16.

Gonçalves, Daniel, Aline Parreau, & Alexandre Pinlou. (2013). Locally identifying coloring in bounded expansion classes of graphs. Discrete Applied Mathematics. 161(18). 2946–2951. 6 indexed citations

17.

Foucaud, Florent, Iiro Honkala, Tero Laihonen, Aline Parreau, & Guillem Perarnau. (2012). Locally identifying colourings for graphs with given maximum degree. Discrete Mathematics. 312(10). 1832–1837. 6 indexed citations

18.

Delmas, Olivier, Sylvain Gravier, Mickaël Montassier, & Aline Parreau. (2011). On two variations of identifying codes. Discrete Mathematics. 311(17). 1948–1956. 1 indexed citations

19.

Foucaud, Florent, et al.. (2011). Extremal graphs for the identifying code problem. European Journal of Combinatorics. 32(4). 628–638. 17 indexed citations

20.

Bessières, Laurent, Aline Parreau, & Bertrand Rémy. (2009). Géométries à courbure négative ou nulle, groupes discrets et rigidités. 5 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