Timothé Picavet

According to our database, Timothé Picavet authored at least 9 papers between 2021 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs.

Marthe Bonamy, Cyril Gavoille, Timothé Picavet, Alexandra Wesolek

CoRR, July, 2025

Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors.

Marthe Bonamy, Cyril Gavoille, Timothé Picavet, Alexandra Wesolek

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2025

Induced Disjoint Paths Without an Induced Minor.

Pierre Aboulker, Édouard Bonnet, Timothé Picavet, Nicolas Trotignon

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024

Distributed Binary Labeling Problems in High-Degree Graphs.

Henrik Lievonen, Timothé Picavet, Jukka Suomela

Proceedings of the Structural Information and Communication Complexity, 2024

2023

A parameterized approximation scheme for the 2D-Knapsack problem with wide items.

Michal Pilipczuk, Mathieu Mari, Timothé Picavet

CoRR, 2023

Distributed derandomization revisited.

Sameep Dahal, Francesco D'Amore, Henrik Lievonen, Timothé Picavet, Jukka Suomela

CoRR, 2023

Brief Announcement: Distributed Derandomization Revisited.

Sameep Dahal, Francesco D'Amore, Henrik Lievonen, Timothé Picavet, Jukka Suomela

Proceedings of the 37th International Symposium on Distributed Computing, 2023

A Parameterized Approximation Scheme for the Geometric Knapsack Problem with Wide Items.

Mathieu Mari, Timothé Picavet, Michal Pilipczuk

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

2021

Temporal Matching on Geometric Graph Data.

Timothé Picavet, Ngoc-Trung Nguyen, Binh-Minh Bui-Xuan

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021