Searching for authors named "Irene Finocchi" – sorted by Relevance.
-
Layered drawings of graphs with crossing constraints
- Layered Drawings of Graphs with Crossing Constraints ⋆ Irene Finocchi Department of Computer
- Cited by 3 (0 self) – Add To MetaCart
-
A Portable Virtual Machine for Debugging and Directing
- and Directing # Camil Demetrescu # Irene Finocchi Abstract Directors are reactive systems that monitor
- Add To MetaCart
-
Smooth Animation of Alaorithms in a Declarative Framework
- Smooth Animation of Alaorithms in a Declarative Framework* Camil Demetrescu t Irene Finocchi
- Add To MetaCart
-
Combinatorial Algorithms for Feedback Problems in Directed Graphs
- Finocchi § Abstract Given a weighted directed graph G = (V, A), the minimum feedback arc set problem
- Cited by 6 (1 self) – Add To MetaCart
-
Optimal resilient sorting and searching in the presence of memory faults
- Optimal Resilient Sorting and Searching in the Presence of Memory Faults Irene Finocchi 1
- Cited by 3 (1 self) – Add To MetaCart
-
Resilient search trees
- Abstract Resilient Search Trees ∗ Irene Finocchi † Fabrizio Grandoni † Giuseppe F. Italiano ‡ We
- Cited by 3 (0 self) – Add To MetaCart
-
A General-Purpose Logic-Based Visualization Framework
- A GENERAL-PURPOSE LOGIC-BASED VISUALIZATION FRAMEWORK Camil Demetrescu y 1 Irene Finocchi z y
- Cited by 4 (3 self) – Add To MetaCart
-
On the Validity of Hierarchical Decompositions
- On the Validity of Hierarchical Decompositions ⋆ Irene Finocchi and Rossella Petreschi Department
- Cited by 1 (0 self) – Add To MetaCart
-
Hierarchical Clustering of Trees: Algorithms and Experiments
- Hierarchical Clustering of Trees: Algorithms and Experiments ⋆ Irene Finocchi and Rossella
- Cited by 2 (1 self) – Add To MetaCart
-
Removing Cycles for Minimizing Crossings
- , 00198 Roma, Italy demetres@(email omitted); Irene Finocchi Dipartimento di Scienze dell
- Cited by 3 (0 self) – Add To MetaCart

