Nathann Cohen

ORCID

Publication Activity (10 Years)

Years Active: 2009-2021
Publications (10 Years): 30

Top Venues

University of Nice Sophia Antipolis, France (PHD)

Education History

University of Nice Sophia Antipolis, France

PHD

Publications

Thibaud Trolliet, Nathann Cohen, Frédéric Giroire, Luc Hogie, Stéphane Pérennes
Interest clustering coefficient: a new metric for directed networks like Twitter. J. Complex Networks 10 (1) (2021)
Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes
Study of a Combinatorial Game in Graphs Through Linear Programming. Algorithmica 82 (2) (2020)
Nathann Cohen, Matjaz Kovse
Not all partial cubes are Θ-graceful. Discret. Math. 343 (10) (2020)
Thibaud Trolliet, Nathann Cohen, Frédéric Giroire, Luc Hogie, Stéphane Pérennes
Interest Clustering Coefficient: A New Metric for Directed Networks Like Twitter. COMPLEX NETWORKS (2) (2020)
Shaull Almagor, Nathann Cohen, Guillermo A. Pérez, Mahsa Shirmohammadi, James Worrell
Coverability in 1-VASS with Disequality Tests. CONCUR (2020)
Thibaud Trolliet, Nathann Cohen, Frédéric Giroire, Luc Hogie, Stéphane Pérennes
Interest Clustering Coefficient: a New Metric for Directed Networks like Twitter. CoRR (2020)
Julien Bensmail, Thibaut Blanc, Nathann Cohen, Frédéric Havet, Leonardo S. Rocha
Backbone colouring and algorithms for TDMA scheduling. Discret. Math. Theor. Comput. Sci. 21 (3) (2019)
Shaull Almagor, Nathann Cohen, Guillermo A. Pérez, Mahsa Shirmohammadi, James Worrell
Coverability in 1-VASS with Disequality Tests. CoRR (2019)
Pierre Aboulker, Nathann Cohen, Frédéric Havet, William Lochet, Phablo F. S. Moura, Stéphan Thomassé
Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number. Electron. J. Comb. 26 (3) (2019)
Nathann Cohen, Edith Elkind, Foram Lakhani
Single-crossing Implementation. CoRR (2019)
Nathann Cohen, Nicolas Almeida Martins, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes, Rudini M. Sampaio
Spy-game on graphs: Complexity and simple topologies. Theor. Comput. Sci. 725 (2018)
Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Hirotaka Ono, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu
Safe sets in graphs: Graph classes and structural parameters. J. Comb. Optim. 36 (4) (2018)
Nathann Cohen, Frédéric Havet, William Lochet, Nicolas Nisse
Subdivisions of oriented cycles in digraphs with large chromatic number. J. Graph Theory 89 (4) (2018)
Nathann Cohen, Frédéric Havet, William Lochet, Raul Lopes
Bispindles in Strongly Connected Digraphs with Large Chromatic Number. Electron. J. Comb. 25 (2) (2018)
Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant
Complexity dichotomies for the MinimumF-Overlay problem. J. Discrete Algorithms (2018)
Nathann Cohen, Frédéric Havet
On the Minimum Size of an Identifying Code Over All Orientations of a Graph. Electron. J. Comb. 25 (1) (2018)
Nathann Cohen, David Coudert, Guillaume Ducoffe, Aurélien Lancin
Applying clique-decomposition for computing Gromov hyperbolicity. Theor. Comput. Sci. 690 (2017)
Nathann Cohen, Dmitrii V. Pasechnik
Implementing Brouwer's database of strongly regular graphs. Des. Codes Cryptogr. 84 (1-2) (2017)
Nathann Cohen, Frédéric Havet, William Lochet, Raul Lopes
Bispindle in strongly connected digraphs with large chromatic number. Electron. Notes Discret. Math. 62 (2017)
Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes
Study of a Combinatorial Game in Graphs Through Linear Programming. ISAAC (2017)
Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant
Complexity Dichotomies for the Minimum F-Overlay Problem. CoRR (2017)
Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller
A polynomial-time algorithm for Outerplanar Diameter Improvement. J. Comput. Syst. Sci. 89 (2017)
Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant
Complexity Dichotomies for the Minimum ℱ -Overlay Problem. IWOCA (2017)
Nathann Cohen, Mathieu Hilaire, Nicolas Almeida Martins, Nicolas Nisse, Stéphane Pérennes
Spy-Game on Graphs. FUN (2016)
Jean-Alexandre Anglès d'Auriac, Nathann Cohen, Hakim El Mafthoui, Ararat Harutyunyan, Sylvain Legay, Yannis Manoussakis
Connected Tropical Subgraphs in Vertex-Colored Graphs. Discret. Math. Theor. Comput. Sci. 17 (3) (2016)
Nathann Cohen, William Lochet
Equitable Orientations of Sparse Uniform Hypergraphs. Electron. J. Comb. 23 (4) (2016)
Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu
Safe Sets in Graphs: Graph Classes and Structural Parameters. COCOA (2016)
Jørgen Bang-Jensen, Nathann Cohen, Frédéric Havet
Finding good 2-partitions of digraphs II. Enumerable properties. Theor. Comput. Sci. 640 (2016)
Jean-Claude Bermond, Nathann Cohen, David Coudert, Dimitrios Letsios, Ioannis Milis, Stéphane Pérennes, Vassilis Zissimopoulos
Bin Packing with Colocations. WAOA (2016)
Nathann Cohen, Dmitrii V. Pasechnik
Implementing Brouwer's database of strongly regular graphs. CoRR (2016)
Nathann Cohen, David Coudert, Aurélien Lancin
On Computing the Gromov Hyperbolicity. ACM J. Exp. Algorithmics 20 (2015)
Nathann Cohen, Zsolt Tuza
Induced Decompositions of Highly Dense Graphs. J. Graph Theory 78 (2) (2015)
Júlio Araújo, Nathann Cohen, Susanna F. de Rezende, Frédéric Havet, Phablo F. S. Moura
On the proper orientation number of bipartite graphs. Theor. Comput. Sci. 566 (2015)
Nathann Cohen, Daniel Gonçalves, Eunjung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller
A Polynomial-Time Algorithm for Outerplanar Diameter Improvement. CSR (2015)
Valentin Borozan, Gerard Jennhwa Chang, Nathann Cohen, Shinya Fujita, Narayanan Narayanan, Reza Naserasr, Petru Valicov
From Edge-Coloring to Strong Edge-Coloring. Electron. J. Comb. 22 (2) (2015)
Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller
A Polynomial-time Algorithm for Outerplanar Diameter Improvement. CoRR (2014)
Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette, Thomas Hackl, Michael Hoffmann, Kolja B. Knauer, Stefan Langerman, Michal Lason, Piotr Micek, Günter Rote, Torsten Ueckerdt
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles CoRR (2013)
Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette, Thomas Hackl, Michael Hoffmann, Kolja B. Knauer, Stefan Langerman, Michal Lason, Piotr Micek, Günter Rote, Torsten Ueckerdt
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. WADS (2013)
Júlio Araújo, Nathann Cohen, Frédéric Giroire, Frédéric Havet
Good edge-labelling of graphs. Discret. Appl. Math. 160 (18) (2012)
Hosam Abdo, Nathann Cohen, Darko Dimitrov
Bounds and Computation of Irregularity of a Graph CoRR (2012)
Vesna Andova, Nathann Cohen, Riste Skrekovski
A note on Zagreb indices inequality for trees and unicyclic graphs. Ars Math. Contemp. 5 (1) (2012)
Manu Basavaraju, L. Sunil Chandran, Nathann Cohen, Frédéric Havet, Tobias Müller
Acyclic Edge-Coloring of Planar Graphs. SIAM J. Discret. Math. 25 (2) (2011)
Jean-Claude Bermond, Yeow Meng Chee, Nathann Cohen, Xiande Zhang
The α-Arboricity of Complete Uniform Hypergraphs. SIAM J. Discret. Math. 25 (2) (2011)
Nathann Cohen, David Coudert, Dorian Mazauric, Napoleão Nepomuceno, Nicolas Nisse
Tradeoffs in process strategy games with application in the WDM reconfiguration problem. Theor. Comput. Sci. 412 (35) (2011)
Nathann Cohen, Frédéric Havet
Linear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree. Graphs Comb. 27 (6) (2011)
Nathann Cohen, Frédéric Havet
Planar graphs with maximum degree Delta>=9 are (Delta+1)-edge-choosable - A short proof. Discret. Math. 310 (21) (2010)
Nathann Cohen, David Coudert, Dorian Mazauric, Napoleão Nepomuceno, Nicolas Nisse
Tradeoffs in Process Strategy Games with Application in the WDM Reconfiguration Problem. FUN (2010)
Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo
Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem. J. Comput. Syst. Sci. 76 (7) (2010)
Júlio Araújo, Nathann Cohen, Frédéric Giroire, Frédéric Havet
Good edge-labelling of graphs. Electron. Notes Discret. Math. 35 (2009)
Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo
-Internal Out-branching Problem. COCOON (2009)
Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo
Algorithm for Finding $k$-Vertex Out-trees and its Application to $k$-Internal Out-branching Problem CoRR (2009)
Nathann Cohen, Frédéric Havet, Tobias Müller
Acyclic edge-colouring of planar graphs. Extended abstract. Electron. Notes Discret. Math. 34 (2009)

Nathann Cohen.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Nathann Cohen