Florian Barbero

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs (available as arXiv preprint)	2021-08-04	Paper
On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs Algorithmica	2020-08-12	Paper
Exploring the complexity of layout parameters in tournaments and semi-complete digraphs	2020-05-27	Paper
Quasiperiods of biinfinite words European Journal of Combinatorics	2020-02-20	Paper
Strong immersion is a well-quasi-ordering for semicomplete digraphs Journal of Graph Theory	2019-04-25	Paper
Exploring the complexity of layout parameters in tournaments and semicomplete digraphs ACM Transactions on Algorithms	2018-11-13	Paper
Exploring the complexity of layout parameters in tournaments and semicomplete digraphs ACM Transactions on Algorithms	2018-11-13	Paper
Linear-vertex kernel for the problem of packing \(r\)-stars into a graph without long induced paths Information Processing Letters	2016-04-06	Paper

Research outcomes over time

This page was built for person: Florian Barbero