Florian Barbero

Identifiers

No identifiers captured yet.

Papers (5)

1. On the Distance Identifying Set meta-problem and applications to the complexity of identifying problems on graphs cs.CC · 2018 · author #1
2. Quasiperiods of biinfinite Sturmian words cs.DM · 2018 · author #1
3. Strong immersion is a well-quasi-ordering for semi-complete digraphs cs.DM · 2017 · author #1
4. Exploring the complexity of layout parameters in tournaments and semi-complete digraphs cs.DS · 2017 · author #1
5. Linear-Vertex Kernel for the Problem of Packing $r$-Stars into a Graph without Long Induced Paths cs.DS · 2015 · author #1

Mentions

No mention provenance yet.

Frequent Coauthors

• Christophe Paul 2 shared papers
• Ana\"el Grandjean 1 shared papers
• Anders Yeo 1 shared papers
• Bin Sheng 1 shared papers
• Gregory Gutin 1 shared papers
• Guilhem Gamard 1 shared papers
• Jocelyn Thiebaut 1 shared papers
• Lucas Isenmann 1 shared papers
• Mark Jones 1 shared papers
• Micha{\l} Pilipczuk 1 shared papers
• Michal Pilipczuk 1 shared papers