Accesso pubblico

How to find a good explanation for clustering?

S Bandyapadhyay, FV Fomin, PA Golovach, W Lochet, N Purohit, ...

Artificial Intelligence 322, 103948, 2023

Mandati: German Research Foundation, European Commission, Research Council of Norway

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

Mandati: European Commission

Progress on the adjacent vertex distinguishing edge coloring conjecture

G Joret, W Lochet

SIAM Journal on Discrete Mathematics 34 (4), 2221-2238, 2020

Mandati: Australian Research Council

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

Mandati: US National Science Foundation, Swiss National Science Foundation, German …

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

Mandati: Agence Nationale de la Recherche

Immersion of transitive tournaments in digraphs with large minimum outdegree

W Lochet

Journal of Combinatorial Theory, Series B 134, 350-353, 2019

Mandati: Agence Nationale de la Recherche

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

Mandati: European Commission

[PDF] dagstuhl.de

Fault tolerant subgraphs with applications in kernelization

W Lochet, D Lokshtanov, P Misra, S Saurabh, R Sharma, M Zehavi

11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 47 …, 2020

Mandati: US National Science Foundation, European Commission

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

Mandati: German Research Foundation, European Commission, Research Council of Norway

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

Mandati: US National Science Foundation, European Commission

Euclidean bottleneck steiner tree is fixed-parameter tractable

S Bandyapadhyay, W Lochet, D Lokshtanov, S Saurabh, J Xue

Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024

Mandati: US National Science Foundation, European Commission

[HTML] springer.com

Parameterized complexity of directed spanner problems

FV Fomin, PA Golovach, W Lochet, P Misra, S Saurabh, R Sharma

Algorithmica 84 (8), 2292-2308, 2022

Mandati: European Commission, Research Council of Norway

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

Mandati: Australian Research Council, Luxembourg National Research Fund, Agence …

[PDF] dagstuhl.de

Exploiting dense structures in parameterized complexity

W Lochet, D Lokshtanov, S Saurabh, M Zehavi

38th International Symposium on Theoretical Aspects of Computer Science …, 2021

Mandati: US National Science Foundation, European Commission

The directed 2-linkage problem with length constraints

J Bang-Jensen, T Bellitto, W Lochet, A Yeo

Theoretical Computer Science 814, 69-73, 2020

Mandati: Danish Council for Independent Research

The structure of typical eye-free graphs and a Turán-type result for two weighted colours

P Keevash, W Lochet

Combinatorics, Probability and Computing 26 (6), 886-910, 2017

Mandati: European Commission

Packing Short Cycles

M Bentert, FV Fomin, PA Golovach, T Korhonen, W Lochet, F Panolan, ...

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2025

Mandati: UK Engineering and Physical Sciences Research Council, European Commission …