14 citations · 34 across the 9 of their papers we have counts for
15 papers
Interest Clustering Coefficient: a New Metric for Directed Networks like Twitter
Thibaud Trolliet, Nathann Cohen, Frédéric Giroire +2
We study here the clustering of directed social graphs. The clustering coefficient has been introduced to capture the social phenomena that a friend of a friend tends to be my frie…
Single-crossing Implementation
Nathann Cohenn, Edith Elkind, Foram Lakhani
An election over a finite set of candidates is called single-crossing if, as we sweep through the list of voters from left to right, the relative order of every pair of candidates…
Coverability in 1-VASS with Disequality Tests
Shaull Almagor, Nathann Cohen, Guillermo A. Pérez +2
We study a class of reachability problems in weighted graphs with constraints on the accumulated weight of paths. The problems we study can equivalently be formulated in the model…
Not all partial cubes are -graceful
Nathann Cohen, Matjaž Kovše
It is shown that the graph obtained by merging two vertices of two 4-cycles is not a -graceful partial cube, thus answering in the negative a question by Brešar and Klavžar from…
Complexity Dichotomies for the Minimum F-Overlay Problem
Nathann Cohen, Frédéric Havet, Dorian Mazauric +2
For a (possibly infinite) fixed family of graphs F, we say that a graph G overlays F on a hypergraph H if V(H) is equal to V(G) and the subgraph of G induced by every hyperedge of…
Bispindles in strongly connected digraphs with large chromatic number
N. Cohenn, F. Havet, W. Lochet +1
A -bispindle is the union of -dipaths and -dipaths, all these dipaths being pairwise internally disjoint. Recently, Cohen et al. showed that fo…