William Lochet

55 papers A* 11A 4B 3Journal 36Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Packing Short Cycles. ACM Trans. Algorithms Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov
2025	J	`jnl`	Exact and Approximate Digraph Bandwidth. Theory Comput. Syst. Pallavi Jain, Lawqueen Kanesh, William Lochet, Saket Saurabh, Roohani Sharma
2025	J	`jnl`	On a tree-based variant of bandwidth and forbidding simple topological minors. CoRR Hugo Jacob, William Lochet, Christophe Paul
2025	A*	`conf`	PTASes for Euclidean TSP with Unit Disk and Unit Square Neighborhoods. SODA Sayan Bandyapadhyay, Katie Clinch, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2025	A*	`conf`	Packing Short Cycles. SODA Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov
2025	A*	`conf`	Robust Contraction Decomposition for Minor-Free Graphs and Its Applications. ICALP Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Dániel Marx, Pranabendu Misra, Daniel Neuen, Saket Saurabh, Prafullkumar Tale, Jie Xue
2024	A*	`conf`	Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. SODA Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2024	J	`jnl`	Packing Short Cycles. CoRR Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov
2024	J	`jnl`	Robust Contraction Decomposition for Minor-Free Graphs and its Applications. CoRR Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Dániel Marx, Pranabendu Misra, Daniel Neuen, Saket Saurabh, Prafullkumar Tale, Jie Xue
2024	J	`jnl`	True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. ACM Trans. Algorithms Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2024	B	`conf`	Uniform Polynomial Kernel for Deletion to K_{2, p} Minor-Free Graphs. ISAAC William Lochet, Roohani Sharma
2023	J	`jnl`	Detours in directed graphs. J. Comput. Syst. Sci. Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Saket Saurabh, Kirill Simonov
2023	J	`jnl`	Edge Separators for Graphs Excluding a Minor. Electron. J. Comb. Gwenaël Joret, William Lochet, Michal T. Seweryn
2023	J	`jnl`	Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. CoRR Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2023	A*	`conf`	FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii. SoCG Sayan Bandyapadhyay, William Lochet, Saket Saurabh
2023	J	`jnl`	FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii. CoRR Sayan Bandyapadhyay, William Lochet, Saket Saurabh
2023	J	`jnl`	How to find a good explanation for clustering? Artif. Intell. Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
2023	A*	`conf`	Minimum-Membership Geometric Set Cover, Revisited. SoCG Sayan Bandyapadhyay, William Lochet, Saket Saurabh, Jie Xue
2023	J	`jnl`	Minimum-Membership Geometric Set Cover, Revisited. CoRR Sayan Bandyapadhyay, William Lochet, Saket Saurabh, Jie Xue
2022	A	`conf`	Detours in Directed Graphs. STACS Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh
2022	J	`jnl`	Detours in Directed Graphs. CoRR Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh
2022	J	`jnl`	Edge separators for graphs excluding a minor. CoRR Gwenaël Joret, William Lochet, Michal T. Seweryn
2022	A*	`conf`	How to Find a Good Explanation for Clustering? AAAI Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
2022	J	`jnl`	Parameterized Complexity of Directed Spanner Problems. Algorithmica Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh, Roohani Sharma
2022	A*	`conf`	Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H<-Minor-Free Graphs. SODA Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2022	A*	`conf`	True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. SoCG Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2021	A*	`conf`	A Polynomial Time Algorithm for the SODA William Lochet
2021	A*	`conf`	EPTAS for SODA Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov
2021	A	`conf`	Exploiting Dense Structures in Parameterized Complexity. STACS William Lochet, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2021	J	`jnl`	How to Find a Good Explanation for Clustering? CoRR Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
2021	J	`jnl`	Packing and Covering Balls in Graphs Excluding a Minor. Comb. Nicolas Bousquet, Wouter Cames van Batenburg, Louis Esperet, Gwenaël Joret, William Lochet, Carole Muller, François Pirot
2021	J	`jnl`	Powers of paths in tournaments. Comb. Probab. Comput. 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
2021	J	`jnl`	Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H-Minor-Free Graphs. CoRR Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2020	A	`conf`	A Polynomial Kernel for Line Graph Deletion. ESA Eduard Eiben, William Lochet
2020	J	`jnl`	A Polynomial Kernel for Line Graph Deletion. CoRR Eduard Eiben, William Lochet
2020	B	`conf`	A Polynomial Kernel for Paw-Free Editing. IPEC Eduard Eiben, William Lochet, Saket Saurabh
2020	J	`jnl`	EPTAS for k-means Clustering of Affine Subspaces. CoRR Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov
2020	A	`conf`	Fault Tolerant Subgraphs with Applications in Kernelization. ITCS William Lochet, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2020	J	`jnl`	Packing and covering balls in graphs excluding a minor. CoRR Nicolas Bousquet, Wouter Cames van Batenburg, Louis Esperet, Gwenaël Joret, William Lochet, Carole Muller, François Pirot
2020	B	`conf`	Parameterized Complexity of Directed Spanner Problems. IPEC Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh, Roohani Sharma
2020	J	`jnl`	Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture. SIAM J. Discret. Math. Gwenaël Joret, William Lochet
2020	J	`jnl`	The directed 2-linkage problem with length constraints. Theor. Comput. Sci. Jørgen Bang-Jensen, Thomas Bellitto, William Lochet, Anders Yeo
2019	J	`jnl`	A Polynomial Kernel for Paw-Free Editing. CoRR Eduard Eiben, William Lochet, Saket Saurabh
2019	J	`jnl`	A proof of the Erdős-Sands-Sauer-Woodrow conjecture. J. Comb. Theory B Nicolas Bousquet, William Lochet, Stéphan Thomassé
2019	—	`conf`	Exact and Approximate Digraph Bandwidth. FSTTCS Pallavi Jain, Lawqueen Kanesh, William Lochet, Saket Saurabh, Roohani Sharma
2019	J	`jnl`	Immersion of transitive tournaments in digraphs with large minimum outdegree. J. Comb. Theory B William Lochet
2019	J	`jnl`	Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number. Electron. J. Comb. Pierre Aboulker, Nathann Cohen, Frédéric Havet, William Lochet, Phablo F. S. Moura, Stéphan Thomassé
2019	J	`jnl`	The directed 2-linkage problem with length constraints. CoRR Jørgen Bang-Jensen, Thomas Bellitto, William Lochet, Anders Yeo
2019	J	`jnl`	The shortest disjoint paths problem. CoRR William Lochet
2018	J	`jnl`	Bispindles in Strongly Connected Digraphs with Large Chromatic Number. Electron. J. Comb. Nathann Cohen, Frédéric Havet, William Lochet, Raul Lopes
2018	J	`jnl`	Progress on the adjacent vertex distinguishing edge colouring conjecture. CoRR Gwenaël Joret, William Lochet
2018	J	`jnl`	Subdivisions of oriented cycles in digraphs with large chromatic number. J. Graph Theory Nathann Cohen, Frédéric Havet, William Lochet, Nicolas Nisse
2017	J	`jnl`	Bispindle in strongly connected digraphs with large chromatic number. Electron. Notes Discret. Math. Nathann Cohen, Frédéric Havet, William Lochet, Raul Lopes
2017	J	`jnl`	The Structure of Typical Eye-Free Graphs and a Turán-Type Result for Two Weighted Colours. Comb. Probab. Comput. Peter Keevash, William Lochet
2016	J	`jnl`	Equitable Orientations of Sparse Uniform Hypergraphs. Electron. J. Comb. Nathann Cohen, William Lochet