default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTimothé Picavet
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2026
[c8]Julien Baste, Lucas de Meyer, Ugo Giocanti, Étienne Objois, Timothé Picavet:
A Polynomial Bound on the Pathwidth of Graphs Edge-Coverable by k Shortest Paths. STACS 2026: 10:1-10:17- [c7]Samuel Humeau, Mamadou Moustapha Kanté, Daniel Mock, Timothé Picavet, Alexandre Vigny:
Testing H-Freeness on Sparse Graphs, the Case of Bounded Expansion. STACS 2026: 55:1-55:18 - 2025
- [c6]Pierre Aboulker, Édouard Bonnet, Timothé Picavet, Nicolas Trotignon:
Induced Disjoint Paths Without an Induced Minor. ICALP 2025: 4:1-4:14 - [c5]Marthe Bonamy
, Cyril Gavoille, Timothé Picavet, Alexandra Wesolek:
Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors. PODC 2025: 77-87 - [i9]Pierre Aboulker, Édouard Bonnet, Timothé Picavet, Nicolas Trotignon:
Induced Disjoint Paths Without an Induced Minor. CoRR abs/2502.05289 (2025) - [i8]Marthe Bonamy, Cyril Gavoille, Timothé Picavet, Alexandra Wesolek:
Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors. CoRR abs/2504.01091 (2025) - [i7]Marthe Bonamy, Cyril Gavoille, Timothé Picavet, Alexandra Wesolek:
Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs. CoRR abs/2507.04960 (2025) - [i6]Julien Baste, Lucas de Meyer, Ugo Giocanti, Étienne Objois, Timothé Picavet:
A polynomial bound on the pathwidth of graphs edge-coverable by k shortest paths. CoRR abs/2510.02901 (2025) - [i5]Marthe Bonamy, Théotime Leclere, Timothé Picavet:
Bipartite Turán number of paths and other trees. CoRR abs/2511.07374 (2025) - [i4]Samuel Humeau, Mamadou Moustapha Kanté, Daniel Mock, Timothé Picavet, Alexandre Vigny:
Testing H-freeness on sparse graphs, the case of bounded expansion. CoRR abs/2511.10230 (2025) - 2024
- [c4]Henrik Lievonen, Timothé Picavet, Jukka Suomela:
Distributed Binary Labeling Problems in High-Degree Graphs. SIROCCO 2024: 402-419 - 2023
- [c3]Mathieu Mari, Timothé Picavet, Michal Pilipczuk:
A Parameterized Approximation Scheme for the Geometric Knapsack Problem with Wide Items. IPEC 2023: 33:1-33:20 - [c2]Sameep Dahal, Francesco d'Amore, Henrik Lievonen, Timothé Picavet, Jukka Suomela:
Brief Announcement: Distributed Derandomization Revisited. DISC 2023: 40:1-40:5 - [i3]Sameep Dahal, Francesco d'Amore, Henrik Lievonen, Timothé Picavet, Jukka Suomela:
Distributed derandomization revisited. CoRR abs/2305.07351 (2023) - [i2]Michal Pilipczuk, Mathieu Mari, Timothé Picavet:
A parameterized approximation scheme for the 2D-Knapsack problem with wide items. CoRR abs/2307.10672 (2023) - [i1]Henrik Lievonen, Timothé Picavet, Jukka Suomela:
Distributed Binary Labeling Problems in High-Degree Graphs. CoRR abs/2312.12243 (2023) - 2021
- [c1]Timothé Picavet, Ngoc-Trung Nguyen, Binh-Minh Bui-Xuan:
Temporal Matching on Geometric Graph Data. CIAC 2021: 394-408
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-03-10 23:05 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
