| 2009 |
| 47 | | Irene Finocchi,
John Hershberger:
Proceedings of the Workshop on Algorithm Engineering and Experiments, ALENEX 2009, New York, New York, USA, January 3, 2009
SIAM 2009 |
| 2008 |
| 46 | EE | Saverio Caminiti,
Irene Finocchi,
Rossella Petreschi:
Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors.
ESA 2008: 234-245 |
| 45 | EE | Irene Finocchi,
Emanuele G. Fusco,
Rossella Petreschi:
A Note on Algebraic Hypercube Colorings.
ITNG 2008: 869-874 |
| 44 | EE | Irene Finocchi,
Giuseppe F. Italiano:
Sorting and Searching in Faulty Memories.
Algorithmica 52(3): 309-332 (2008) |
| 2007 |
| 43 | EE | 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: 347-358 |
| 42 | EE | Irene Finocchi,
Fabrizio Grandoni,
Giuseppe F. Italiano:
Resilient search trees.
SODA 2007: 547-553 |
| 41 | EE | Irene Finocchi,
Fabrizio Grandoni,
Giuseppe F. Italiano:
Designing reliable algorithms in unreliable memories.
Computer Science Review 1(2): 77-87 (2007) |
| 40 | EE | Saverio Caminiti,
Irene Finocchi,
Rossella Petreschi:
On coding labeled trees.
Theor. Comput. Sci. 382(2): 97-108 (2007) |
| 2006 |
| 39 | | Tiziana Calamoneri,
Irene Finocchi,
Giuseppe F. Italiano:
Algorithms and Complexity, 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings
Springer 2006 |
| 38 | EE | Vincenzo Bonifaci,
Camil Demetrescu,
Irene Finocchi,
Luigi Laura:
Visual editing of animated algorithms: the Leonardo Web builder.
AVI 2006: 476-479 |
| 37 | EE | Umberto Ferraro Petrillo,
Irene Finocchi,
Giuseppe F. Italiano:
The Price of Resiliency: A Case Study on Sorting with Memory Faults.
ESA 2006: 768-779 |
| 36 | EE | Irene Finocchi,
Fabrizio Grandoni,
Giuseppe F. Italiano:
Optimal Resilient Sorting and Searching in the Presence of Memory Faults.
ICALP (1) 2006: 286-298 |
| 35 | EE | Camil Demetrescu,
Irene Finocchi,
Andrea Ribichini:
Trading off space for passes in graph streaming problems.
SODA 2006: 714-723 |
| 34 | EE | Camil Demetrescu,
Irene Finocchi:
A data-driven graphical toolkit for software visualization.
SOFTVIS 2006: 57-66 |
| 33 | EE | Irene Finocchi:
Crossing-constrained hierarchical drawings.
J. Discrete Algorithms 4(2): 299-312 (2006) |
| 32 | EE | Sajal K. Das,
Irene Finocchi,
Rossella Petreschi:
Conflict-free star-access in parallel memory systems.
J. Parallel Distrib. Comput. 66(11): 1431-1441 (2006) |
| 2005 |
| 31 | EE | Irene Finocchi,
Fabrizio Grandoni,
Giuseppe F. Italiano:
Designing Reliable Algorithms in Unreliable Memories.
ESA 2005: 1-8 |
| 30 | | Tiziana Calamoneri,
Irene Finocchi,
Rossella Petreschi:
Graph Coloring with Distance Constraints.
PDPTA 2005: 131-140 |
| 29 | EE | Vincenzo Bonifaci,
Camil Demetrescu,
Irene Finocchi,
Giuseppe F. Italiano,
Luigi Laura:
Portraying Algorithms with Leonardo Web.
WISE Workshops 2005: 73-83 |
| 28 | EE | Irene Finocchi,
Rossella Petreschi:
Structure-Preserving Hierarchical Decompositions.
Theory Comput. Syst. 38(6): 687-700 (2005) |
| 2004 |
| 27 | EE | Sajal K. Das,
Irene Finocchi,
Rossella Petreschi:
Star-Coloring of Graphs for Conflict-Free Access to Parallel Memory Systems.
IPDPS 2004 |
| 26 | EE | Saverio Caminiti,
Irene Finocchi,
Rossella Petreschi:
A Unified Approach to Coding Labeled Trees.
LATIN 2004: 339-348 |
| 25 | EE | Camil Demetrescu,
Irene Finocchi:
A portable virtual machine for program debugging and directing.
SAC 2004: 1524-1530 |
| 24 | EE | Irene Finocchi,
Giuseppe F. Italiano:
Sorting and searching in the presence of memory faults (without redundancy).
STOC 2004: 101-110 |
| 23 | EE | Irene Finocchi,
Alessandro Panconesi,
Riccardo Silvestri:
An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms.
Algorithmica 41(1): 1-23 (2004) |
| 22 | EE | Irene Finocchi,
Rossella Petreschi:
Divider-based algorithms for hierarchical tree partitioning.
Discrete Applied Mathematics 136(2-3): 227-247 (2004) |
| 21 | EE | Vincenzo Bonifaci,
Camil Demetrescu,
Irene Finocchi,
Luigi Laura:
A Java-based system for building animated presentations over the Web.
Sci. Comput. Program. 53(1): 37-49 (2004) |
| 2003 |
| 20 | EE | Camil Demetrescu,
Irene Finocchi,
Giuseppe F. Italiano:
Engineering and Visualizing Algorithms.
Graph Drawing 2003: 509-513 |
| 19 | | Camil Demetrescu,
Irene Finocchi,
Giuseppe F. Italiano:
Algorithm engineering, Algorithmics Column.
Bulletin of the EATCS 79: 48-63 (2003) |
| 18 | EE | Camil Demetrescu,
Irene Finocchi:
Combinatorial algorithms for feedback problems in directed graphs.
Inf. Process. Lett. 86(3): 129-136 (2003) |
| 2002 |
| 17 | EE | Irene Finocchi,
Alessandro Panconesi,
Riccardo Silvestri:
Experimental analysis of simple, distributed vertex coloring algorithms.
SODA 2002: 606-615 |
| 16 | EE | Tiziana Calamoneri,
Irene Finocchi,
Yannis Manoussakis,
Rossella Petreschi:
On max cut in cubic graphs.
Parallel Algorithms Appl. 17(3): 165-183 (2002) |
| 2001 |
| 15 | EE | Irene Finocchi,
Rossella Petreschi:
Hierarchical Clustering of Trees: Algorithms and Experiments.
ALENEX 2001: 117-131 |
| 14 | EE | Irene Finocchi:
Layered Drawings of Graphs with Crossing Constraints.
COCOON 2001: 357-367 |
| 13 | EE | Irene Finocchi,
Rossella Petreschi:
On the Validity of Hierarchical Decompositions.
COCOON 2001: 368-374 |
| 12 | EE | James Abello,
Irene Finocchi,
Jeffrey L. Korn:
Visualization of State Transition Graphs Graph Sketches.
INFOVIS 2001: 67- |
| 11 | EE | Camil Demetrescu,
Irene Finocchi,
John T. Stasko:
Specifying Algorithm Visualizations: Interesting Events or State Mapping?
Software Visualization 2001: 16-30 |
| 10 | | Camil Demetrescu,
Irene Finocchi:
Rwmoving Cycles for Minimizing Crossings.
ACM Journal of Experimental Algorithmics 6: 2- (2001) |
| 9 | EE | Irene Finocchi,
Rossella Petreschi:
Tree partitioning via vertex deletion.
Electronic Notes in Discrete Mathematics 8: 38-41 (2001) |
| 8 | | Camil Demetrescu,
Irene Finocchi:
Smooth Animation of Algorithms in a Declarative Framework.
J. Vis. Lang. Comput. 12(3): 253-281 (2001) |
| 2000 |
| 7 | EE | Camil Demetrescu,
Irene Finocchi,
Giuseppe Liotta:
Visualizing Algorithms over the Web with the Publication-Driven Approach.
Algorithm Engineering 2000: 147-158 |
| 6 | EE | Camil Demetrescu,
Irene Finocchi,
Giuseppe F. Italiano,
Stefan Näher:
Visualization in Algorithm Engineering: Tools and Techniques.
Experimental Algorithmics 2000: 24-50 |
| 5 | | Pierluigi Crescenzi,
Camil Demetrescu,
Irene Finocchi,
Rossella Petreschi:
Reversible Execution and Visualization of Programs with LEONARDO.
J. Vis. Lang. Comput. 11(2): 125-150 (2000) |
| 1999 |
| 4 | EE | Tiziana Calamoneri,
Irene Finocchi,
Yannis Manoussakis,
Rossella Petreschi:
A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs.
ASIAN 1999: 27-36 |
| 3 | EE | Camil Demetrescu,
Giuseppe Di Battista,
Irene Finocchi,
Giuseppe Liotta,
Maurizio Patrignani,
Maurizio Pizzonia:
Infinite Trees and the Future.
Graph Drawing 1999: 379-391 |
| 2 | EE | Camil Demetrescu,
Irene Finocchi:
A Technique for Generating Graphical Abstractions of Program Data Structures.
VISUAL 1999: 785-792 |
| 1 | EE | Camil Demetrescu,
Irene Finocchi:
Smooth Animation of Algorithms in a Declarative Framework.
VL 1999: 280-287 |