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

A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs. - Tiziana Calamoneri; Irene Finocchi; Yannis Manoussakis; Rossella Petreschi (ASIAN, 1999)

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)

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

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

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

Hierarchical Clustering of Trees: Algorithms and Experiments. - Irene Finocchi; Rossella Petreschi (ALENEX, 2001)

Layered Drawings of Graphs with Crossing Constraints. - Irene Finocchi (COCOON, 2001)

On the Validity of Hierarchical Decompositions. - Irene Finocchi; Rossella Petreschi (COCOON, 2001)

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

Graph Sketches. - James Abello; Irene Finocchi; Jeffrey L. Korn (INFOVIS, 2001)

Tree partitioning via vertex deletion. - Irene Finocchi; Rossella Petreschi (Electron. Notes Discret. Math., 2001)

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

Smooth Animation of Algorithms in a Declarative Framework. - Camil Demetrescu; Irene Finocchi (J. Vis. Lang. Comput., 2001)

Experimental analysis of simple, distributed vertex coloring algorithms. - Irene Finocchi; Alessandro Panconesi; Riccardo Silvestri (SODA, 2002)

On max cut in cubic graphs. - Tiziana Calamoneri; Irene Finocchi; Yannis Manoussakis; Rossella Petreschi (Parallel Algorithms Appl., 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)

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)

Star-Coloring of Graphs for Conflict-Free Access to Parallel Memory Systems. - Sajal K. Das 001; Irene Finocchi; Rossella Petreschi (IPDPS, 2004)

A Unified Approach to Coding Labeled Trees. - Saverio Caminiti; Irene Finocchi; Rossella Petreschi (LATIN, 2004)

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

Sorting and searching in the presence of memory faults (without redundancy). - Irene Finocchi; Giuseppe F. Italiano (STOC, 2004)

Divider-based algorithms for hierarchical tree partitioning. - Irene Finocchi; Rossella Petreschi (Discret. Appl. Math., 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)

Graph Coloring with Distance Constraints. - Tiziana Calamoneri; Irene Finocchi; Rossella Petreschi (PDPTA, 2005)

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

An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms. - Irene Finocchi; Alessandro Panconesi; Riccardo Silvestri (Algorithmica, 2005)

Structure-Preserving Hierarchical Decompositions. - Irene Finocchi; Rossella Petreschi (Theory Comput. Syst., 2005)

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

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

Crossing-constrained hierarchical drawings. - Irene Finocchi (J. Discrete Algorithms, 2006)

Conflict-free star-access in parallel memory systems. - Sajal K. Das 001; Irene Finocchi; Rossella Petreschi (J. Parallel Distributed Comput., 2006)

Optimal Resilient Dynamic Dictionaries. - Gerth Stølting Brodal; Rolf Fagerberg; Irene Finocchi; Fabrizio Grandoni 001; Giuseppe F. Italiano; Allan Grønlund Jørgensen; Gabriel Moruz; Thomas Mølhave (ESA, 2007)

Resilient search trees. - Irene Finocchi; Fabrizio Grandoni 001; Giuseppe F. Italiano (SODA, 2007)

Designing reliable algorithms in unreliable memories. - Irene Finocchi; Fabrizio Grandoni 001; Giuseppe F. Italiano (Comput. Sci. Rev., 2007)

On coding labeled trees. - Saverio Caminiti; Irene Finocchi; Rossella Petreschi (Theor. Comput. Sci., 2007)

Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors. - Saverio Caminiti; Irene Finocchi; Rossella Petreschi (ESA, 2008)

A Note on Algebraic Hypercube Colorings. - Irene Finocchi; Emanuele G. Fusco; Rossella Petreschi (ITNG, 2008)

Sorting and Searching in Faulty Memories. - Irene Finocchi; Giuseppe F. Italiano (Algorithmica, 2008)

Informative Labeling Schemes for the Least Common Ancestor Problem. - Saverio Caminiti; Irene Finocchi; Rossella Petreschi (ICTCS, 2009)

The Price of Resiliency: a Case Study on Sorting with Memory Faults. - Umberto Ferraro Petrillo; Irene Finocchi; Giuseppe F. Italiano (Algorithmica, 2009)

Trading off space for passes in graph streaming problems. - Camil Demetrescu; Irene Finocchi; Andrea Ribichini (ACM Trans. Algorithms, 2009)

Resilient dictionaries. - Irene Finocchi; Fabrizio Grandoni 001; Giuseppe F. Italiano (ACM Trans. Algorithms, 2009)

Optimal resilient sorting and searching in the presence of memory faults. - Irene Finocchi; Fabrizio Grandoni 001; Giuseppe F. Italiano (Theor. Comput. Sci., 2009)

Experimental Study of Resilient Algorithms and Data Structures. - Umberto Ferraro Petrillo; Irene Finocchi; Giuseppe F. Italiano (SEA, 2010)

Dynamic programming in faulty memory hierarchies (cache-obliviously). - Saverio Caminiti; Irene Finocchi; Emanuele G. Fusco; Francesco Silvestri 001 (FSTTCS, 2011)

Local dependency dynamic programming in the presence of memory faults. - Saverio Caminiti; Irene Finocchi; Emanuele G. Fusco (STACS, 2011)

Guest editors' foreword. - Irene Finocchi; John Hershberger 001 (ACM J. Exp. Algorithmics, 2011)

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

Editorial: Preface to the special issue. - Tiziana Calamoneri; Irene Finocchi (Networks, 2012)

Software Streams: Big Data Challenges in Dynamic Program Analysis. - Irene Finocchi (CiE, 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)

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)

Counting small cliques in MapReduce. - Irene Finocchi; Marco Finocchi; Emanuele G. Fusco (CoRR, 2014)

Reactive Imperative Programming with Dataflow Constraints. - Camil Demetrescu; Irene Finocchi; Andrea Ribichini (ACM Trans. Program. Lang. Syst., 2014)

Input-Sensitive Profiling. - Emilio Coppa; Camil Demetrescu; Irene Finocchi (IEEE Trans. Software Eng., 2014)

On data skewness, stragglers, and MapReduce progress indicators. - Emilio Coppa; Irene Finocchi (SoCC, 2015)

Empirical Evaluation for Graph Drawing (Dagstuhl Seminar 15052). - Ulrik Brandes; Irene Finocchi; Martin Nöllenburg; Aaron J. Quigley (Dagstuhl Reports, 2015)

Clique Counting in MapReduce: Algorithms and Experiments. - Irene Finocchi; Marco Finocchi; Emanuele G. Fusco (ACM J. Exp. Algorithmics, 2015)

Mining hot calling contexts in small space. - Daniele Cono D'Elia; Camil Demetrescu; Irene Finocchi (Softw. Pract. Exp., 2016)

Guest Editors' Foreword. - Nikhil Bansal 001; Irene Finocchi (Algorithmica, 2017)

Resilient Dynamic Programming. - Saverio Caminiti; Irene Finocchi; Emanuele G. Fusco; Francesco Silvestri 001 (Algorithmica, 2017)

Efficient Pruning of Large Knowledge Graphs. - Stefano Faralli 001; Irene Finocchi; Simone Paolo Ponzetto; Paola Velardi (IJCAI, 2018)

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

CrumbTrail: An efficient methodology to reduce multiple inheritance in knowledge graphs. - Stefano Faralli 001; Irene Finocchi; Simone Paolo Ponzetto; Paola Velardi (Knowl. Based Syst., 2018)

WebIsAGraph: A Very Large Hypernymy Graph from a Web Corpus. - Stefano Faralli 001; Irene Finocchi; Simone Paolo Ponzetto; Paola Velardi (CLiC-it, 2019)

Counting cliques in parallel without a cluster: Engineering a fork/join algorithm for shared-memory platforms. - Emilio Coppa; Irene Finocchi; Renan Leon Garcia (Inf. Sci., 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)

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)

Clique-TF-IDF: A New Partitioning Framework Based on Dense Substructures. - Marco D'Elia; Irene Finocchi; Maurizio Patrignani (AI*IA, 2023)

An analysis of international mobility and research productivity in computer science. - Irene Finocchi; Andrea Ribichini; Marco Schaerf (Scientometrics, 2023)

From Stars to Diamonds: Counting and Listing Almost Complete Subgraphs in Large Networks. - Irene Finocchi; Renan Leon Garcia; Blerina Sinaimeri (Comput. J., 2024)

Maximal cliques summarization: Principles, problem classification, and algorithmic approaches. - Marco D'Elia; Irene Finocchi; Maurizio Patrignani (Comput. Sci. Rev., 2025)

A large-scale temporal analysis of scientific production across disciplines and countries. - Irene Finocchi; Andrea Ribichini; Marco Schaerf (J. Informetrics, 2025)