![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- William Lochet
CNRS at LIRMM, France
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 46 matches
- 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): 20 (2024) - Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue:
Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. SODA 2024: 699-711 - 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: 103948 (2023) - Gwenaël Joret, William Lochet
, Michal T. Seweryn:
Edge Separators for Graphs Excluding a Minor. Electron. J. Comb. 30(4) (2023) - 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) - Sayan Bandyapadhyay, William Lochet
, Saket Saurabh, Jie Xue:
Minimum-Membership Geometric Set Cover, Revisited. SoCG 2023: 11:1-11:14 - 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 - Sayan Bandyapadhyay, William Lochet, Saket Saurabh:
FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii. CoRR abs/2303.07923 (2023) - Sayan Bandyapadhyay, William Lochet, Saket Saurabh, Jie Xue:
Minimum-Membership Geometric Set Cover, Revisited. CoRR abs/2305.03985 (2023) - Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue:
Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. CoRR abs/2312.01589 (2023) - 2022
- 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) - 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 - 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 - 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 - Fedor V. Fomin
, Petr A. Golovach, William Lochet
, Danil Sagunov, Kirill Simonov, Saket Saurabh:
Detours in Directed Graphs. STACS 2022: 29:1-29:16 - Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh:
Detours in Directed Graphs. CoRR abs/2201.03318 (2022) - Gwenaël Joret, William Lochet, Michal T. Seweryn:
Edge separators for graphs excluding a minor. CoRR abs/2212.10998 (2022) - 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): 299-318 (2021) - 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) - 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 - William Lochet
:
A Polynomial Time Algorithm for the k-Disjoint Shortest Paths Problem. SODA 2021: 169-178 - William Lochet
, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Exploiting Dense Structures in Parameterized Complexity. STACS 2021: 50:1-50:17 - 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) - 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
- Gwenaël Joret
, William Lochet:
Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture. SIAM J. Discret. Math. 34(4): 2221-2238 (2020) - 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) - Eduard Eiben
, William Lochet
:
A Polynomial Kernel for Line Graph Deletion. ESA 2020: 42:1-42:15 - 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 - Eduard Eiben
, William Lochet
, Saket Saurabh:
A Polynomial Kernel for Paw-Free Editing. IPEC 2020: 10:1-10:15 - 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
skipping 16 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
retrieved on 2024-08-18 20:25 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint