Camil Demetrescu

	2011
56		Camil Demetrescu, Magnús M. Halldórsson: Algorithms - ESA 2011 - 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceedings Springer 2011
55		Camil Demetrescu, Irene Finocchi, Andrea Ribichini: Reactive imperative programming with dataflow constraints. OOPSLA 2011: 407-426
54		Daniele Cono D'Elia, Camil Demetrescu, Irene Finocchi: Mining hot calling contexts in small space. PLDI 2011: 516-527
53		Camil Demetrescu, Irene Finocchi, Andrea Ribichini: Reactive Imperative Programming with Dataflow Constraints CoRR abs/1104.2293: (2011)
52		Camil Demetrescu, Michael Kaufmann, Stephen G. Kobourov, Petra Mutzel: Graph Drawing with Algorithm Engineering Methods (Dagstuhl Seminar 11191). Dagstuhl Reports 1(5): 47-60 (2011)
	2010
51		Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini: Adapting parallel algorithms to the W-Stream model, with applications to graph problems. Theor. Comput. Sci. 411(44-46): 3994-4004 (2010)
	2009
50		Camil Demetrescu: Preface. ACM Journal of Experimental Algorithmics 14: (2009)
49		Camil Demetrescu, Irene Finocchi, Andrea Ribichini: Trading off space for passes in graph streaming problems. ACM Transactions on Algorithms 6(1): (2009)
48		Giorgio Ausiello, Camil Demetrescu, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini: Graph Spanners in the Streaming Model: An Experimental Study. Algorithmica 55(2): 346-374 (2009)
	2008
47		Camil Demetrescu, Giuseppe F. Italiano: Decremental All-Pairs Shortest Paths. Encyclopedia of Algorithms 2008
46		Camil Demetrescu, Andrew V. Goldberg, David S. Johnson: Implementation Challenge for Shortest Paths. Encyclopedia of Algorithms 2008
45		Camil Demetrescu, Giuseppe F. Italiano: Single-Source Fully Dynamic Reachability. Encyclopedia of Algorithms 2008
44		Camil Demetrescu, Giuseppe F. Italiano: Trade-Offs for Dynamic Graph Problems. Encyclopedia of Algorithms 2008
43		Camil Demetrescu, Giuseppe F. Italiano: Visualization Techniques for Algorithm Engineering. Encyclopedia of Algorithms 2008
42		Camil Demetrescu, Roberto Tamassia: Papers from ALENEX 2005. ACM Journal of Experimental Algorithmics 12: (2008)
41		Camil Demetrescu, Giuseppe F. Italiano: Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure. Algorithmica 51(4): 387-427 (2008)
40		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		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		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		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		Vincenzo Bonifaci, Camil Demetrescu, Irene Finocchi, Luigi Laura: Visual editing of animated algorithms: the Leonardo Web builder. AVI 2006: 476-479
34		Camil Demetrescu, Pompeo Faruolo, Giuseppe F. Italiano, Mikkel Thorup: Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths? ESA 2006: 732-743
33		Camil Demetrescu, Irene Finocchi, Andrea Ribichini: Trading off space for passes in graph streaming problems. SODA 2006: 714-723
32		Camil Demetrescu, Irene Finocchi: A data-driven graphical toolkit for software visualization. SOFTVIS 2006: 57-66
31		Camil Demetrescu, Giuseppe F. Italiano: Experimental analysis of dynamic all pairs shortest path algorithms. ACM Transactions on Algorithms 2(4): 578-601 (2006)
30		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		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		Vincenzo Bonifaci, Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Luigi Laura: Portraying Algorithms with Leonardo Web. WISE Workshops 2005: 73-83
26		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		Camil Demetrescu, Irene Finocchi: A portable virtual machine for program debugging and directing. SAC 2004: 1524-1530
24		Camil Demetrescu, Stefano Emiliozzi, Giuseppe F. Italiano: Experimental analysis of dynamic all pairs shortest path algorithms. SODA 2004: 369-378
23		Camil Demetrescu, Giuseppe F. Italiano: Engineering Shortest Path Algorithms. WEA 2004: 191-198
22		Camil Demetrescu, Giuseppe F. Italiano: A new approach to dynamic all pairs shortest paths. J. ACM 51(6): 968-992 (2004)
21		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		Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano: Engineering and Visualizing Algorithms. Graph Drawing 2003: 509-513
19		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		Camil Demetrescu, Irene Finocchi: Combinatorial algorithms for feedback problems in directed graphs. Inf. Process. Lett. 86(3): 129-136 (2003)
	2002
16		Camil Demetrescu, Giuseppe F. Italiano: Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths. ICALP 2002: 633-643
15		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		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		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		Camil Demetrescu, Irene Finocchi, Giuseppe Liotta: Visualizing Algorithms over the Web with the Publication-Driven Approach. Algorithm Engineering 2000: 147-158
8		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		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		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		Camil Demetrescu, Giuseppe Di Battista, Irene Finocchi, Giuseppe Liotta, Maurizio Patrignani, Maurizio Pizzonia: Infinite Trees and the Future. Graph Drawing 1999: 379-391
2		Camil Demetrescu, Irene Finocchi: A Technique for Generating Graphical Abstractions of Program Data Structures. VISUAL 1999: 785-792
1		Camil Demetrescu, Irene Finocchi: Smooth Animation of Algorithms in a Declarative Framework. VL 1999: 280-287

Coauthor Index

1	Giorgio Ausiello	[38] [48]
2	Giuseppe Di Battista	[3]
3	Vincenzo Bonifaci	[21] [27] [35]
4	Rezaul Alam Chowdhury	[40]
5	Pierluigi Crescenzi (Pilu Crescenzi)	[4]
6	Daniele Cono D'Elia	[54]
7	Stefano Emiliozzi	[24]
8	Bruno Escoffier	[37] [51]
9	Pompeo Faruolo	[34]
10	Irene Finocchi	[1] [2] [3] [4] [7] [9] [10] [12] [13] [17] [18] [20] [21] [25] [27] [32] [33] [35] [49] [53] [54] [55]
11	Paolo Giulio Franciosa	[38] [48]
12	Daniele Frigioni	[8]
13	Andrew V. Goldberg	[46]
14	Magnús M. Halldórsson	[56]
15	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] [48]
16	David S. Johnson	[46]
17	Michael Kaufmann	[52]
18	Stephen G. Kobourov	[52]
19	Luigi Laura	[21] [27] [35]
20	Giuseppe Liotta	[3] [9]
21	Alberto Marchetti-Spaccamela	[8]
22	Gabriel Moruz	[37] [51]
23	Petra Mutzel	[52]
24	Stefan Näher	[7]
25	Umberto Nanni	[8]
26	Maurizio Patrignani	[3]
27	Rossella Petreschi	[4]
28	Maurizio Pizzonia	[3]
29	Vijaya Ramachandran	[40]
30	Andrea Ribichini	[33] [37] [38] [48] [49] [51] [53] [55]
31	Robert Sedgewick (Bob Sedgewick)	[28]
32	John T. Stasko	[13]
33	Roberto Tamassia	[28] [42]
34	Mikkel Thorup	[15] [34] [40]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page