Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem. - Nathann Cohen; Fedor V. Fomin; Gregory Z. Gutin; Eun Jung Kim 002; Saket Saurabh 001; Anders Yeo (COCOON, 2009)

Acyclic edge-colouring of planar graphs. Extended abstract. - Nathann Cohen; Frédéric Havet; Tobias Müller (Electron. Notes Discret. Math., 2009)

Planar graphs with maximum degree Delta>=9 are (Delta+1)-edge-choosable - A short proof. - Nathann Cohen; Frédéric Havet (Discret. Math., 2010)

Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem. - Nathann Cohen; Fedor V. Fomin; Gregory Z. Gutin; Eun Jung Kim 002; Saket Saurabh 001; Anders Yeo (J. Comput. Syst. Sci., 2010)

Linear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree. - Nathann Cohen; Frédéric Havet (Graphs Comb., 2011)

Acyclic Edge-Coloring of Planar Graphs. - Manu Basavaraju; L. Sunil Chandran; Nathann Cohen; Frédéric Havet; Tobias Müller (SIAM J. Discret. Math., 2011)

The α-Arboricity of Complete Uniform Hypergraphs. - Jean-Claude Bermond; Yeow Meng Chee; Nathann Cohen; Xiande Zhang (SIAM J. Discret. Math., 2011)

Tradeoffs in process strategy games with application in the WDM reconfiguration problem. - Nathann Cohen; David Coudert; Dorian Mazauric; Napoleão Nepomuceno; Nicolas Nisse (Theor. Comput. Sci., 2011)

Three years of graphs and music : some results in graph theory and its applications. - Nathann Cohen (2011)

A note on Zagreb indices inequality for trees and unicyclic graphs. - Vesna Andova; Nathann Cohen; Riste Skrekovski (Ars Math. Contemp., 2012)

Bounds and Computation of Irregularity of a Graph - Hosam Abdo; Nathann Cohen; Darko Dimitrov (CoRR, 2012)

Good edge-labelling of graphs. - Júlio Araújo 001; Nathann Cohen; Frédéric Giroire; Frédéric Havet (Discret. Appl. Math., 2012)

Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. - Andrei Asinowski; Jean Cardinal; Nathann Cohen; Sébastien Collette; Thomas Hackl; Michael Hoffmann 001; Kolja B. Knauer; Stefan Langerman; Michal Lason; Piotr Micek; Günter Rote; Torsten Ueckerdt (WADS, 2013)

From Edge-Coloring to Strong Edge-Coloring. - Valentin Borozan; Gerard Jennhwa Chang; Nathann Cohen; Shinya Fujita 001; Narayanan Narayanan; Reza Naserasr; Petru Valicov (Electron. J. Comb., 2015)

On Computing the Gromov Hyperbolicity. - Nathann Cohen; David Coudert; Aurélien Lancin (ACM J. Exp. Algorithmics, 2015)

Induced Decompositions of Highly Dense Graphs. - Nathann Cohen; Zsolt Tuza (J. Graph Theory, 2015)

On the proper orientation number of bipartite graphs. - Júlio Araújo 001; Nathann Cohen; Susanna F. de Rezende; Frédéric Havet; Phablo F. S. Moura (Theor. Comput. Sci., 2015)

Safe Sets in Graphs: Graph Classes and Structural Parameters. - Raquel Águeda; Nathann Cohen; Shinya Fujita 001; Sylvain Legay; Yannis Manoussakis; Yasuko Matsui; Leandro Montero; Reza Naserasr; Yota Otachi; Tadashi Sakuma; Zsolt Tuza; Renyu Xu (COCOA, 2016)

Spy-Game on Graphs. - Nathann Cohen; Mathieu Hilaire; Nicolas Almeida Martins; Nicolas Nisse; Stéphane Pérennes (FUN, 2016)

Bin Packing with Colocations. - Jean-Claude Bermond; Nathann Cohen; David Coudert; Dimitrios Letsios; Ioannis Milis; Stéphane Pérennes; Vassilis Zissimopoulos (WAOA, 2016)

Equitable Orientations of Sparse Uniform Hypergraphs. - Nathann Cohen; William Lochet (Electron. J. Comb., 2016)

Connected Tropical Subgraphs in Vertex-Colored Graphs. - Jean-Alexandre Anglès d'Auriac; Nathann Cohen; Hakim El Mafthoui; Ararat Harutyunyan; Sylvain Legay; Yannis Manoussakis (Discret. Math. Theor. Comput. Sci., 2016)

Finding good 2-partitions of digraphs II. Enumerable properties. - Jørgen Bang-Jensen; Nathann Cohen; Frédéric Havet (Theor. Comput. Sci., 2016)

Complexity Dichotomies for the Minimum ℱ -Overlay Problem. - Nathann Cohen; Frédéric Havet; Dorian Mazauric; Ignasi Sau; Rémi Watrigant (IWOCA, 2017)

Implementing Brouwer's database of strongly regular graphs. - Nathann Cohen; Dmitrii V. Pasechnik (Des. Codes Cryptogr., 2017)

Bispindle in strongly connected digraphs with large chromatic number. - Nathann Cohen; Frédéric Havet; William Lochet; Raul Lopes 001 (Electron. Notes Discret. Math., 2017)

A polynomial-time algorithm for Outerplanar Diameter Improvement. - Nathann Cohen; Daniel Gonçalves 001; Eun Jung Kim 002; Christophe Paul; Ignasi Sau; Dimitrios M. Thilikos; Mathias Weller (J. Comput. Syst. Sci., 2017)

Applying clique-decomposition for computing Gromov hyperbolicity. - Nathann Cohen; David Coudert; Guillaume Ducoffe; Aurélien Lancin (Theor. Comput. Sci., 2017)

On the Minimum Size of an Identifying Code Over All Orientations of a Graph. - Nathann Cohen; Frédéric Havet (Electron. J. Comb., 2018)

Bispindles in Strongly Connected Digraphs with Large Chromatic Number. - Nathann Cohen; Frédéric Havet; William Lochet; Raul Lopes 001 (Electron. J. Comb., 2018)

Safe sets in graphs: Graph classes and structural parameters. - Raquel Águeda; Nathann Cohen; Shinya Fujita 001; Sylvain Legay; Yannis Manoussakis; Yasuko Matsui; Leandro Montero; Reza Naserasr; Hirotaka Ono 001; Yota Otachi; Tadashi Sakuma; Zsolt Tuza; et al. (J. Comb. Optim., 2018)

Complexity dichotomies for the MinimumF-Overlay problem. - Nathann Cohen; Frédéric Havet; Dorian Mazauric; Ignasi Sau; Rémi Watrigant (J. Discrete Algorithms, 2018)

Subdivisions of oriented cycles in digraphs with large chromatic number. - Nathann Cohen; Frédéric Havet; William Lochet; Nicolas Nisse (J. Graph Theory, 2018)

Spy-game on graphs: Complexity and simple topologies. - Nathann Cohen; Nicolas Almeida Martins; Fionn Mc Inerney; Nicolas Nisse; Stéphane Pérennes; Rudini M. Sampaio (Theor. Comput. Sci., 2018)

Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number. - Pierre Aboulker; Nathann Cohen; Frédéric Havet; William Lochet; Phablo F. S. Moura; Stéphan Thomassé (Electron. J. Comb., 2019)

Single-crossing Implementation. - Nathann Cohen; Edith Elkind; Foram Lakhani (CoRR, 2019)

Backbone colouring and algorithms for TDMA scheduling. - Julien Bensmail; Thibaut Blanc; Nathann Cohen; Frédéric Havet; Leonardo S. Rocha 001 (Discret. Math. Theor. Comput. Sci., 2019)

Coverability in 1-VASS with Disequality Tests. - Shaull Almagor; Nathann Cohen; Guillermo A. Pérez 001; Mahsa Shirmohammadi; James Worrell 001 (CONCUR, 2020)

Study of a Combinatorial Game in Graphs Through Linear Programming. - Nathann Cohen; Fionn Mc Inerney; Nicolas Nisse; Stéphane Pérennes (Algorithmica, 2020)

Not all partial cubes are Θ-graceful. - Nathann Cohen; Matjaz Kovse (Discret. Math., 2020)

Interest clustering coefficient: a new metric for directed networks like Twitter. - Thibaud Trolliet; Nathann Cohen; Frédéric Giroire; Luc Hogie; Stéphane Pérennes (J. Complex Networks, 2021)