The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Camil Demetrescu: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  37. A data-driven graphical toolkit for software visualization. [Citation Graph (, )][DBLP]


  38. Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure. [Citation Graph (, )][DBLP]


  39. Graph Spanners in the Streaming Model: An Experimental Study. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002