Folgen
Lochet William
Lochet William
CNRS, LIRMM, Université de Montpellier, France
Bestätigte E-Mail-Adresse bei lirmm.fr - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Subdivisions in digraphs of large out-degree or large dichromatic number
P Aboulker, N Cohen, F Havet, W Lochet, PFS Moura, S Thomassé
arXiv preprint arXiv:1610.00876, 2016
332016
A Polynomial Time Algorithm for the k-Disjoint Shortest Paths Problem
W Lochet
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
242021
Subdivisions of oriented cycles in digraphs with large chromatic number
N Cohen, F Havet, W Lochet, N Nisse
Journal of Graph Theory 89 (4), 439-456, 2018
202018
How to find a good explanation for clustering?
S Bandyapadhyay, FV Fomin, PA Golovach, W Lochet, N Purohit, ...
Artificial Intelligence, 103948, 2023
182023
Progress on the adjacent vertex distinguishing edge coloring conjecture
G Joret, W Lochet
SIAM Journal on Discrete Mathematics 34 (4), 2221-2238, 2020
152020
A polynomial kernel for paw-free editing
E Eiben, W Lochet, S Saurabh
arXiv preprint arXiv:1911.03683, 2019
102019
EPTAS for k-means Clustering of Affine Subspaces
E Eiben, FV Fomin, PA Golovach, W Lochet, F Panolan, K Simonov
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
92021
A proof of the Erdős–Sands–Sauer–Woodrow conjecture
N Bousquet, W Lochet, S Thomassé
Journal of Combinatorial Theory, Series B 137, 316-319, 2019
92019
Detours in directed graphs
FV Fomin, PA Golovach, W Lochet, D Sagunov, S Saurabh, K Simonov
Journal of Computer and System Sciences 137, 66-86, 2023
82023
FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii
S Bandyapadhyay, W Lochet, S Saurabh
arXiv preprint arXiv:2303.07923, 2023
82023
Immersion of transitive tournaments in digraphs with large minimum outdegree
W Lochet
Journal of Combinatorial Theory, Series B 134, 350-353, 2019
82019
Powers of paths in tournaments
N Draganić, F Dross, J Fox, A Girão, F Havet, D Korándi, W Lochet, ...
Combinatorics, Probability and Computing 30 (6), 894-898, 2021
72021
Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H-Minor-Free Graphs
S Bandyapadhyay, W Lochet, D Lokshtanov, S Saurabh, J Xue
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
62022
Fault tolerant subgraphs with applications in kernelization
W Lochet, D Lokshtanov, P Misra, S Saurabh, R Sharma, M Zehavi
Schloss Dagstuhl–Leibniz Center for Informatics, 2020
62020
Parameterized complexity of directed spanner problems
FV Fomin, PA Golovach, W Lochet, P Misra, S Saurabh, R Sharma
Algorithmica 84 (8), 2292-2308, 2022
32022
True contraction decomposition and almost ETH-tight bipartization for unit-disk graphs
S Bandyapadhyay, W Lochet, D Lokshtanov, S Saurabh, J Xue
38th International Symposium on Computational Geometry (SoCG 2022), 2022
32022
Packing and covering balls in graphs excluding a minor
N Bousquet, W Cames Van Batenburg, L Esperet, G Joret, W Lochet, ...
Combinatorica 41 (3), 299-318, 2021
32021
Minimum-Membership Geometric Set Cover, Revisited
S Bandyapadhyay, W Lochet, S Saurabh, J Xue
arXiv preprint arXiv:2305.03985, 2023
22023
Exact and approximate digraph bandwidth
P Jain, L Kanesh, W Lochet, S Saurabh, R Sharma
22023
The directed 2-linkage problem with length constraints
J Bang-Jensen, T Bellitto, W Lochet, A Yeo
Theoretical Computer Science 814, 69-73, 2020
22020
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20