Author pages are created from data sourced from our academic publisher partnerships and public sources.
- Publications
- Influence
Subdivisions of oriented cycles in digraphs with large chromatic number
TLDR
Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number
- P. Aboulker, N. Cohen, F. Havet, W. Lochet, Phablo F. S. Moura, S. Thomassé
- Mathematics, Computer Science
- Electron. J. Comb.
- 4 October 2016
TLDR
A proof of the Erdős-Sands-Sauer-Woodrow conjecture
- N. Bousquet, W. Lochet, S. Thomassé
- Philosophy, Computer Science
- J. Comb. Theory, Ser. B
- 23 March 2017
TLDR
The shortest disjoint paths problem
- W. Lochet
- Mathematics, Computer Science
- ArXiv
- 22 December 2019
TLDR
- 2
- 1
- PDF
A Polynomial Kernel for Paw-Free Editing
- E. Eiben, W. Lochet, S. Saurabh
- Mathematics, Computer Science
- IPEC
- 9 November 2019
TLDR
Fault Tolerant Subgraphs with Applications in Kernelization
- W. Lochet, D. Lokshtanov, Pranabendu Misra, S. Saurabh, Roohani Sharma, M. Zehavi
- Computer Science
- ITCS
- 2020
TLDR
The directed 2-linkage problem with length constraints
- J. Bang-Jensen, Thomas Bellitto, W. Lochet, A. Yeo
- Mathematics, Computer Science
- Theor. Comput. Sci.
- 1 July 2019
TLDR
A proof of the Erd\H{o}s-Sands-Sauer-Woodrow conjecture
- N. Bousquet, W. Lochet, S. Thomassé
- Mathematics
- 23 March 2017
A very nice result of B\'ar\'any and Lehel asserts that every finite subset $X$ or $\mathbb R^d$ can be covered by $f(d)$ $X$-boxes (i.e. each box has two antipodal points in $X$). As shown by… Expand
- 2
Exact and Approximate Digraph Bandwidth
- Pallavi Jain, L. Kanesh, W. Lochet, S. Saurabh, Roohani Sharma
- Mathematics, Computer Science
- FSTTCS
- 2019
TLDR
Progress on the adjacent vertex distinguishing edge colouring conjecture
- Gwenaël Joret, W. Lochet
- Computer Science, Mathematics
- SIAM J. Discret. Math.
- 17 April 2018
TLDR