Pubblicazioni di Demetrescu Camil

2008

Demetrescu Camil, Giuseppe F. Italiano
Demetrescu Camil, Giuseppe F. Italiano
Single-Source Fully Dynamic Reachability. Encyclopedia of Algorithms 2008: 846-847

Demetrescu Camil, Giuseppe F. Italiano
Trade-Offs for Dynamic Graph Problems. Encyclopedia of Algorithms 2008 2008: 958-961

Demetrescu Camil, Giuseppe F. Italiano
Visualization Techniques for Algorithm Engineering. Encyclopedia of Algorithms 2008: 1008-1011

2007

DEMETRESCU Camil, Bruno Escoffier, Moruz Gabriel, RIBICHINI ANDREA
Adapting parallel algorithms to the W-stream model, with applications to graph problems. LECTURE NOTES IN COMPUTER SCIENCEProceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science 2007: 194-205

Demetrescu Camil, Giuseppe F. Italiano
Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks. ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2007: 3-15

Demetrescu Camil, Mikkel Thorup, Rezaul Alam Chowdhury, Vijaya Ramachandran
Oracles for distances avoiding a failed node or link. SIAM JOURNAL ON COMPUTING 2007: 1299-1318

Demetrescu Camil, FERRARO PETRILLO Umberto, Finocchi Irene, G. F. Italiano
Progetto di algoritmi e strutture dati in Java. Progetto di algoritmi e strutture dati in Java 2007: 1-433

Ausiello Giorgio, Demetrescu Camil, Franciosa Paolo Giulio, Italiano GIUSEPPE FRANCESCO, Ribichini Andrea
Small stretch spanners in the streaming model: New algorithms and experiments. LECTURE NOTES IN COMPUTER SCIENCEProceedings of the 15th Annual European Symposium on Algorithms 2007: 605-617

2006

Demetrescu Camil, Finocchi Irene
A data-driven graphical toolkit for software visualization. Proceedings of the 2006 ACM symposium on Software visualization - SoftVis '06 2006: 57-66

Demetrescu Camil, P. Faruolo, G. F. Italiano, M. Thorup
Does path cleaning help in dynamic all-pairs shortest paths?. LECTURE NOTES IN COMPUTER SCIENCEProceedings of the 14th Annual European Symposium on Algorithms 2006: 732-743

Demetrescu Camil, Giuseppe F. Italiano
Experimental Analysis of Dynamic All Pairs Shortest Path Algorithms. ACM TRANSACTIONS ON ALGORITHMSProc. of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'04) 2006: 578-601

Demetrescu Camil, Giuseppe F. Italiano
Fully dynamic all pairs shortest paths with real edge weights. JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2006: 813-837

D. Calvanese, DE GIACOMO Giuseppe, Demetrescu Camil, Iocchi Luca, Nardi Daniele
Lezioni di Fondamenti di Informatica (2/ed). Libro di testo per corsi universitari, Esculapio Editore Bologna 2006: -

Demetrescu Camil, Finocchi Irene, Ribichini Andrea
Trading off space for passes in graph streaming problems. Proceedings of the 17-th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'06) 2006: 714-723

© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma