De Biasi, Marzio
13  Ergebnisse:
Personensuche X
?
1

The complexity of snake and undirected NCL variants:

De Biasi, Marzio ; Ophelders, Tim
Theoretical Computer Science.  748 (2018)  - p. 55-65 , 2018
 
?
2

On the complexity of restoring corrupted colorings:

De Biasi, Marzio ; Lauri, Juho
Journal of Combinatorial Optimization.  37 (2018)  4 - p. 1150-1169 , 2018
 
?
 
?
5

The complexity of snake and undirected NCL variants:

De Biasi, Marzio ; Ophelders, T.A.E
De Biasi , M & Ophelders , T A E 2018 , ' The complexity of snake and undirected NCL variants ' , Theoretical Computer Science , vol. 748 , pp. 55-65 . https://doi.org/10.1016/j.tcs.2017.10.031.  , 2018
 
?
7

The Complexity of Snake:

De Biasi, Marzio ; Ophelders, Tim
doi:10.4230/LIPIcs.FUN.2016.11.  , 2016
 
?
9

Permutation Reconstruction from Differences:

De Biasi, Marzio
https://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i4p3/pdf.  , 2014
 
?
10

Minimal TSP Tour is coNP-Complete:

De Biasi, Marzio
http://arxiv.org/abs/1403.3431.  , 2014
 
1-13