Temporal Matching on Geometric Graph Data. - Timothé Picavet; Ngoc-Trung Nguyen; Binh-Minh Bui-Xuan (CIAC, 2021)

A Parameterized Approximation Scheme for the Geometric Knapsack Problem with Wide Items. - Mathieu Mari; Timothé Picavet; Michal Pilipczuk (IPEC, 2023)

Brief Announcement: Distributed Derandomization Revisited. - Sameep Dahal; Francesco D'Amore 001; Henrik Lievonen; Timothé Picavet; Jukka Suomela (DISC, 2023)

Distributed derandomization revisited. - Sameep Dahal; Francesco D'Amore 001; Henrik Lievonen; Timothé Picavet; Jukka Suomela (CoRR, 2023)

A parameterized approximation scheme for the 2D-Knapsack problem with wide items. - Michal Pilipczuk; Mathieu Mari; Timothé Picavet (CoRR, 2023)

Distributed Binary Labeling Problems in High-Degree Graphs. - Henrik Lievonen; Timothé Picavet; Jukka Suomela (SIROCCO, 2024)

Induced Disjoint Paths Without an Induced Minor. - Pierre Aboulker; Édouard Bonnet; Timothé Picavet; Nicolas Trotignon (ICALP, 2025)

Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors. - Marthe Bonamy; Cyril Gavoille; Timothé Picavet; Alexandra Wesolek (PODC, 2025)

Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs. - Marthe Bonamy; Cyril Gavoille; Timothé Picavet; Alexandra Wesolek (CoRR, 2025)