Matteo Dell'Orefice

According to our database, Matteo Dell'Orefice authored at least 2 papers between 2016 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2019

A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs.

Tiziana Calamoneri, Matteo Dell'Orefice, Angelo Monti

Theor. Comput. Sci., 2019

2016

A Locally Connected Spanning Tree Can Be Found in Polynomial Time on Simple Clique 3-Trees.

Tiziana Calamoneri, Matteo Dell'Orefice, Angelo Monti

Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016