Camil Demetrescu

2008
47	EE	Camil Demetrescu, Giuseppe F. Italiano: Decremental All-Pairs Shortest Paths. Encyclopedia of Algorithms 2008
46	EE	Camil Demetrescu, Andrew V. Goldberg, David S. Johnson: Implementation Challenge for Shortest Paths. Encyclopedia of Algorithms 2008
45	EE	Camil Demetrescu, Giuseppe F. Italiano: Single-Source Fully Dynamic Reachability. Encyclopedia of Algorithms 2008
44	EE	Camil Demetrescu, Giuseppe F. Italiano: Trade-Offs for Dynamic Graph Problems. Encyclopedia of Algorithms 2008
43	EE	Camil Demetrescu, Giuseppe F. Italiano: Visualization Techniques for Algorithm Engineering. Encyclopedia of Algorithms 2008
42	EE	Camil Demetrescu, Roberto Tamassia: Papers from ALENEX 2005. ACM Journal of Experimental Algorithmics 12: (2008)
41	EE	Camil Demetrescu, Giuseppe F. Italiano: Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure. Algorithmica 51(4): 387-427 (2008)
40	EE	Camil Demetrescu, Mikkel Thorup, Rezaul Alam Chowdhury, Vijaya Ramachandran: Oracles for Distances Avoiding a Failed Node or Link. SIAM J. Comput. 37(5): 1299-1318 (2008)
2007
39		Camil Demetrescu: Experimental Algorithms, 6th International Workshop, WEA 2007, Rome, Italy, June 6-8, 2007, Proceedings Springer 2007
38	EE	Giorgio Ausiello, Camil Demetrescu, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini: Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments. ESA 2007: 605-617
37	EE	Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini: Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems. MFCS 2007: 194-205
36	EE	Camil Demetrescu, Giuseppe F. Italiano: Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks. Electr. Notes Theor. Comput. Sci. 171(1): 3-15 (2007)
2006
35	EE	Vincenzo Bonifaci, Camil Demetrescu, Irene Finocchi, Luigi Laura: Visual editing of animated algorithms: the Leonardo Web builder. AVI 2006: 476-479
34	EE	Camil Demetrescu, Pompeo Faruolo, Giuseppe F. Italiano, Mikkel Thorup: Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths? ESA 2006: 732-743
33	EE	Camil Demetrescu, Irene Finocchi, Andrea Ribichini: Trading off space for passes in graph streaming problems. SODA 2006: 714-723
32	EE	Camil Demetrescu, Irene Finocchi: A data-driven graphical toolkit for software visualization. SOFTVIS 2006: 57-66
31	EE	Camil Demetrescu, Giuseppe F. Italiano: Experimental analysis of dynamic all pairs shortest path algorithms. ACM Transactions on Algorithms 2(4): 578-601 (2006)
30	EE	Camil Demetrescu, Giuseppe F. Italiano: Fully dynamic all pairs shortest paths with real edge weights. J. Comput. Syst. Sci. 72(5): 813-837 (2006)
29	EE	Camil Demetrescu, Giuseppe F. Italiano: Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures. J. Discrete Algorithms 4(3): 353-383 (2006)
2005
28		Camil Demetrescu, Robert Sedgewick, Roberto Tamassia: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, ALENEX /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005 SIAM 2005
27	EE	Vincenzo Bonifaci, Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Luigi Laura: Portraying Algorithms with Leonardo Web. WISE Workshops 2005: 73-83
26	EE	Camil Demetrescu, Giuseppe F. Italiano: Trade-offs for fully dynamic transitive closure on DAGs: breaking through the O(n2 barrier. J. ACM 52(2): 147-156 (2005)
2004
25	EE	Camil Demetrescu, Irene Finocchi: A portable virtual machine for program debugging and directing. SAC 2004: 1524-1530
24	EE	Camil Demetrescu, Stefano Emiliozzi, Giuseppe F. Italiano: Experimental analysis of dynamic all pairs shortest path algorithms. SODA 2004: 369-378
23	EE	Camil Demetrescu, Giuseppe F. Italiano: Engineering Shortest Path Algorithms. WEA 2004: 191-198
22	EE	Camil Demetrescu, Giuseppe F. Italiano: A new approach to dynamic all pairs shortest paths. J. ACM 51(6): 968-992 (2004)
21	EE	Vincenzo Bonifaci, Camil Demetrescu, Irene Finocchi, Luigi Laura: A Java-based system for building animated presentations over the Web. Sci. Comput. Program. 53(1): 37-49 (2004)
2003
20	EE	Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano: Engineering and Visualizing Algorithms. Graph Drawing 2003: 509-513
19	EE	Camil Demetrescu, Giuseppe F. Italiano: A new approach to dynamic all pairs shortest paths. STOC 2003: 159-166
18		Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano: Algorithm engineering, Algorithmics Column. Bulletin of the EATCS 79: 48-63 (2003)
17	EE	Camil Demetrescu, Irene Finocchi: Combinatorial algorithms for feedback problems in directed graphs. Inf. Process. Lett. 86(3): 129-136 (2003)
2002
16	EE	Camil Demetrescu, Giuseppe F. Italiano: Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths. ICALP 2002: 633-643
15	EE	Camil Demetrescu, Mikkel Thorup: Oracles for distances avoiding a link-failure. SODA 2002: 838-843
2001
14		Camil Demetrescu, Giuseppe F. Italiano: Fully Dynamic All Pairs Shortest Paths with Real Edge Weights. FOCS 2001: 260-267
13	EE	Camil Demetrescu, Irene Finocchi, John T. Stasko: Specifying Algorithm Visualizations: Interesting Events or State Mapping? Software Visualization 2001: 16-30
12		Camil Demetrescu, Irene Finocchi: Rwmoving Cycles for Minimizing Crossings. ACM Journal of Experimental Algorithmics 6: 2- (2001)
11	EE	Camil Demetrescu, Giuseppe F. Italiano: Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure CoRR cs.DS/0104001: (2001)
10		Camil Demetrescu, Irene Finocchi: Smooth Animation of Algorithms in a Declarative Framework. J. Vis. Lang. Comput. 12(3): 253-281 (2001)
2000
9	EE	Camil Demetrescu, Irene Finocchi, Giuseppe Liotta: Visualizing Algorithms over the Web with the Publication-Driven Approach. Algorithm Engineering 2000: 147-158
8	EE	Camil Demetrescu, Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni: Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study. Algorithm Engineering 2000: 218-229
7	EE	Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Stefan Näher: Visualization in Algorithm Engineering: Tools and Techniques. Experimental Algorithmics 2000: 24-50
6		Camil Demetrescu, Giuseppe F. Italiano: Fully Dynamic Transitive Closure: Breaking Through the O(n2) Barrier. FOCS 2000: 381-389
5	EE	Camil Demetrescu, Giuseppe F. Italiano: What Do We Learn from Experimental Algorithmics? MFCS 2000: 36-51
4		Pierluigi Crescenzi, Camil Demetrescu, Irene Finocchi, Rossella Petreschi: Reversible Execution and Visualization of Programs with LEONARDO. J. Vis. Lang. Comput. 11(2): 125-150 (2000)
1999
3	EE	Camil Demetrescu, Giuseppe Di Battista, Irene Finocchi, Giuseppe Liotta, Maurizio Patrignani, Maurizio Pizzonia: Infinite Trees and the Future. Graph Drawing 1999: 379-391
2	EE	Camil Demetrescu, Irene Finocchi: A Technique for Generating Graphical Abstractions of Program Data Structures. VISUAL 1999: 785-792
1	EE	Camil Demetrescu, Irene Finocchi: Smooth Animation of Algorithms in a Declarative Framework. VL 1999: 280-287

Coauthor Index

1	Giorgio Ausiello	[38]
2	Giuseppe Di Battista	[3]
3	Vincenzo Bonifaci	[21] [27] [35]
4	Rezaul Alam Chowdhury	[40]
5	Pierluigi Crescenzi (Pilu Crescenzi)	[4]
6	Stefano Emiliozzi	[24]
7	Bruno Escoffier	[37]
8	Pompeo Faruolo	[34]
9	Irene Finocchi	[1] [2] [3] [4] [7] [9] [10] [12] [13] [17] [18] [20] [21] [25] [27] [32] [33] [35]
10	Paolo Giulio Franciosa	[38]
11	Daniele Frigioni	[8]
12	Andrew V. Goldberg	[46]
13	Giuseppe F. Italiano	[5] [6] [7] [11] [14] [16] [18] [19] [20] [22] [23] [24] [26] [27] [29] [30] [31] [34] [36] [38] [41] [43] [44] [45] [47]
14	David S. Johnson	[46]
15	Luigi Laura	[21] [27] [35]
16	Giuseppe Liotta	[3] [9]
17	Alberto Marchetti-Spaccamela	[8]
18	Gabriel Moruz	[37]
19	Stefan Näher	[7]
20	Umberto Nanni	[8]
21	Maurizio Patrignani	[3]
22	Rossella Petreschi	[4]
23	Maurizio Pizzonia	[3]
24	Vijaya Ramachandran	[40]
25	Andrea Ribichini	[33] [37] [38]
26	Robert Sedgewick	[28]
27	John T. Stasko	[13]
28	Roberto Tamassia	[28] [42]
29	Mikkel Thorup	[15] [34] [40]