default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilliam Lochet
Person information
- affiliation: CNRS at LIRMM, France
- affiliation (former): University of Bergen, Norway
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]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): 20 (2024)- [c16]William Lochet, Roohani Sharma:
Uniform Polynomial Kernel for Deletion to K_{2, p} Minor-Free Graphs. ISAAC 2024: 46:1-46:14 - [c15]Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue:
Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. SODA 2024: 699-711 - [i16]Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov:
Packing Short Cycles. CoRR abs/2410.18878 (2024) - [i15]Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Dániel Marx, Pranabendu Misra, Daniel Neuen, Saket Saurabh, Prafullkumar Tale, Jie Xue:
Robust Contraction Decomposition for Minor-Free Graphs and its Applications. CoRR abs/2412.04145 (2024) - 2023
- [j16]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: 103948 (2023) - [j15]Gwenaël Joret, William Lochet, Michal T. Seweryn:
Edge Separators for Graphs Excluding a Minor. Electron. J. Comb. 30(4) (2023) - [j14]Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Saket Saurabh, Kirill Simonov:
Detours in directed graphs. J. Comput. Syst. Sci. 137: 66-86 (2023) - [c14]Sayan Bandyapadhyay, William Lochet, Saket Saurabh, Jie Xue:
Minimum-Membership Geometric Set Cover, Revisited. SoCG 2023: 11:1-11:14 - [c13]Sayan Bandyapadhyay, William Lochet, Saket Saurabh:
FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii. SoCG 2023: 12:1-12:14 - [i14]Sayan Bandyapadhyay, William Lochet, Saket Saurabh:
FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii. CoRR abs/2303.07923 (2023) - [i13]Sayan Bandyapadhyay, William Lochet, Saket Saurabh, Jie Xue:
Minimum-Membership Geometric Set Cover, Revisited. CoRR abs/2305.03985 (2023) - [i12]Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue:
Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. CoRR abs/2312.01589 (2023) - 2022
- [j13]Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh, Roohani Sharma:
Parameterized Complexity of Directed Spanner Problems. Algorithmica 84(8): 2292-2308 (2022) - [c12]Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov:
How to Find a Good Explanation for Clustering? AAAI 2022: 3904-3912 - [c11]Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue:
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. SoCG 2022: 11:1-11:16 - [c10]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: 2063-2084 - [c9]Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh:
Detours in Directed Graphs. STACS 2022: 29:1-29:16 - [i11]Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh:
Detours in Directed Graphs. CoRR abs/2201.03318 (2022) - [i10]Gwenaël Joret, William Lochet, Michal T. Seweryn:
Edge separators for graphs excluding a minor. CoRR abs/2212.10998 (2022) - 2021
- [j12]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): 299-318 (2021) - [j11]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): 894-898 (2021) - [c8]William Lochet:
A Polynomial Time Algorithm for the k-Disjoint Shortest Paths Problem. SODA 2021: 169-178 - [c7]Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov:
EPTAS for k-means Clustering of Affine Subspaces. SODA 2021: 2649-2659 - [c6]William Lochet, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Exploiting Dense Structures in Parameterized Complexity. STACS 2021: 50:1-50:17 - [i9]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 abs/2111.14196 (2021) - [i8]Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov:
How to Find a Good Explanation for Clustering? CoRR abs/2112.06580 (2021) - 2020
- [j10]Gwenaël Joret, William Lochet:
Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture. SIAM J. Discret. Math. 34(4): 2221-2238 (2020) - [j9]Jørgen Bang-Jensen, Thomas Bellitto, William Lochet, Anders Yeo:
The directed 2-linkage problem with length constraints. Theor. Comput. Sci. 814: 69-73 (2020) - [c5]Eduard Eiben, William Lochet:
A Polynomial Kernel for Line Graph Deletion. ESA 2020: 42:1-42:15 - [c4]William Lochet, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Fault Tolerant Subgraphs with Applications in Kernelization. ITCS 2020: 47:1-47:22 - [c3]Eduard Eiben, William Lochet, Saket Saurabh:
A Polynomial Kernel for Paw-Free Editing. IPEC 2020: 10:1-10:15 - [c2]Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh, Roohani Sharma:
Parameterized Complexity of Directed Spanner Problems. IPEC 2020: 12:1-12:11 - [i7]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 abs/2001.04517 (2020) - [i6]Eduard Eiben, William Lochet:
A Polynomial Kernel for Line Graph Deletion. CoRR abs/2006.15584 (2020) - [i5]Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov:
EPTAS for k-means Clustering of Affine Subspaces. CoRR abs/2010.09580 (2020)
2010 – 2019
- 2019
- [j8]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): 3 (2019) - [j7]William Lochet:
Immersion of transitive tournaments in digraphs with large minimum outdegree. J. Comb. Theory B 134: 350-353 (2019) - [j6]Nicolas Bousquet, William Lochet, Stéphan Thomassé:
A proof of the Erdős-Sands-Sauer-Woodrow conjecture. J. Comb. Theory B 137: 316-319 (2019) - [c1]Pallavi Jain, Lawqueen Kanesh, William Lochet, Saket Saurabh, Roohani Sharma:
Exact and Approximate Digraph Bandwidth. FSTTCS 2019: 18:1-18:15 - [i4]Jørgen Bang-Jensen, Thomas Bellitto, William Lochet, Anders Yeo:
The directed 2-linkage problem with length constraints. CoRR abs/1907.00817 (2019) - [i3]Eduard Eiben, William Lochet, Saket Saurabh:
A Polynomial Kernel for Paw-Free Editing. CoRR abs/1911.03683 (2019) - [i2]William Lochet:
The shortest disjoint paths problem. CoRR abs/1912.10486 (2019) - 2018
- [j5]Nathann Cohen, Frédéric Havet, William Lochet, Raul Lopes:
Bispindles in Strongly Connected Digraphs with Large Chromatic Number. Electron. J. Comb. 25(2): 2 (2018) - [j4]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): 439-456 (2018) - [i1]Gwenaël Joret, William Lochet:
Progress on the adjacent vertex distinguishing edge colouring conjecture. CoRR abs/1804.06104 (2018) - 2017
- [j3]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): 886-910 (2017) - [j2]Nathann Cohen, Frédéric Havet, William Lochet, Raul Lopes:
Bispindle in strongly connected digraphs with large chromatic number. Electron. Notes Discret. Math. 62: 69-74 (2017) - 2016
- [j1]Nathann Cohen, William Lochet:
Equitable Orientations of Sparse Uniform Hypergraphs. Electron. J. Comb. 23(4): 4 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
