Titolo | Pubblicato in | Anno |
---|---|---|
Visualizing co-phylogenetic reconciliations | Proceedings 25th Int.l Symp. on Graph Drawing & Network Visualization (GD 2017) | 2018 |
Graphs that are not pairwise compatible: A new proof technique (extended abstract) | Proceedings of 29th International Workshop on Combinatorial Algorithms (IWOCA 2018) | 2018 |
Pairwise Compatibility Graphs (Invited Talk) | Proceedings 19th Italian Conference on Theoretical Computer Science (ICTCS 2018) | 2018 |
Some classes of graphs that are not pairwise compatibility graphs (communication) | CEUR Workshop Proceedings 19th Italian Conference on Theoretical Computer Science (ICTCS 2017) | 2017 |
Autonomous mobile sensor placement in complex environments | ACM TRANSACTIONS ON AUTONOMOUS AND ADAPTIVE SYSTEMS | 2017 |
Autonomous mobile sensor placement in complex environments | ACM TRANSACTIONS ON AUTONOMOUS AND ADAPTIVE SYSTEMS | 2017 |
On maximal chain subgraphs and covers of bipartite graphs | Proceedings IWOCA 2016 | 2016 |
On pairwise compatibility graphs: a survey | SIAM REVIEW | 2016 |
Fully dynamically mantaining minimal integral separator for Threshold and Difference Graphs | Proceedings of WALCOM 2016: Algorithms and Computation | 2016 |
A locally connected spanning tree can be found in polynomial time on simple clique 3-trees | Proceedings of the 17th Italian Conference on Theoretical Computer Science | 2016 |
Optimal L(j, k)-Edge-Labeling of Regular Grids | INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE | 2015 |
Dynamically Operating on Threshold Graphs and Related Classes (Extended Abstract) | Proc. 13th Cologne-Twente Workshop on Graphs & Combinatorial Optimization (CTW 2015) | 2015 |
Corrigendum to “On Pairwise Compatibility Graphs having Dilworth Number Two” | THEORETICAL COMPUTER SCIENCE | 2015 |
Graph algorithms and their applications, especially in the fields of networking and bioinformatics
© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma