I agree that this site is using cookies. You can find further informations here.
X
Cohen, Nathann
279  results:
Search for persons X
?
1

Interest clustering coefficient: a new metric for directed ..:

Trolliet, Thibaud ; Cohen, Nathann ; Giroire, Frédéric...
Journal of Complex Networks.  10 (2021)  1 - p. , 2021
Link: https://doi.org/10.1093/..
 
?
2

Interest Clustering Coefficient: A New Metric for Directed ..:

, In: Studies in Computational Intelligence; Complex Networks & Their Applications IX,
Trolliet, Thibaud ; Cohen, Nathann ; Giroire, Frédéric.. - p. 597-609 , 2021
Link: https://doi.org/10.1007/..
 
?
3

Not all partial cubes are Θ-graceful:

Cohen, Nathann ; Kovše, Matjaž
Discrete Mathematics.  343 (2020)  10 - p. 112031 , 2020
Link: https://doi.org/10.1016/..
 
?
4

Study of a Combinatorial Game in Graphs Through Linear Prog..:

Cohen, Nathann ; Mc Inerney, Fionn ; Nisse, Nicolas.
Algorithmica.  82 (2018)  2 - p. 212-244 , 2018
Link: https://doi.org/10.1007/..
 
?
5

Complexity dichotomies for the Minimum F-Overlay problem:

Cohen, Nathann ; Havet, Frédéric ; Mazauric, Dorian..
Journal of Discrete Algorithms.  52-53 (2018)  - p. 133-142 , 2018
Link: https://doi.org/10.1016/..
 
?
6

Subdivisions of oriented cycles in digraphs with large chro..:

Cohen, Nathann ; Havet, Frédéric ; Lochet, William.
Journal of Graph Theory.  89 (2018)  4 - p. 439-456 , 2018
Link: https://doi.org/10.1002/..
 
?
7

Spy-game on graphs: Complexity and simple topologies:

Cohen, Nathann ; Martins, Nícolas A. ; Mc Inerney, Fionn...
Theoretical Computer Science.  725 (2018)  - p. 1-15 , 2018
Link: https://doi.org/10.1016/..
 
?
8

A polynomial-time algorithm for Outerplanar Diameter Improv..:

Cohen, Nathann ; Gonçalves, Daniel ; Kim, Eun Jung...
Journal of Computer and System Sciences.  89 (2017)  - p. 315-327 , 2017
Link: https://doi.org/10.1016/..
 
?
9

Applying clique-decomposition for computing Gromov hyperbol..:

Cohen, Nathann ; Coudert, David ; Ducoffe, Guillaume.
Theoretical Computer Science.  690 (2017)  - p. 114-139 , 2017
Link: https://doi.org/10.1016/..
 
?
10

Bispindle in strongly connected digraphs with large chromat..:

Cohen, Nathann ; Havet, Frédéric ; Lochet, William.
Electronic Notes in Discrete Mathematics.  62 (2017)  - p. 69-74 , 2017
Link: https://doi.org/10.1016/..
 
?
11

Safe sets in graphs: Graph classes and structural parameter:

Águeda, Raquel ; Cohen, Nathann ; Fujita, Shinya...
Journal of Combinatorial Optimization.  36 (2017)  4 - p. 1221-1242 , 2017
Link: https://doi.org/10.1007/..
 
?
12

Finding good 2-partitions of digraphs II. Enumerable proper..:

Bang-Jensen, J. ; Cohen, Nathann ; Havet, Frédéric
Theoretical Computer Science.  640 (2016)  - p. 1-19 , 2016
Link: https://doi.org/10.1016/..
 
?
13

Implementing Brouwer's database of strongly regular graphs:

Cohen, Nathann ; Pasechnik, Dmitrii V.
Designs, Codes and Cryptography.  84 (2016)  1-2 - p. 223-235 , 2016
Link: https://doi.org/10.1007/..
 
?
14

On the proper orientation number of bipartite graphs:

Araujo, Julio ; Cohen, Nathann ; de Rezende, Susanna F...
Theoretical Computer Science.  566 (2015)  - p. 59-75 , 2015
Link: https://doi.org/10.1016/..
 
?
15

On Computing the Gromov Hyperbolicity:

Cohen, Nathann ; Coudert, David ; Lancin, Aurélien
Journal of Experimental Algorithmics (JEA).  20 (2015)  20 - p. 1-18 , 2015
Link: https://dl.acm.org/doi/1..
 
1-15