The following pages link to Florian Barbero (Q786034):
Displaying 6 items.
- On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs (Q786037) (← links)
- Quasiperiods of biinfinite words (Q2297910) (← links)
- Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs (Q4554366) (← links)
- Strong immersion is a well‐quasi‐ordering for semicomplete digraphs (Q4632018) (← links)
- On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs (Q5009472) (← links)
- Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs (Q5111401) (← links)
