Nathann Cohen

Orcid: 0000-0002-3341-3712

Affiliations:
  • University of Paris-Sud, LRI


According to our database1, Nathann Cohen authored at least 41 papers between 2009 and 2021.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Interest clustering coefficient: a new metric for directed networks like Twitter.
J. Complex Networks, 2021

2020
Not all partial cubes are Θ-graceful.
Discret. Math., 2020

Study of a Combinatorial Game in Graphs Through Linear Programming.
Algorithmica, 2020

Coverability in 1-VASS with Disequality Tests.
Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019
Backbone colouring and algorithms for TDMA scheduling.
Discret. Math. Theor. Comput. Sci., 2019

Single-crossing Implementation.
CoRR, 2019

Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number.
Electron. J. Comb., 2019

2018
Spy-game on graphs: Complexity and simple topologies.
Theor. Comput. Sci., 2018

Subdivisions of oriented cycles in digraphs with large chromatic number.
J. Graph Theory, 2018

Complexity dichotomies for the MinimumF-Overlay problem.
J. Discrete Algorithms, 2018

Safe sets in graphs: Graph classes and structural parameters.
J. Comb. Optim., 2018

Bispindles in Strongly Connected Digraphs with Large Chromatic Number.
Electron. J. Comb., 2018

On the Minimum Size of an Identifying Code Over All Orientations of a Graph.
Electron. J. Comb., 2018

2017
Applying clique-decomposition for computing Gromov hyperbolicity.
Theor. Comput. Sci., 2017

A polynomial-time algorithm for Outerplanar Diameter Improvement.
J. Comput. Syst. Sci., 2017

Bispindle in strongly connected digraphs with large chromatic number.
Electron. Notes Discret. Math., 2017

Implementing Brouwer's database of strongly regular graphs.
Des. Codes Cryptogr., 2017

Complexity Dichotomies for the Minimum ℱ -Overlay Problem.
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

2016
Finding good 2-partitions of digraphs II. Enumerable properties.
Theor. Comput. Sci., 2016

Connected Tropical Subgraphs in Vertex-Colored Graphs.
Discret. Math. Theor. Comput. Sci., 2016

Equitable Orientations of Sparse Uniform Hypergraphs.
Electron. J. Comb., 2016

Bin Packing with Colocations.
Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

Spy-Game on Graphs.
Proceedings of the 8th International Conference on Fun with Algorithms, 2016

Safe Sets in Graphs: Graph Classes and Structural Parameters.
Proceedings of the Combinatorial Optimization and Applications, 2016

2015
On the proper orientation number of bipartite graphs.
Theor. Comput. Sci., 2015

Induced Decompositions of Highly Dense Graphs.
J. Graph Theory, 2015

On Computing the Gromov Hyperbolicity.
ACM J. Exp. Algorithmics, 2015

From Edge-Coloring to Strong Edge-Coloring.
Electron. J. Comb., 2015

2013
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

2012
Good edge-labelling of graphs.
Discret. Appl. Math., 2012

Bounds and Computation of Irregularity of a Graph
CoRR, 2012

A note on Zagreb indices inequality for trees and unicyclic graphs.
Ars Math. Contemp., 2012

2011
Three years of graphs and music : some results in graph theory and its applications.
PhD thesis, 2011

Tradeoffs in process strategy games with application in the WDM reconfiguration problem.
Theor. Comput. Sci., 2011

The α-Arboricity of Complete Uniform Hypergraphs.
SIAM J. Discret. Math., 2011

Acyclic Edge-Coloring of Planar Graphs.
SIAM J. Discret. Math., 2011

Linear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree.
Graphs Comb., 2011

2010
Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem.
J. Comput. Syst. Sci., 2010

Planar graphs with maximum degree Delta>=9 are (Delta+1)-edge-choosable - A short proof.
Discret. Math., 2010

2009
Acyclic edge-colouring of planar graphs. Extended abstract.
Electron. Notes Discret. Math., 2009

Algorithm for Finding <i>k</i>-Vertex Out-trees and Its Application to <i>k</i>-Internal Out-branching Problem.
Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009


  Loading...