AgoraResearch hub
ExploreLibraryProfile
Account
Timothé Picavet
Scholar

Timothé Picavet

Google Scholar ID: c9CMJUIAAAAJ
LaBRI, Université de Bordeaux
Graph TheoryDistributed algorithmsParameterized ComplexityCombinatoricsAlgorithms
Homepage↗Google Scholar↗
Citations & Impact
All-time
Citations
19
 
H-index
3
 
i10-index
0
 
Publications
8
 
Co-authors
10
list available
Contact
No contact links provided.
Publications
5 items
Testing H-freeness on sparse graphs, the case of bounded expansion
2025
Cited
0
Bipartite Tur'an number of paths and other trees
2025
Cited
1
A polynomial bound on the pathwidth of graphs edge-coverable by $k$ shortest paths
2025
Cited
0
Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs
2025
Cited
0
Induced Disjoint Paths Without an Induced Minor
2025
Cited
0
Resume (English only)
Co-authors
10 total
Jukka Suomela
Jukka Suomela
Aalto University
Henrik Lievonen
Henrik Lievonen
Aalto University
Francesco d'Amore
Francesco d'Amore
Gran Sasso Science Institute
Alexandra Wesolek
Alexandra Wesolek
Technical University of Berlin
Marthe Bonamy
Marthe Bonamy
LaBRI, CNRS, Université Bordeaux
Cyril Gavoille
Cyril Gavoille
Professeur d'informatique, Université de Bordeaux
Mathieu Mari
Mathieu Mari
Postdoc
Michał Pilipczuk
Michał Pilipczuk
University of Warsaw

Welcome back

Sign in to Agora

Welcome back! Please sign in to continue.

Do not have an account?