Julien Moncel

568 total citations
22 papers, 222 citations indexed

About

Julien Moncel is a scholar working on Computer Networks and Communications, Artificial Intelligence and Computational Theory and Mathematics. According to data from OpenAlex, Julien Moncel has authored 22 papers receiving a total of 222 indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Computer Networks and Communications, 11 papers in Artificial Intelligence and 10 papers in Computational Theory and Mathematics. Recurrent topics in Julien Moncel's work include Advanced Graph Theory Research (10 papers), Coding theory and cryptography (9 papers) and Interconnection Networks and Systems (8 papers). Julien Moncel is often cited by papers focused on Advanced Graph Theory Research (10 papers), Coding theory and cryptography (9 papers) and Interconnection Networks and Systems (8 papers). Julien Moncel collaborates with scholars based in France, Israel and Germany. Julien Moncel's co-authors include Sylvain Gravier, Clifford Smyth, Antoine Lobstein, Miklós Ruszinkó, Alan Frieze, Ryan R. Martin, Marc Daniel, Michel Mollard, Yael Ben‐Haim and Aline Parreau and has published in prestigious journals such as Omega, Computers & Industrial Engineering and Theoretical Computer Science.

In The Last Decade

Julien Moncel

21 papers receiving 210 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Julien Moncel France	10	130	124	86	75	43	22	222
Somnath Sikdar Germany	11	77 0.6×	238 1.9×	31 0.4×	36 0.5×	18 0.4×	23	264
Yota Otachi Japan	9	104 0.8×	196 1.6×	26 0.3×	27 0.4×	10 0.2×	66	244
Carme Àlvarez Spain	8	114 0.9×	102 0.8×	32 0.4×	64 0.9×	6 0.1×	32	220
Miwako Mishima Japan	8	146 1.1×	58 0.5×	336 3.9×	308 4.1×	49 1.1×	24	359
Changhong Lü China	10	98 0.8×	275 2.2×	107 1.2×	29 0.4×	12 0.3×	53	326
Iliya Bouyukliev Bulgaria	10	90 0.7×	54 0.4×	217 2.5×	259 3.5×	11 0.3×	47	283
Geevarghese Philip India	8	54 0.4×	158 1.3×	14 0.2×	37 0.5×	17 0.4×	32	193
Maximilien Gadouleau United Kingdom	11	240 1.8×	65 0.5×	197 2.3×	167 2.2×	41 1.0×	45	325
Gwenaël Joret Belgium	10	47 0.4×	182 1.5×	26 0.3×	37 0.5×	15 0.3×	55	242
Miki Hermann France	7	63 0.5×	185 1.5×	10 0.1×	126 1.7×	16 0.4×	24	251

Countries citing papers authored by Julien Moncel

Since Specialization

Citations

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

Fields of papers citing papers by Julien Moncel

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Julien Moncel

This figure shows the co-authorship network connecting the top 25 collaborators of Julien Moncel. A scholar is included among the top collaborators of Julien Moncel 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 Julien Moncel. Julien Moncel 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

Gravier, Sylvain, et al.. (2018). Octal games on graphs: The game 0.33 on subdivided stars and bistars. Theoretical Computer Science. 746. 19–35. 2 indexed citations

Moncel, Julien, et al.. (2016). A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs. Discrete Applied Mathematics. 208. 27–40.

Finke, Gerd, et al.. (2016). Unified matrix approach to solve production-maintenance problems on a single machine. Omega. 66. 140–146. 5 indexed citations

Moncel, Julien, et al.. (2012). Generic algorithms for some decision problems on fasciagraphs and rotagraphs. Discrete Mathematics. 312(17). 2707–2719. 6 indexed citations

Brauner, Nadia, et al.. (2012). Dense and sparse graph partition. Discrete Applied Mathematics. 160(16-17). 2389–2396. 5 indexed citations

Gravier, Sylvain, et al.. (2012). New results on variants of covering codes in Sierpiński graphs. Designs Codes and Cryptography. 69(2). 181–188. 12 indexed citations

Duchêne, Éric, Sylvain Gravier, & Julien Moncel. (2009). New results about impartial solitaire clobber. RAIRO - Operations Research. 43(4). 463–482. 3 indexed citations

Laihonen, Tero & Julien Moncel. (2008). On graphs admitting t-ID codes.. Australas. J Comb.. 41. 81–92. 2 indexed citations

Ben‐Haim, Yael, Sylvain Gravier, Antoine Lobstein, & Julien Moncel. (2008). Adaptive identification in graphs. Journal of Combinatorial Theory Series A. 115(7). 1114–1126. 7 indexed citations

10.

Gravier, Sylvain, et al.. (2008). Identifying Codes of Cartesian Product of Two Cliques of the Same Size. The Electronic Journal of Combinatorics. 15(1). 15 indexed citations

11.

Gravier, Sylvain, Julien Moncel, & Charles Payan. (2006). A generalization of the pentomino exclusion problem: Dislocation of graphs. Discrete Mathematics. 307(3-5). 435–444. 3 indexed citations

12.

Frieze, Alan, Ryan R. Martin, Julien Moncel, Miklós Ruszinkó, & Clifford Smyth. (2006). Codes identifying sets of vertices in random networks. Discrete Mathematics. 307(9-10). 1094–1107. 24 indexed citations

13.

Moncel, Julien. (2006). On graphs on n vertices having an identifying code of cardinality⌈log2(n+1)⌉. Discrete Applied Mathematics. 154(14). 2032–2039. 15 indexed citations

14.

Charon, Irène, Sylvain Gravier, Olivier Hudry, et al.. (2006). A linear algorithm for minimum 1-identifying codes in oriented trees. Discrete Applied Mathematics. 154(8). 1246–1253. 12 indexed citations

15.

Gravier, Sylvain & Julien Moncel. (2006). On graphs having a V⧹{x} set as an identifying code. Discrete Mathematics. 307(3-5). 432–434. 20 indexed citations

16.

Moncel, Julien. (2006). Constructing codes identifying sets of vertices. Designs Codes and Cryptography. 41(1). 23–31. 3 indexed citations

17.

Gravier, Sylvain, et al.. (2005). Identifying codes of cycles. European Journal of Combinatorics. 27(5). 767–776. 28 indexed citations

18.

Moncel, Julien. (2005). Monotonicity of the minimum cardinality of an identifying code in the hypercube. Discrete Applied Mathematics. 154(6). 898–899. 13 indexed citations

19.

Gravier, Sylvain & Julien Moncel. (2005). Construction of Codes Identifying Sets of Vertices. The Electronic Journal of Combinatorics. 12(1). 21 indexed citations

20.

Daniel, Marc, Sylvain Gravier, & Julien Moncel. (2004). Identifying codes in some subgraphs of the square lattice. Theoretical Computer Science. 319(1-3). 411–421. 13 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