William Lochet

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 46

Top Topics

Polynomial Kernels

Strongly Connected

Parameterized Complexity

Top Venues

Electron. J. Comb.

Publications

Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. SODA (2024)
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. ACM Trans. Algorithms 20 (3) (2024)
Sayan Bandyapadhyay, William Lochet, Saket Saurabh, Jie Xue
Minimum-Membership Geometric Set Cover, Revisited. CoRR (2023)
Sayan Bandyapadhyay, William Lochet, Saket Saurabh
FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii. CoRR (2023)
Sayan Bandyapadhyay, William Lochet, Saket Saurabh, Jie Xue
Minimum-Membership Geometric Set Cover, Revisited. SoCG (2023)
Sayan Bandyapadhyay, William Lochet, Saket Saurabh
FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii. SoCG (2023)
Gwenaël Joret, William Lochet, Michal T. Seweryn
Edge Separators for Graphs Excluding a Minor. Electron. J. Comb. 30 (4) (2023)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
How to find a good explanation for clustering? Artif. Intell. 322 (2023)
Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Saket Saurabh, Kirill Simonov
Detours in directed graphs. J. Comput. Syst. Sci. 137 (2023)
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. CoRR (2023)
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. SoCG (2022)
Gwenaël Joret, William Lochet, Michal T. Seweryn
Edge separators for graphs excluding a minor. CoRR (2022)
Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh, Roohani Sharma
Parameterized Complexity of Directed Spanner Problems. Algorithmica 84 (8) (2022)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
How to Find a Good Explanation for Clustering? AAAI (2022)
Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh
Detours in Directed Graphs. CoRR (2022)
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H<-Minor-Free Graphs. SODA (2022)
Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh
Detours in Directed Graphs. STACS (2022)
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
Powers of paths in tournaments. Comb. Probab. Comput. 30 (6) (2021)
William Lochet, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
Exploiting Dense Structures in Parameterized Complexity. STACS (2021)
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H-Minor-Free Graphs. CoRR (2021)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
How to Find a Good Explanation for Clustering? CoRR (2021)
Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov
-means Clustering of Affine Subspaces. SODA (2021)
William Lochet
-Disjoint Shortest Paths Problem. SODA (2021)
Nicolas Bousquet, Wouter Cames van Batenburg, Louis Esperet, Gwenaël Joret, William Lochet, Carole Muller, François Pirot
Packing and Covering Balls in Graphs Excluding a Minor. Comb. 41 (3) (2021)
Nicolas Bousquet, Wouter Cames van Batenburg, Louis Esperet, Gwenaël Joret, William Lochet, Carole Muller, François Pirot
Packing and covering balls in graphs excluding a minor. CoRR (2020)
Eduard Eiben, William Lochet
A Polynomial Kernel for Line Graph Deletion. CoRR (2020)
Eduard Eiben, William Lochet
A Polynomial Kernel for Line Graph Deletion. ESA (2020)
Eduard Eiben, William Lochet, Saket Saurabh
A Polynomial Kernel for Paw-Free Editing. IPEC (2020)
William Lochet, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi
Fault Tolerant Subgraphs with Applications in Kernelization. ITCS (2020)
Gwenaël Joret, William Lochet
Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture. SIAM J. Discret. Math. 34 (4) (2020)
Jørgen Bang-Jensen, Thomas Bellitto, William Lochet, Anders Yeo
The directed 2-linkage problem with length constraints. Theor. Comput. Sci. 814 (2020)
Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov
EPTAS for k-means Clustering of Affine Subspaces. CoRR (2020)
Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh, Roohani Sharma
Parameterized Complexity of Directed Spanner Problems. IPEC (2020)
Pierre Aboulker, Nathann Cohen, Frédéric Havet, William Lochet, Phablo F. S. Moura, Stéphan Thomassé
Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number. Electron. J. Comb. 26 (3) (2019)
William Lochet
Immersion of transitive tournaments in digraphs with large minimum outdegree. J. Comb. Theory, Ser. B 134 (2019)
Eduard Eiben, William Lochet, Saket Saurabh
A Polynomial Kernel for Paw-Free Editing. CoRR (2019)
Jørgen Bang-Jensen, Thomas Bellitto, William Lochet, Anders Yeo
The directed 2-linkage problem with length constraints. CoRR (2019)
Pallavi Jain, Lawqueen Kanesh, William Lochet, Saket Saurabh, Roohani Sharma
Exact and Approximate Digraph Bandwidth. FSTTCS (2019)
Nicolas Bousquet, William Lochet, Stéphan Thomassé
A proof of the Erdős-Sands-Sauer-Woodrow conjecture. J. Comb. Theory, Ser. B 137 (2019)
William Lochet
The shortest disjoint paths problem. CoRR (2019)
Nathann Cohen, Frédéric Havet, William Lochet, Nicolas Nisse
Subdivisions of oriented cycles in digraphs with large chromatic number. J. Graph Theory 89 (4) (2018)
Nathann Cohen, Frédéric Havet, William Lochet, Raul Lopes
Bispindles in Strongly Connected Digraphs with Large Chromatic Number. Electron. J. Comb. 25 (2) (2018)
Gwenaël Joret, William Lochet
Progress on the adjacent vertex distinguishing edge colouring conjecture. CoRR (2018)
Nathann Cohen, Frédéric Havet, William Lochet, Raul Lopes
Bispindle in strongly connected digraphs with large chromatic number. Electron. Notes Discret. Math. 62 (2017)
Peter Keevash, William Lochet
The Structure of Typical Eye-Free Graphs and a Turán-Type Result for Two Weighted Colours. Comb. Probab. Comput. 26 (6) (2017)
Nathann Cohen, William Lochet
Equitable Orientations of Sparse Uniform Hypergraphs. Electron. J. Comb. 23 (4) (2016)