default search action
Camil Demetrescu
- > Home > Persons > Camil Demetrescu
Publications
- 2016
- [r12]Camil Demetrescu, Giuseppe F. Italiano:
Decremental All-Pairs Shortest Paths. Encyclopedia of Algorithms 2016: 506-509 - [r10]Camil Demetrescu, Giuseppe F. Italiano:
Single-Source Fully Dynamic Reachability. Encyclopedia of Algorithms 2016: 1994-1996 - [r9]Camil Demetrescu, Giuseppe F. Italiano:
Trade-Offs for Dynamic Graph Problems. Encyclopedia of Algorithms 2016: 2242-2246 - [r8]Camil Demetrescu, Giuseppe F. Italiano:
Visualization Techniques for Algorithm Engineering. Encyclopedia of Algorithms 2016: 2333-2337 - 2014
- [i6]Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Luigi Laura:
Experimental Evaluation of Algorithms for the Food-Selection Problem. CoRR abs/1401.7591 (2014) - 2013
- [p2]Camil Demetrescu, Giuseppe F. Italiano:
The Quest for the Shortest Route. The Power of Algorithms 2013: 85-105 - 2009
- [j17]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
- [j14]Camil Demetrescu, Giuseppe F. Italiano:
Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure. Algorithmica 51(4): 387-427 (2008) - [r6]Camil Demetrescu, Giuseppe F. Italiano:
Decremental All-Pairs Shortest Paths. Encyclopedia of Algorithms 2008 - [r5]Camil Demetrescu, Giuseppe F. Italiano:
Single-Source Fully Dynamic Reachability. Encyclopedia of Algorithms 2008 - [r4]Camil Demetrescu, Giuseppe F. Italiano:
Trade-Offs for Dynamic Graph Problems. Encyclopedia of Algorithms 2008 - [r3]Camil Demetrescu, Giuseppe F. Italiano:
Visualization Techniques for Algorithm Engineering. Encyclopedia of Algorithms 2008 - 2007
- [c26]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 - 2006
- [j11]Camil Demetrescu, Giuseppe F. Italiano:
Fully dynamic all pairs shortest paths with real edge weights. J. Comput. Syst. Sci. 72(5): 813-837 (2006) - [j10]Camil Demetrescu, Giuseppe F. Italiano:
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures. J. Discrete Algorithms 4(3): 353-383 (2006) - [j9]Camil Demetrescu, Giuseppe F. Italiano:
Experimental analysis of dynamic all pairs shortest path algorithms. ACM Trans. Algorithms 2(4): 578-601 (2006) - [c23]Camil Demetrescu, Pompeo Faruolo, Giuseppe F. Italiano, Mikkel Thorup:
Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths? ESA 2006: 732-743 - [c20]Camil Demetrescu, Giuseppe F. Italiano:
Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks. WCAN@ICALP 2006: 3-15 - 2005
- [j8]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) - [c19]Vincenzo Bonifaci, Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Luigi Laura:
Portraying Algorithms with Leonardo Web. WISE Workshops 2005: 73-83 - 2004
- [j7]Camil Demetrescu, Giuseppe F. Italiano:
A new approach to dynamic all pairs shortest paths. J. ACM 51(6): 968-992 (2004) - [c17]Camil Demetrescu, Stefano Emiliozzi, Giuseppe F. Italiano:
Experimental analysis of dynamic all pairs shortest path algorithms. SODA 2004: 369-378 - [c16]Camil Demetrescu, Giuseppe F. Italiano:
Engineering Shortest Path Algorithms. WEA 2004: 191-198 - [r2]Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano:
Dynamic Trees. Handbook of Data Structures and Applications 2004 - [r1]Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano:
Dynamic Graphs. Handbook of Data Structures and Applications 2004 - 2003
- [j5]Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano:
Algorithm engineering, Algorithmics Column. Bull. EATCS 79: 48-63 (2003) - [c15]Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano:
Engineering and Visualizing Algorithms. GD 2003: 509-513 - [c14]Camil Demetrescu, Giuseppe F. Italiano:
A new approach to dynamic all pairs shortest paths. STOC 2003: 159-166 - [p1]Harold N. Gabow, Camil Demetrescu, Irene Finocchi, Giuseppe Francesco Italiano, Giuseppe Liotta, Roberto Tamassia, Richard B. Borie, R. Gary Parker, Craig A. Tovey:
Graphs in Computer Science. Handbook of Graph Theory 2003: 952-1073 - 2002
- [c13]Camil Demetrescu, Giuseppe F. Italiano:
Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths. ICALP 2002: 633-643 - 2001
- [c10]Camil Demetrescu, Giuseppe F. Italiano:
Fully Dynamic All Pairs Shortest Paths with Real Edge Weights. FOCS 2001: 260-267 - [i1]Camil Demetrescu, Giuseppe F. Italiano:
Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure. CoRR cs.DS/0104001 (2001) - 2000
- [c9]Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Stefan Näher:
Visualization in Algorithm Engineering: Tools and Techniques. Experimental Algorithmics 2000: 24-50 - [c8]Camil Demetrescu, Giuseppe F. Italiano:
Fully Dynamic Transitive Closure: Breaking Through the O(n2) Barrier. FOCS 2000: 381-389 - [c7]Camil Demetrescu, Giuseppe F. Italiano:
What Do We Learn from Experimental Algorithmics? MFCS 2000: 36-51
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-18 01:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint