Non-trivial unary languages recognized by two-way one-counter machines. - Marzio De Biasi; Abuzer Yakaryilmaz (CoRR, 2013)

Unary Languages Recognized by Two-Way One-Counter Automata. - Marzio De Biasi; Abuzer Yakaryilmaz (CIAA, 2014)

Permutation Reconstruction from Differences. - Marzio De Biasi (Electron. J. Comb., 2014)

Minimal TSP Tour is coNP-Complete. - Marzio De Biasi (CoRR, 2014)

The Complexity of Snake. - Marzio De Biasi; Tim Ophelders (FUN, 2016)

Verifying Pipelined-RAM Consistency over Read/Write Traces of Data Replicas. - Hengfeng Wei; Marzio De Biasi; Yu Huang 002; Jiannong Cao 001; Jian Lu 001 (IEEE Trans. Parallel Distributed Syst., 2016)

The complexity of snake and undirected NCL variants. - Marzio De Biasi; Tim Ophelders (Theor. Comput. Sci., 2018)

The Power of One-State Turing Machines. - Marzio De Biasi (CoRR, 2019)

On the complexity of restoring corrupted colorings. - Marzio De Biasi; Juho Lauri (J. Comb. Optim., 2019)