William Lochet

According to our database, William Lochet authored at least 31 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable.

Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Detours in directed graphs.

Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Saket Saurabh, Kirill Simonov

J. Comput. Syst. Sci., November, 2023

How to find a good explanation for clustering?

Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov

Artif. Intell., September, 2023

Edge Separators for Graphs Excluding a Minor.

Gwenaël Joret, William Lochet, Michal T. Seweryn

Electron. J. Comb., 2023

FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii.

Sayan Bandyapadhyay, William Lochet, Saket Saurabh

Proceedings of the 39th International Symposium on Computational Geometry, 2023

Minimum-Membership Geometric Set Cover, Revisited.

Sayan Bandyapadhyay, William Lochet, Saket Saurabh, Jie Xue

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022

Parameterized Complexity of Directed Spanner Problems.

Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh, Roohani Sharma

Algorithmica, 2022

Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H<-Minor-Free Graphs.

Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs.

Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

Powers of paths in tournaments.

Nemanja Draganic, François Dross, Jacob Fox, António Girão, Frédéric Havet, Dániel Korándi, William Lochet, David Munhá Correia, Alex D. Scott, Benny Sudakov

Comb. Probab. Comput., 2021

Packing and Covering Balls in Graphs Excluding a Minor.

Nicolas Bousquet, Wouter Cames van Batenburg, Louis Esperet, Gwenaël Joret, William Lochet, Carole Muller, François Pirot

Comb., 2021

Exploiting Dense Structures in Parameterized Complexity.

William Lochet, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

A Polynomial Time Algorithm for the <i>k</i>-Disjoint Shortest Paths Problem.

William Lochet

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

EPTAS for <i>k</i>-means Clustering of Affine Subspaces.

Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

The directed 2-linkage problem with length constraints.

Jørgen Bang-Jensen, Thomas Bellitto, William Lochet, Anders Yeo

Theor. Comput. Sci., 2020

Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture.

Gwenaël Joret, William Lochet

SIAM J. Discret. Math., 2020

EPTAS for k-means Clustering of Affine Subspaces.

Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov

CoRR, 2020

A Polynomial Kernel for Paw-Free Editing.

Eduard Eiben, William Lochet, Saket Saurabh

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

Fault Tolerant Subgraphs with Applications in Kernelization.

William Lochet, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

A Polynomial Kernel for Line Graph Deletion.

Eduard Eiben, William Lochet

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

Immersion of transitive tournaments in digraphs with large minimum outdegree.

William Lochet

J. Comb. Theory, Ser. B, 2019

A proof of the Erdős-Sands-Sauer-Woodrow conjecture.

Nicolas Bousquet, William Lochet, Stéphan Thomassé

J. Comb. Theory, Ser. B, 2019

The shortest disjoint paths problem.

William Lochet

CoRR, 2019

Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number.

Pierre Aboulker, Nathann Cohen, Frédéric Havet, William Lochet, Phablo F. S. Moura, Stéphan Thomassé

Electron. J. Comb., 2019

Exact and Approximate Digraph Bandwidth.

Pallavi Jain, Lawqueen Kanesh, William Lochet, Saket Saurabh, Roohani Sharma

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

2018

Subdivisions of oriented cycles in digraphs with large chromatic number.

Nathann Cohen, Frédéric Havet, William Lochet, Nicolas Nisse

J. Graph Theory, 2018

Progress on the adjacent vertex distinguishing edge colouring conjecture.

Gwenaël Joret, William Lochet

CoRR, 2018

Bispindles in Strongly Connected Digraphs with Large Chromatic Number.

Nathann Cohen, Frédéric Havet, William Lochet, Raul Lopes

Electron. J. Comb., 2018

2017

Bispindle in strongly connected digraphs with large chromatic number.

Nathann Cohen, Frédéric Havet, William Lochet, Raul Lopes

Electron. Notes Discret. Math., 2017

The Structure of Typical Eye-Free Graphs and a Turán-Type Result for Two Weighted Colours.

Peter Keevash, William Lochet

Comb. Probab. Comput., 2017

2016

Equitable Orientations of Sparse Uniform Hypergraphs.

Nathann Cohen, William Lochet

Electron. J. Comb., 2016