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 | 39 | 2016 |

How to find a good explanation for clustering? S Bandyapadhyay, FV Fomin, PA Golovach, W Lochet, N Purohit, ... Artificial Intelligence 322, 103948, 2023 | 33 | 2023 |

A Polynomial Time Algorithm for the *k*-Disjoint Shortest Paths ProblemW Lochet Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 28 | 2021 |

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 | 25 | 2018 |

Progress on the adjacent vertex distinguishing edge coloring conjecture G Joret, W Lochet SIAM Journal on Discrete Mathematics 34 (4), 2221-2238, 2020 | 18 | 2020 |

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 | 13 | 2023 |

Immersion of transitive tournaments in digraphs with large minimum outdegree W Lochet Journal of Combinatorial Theory, Series B 134, 350-353, 2019 | 12 | 2019 |

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 | 11 | 2021 |

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 | 11 | 2019 |

A polynomial kernel for paw-free editing E Eiben, W Lochet, S Saurabh arXiv preprint arXiv:1911.03683, 2019 | 10 | 2019 |

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 | 9 | 2023 |

EPTAS for *k*-means Clustering of Affine SubspacesE Eiben, FV Fomin, PA Golovach, W Lochet, F Panolan, K Simonov Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 9 | 2021 |

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), 2020 | 8 | 2020 |

True contraction decomposition and almost ETH-tight bipartization for unit-disk graphs S Bandyapadhyay, W Lochet, D Lokshtanov, S Saurabh, J Xue ACM Transactions on Algorithms 20 (3), 1-26, 2024 | 6 | 2024 |

Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on *H*-Minor-Free GraphsS Bandyapadhyay, W Lochet, D Lokshtanov, S Saurabh, J Xue Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | 6 | 2022 |

Bispindles in strongly connected digraphs with large chromatic number N Cohenn, F Havet, W Lochet, R Lopes arXiv preprint arXiv:1703.02230, 2017 | 4 | 2017 |

Exact and approximate digraph bandwidth P Jain, L Kanesh, W Lochet, S Saurabh, R Sharma | 3 | 2023 |

Parameterized complexity of directed spanner problems FV Fomin, PA Golovach, W Lochet, P Misra, S Saurabh, R Sharma Algorithmica 84 (8), 2292-2308, 2022 | 3 | 2022 |

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 | 3 | 2021 |

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 | 2 | 2024 |