Equitable Orientations of Sparse Uniform Hypergraphs. - Nathann Cohen; William Lochet (Electron. J. Comb., 2016)

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)

Bispindle in strongly connected digraphs with large chromatic number. - Nathann Cohen; Frédéric Havet; William Lochet; Raul Lopes 001 (Electron. Notes Discret. Math., 2017)

Bispindles in Strongly Connected Digraphs with Large Chromatic Number. - Nathann Cohen; Frédéric Havet; William Lochet; Raul Lopes 001 (Electron. J. Comb., 2018)

Progress on the adjacent vertex distinguishing edge colouring conjecture. - Gwenaël Joret; William Lochet (CoRR, 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)

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)

The shortest disjoint paths problem. - William Lochet (CoRR, 2019)

A proof of the Erdős-Sands-Sauer-Woodrow conjecture. - Nicolas Bousquet 001; William Lochet; Stéphan Thomassé (J. Comb. Theory B, 2019)

Immersion of transitive tournaments in digraphs with large minimum outdegree. - William Lochet (J. Comb. Theory B, 2019)

A Polynomial Kernel for Line Graph Deletion. - Eduard Eiben; William Lochet (ESA, 2020)

Fault Tolerant Subgraphs with Applications in Kernelization. - William Lochet; Daniel Lokshtanov; Pranabendu Misra; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (ITCS, 2020)

A Polynomial Kernel for Paw-Free Editing. - Eduard Eiben; William Lochet; Saket Saurabh 001 (IPEC, 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)

Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture. - Gwenaël Joret; William Lochet (SIAM J. Discret. Math., 2020)

The directed 2-linkage problem with length constraints. - Jørgen Bang-Jensen; Thomas Bellitto; William Lochet; Anders Yeo (Theor. Comput. Sci., 2020)

EPTAS for k-means Clustering of Affine Subspaces. - Eduard Eiben; Fedor V. Fomin; Petr A. Golovach; William Lochet; Fahad Panolan; Kirill Simonov (SODA, 2021)

A Polynomial Time Algorithm for the k-Disjoint Shortest Paths Problem. - William Lochet (SODA, 2021)

Exploiting Dense Structures in Parameterized Complexity. - William Lochet; Daniel Lokshtanov; Saket Saurabh 001; Meirav Zehavi (STACS, 2021)

Packing and Covering Balls in Graphs Excluding a Minor. - Nicolas Bousquet 001; Wouter Cames van Batenburg; Louis Esperet; Gwenaël Joret; William Lochet; Carole Muller; François Pirot (Comb., 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)

Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H<-Minor-Free Graphs. - Sayan Bandyapadhyay; William Lochet; Daniel Lokshtanov; Saket Saurabh 001; Jie Xue 003 (SODA, 2022)

Parameterized Complexity of Directed Spanner Problems. - Fedor V. Fomin; Petr A. Golovach; William Lochet; Pranabendu Misra; Saket Saurabh 001; Roohani Sharma (Algorithmica, 2022)

Minimum-Membership Geometric Set Cover, Revisited. - Sayan Bandyapadhyay; William Lochet; Saket Saurabh 001; Jie Xue 003 (SoCG, 2023)

FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii. - Sayan Bandyapadhyay; William Lochet; Saket Saurabh 001 (SoCG, 2023)

Edge Separators for Graphs Excluding a Minor. - Gwenaël Joret; William Lochet; Michal T. Seweryn (Electron. J. Comb., 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., 2023)

Detours in directed graphs. - Fedor V. Fomin; Petr A. Golovach; William Lochet; Danil Sagunov; Saket Saurabh 001; Kirill Simonov (J. Comput. Syst. Sci., 2023)

Uniform Polynomial Kernel for Deletion to K_{2, p} Minor-Free Graphs. - William Lochet; Roohani Sharma (ISAAC, 2024)

Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. - Sayan Bandyapadhyay; William Lochet; Daniel Lokshtanov; Saket Saurabh 001; Jie Xue 003 (SODA, 2024)

True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. - Sayan Bandyapadhyay; William Lochet; Daniel Lokshtanov; Saket Saurabh 001; Jie Xue 003 (ACM Trans. Algorithms, 2024)

Robust Contraction Decomposition for Minor-Free Graphs and Its Applications. - Sayan Bandyapadhyay; William Lochet; Daniel Lokshtanov; Dániel Marx; Pranabendu Misra; Daniel Neuen; Saket Saurabh 001; Prafullkumar Tale; Jie Xue 003 (ICALP, 2025)

PTASes for Euclidean TSP with Unit Disk and Unit Square Neighborhoods. - Sayan Bandyapadhyay; Katie Clinch; William Lochet; Daniel Lokshtanov; Saket Saurabh 001; Jie Xue 003 (SODA, 2025)

Packing Short Cycles. - Matthias Bentert; Fedor V. Fomin; Petr A. Golovach; Tuukka Korhonen; William Lochet; Fahad Panolan; M. S. Ramanujan 001; Saket Saurabh 001; Kirill Simonov (SODA, 2025)

On a tree-based variant of bandwidth and forbidding simple topological minors. - Hugo Jacob 001; William Lochet; Christophe Paul (CoRR, 2025)

Exact and Approximate Digraph Bandwidth. - Pallavi Jain 001; Lawqueen Kanesh; William Lochet; Saket Saurabh 001; Roohani Sharma (Theory Comput. Syst., 2025)