LEONARDO: a software visualization system. - Pierluigi Crescenzi; Camil Demetrescu; Irene Finocchi; Rossella Petreschi (WAE, 1997)

Infinite Trees and the Future. - Camil Demetrescu; Giuseppe Di Battista; Irene Finocchi; Giuseppe Liotta; Maurizio Patrignani; Maurizio Pizzonia (GD, 1999)

A Technique for Generating Graphical Abstractions of Program Data Structures. - Camil Demetrescu; Irene Finocchi (VISUAL, 1999)

Smooth Animation of Algorithms in a Declarative Framework. - Camil Demetrescu; Irene Finocchi (VL, 1999)

Visualization in Algorithm Engineering: Tools and Techniques. - Camil Demetrescu; Irene Finocchi; Giuseppe F. Italiano; Stefan Näher (Experimental Algorithmics, 2000)

Fully Dynamic Transitive Closure: Breaking Through the O(n2) Barrier. - Camil Demetrescu; Giuseppe F. Italiano (FOCS, 2000)

What Do We Learn from Experimental Algorithmics? - Camil Demetrescu; Giuseppe F. Italiano (MFCS, 2000)

Visualizing Algorithms over the Web with the Publication-Driven Approach. - Camil Demetrescu; Irene Finocchi; Giuseppe Liotta (WAE, 2000)

Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study. - Camil Demetrescu; Daniele Frigioni; Alberto Marchetti-Spaccamela; Umberto Nanni (WAE, 2000)

Reversible Execution and Visualization of Programs with LEONARDO. - Pierluigi Crescenzi; Camil Demetrescu; Irene Finocchi; Rossella Petreschi (J. Vis. Lang. Comput., 2000)

Specifying Algorithm Visualizations: Interesting Events or State Mapping? - Camil Demetrescu; Irene Finocchi; John T. Stasko (Software Visualization, 2001)

Fully Dynamic All Pairs Shortest Paths with Real Edge Weights. - Camil Demetrescu; Giuseppe F. Italiano (FOCS, 2001)

Removing Cycles for Minimizing Crossings. - Camil Demetrescu; Irene Finocchi (ACM J. Exp. Algorithmics, 2001)

Fully Dynamic Algorithms for Path Problems on Directed Graphs. - Camil Demetrescu (2001)

Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths. - Camil Demetrescu; Giuseppe F. Italiano (ICALP, 2002)

Oracles for distances avoiding a link-failure. - Camil Demetrescu; Mikkel Thorup (SODA, 2002)

Graphs in Computer Science. - Harold N. Gabow; Camil Demetrescu; Irene Finocchi; Giuseppe Francesco Italiano; Giuseppe Liotta; Roberto Tamassia; Richard B. Borie; R. Gary Parker; Craig A. Tovey (Handbook of Graph Theory, 2003)

Engineering and Visualizing Algorithms. - Camil Demetrescu; Irene Finocchi; Giuseppe F. Italiano (GD, 2003)

A new approach to dynamic all pairs shortest paths. - Camil Demetrescu; Giuseppe F. Italiano (STOC, 2003)

Algorithm engineering, Algorithmics Column. - Camil Demetrescu; Irene Finocchi; Giuseppe F. Italiano (Bull. EATCS, 2003)

Combinatorial algorithms for feedback problems in directed graphs. - Camil Demetrescu; Irene Finocchi (Inf. Process. Lett., 2003)

A portable virtual machine for program debugging and directing. - Camil Demetrescu; Irene Finocchi (SAC, 2004)

Experimental analysis of dynamic all pairs shortest path algorithms. - Camil Demetrescu; Stefano Emiliozzi; Giuseppe F. Italiano (SODA, 2004)

Engineering Shortest Path Algorithms. - Camil Demetrescu; Giuseppe F. Italiano (WEA, 2004)

A Java-based system for building animated presentations over the Web. - Vincenzo Bonifaci; Camil Demetrescu; Irene Finocchi; Luigi Laura (Sci. Comput. Program., 2004)

Dynamic Trees. - Camil Demetrescu; Irene Finocchi; Giuseppe F. Italiano (Handbook of Data Structures and Applications, 2004)

Dynamic Graphs. - Camil Demetrescu; Irene Finocchi; Giuseppe F. Italiano (Handbook of Data Structures and Applications, 2004)

Portraying Algorithms with Leonardo Web. - Vincenzo Bonifaci; Camil Demetrescu; Irene Finocchi; Giuseppe F. Italiano; Luigi Laura (WISE Workshops, 2005)

Trade-offs for fully dynamic transitive closure on DAGs: breaking through the O(n2 barrier. - Camil Demetrescu; Giuseppe F. Italiano (J. ACM, 2005)

Visual editing of animated algorithms: the Leonardo Web builder. - Vincenzo Bonifaci; Camil Demetrescu; Irene Finocchi; Luigi Laura (AVI, 2006)

Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths? - Camil Demetrescu; Pompeo Faruolo; Giuseppe F. Italiano; Mikkel Thorup (ESA, 2006)

Trading off space for passes in graph streaming problems. - Camil Demetrescu; Irene Finocchi; Andrea Ribichini (SODA, 2006)

A data-driven graphical toolkit for software visualization. - Camil Demetrescu; Irene Finocchi (SOFTVIS, 2006)

Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks. - Camil Demetrescu; Giuseppe F. Italiano (WCAN@ICALP, 2006)

Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures. - Camil Demetrescu; Giuseppe F. Italiano (J. Discrete Algorithms, 2006)

Experimental analysis of dynamic all pairs shortest path algorithms. - Camil Demetrescu; Giuseppe F. Italiano (ACM Trans. Algorithms, 2006)

Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments. - Giorgio Ausiello; Camil Demetrescu; Paolo Giulio Franciosa; Giuseppe F. Italiano; Andrea Ribichini (ESA, 2007)

Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems. - Camil Demetrescu; Bruno Escoffier; Gabriel Moruz; Andrea Ribichini (MFCS, 2007)

Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure. - Camil Demetrescu; Giuseppe F. Italiano (Algorithmica, 2008)

Papers from ALENEX 2005. - Camil Demetrescu; Roberto Tamassia (ACM J. Exp. Algorithmics, 2008)

Oracles for Distances Avoiding a Failed Node or Link. - Camil Demetrescu; Mikkel Thorup; Rezaul Alam Chowdhury; Vijaya Ramachandran (SIAM J. Comput., 2008)

Implementation Challenge for Shortest Paths. - Camil Demetrescu; Andrew V. Goldberg; David S. Johnson 001 (Encyclopedia of Algorithms, 2008)

Decremental All-Pairs Shortest Paths. - Camil Demetrescu; Giuseppe F. Italiano (Encyclopedia of Algorithms, 2008)

Single-Source Fully Dynamic Reachability. - Camil Demetrescu; Giuseppe F. Italiano (Encyclopedia of Algorithms, 2008)

Trade-Offs for Dynamic Graph Problems. - Camil Demetrescu; Giuseppe F. Italiano (Encyclopedia of Algorithms, 2008)

Visualization Techniques for Algorithm Engineering. - Camil Demetrescu; Giuseppe F. Italiano (Encyclopedia of Algorithms, 2008)

Graph Spanners in the Streaming Model: An Experimental Study. - Giorgio Ausiello; Camil Demetrescu; Paolo Giulio Franciosa; Giuseppe F. Italiano; Andrea Ribichini (Algorithmica, 2009)

Preface. - Camil Demetrescu (ACM J. Exp. Algorithmics, 2009)

Reactive imperative programming with dataflow constraints. - Camil Demetrescu; Irene Finocchi; Andrea Ribichini (OOPSLA, 2011)

Mining hot calling contexts in small space. - Daniele Cono D'Elia; Camil Demetrescu; Irene Finocchi (PLDI, 2011)

Graph Drawing with Algorithm Engineering Methods (Dagstuhl Seminar 11191). - Camil Demetrescu; Michael Kaufmann 001; Stephen G. Kobourov; Petra Mutzel (Dagstuhl Reports, 2011)

k-Calling context profiling. - Giorgio Ausiello; Camil Demetrescu; Irene Finocchi; Donatella Firmani (OOPSLA, 2012)

Input-sensitive profiling. - Emilio Coppa; Camil Demetrescu; Irene Finocchi (PLDI, 2012)

The Quest for the Shortest Route. - Camil Demetrescu; Giuseppe F. Italiano (The Power of Algorithms, 2013)

Ball-Larus path profiling across multiple loop iterations. - Daniele Cono D'Elia; Camil Demetrescu (OOPSLA, 2013)

Editorial. - Camil Demetrescu; Magnús M. Halldórsson (Algorithmica, 2013)

Multithreaded Input-Sensitive Profiling - Emilio Coppa; Camil Demetrescu; Irene Finocchi; Romolo Marotta (CoRR, 2013)

Ball-Larus Path Profiling Across Multiple Loop iterations - Daniele Cono D'Elia; Camil Demetrescu; Irene Finocchi (CoRR, 2013)

Preface. - Camil Demetrescu; Stefano Leonardi 001; Alberto Marchetti-Spaccamela (Theor. Comput. Sci., 2013)

Estimating the Empirical Cost Function of Routines with Dynamic Workloads. - Emilio Coppa; Camil Demetrescu; Irene Finocchi; Romolo Marotta (CGO, 2014)

Experimental Evaluation of Algorithms for the Food-Selection Problem. - Camil Demetrescu; Irene Finocchi; Giuseppe F. Italiano; Luigi Laura (CoRR, 2014)

Front Matter, Table of Contents. - Camil Demetrescu; Matthew Flatt (Dagstuhl Artifacts Ser., 2015)

Flexible on-stack replacement in LLVM. - Daniele Cono D'Elia; Camil Demetrescu (CGO, 2016)

Rethinking Experimental Methods in Computing (Dagstuhl Seminar 16111). - Daniel Delling; Camil Demetrescu; David S. Johnson 001; Jan Vitek (Dagstuhl Reports, 2016)

Programming Language Techniques for Incremental and Reactive Computing (Dagstuhl Seminar 16402). - Camil Demetrescu; Sebastian Erdweg; Matthew A. Hammer; Shriram Krishnamurthi (Dagstuhl Reports, 2016)

Implementation Challenge for Shortest Paths. - Camil Demetrescu; Andrew V. Goldberg; David S. Johnson 001 (Encyclopedia of Algorithms, 2016)

Decremental All-Pairs Shortest Paths. - Camil Demetrescu; Giuseppe F. Italiano (Encyclopedia of Algorithms, 2016)

Single-Source Fully Dynamic Reachability. - Camil Demetrescu; Giuseppe F. Italiano (Encyclopedia of Algorithms, 2016)

Trade-Offs for Dynamic Graph Problems. - Camil Demetrescu; Giuseppe F. Italiano (Encyclopedia of Algorithms, 2016)

Visualization Techniques for Algorithm Engineering. - Camil Demetrescu; Giuseppe F. Italiano (Encyclopedia of Algorithms, 2016)

My (fair) big data. - Tiziana Catarci; Monica Scannapieco; Marco Console; Camil Demetrescu (IEEE BigData, 2017)

Assisting Malware Analysis with Symbolic Execution: A Case Study. - Roberto Baldoni; Emilio Coppa; Daniele Cono D'Elia; Camil Demetrescu (CSCML, 2017)

Rethinking pointer reasoning in symbolic execution. - Emilio Coppa; Daniele Cono D'Elia; Camil Demetrescu (ASE, 2017)

On-Stack Replacement à la Carte. - Daniele Cono D'Elia; Camil Demetrescu (CoRR, 2017)

On-stack replacement, distilled. - Daniele Cono D'Elia; Camil Demetrescu (PLDI, 2018)

A Survey of Symbolic Execution Techniques. - Roberto Baldoni; Emilio Coppa; Daniele Cono D'Elia; Camil Demetrescu; Irene Finocchi (ACM Comput. Surv., 2018)

Accuracy of author names in bibliographic data sources: an Italian case study. - Camil Demetrescu; Andrea Ribichini; Marco Schaerf (Scientometrics, 2018)

Reconstructing C2 Servers for Remote Access Trojans with Symbolic Execution. - Luca Borzacchiello; Emilio Coppa; Daniele Cono D'Elia; Camil Demetrescu (CSCML, 2019)

Static Analysis of ROP Code. - Daniele Cono D'Elia; Emilio Coppa; Andrea Salvati; Camil Demetrescu (EuroSec@EuroSys, 2019)

The ROP needle: hiding trigger-based injection vectors via code reuse. - Pietro Borrello; Emilio Coppa; Daniele Cono D'Elia; Camil Demetrescu (SAC, 2019)

SymNav: Visually Assisting Symbolic Execution. - Marco Angelini; Graziano Blasilli; Luca Borzacchiello; Emilio Coppa; Daniele Cono D'Elia; Camil Demetrescu; Simone Lenti; Simone Nicchi; Giuseppe Santucci (VizSEC, 2019)

On the Shapley value and its application to the Italian VQR research assessment exercise. - Camil Demetrescu; Francesco Lupia; Angelo Mendicelli; Andrea Ribichini; Francesco Scarcello; Marco Schaerf (J. Informetrics, 2019)

Memory models in symbolic execution: key ideas and new thoughts. - Luca Borzacchiello; Emilio Coppa; Daniele Cono D'Elia; Camil Demetrescu (Softw. Test. Verification Reliab., 2019)

On bibliometrics in academic promotions: a case study in computer science and engineering in Italy. - Camil Demetrescu; Irene Finocchi; Andrea Ribichini; Marco Schaerf (Scientometrics, 2020)

Are Italian research assessment exercises size-biased? - Camil Demetrescu; Andrea Ribichini; Marco Schaerf (Scientometrics, 2020)

Fuzzing Symbolic Expressions. - Luca Borzacchiello; Emilio Coppa; Camil Demetrescu (ICSE, 2021)

FUZZOLIC: Mixing fuzzing and concolic execution. - Luca Borzacchiello; Emilio Coppa; Camil Demetrescu (Comput. Secur., 2021)

Reach Me if You Can: On Native Vulnerability Reachability in Android Apps. - Luca Borzacchiello; Emilio Coppa; Davide Maiorca; Andrea Columbu; Camil Demetrescu; Giorgio Giacinto (ESORICS (3), 2022)

Handling Memory-Intensive Operations in Symbolic Execution. - Luca Borzacchiello; Emilio Coppa; Camil Demetrescu (ISEC, 2022)

SymFusion: Hybrid Instrumentation for Concolic Execution. - Emilio Coppa; Heng Yin 001; Camil Demetrescu (ASE, 2022)

Which Conference Is That? A Case Study in Computer Science. - Camil Demetrescu; Irene Finocchi; Andrea Ribichini; Marco Schaerf (ACM J. Data Inf. Qual., 2022)

On computer science research and its temporal evolution. - Camil Demetrescu; Irene Finocchi; Andrea Ribichini; Marco Schaerf (Scientometrics, 2022)

SENinja: A symbolic execution plugin for Binary Ninja. - Luca Borzacchiello; Emilio Coppa; Camil Demetrescu (SoftwareX, 2022)