Nathann Cohen

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