William Lochet

activity

20162022

most citedA proof of the Erdős-Sands-Sauer-Woodrow conjecture

2 citations · 3 across the 4 of their papers we have counts for

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2022

Detours in Directed Graphs

Fedor V. Fomin, Petr A. Golovach, William Lochet +3

We study two "above guarantee" versions of the classical Longest Path problem on undirected and directed graphs and obtain the following results. In the first variant of Longest Pa…

cs.DS2020

EPTAS for $k$ -means Clustering of Affine Subspaces

Eduard Eiben, Fedor V. Fomin, Petr A. Golovach +3

We consider a generalization of the fundamental $k$ -means clustering for data with incomplete or corrupted entries. When data objects are represented by points in $R^{d}$ , a…

cs.DS2020

A Polynomial Kernel for Line Graph Deletion

Eduard Eiben, William Lochet

The line graph of a graph $G$ is the graph $L (G)$ whose vertex set is the edge set of $G$ and there is an edge between $e, f \in E (G)$ if $e$ and $f$ share an endpoint in $G$ . A grap…

Detours in Directed Graphs

EPTAS for k-means Clustering of Affine Subspaces

A Polynomial Kernel for Line Graph Deletion

EPTAS for $k$ -means Clustering of Affine Subspaces