Lucas Gnecco

Orcid: 0000-0002-1561-2080

According to our database1, Lucas Gnecco authored at least 2 papers in 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections [Extended Version].
CoRR, 2021

The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections.
Proceedings of the Similarity Search and Applications - 14th International Conference, 2021


  Loading...