Nathann Cohen

activity

20092020

most citedColoring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles

14 citations · 34 across the 9 of their papers we have counts for

collaborators

Showing 2017Show all

2 papers · 1 filter

cs.DS2017

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…

math.CO2017

Bispindles in strongly connected digraphs with large chromatic number

N. Cohenn, F. Havet, W. Lochet +1

A $(k_{1} + k_{2})$ -bispindle is the union of $k_{1}$ $(x, y)$ -dipaths and $k_{2}$ $(y, x)$ -dipaths, all these dipaths being pairwise internally disjoint. Recently, Cohen et al. showed that fo…