A survey of symbolic execution techniques R Baldoni, E Coppa, DC D’elia, C Demetrescu, I Finocchi ACM Computing Surveys (CSUR) 51 (3), 1-39, 2018 | 848 | 2018 |
A new approach to dynamic all pairs shortest paths C Demetrescu, GF Italiano Journal of the ACM (JACM) 51 (6), 968-992, 2004 | 447 | 2004 |
The shortest path problem: Ninth DIMACS implementation challenge C Demetrescu, AV Goldberg, DS Johnson American Mathematical Soc., 2009 | 266* | 2009 |
Experimental analysis of dynamic all pairs shortest path algorithms C Demetrescu, GF Italiano ACM Transactions on Algorithms (TALG) 2 (4), 578-601, 2006 | 163 | 2006 |
Fully dynamic transitive closure: breaking through the o (n/sup 2/) barrier C Demetrescu, GF Italiano Proceedings 41st Annual Symposium on Foundations of Computer Science, 381-389, 2000 | 141 | 2000 |
Input-sensitive profiling E Coppa, C Demetrescu, I Finocchi ACM SIGPLAN Notices 47 (6), 89-98, 2012 | 130 | 2012 |
Trading off space for passes in graph streaming problems C Demetrescu, I Finocchi, A Ribichini ACM Transactions on Algorithms (TALG) 6 (1), 1-17, 2009 | 124 | 2009 |
Oracles for distances avoiding a failed node or link C Demetrescu, M Thorup, RA Chowdhury, V Ramachandran SIAM Journal on Computing 37 (5), 1299-1318, 2008 | 121 | 2008 |
Reversible execution and visualization of programs with LEONARDO P Crescenzi, C Demetrescu, I Finocchi, R Petreschi Journal of Visual Languages & Computing 11 (2), 125-150, 2000 | 97 | 2000 |
Combinatorial algorithms for feedback problems in directed graphs C Demetrescu, I Finocchi Information Processing Letters 86 (3), 129-136, 2003 | 88 | 2003 |
Fully dynamic all pairs shortest paths with real edge weights C Demetrescu, GF Italiano Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 260-267, 2001 | 85 | 2001 |
Fully dynamic all pairs shortest paths with real edge weights C Demetrescu, GF Italiano Journal of Computer and System Sciences 72 (5), 813-837, 2006 | 80 | 2006 |
Specifying algorithm visualizations: Interesting events or state mapping? C Demetrescu, I Finocchi, JT Stasko Software Visualization: International Seminar Dagstuhl Castle, Germany, May …, 2002 | 78 | 2002 |
Dynamic graph algorithms C Demetrescu, D Eppstein, Z Galil, GF Italiano Algorithms and Theory of Computation Handbook, Volume 1, 235-262, 2009 | 74 | 2009 |
Maintaining shortest paths in digraphs with arbitrary arc weights: An experimental study C Demetrescu, D Frigioni, A Marchetti-Spaccamela, U Nanni Algorithm Engineering: 4th International Workshop, WAE 2000 Saarbrücken …, 2001 | 51 | 2001 |
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures C Demetrescu, GF Italiano Journal of Discrete Algorithms 4 (3), 353-383, 2006 | 50 | 2006 |
Reactive imperative programming with dataflow constraints C Demetrescu, I Finocchi, A Ribichini ACM SIGPLAN Notices 46 (10), 407-426, 2011 | 49 | 2011 |
Mining hot calling contexts in small space DC D'Elia, C Demetrescu, I Finocchi ACM SIGPLAN Notices 46 (6), 516-527, 2011 | 46* | 2011 |
Oracles for distances avoiding a node or link failure C Demetrescu, M Thorup, RA Chowdhury, V Ramachandran Manuscript, 2003 | 42 | 2003 |
Algoritmi e strutture dati C Demetrescu, I Finocchi, GF Italiano McGraw-Hill, 2004 | 40 | 2004 |