Irene Finocchi

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 15

Top Topics

Computer Science

Dynamic Programming Algorithms

Empirical Evaluation

Multiple Inheritance

Top Venues

ACM J. Exp. Algorithmics

Publications

Irene Finocchi, Renan Leon Garcia, Blerina Sinaimeri
From Stars to Diamonds: Counting and Listing Almost Complete Subgraphs in Large Networks. Comput. J. 67 (6) (2024)
Irene Finocchi, Andrea Ribichini, Marco Schaerf
An analysis of international mobility and research productivity in computer science. Scientometrics 128 (11) (2023)
Marco D'Elia, Irene Finocchi, Maurizio Patrignani
Clique-TF-IDF: A New Partitioning Framework Based on Dense Substructures. AI*IA (2023)
Camil Demetrescu, Irene Finocchi, Andrea Ribichini, Marco Schaerf
Which Conference Is That? A Case Study in Computer Science. ACM J. Data Inf. Qual. 14 (3) (2022)
Camil Demetrescu, Irene Finocchi, Andrea Ribichini, Marco Schaerf
On computer science research and its temporal evolution. Scientometrics 127 (8) (2022)
Camil Demetrescu, Irene Finocchi, Andrea Ribichini, Marco Schaerf
On bibliometrics in academic promotions: a case study in computer science and engineering in Italy. Scientometrics 124 (3) (2020)
Stefano Faralli, Irene Finocchi, Simone Paolo Ponzetto, Paola Velardi
WebIsAGraph: A Very Large Hypernymy Graph from a Web Corpus. CLiC-it (2019)
Emilio Coppa, Irene Finocchi, Renan Leon Garcia
Counting cliques in parallel without a cluster: Engineering a fork/join algorithm for shared-memory platforms. Inf. Sci. 496 (2019)
Roberto Baldoni, Emilio Coppa, Daniele Cono D'Elia, Camil Demetrescu, Irene Finocchi
A Survey of Symbolic Execution Techniques. ACM Comput. Surv. 51 (3) (2018)
Stefano Faralli, Irene Finocchi, Simone Paolo Ponzetto, Paola Velardi
Efficient Pruning of Large Knowledge Graphs. IJCAI (2018)
Stefano Faralli, Irene Finocchi, Simone Paolo Ponzetto, Paola Velardi
CrumbTrail: An efficient methodology to reduce multiple inheritance in knowledge graphs. Knowl. Based Syst. 151 (2018)
Nikhil Bansal, Irene Finocchi
Guest Editors' Foreword. Algorithmica 78 (4) (2017)
Saverio Caminiti, Irene Finocchi, Emanuele G. Fusco, Francesco Silvestri
Resilient Dynamic Programming. Algorithmica 77 (2) (2017)
Roberto Baldoni, Emilio Coppa, Daniele Cono D'Elia, Camil Demetrescu, Irene Finocchi
A Survey of Symbolic Execution Techniques. CoRR (2016)
Daniele Cono D'Elia, Camil Demetrescu, Irene Finocchi
Mining hot calling contexts in small space. Softw. Pract. Exp. 46 (8) (2016)
Irene Finocchi, Marco Finocchi, Emanuele G. Fusco
Clique Counting in MapReduce: Algorithms and Experiments. ACM J. Exp. Algorithmics 20 (2015)
Emilio Coppa, Irene Finocchi
On data skewness, stragglers, and MapReduce progress indicators. SoCC (2015)
Ulrik Brandes, Irene Finocchi, Martin Nöllenburg, Aaron J. Quigley
Empirical Evaluation for Graph Drawing (Dagstuhl Seminar 15052). Dagstuhl Reports 5 (1) (2015)
Emilio Coppa, Irene Finocchi
On data skewness, stragglers, and MapReduce progress indicators. CoRR (2015)
Emilio Coppa, Camil Demetrescu, Irene Finocchi, Romolo Marotta
Estimating the Empirical Cost Function of Routines with Dynamic Workloads. CGO (2014)
Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Luigi Laura
Experimental Evaluation of Algorithms for the Food-Selection Problem. CoRR (2014)
Irene Finocchi, Marco Finocchi, Emanuele G. Fusco
Counting small cliques in MapReduce. CoRR (2014)
Emilio Coppa, Camil Demetrescu, Irene Finocchi
Input-Sensitive Profiling. IEEE Trans. Software Eng. 40 (12) (2014)
Camil Demetrescu, Irene Finocchi, Andrea Ribichini
Reactive Imperative Programming with Dataflow Constraints. ACM Trans. Program. Lang. Syst. 37 (1) (2014)
Irene Finocchi
Software Streams: Big Data Challenges in Dynamic Program Analysis. CiE (2013)
Daniele Cono D'Elia, Camil Demetrescu, Irene Finocchi
Ball-Larus Path Profiling Across Multiple Loop iterations CoRR (2013)
Emilio Coppa, Camil Demetrescu, Irene Finocchi, Romolo Marotta
Multithreaded Input-Sensitive Profiling CoRR (2013)
Giorgio Ausiello, Camil Demetrescu, Irene Finocchi, Donatella Firmani
k-Calling context profiling. OOPSLA (2012)
Emilio Coppa, Camil Demetrescu, Irene Finocchi
Input-sensitive profiling. PLDI (2012)
Tiziana Calamoneri, Irene Finocchi
Editorial: Preface to the special issue. Networks 59 (3) (2012)
Saverio Caminiti, Irene Finocchi, Emanuele G. Fusco
Local dependency dynamic programming in the presence of memory faults. STACS (2011)
Daniele Cono D'Elia, Camil Demetrescu, Irene Finocchi
Mining hot calling contexts in small space. PLDI (2011)
Camil Demetrescu, Irene Finocchi, Andrea Ribichini
Reactive imperative programming with dataflow constraints. OOPSLA (2011)
Camil Demetrescu, Irene Finocchi, Andrea Ribichini
Reactive Imperative Programming with Dataflow Constraints CoRR (2011)
Saverio Caminiti, Irene Finocchi, Emanuele G. Fusco, Francesco Silvestri
Dynamic programming in faulty memory hierarchies (cache-obliviously). FSTTCS (2011)
Irene Finocchi, John Hershberger
Guest editors' foreword. ACM J. Exp. Algorithmics 16 (2011)
Umberto Ferraro Petrillo, Irene Finocchi, Giuseppe F. Italiano
Experimental Study of Resilient Algorithms and Data Structures. SEA (2010)
Saverio Caminiti, Irene Finocchi, Rossella Petreschi
Informative Labeling Schemes for the Least Common Ancestor Problem. ICTCS (2009)
Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
Optimal resilient sorting and searching in the presence of memory faults. Theor. Comput. Sci. 410 (44) (2009)
Camil Demetrescu, Irene Finocchi, Andrea Ribichini
Trading off space for passes in graph streaming problems. ACM Trans. Algorithms 6 (1) (2009)
Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
Resilient dictionaries. ACM Trans. Algorithms 6 (1) (2009)
Umberto Ferraro Petrillo, Irene Finocchi, Giuseppe F. Italiano
The Price of Resiliency: a Case Study on Sorting with Memory Faults. Algorithmica 53 (4) (2009)
Irene Finocchi, Emanuele G. Fusco, Rossella Petreschi
A Note on Algebraic Hypercube Colorings. ITNG (2008)
Saverio Caminiti, Irene Finocchi, Rossella Petreschi
Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors. ESA (2008)
Irene Finocchi, Giuseppe F. Italiano
Sorting and Searching in Faulty Memories. Algorithmica 52 (3) (2008)
Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
Resilient search trees. SODA (2007)
Gerth Stølting Brodal, Rolf Fagerberg, Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano, Allan Grønlund Jørgensen, Gabriel Moruz, Thomas Mølhave
Optimal Resilient Dynamic Dictionaries. ESA (2007)
Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
Designing reliable algorithms in unreliable memories. Comput. Sci. Rev. 1 (2) (2007)
Saverio Caminiti, Irene Finocchi, Rossella Petreschi
On coding labeled trees. Theor. Comput. Sci. 382 (2) (2007)
Umberto Ferraro Petrillo, Irene Finocchi, Giuseppe F. Italiano
The Price of Resiliency: A Case Study on Sorting with Memory Faults. ESA (2006)
Camil Demetrescu, Irene Finocchi
A data-driven graphical toolkit for software visualization. SOFTVIS (2006)
Sajal K. Das, Irene Finocchi, Rossella Petreschi
Conflict-free star-access in parallel memory systems. J. Parallel Distributed Comput. 66 (11) (2006)
Camil Demetrescu, Irene Finocchi, Andrea Ribichini
Trading off space for passes in graph streaming problems. SODA (2006)
Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
Optimal Resilient Sorting and Searching in the Presence of Memory Faults. ICALP (1) (2006)
Irene Finocchi
Crossing-constrained hierarchical drawings. J. Discrete Algorithms 4 (2) (2006)
Vincenzo Bonifaci, Camil Demetrescu, Irene Finocchi, Luigi Laura
Visual editing of animated algorithms: the Leonardo Web builder. AVI (2006)
Irene Finocchi, Rossella Petreschi
Structure-Preserving Hierarchical Decompositions. Theory Comput. Syst. 38 (6) (2005)
Vincenzo Bonifaci, Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Luigi Laura
Portraying Algorithms with Leonardo Web. WISE Workshops (2005)
Irene Finocchi, Alessandro Panconesi, Riccardo Silvestri
An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms. Algorithmica 41 (1) (2005)
Tiziana Calamoneri, Irene Finocchi, Rossella Petreschi
Graph Coloring with Distance Constraints. PDPTA (2005)
Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
Designing Reliable Algorithms in Unreliable Memories. ESA (2005)
Vincenzo Bonifaci, Camil Demetrescu, Irene Finocchi, Luigi Laura
A Java-based system for building animated presentations over the Web. Sci. Comput. Program. 53 (1) (2004)
Sajal K. Das, Irene Finocchi, Rossella Petreschi
Star-Coloring of Graphs for Conflict-Free Access to Parallel Memory Systems. IPDPS (2004)
Camil Demetrescu, Irene Finocchi
A portable virtual machine for program debugging and directing. SAC (2004)
Irene Finocchi, Rossella Petreschi
Divider-based algorithms for hierarchical tree partitioning. Discret. Appl. Math. 136 (2-3) (2004)
Saverio Caminiti, Irene Finocchi, Rossella Petreschi
A Unified Approach to Coding Labeled Trees. LATIN (2004)
Irene Finocchi, Giuseppe F. Italiano
Sorting and searching in the presence of memory faults (without redundancy). STOC (2004)
Camil Demetrescu, Irene Finocchi
Combinatorial algorithms for feedback problems in directed graphs. Inf. Process. Lett. 86 (3) (2003)
Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano
Engineering and Visualizing Algorithms. Graph Drawing (2003)
Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano
Algorithm engineering, Algorithmics Column. Bull. EATCS 79 (2003)
Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi
On max cut in cubic graphs. Parallel Algorithms Appl. 17 (3) (2002)
Irene Finocchi, Alessandro Panconesi, Riccardo Silvestri
Experimental analysis of simple, distributed vertex coloring algorithms. SODA (2002)
Camil Demetrescu, Irene Finocchi
Removing Cycles for Minimizing Crossings. ACM J. Exp. Algorithmics 6 (2001)
Irene Finocchi, Rossella Petreschi
On the Validity of Hierarchical Decompositions. COCOON (2001)
James Abello, Irene Finocchi, Jeffrey L. Korn
Graph Sketches. INFOVIS (2001)
Camil Demetrescu, Irene Finocchi
Smooth Animation of Algorithms in a Declarative Framework. J. Vis. Lang. Comput. 12 (3) (2001)
Irene Finocchi, Rossella Petreschi
Hierarchical Clustering of Trees: Algorithms and Experiments. ALENEX (2001)
Irene Finocchi
Layered Drawings of Graphs with Crossing Constraints. COCOON (2001)
Irene Finocchi, Rossella Petreschi
Tree partitioning via vertex deletion. Electron. Notes Discret. Math. 8 (2001)
Camil Demetrescu, Irene Finocchi, John T. Stasko
Specifying Algorithm Visualizations: Interesting Events or State Mapping? Software Visualization (2001)
Camil Demetrescu, Irene Finocchi, Giuseppe Liotta
Visualizing Algorithms over the Web with the Publication-Driven Approach. WAE (2000)
Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Stefan Näher
Visualization in Algorithm Engineering: Tools and Techniques. Experimental Algorithmics (2000)
Pierluigi Crescenzi, Camil Demetrescu, Irene Finocchi, Rossella Petreschi
Reversible Execution and Visualization of Programs with LEONARDO. J. Vis. Lang. Comput. 11 (2) (2000)
Camil Demetrescu, Irene Finocchi
A Technique for Generating Graphical Abstractions of Program Data Structures. VISUAL (1999)
Camil Demetrescu, Giuseppe Di Battista, Irene Finocchi, Giuseppe Liotta, Maurizio Patrignani, Maurizio Pizzonia
Infinite Trees and the Future. Graph Drawing (1999)
Camil Demetrescu, Irene Finocchi
Smooth Animation of Algorithms in a Declarative Framework. VL (1999)
Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi
A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs. ASIAN (1999)
Pierluigi Crescenzi, Camil Demetrescu, Irene Finocchi, Rossella Petreschi
LEONARDO: a software visualization system. WAE (1997)