Nathann Cohen

1.3k total citations · 1 hit paper
29 papers, 766 citations indexed

About

Nathann Cohen is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering and Computer Networks and Communications. According to data from OpenAlex, Nathann Cohen has authored 29 papers receiving a total of 766 indexed citations (citations by other indexed papers that have themselves been cited), including 24 papers in Computational Theory and Mathematics, 9 papers in Electrical and Electronic Engineering and 6 papers in Computer Networks and Communications. Recurrent topics in Nathann Cohen's work include Advanced Graph Theory Research (19 papers), Graph Labeling and Dimension Problems (12 papers) and graph theory and CDMA systems (7 papers). Nathann Cohen is often cited by papers focused on Advanced Graph Theory Research (19 papers), Graph Labeling and Dimension Problems (12 papers) and graph theory and CDMA systems (7 papers). Nathann Cohen collaborates with scholars based in France, Brazil and Austria. Nathann Cohen's co-authors include C. Gregory Plaxton, Donald Varvel, Sanjoy Baruah, Frédéric Havet, Hosam Abdo, Darko Dimitrov, Tobias Müller, David Coudert, Manu Basavaraju and L. Sunil Chandran and has published in prestigious journals such as SHILAP Revista de lepidopterología, Theoretical Computer Science and Discrete Applied Mathematics.

In The Last Decade

Nathann Cohen

27 papers receiving 701 citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Proportionate progress: A notion of fairness in resource allocation

1996 508 citations Sanjoy Baruah, Nathann Cohen et al. profile →

Peers

Nathann Cohen

HA

CNC

CTM

DMC

GT

Sourav Chakraborty United States

David P. Jacobs United States

Philippe Clauss France

Jinfeng Liu China

Jean‐Jacques Pansiot France

Dominique Sotteau France

Rossella Petreschi Italy

A. J. M. van Gasteren Netherlands

M. Dowd United States

Naomi Nishimura Canada

Sourav Chakraborty United States

Nathann Cohen

124 ×0.2

HA

198 ×0.5

CNC

188 ×0.7

CTM

73 ×1.1

DMC

29 ×0.5

GT

Citations per year, relative to Nathann Cohen Nathann Cohen (= 1×) peers Sourav Chakraborty

Countries citing papers authored by Nathann Cohen

Since Specialization

Citations

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

Fields of papers citing papers by Nathann Cohen

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Nathann Cohen

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

1.

Bensmail, Julien, et al.. (2019). Backbone colouring and algorithms for TDMA scheduling. SHILAP Revista de lepidopterología.

2.

Cohen, Nathann. (2019). Several Graph problems and their Linear Program formulations. HAL (Le Centre pour la Communication Scientifique Directe). 5 indexed citations

3.

Cohen, Nathann, Shinya Fujita, Sylvain Legay, et al.. (2017). Safe sets in graphs: Graph classes and structural parameters. Journal of Combinatorial Optimization. 36(4). 1221–1242. 13 indexed citations

4.

Cohen, Nathann, et al.. (2017). Spy-game on graphs: Complexity and simple topologies. Theoretical Computer Science. 725. 1–15. 3 indexed citations

5.

Cohen, Nathann, et al.. (2017). Applying clique-decomposition for computing Gromov hyperbolicity. Theoretical Computer Science. 690. 114–139. 15 indexed citations

6.

Bang‐Jensen, Jørgen, Nathann Cohen, & Frédéric Havet. (2016). Finding good 2-partitions of digraphs II. Enumerable properties. Theoretical Computer Science. 640. 1–19. 8 indexed citations

7.

Cohen, Nathann, et al.. (2016). Subidvisions de cycles orientés dans les graphes dirigés de fort nombre chromatique. HAL (Le Centre pour la Communication Scientifique Directe). 8 indexed citations

8.

Cohen, Nathann, et al.. (2016). Connected Tropical Subgraphs in Vertex-Colored Graphs. Discrete Mathematics & Theoretical Computer Science. Vol. 17 no. 3(Graph Theory). 5 indexed citations

9.

Cohen, Nathann, et al.. (2015). On Computing the Gromov Hyperbolicity. ACM Journal of Experimental Algorithmics. 20. 1–18. 7 indexed citations

10.

Cohen, Nathann, et al.. (2014). On the proper orientation number of bipartite graphs. Theoretical Computer Science. 566. 59–75. 8 indexed citations

11.

Cohen, Nathann & Źsolt Tuza. (2014). Induced Decompositions of Highly Dense Graphs. Journal of Graph Theory. 78(2). 97–107. 2 indexed citations

12.

Abdo, Hosam, Nathann Cohen, & Darko Dimitrov. (2014). Graphs with maximal irregularity. Filomat. 28(7). 1315–1322. 37 indexed citations

13.

Cohen, Nathann, Thierry Dumont, Laurent Fousse, et al.. (2013). Calcul mathématique avec Sage. SPIRE - Sciences Po Institutional REpository. 468. 2 indexed citations

14.

Cohen, Nathann, et al.. (2011). Good edge-labelling of graphs. Discrete Applied Mathematics. 160(18). 2502–2513. 9 indexed citations

15.

Bermond, J, Yeow Meng Chee, Nathann Cohen, & Xiaofeng Zhang. (2011). The α-Arboricity of Complete Uniform Hypergraphs. SIAM Journal on Discrete Mathematics. 25(2). 600–610. 3 indexed citations

16.

Basavaraju, Manu, L. Sunil Chandran, Nathann Cohen, Frédéric Havet, & Tobias Müller. (2011). Acyclic Edge-Coloring of Planar Graphs. SIAM Journal on Discrete Mathematics. 25(2). 463–478. 31 indexed citations

17.

Cohen, Nathann & Frédéric Havet. (2010). Planar graphs with maximum degree Δ≥9 are (Δ+1)-edge-choosable—A short proof. Discrete Mathematics. 310(21). 3049–3051. 7 indexed citations

18.

Cohen, Nathann, et al.. (2009). Good edge-labelling of graphs. Electronic Notes in Discrete Mathematics. 35. 275–280. 1 indexed citations

19.

Cohen, Nathann, Frédéric Havet, & Tobias Mueller. (2009). Acyclic edge-colouring of planar graphs. HAL (Le Centre pour la Communication Scientifique Directe). 25(2). 8 indexed citations

20.

Baruah, Sanjoy, Nathann Cohen, C. Gregory Plaxton, & Donald Varvel. (1993). Proportionate progress. 345–354. 55 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