Publications

2026

The Distributed Complexity Landscape on Trees Depends on the Knowledge About the Network Size.

with Gustav Schmid, Alkida Balliu, Fabian Kuhn, Dennis Olivetti, Sebastian Brandt

PODC Conference Paper
Meta-Theorems for Cuttable Distributed Problems.

with Marthe Bonamy, Cyril Gavoille, Avinandan Das, Jukka Suomela, Alexandra Wesolek

PODC Conference Paper
A Polynomial Bound on the Pathwidth of Graphs Edge-Coverable by k Shortest Paths.

with Julien Baste, Lucas de Meyer, Ugo Giocanti, Étienne Objois

STACS Conference Paper
Testing H-Freeness on Sparse Graphs, the Case of Bounded Expansion.

with Samuel Humeau, Mamadou Moustapha Kanté, Daniel Mock, Alexandre Vigny

STACS Conference Paper
The Distributed Complexity Landscape on Trees Depends on the Knowledge About the Network Size.

with Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, Gustav Schmid

CoRR Preprint arXiv
Meta-Theorems for Cuttable Distributed Problems.

with Marthe Bonamy, Avinandan Das, Cyril Gavoille, Jukka Suomela, Alexandra Wesolek

CoRR Preprint arXiv

Induced Disjoint Paths Without an Induced Minor.

with Pierre Aboulker, Édouard Bonnet, Nicolas Trotignon

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

with Marthe Bonamy, Cyril Gavoille, Alexandra Wesolek

PODC Conference Paper
Induced Disjoint Paths Without an Induced Minor.

with Pierre Aboulker, Édouard Bonnet, Nicolas Trotignon

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

with Marthe Bonamy, Cyril Gavoille, Alexandra Wesolek

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

with Marthe Bonamy, Cyril Gavoille, Alexandra Wesolek

CoRR Preprint arXiv
A polynomial bound on the pathwidth of graphs edge-coverable by k shortest paths.

with Julien Baste, Lucas de Meyer, Ugo Giocanti, Étienne Objois

CoRR Preprint arXiv
Bipartite Turán number of paths and other trees.

with Marthe Bonamy, Théotime Leclere

CoRR Preprint arXiv
Testing H-freeness on sparse graphs, the case of bounded expansion.

with Samuel Humeau, Mamadou Moustapha Kanté, Daniel Mock, Alexandre Vigny

CoRR Preprint arXiv

Distributed Binary Labeling Problems in High-Degree Graphs.

with Henrik Lievonen, Jukka Suomela

SIROCCO Conference Paper

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

with Mathieu Mari, Michal Pilipczuk

IPEC Conference Paper
Brief Announcement: Distributed Derandomization Revisited.

with Sameep Dahal, Francesco d'Amore, Henrik Lievonen, Jukka Suomela

DISC Conference Paper
Distributed derandomization revisited.

with Sameep Dahal, Francesco d'Amore, Henrik Lievonen, Jukka Suomela

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

with Michal Pilipczuk, Mathieu Mari

CoRR Preprint arXiv
Distributed Binary Labeling Problems in High-Degree Graphs.

with Henrik Lievonen, Jukka Suomela

CoRR Preprint arXiv

Temporal Matching on Geometric Graph Data.

with Ngoc-Trung Nguyen, Binh-Minh Bui-Xuan

CIAC Conference Paper