Sfoglia per Autore
LEONARDO: a software visualization system
1997 Crescenzi, P.; Demetrescu, Camil; Finocchi, Irene; Petreschi, Rossella
Infinite Trees and the Future
1999 Demetrescu, Camil; G., Di Battista; Finocchi, Irene; Giuseppe, Liotta; Maurizio, Patrignani; Maurizio, Pizzonia
Smooth animation of algorithms in a declarative framework
1999 Demetrescu, Camil; Finocchi, Irene
Reversible execution and visualization of programs with LEONARDO
2000 Pierluigi, Crescenzi; Demetrescu, Camil; Finocchi, Irene; Petreschi, Rossella
Fully dynamic transitive closure: Breaking through the O(n(2)) barrier
2000 Demetrescu, Camil; Giuseppe F., Italiano
Break the `Right' Cycles and Get the `Best' Drawing'
2000 Demetrescu, Camil; Finocchi, Irene
Breaking cycles for minimizing crossings
2001 Demetrescu, Camil; Finocchi, Irene
Fully Dynamic Algorithms for Path Problems on Directed Graphs
2001 Demetrescu, Camil
Fully dynamic all pairs shortest paths with real edge weights
2001 Demetrescu, Camil; G. F., Italiano
Visualizing Algorithms over the Web with the Publication-Driven Approach
2001 Demetrescu, Camil; Finocchi, Irene; Liotta, Giuseppe
Smooth animation of algorithms in a declarative framework
2001 Demetrescu, Camil; Finocchi, Irene
Maintaining shortest paths in digraphs with arbitrary arc weights: An experimental study
2001 Demetrescu, Camil; Frigioni, Daniele; Nanni, Umberto; MARCHETTI SPACCAMELA, Alberto
Oracles for distances avoiding a link-failure
2002 Demetrescu, Camil; M., Thorup
Specifying algorithm visualizations: Interesting events or state mapping?
2002 Demetrescu, Camil; Finocchi, Irene; John T., Stasko
Improved bounds and new trade-offs for dynamic all pairs shortest paths
2002 Demetrescu, Camil; Giuseppe F., Italiano
Visualization in algorithm engineering: Tools and techniques
2002 Demetrescu, Camil; Finocchi, Irene; Giuseppe F., Italiano; S., Naeher
A System for Building Animated Presentations over the Web
2003 B. A., Colombo; Demetrescu, Camil; Finocchi, Irene; Laura, Luigi
Algorithm Engineering
2003 Demetrescu, Camil; Finocchi, Irene; G. F., Italiano
DYNAMIC GRAPH ALGORITHMS
2003 Demetrescu, Camil; Finocchi, Irene; G. F., Italiano
Combinatorial algorithms for feedback problems in directed graphs
2003 Demetrescu, Camil; Finocchi, Irene
Titolo | Data di pubblicazione | Autore(i) | File |
---|---|---|---|
LEONARDO: a software visualization system | 1997 | Crescenzi, P.; Demetrescu, Camil; Finocchi, Irene; Petreschi, Rossella | |
Infinite Trees and the Future | 1999 | Demetrescu, Camil; G., Di Battista; Finocchi, Irene; Giuseppe, Liotta; Maurizio, Patrignani; Maurizio, Pizzonia | |
Smooth animation of algorithms in a declarative framework | 1999 | Demetrescu, Camil; Finocchi, Irene | |
Reversible execution and visualization of programs with LEONARDO | 2000 | Pierluigi, Crescenzi; Demetrescu, Camil; Finocchi, Irene; Petreschi, Rossella | |
Fully dynamic transitive closure: Breaking through the O(n(2)) barrier | 2000 | Demetrescu, Camil; Giuseppe F., Italiano | |
Break the `Right' Cycles and Get the `Best' Drawing' | 2000 | Demetrescu, Camil; Finocchi, Irene | |
Breaking cycles for minimizing crossings | 2001 | Demetrescu, Camil; Finocchi, Irene | |
Fully Dynamic Algorithms for Path Problems on Directed Graphs | 2001 | Demetrescu, Camil | |
Fully dynamic all pairs shortest paths with real edge weights | 2001 | Demetrescu, Camil; G. F., Italiano | |
Visualizing Algorithms over the Web with the Publication-Driven Approach | 2001 | Demetrescu, Camil; Finocchi, Irene; Liotta, Giuseppe | |
Smooth animation of algorithms in a declarative framework | 2001 | Demetrescu, Camil; Finocchi, Irene | |
Maintaining shortest paths in digraphs with arbitrary arc weights: An experimental study | 2001 | Demetrescu, Camil; Frigioni, Daniele; Nanni, Umberto; MARCHETTI SPACCAMELA, Alberto | |
Oracles for distances avoiding a link-failure | 2002 | Demetrescu, Camil; M., Thorup | |
Specifying algorithm visualizations: Interesting events or state mapping? | 2002 | Demetrescu, Camil; Finocchi, Irene; John T., Stasko | |
Improved bounds and new trade-offs for dynamic all pairs shortest paths | 2002 | Demetrescu, Camil; Giuseppe F., Italiano | |
Visualization in algorithm engineering: Tools and techniques | 2002 | Demetrescu, Camil; Finocchi, Irene; Giuseppe F., Italiano; S., Naeher | |
A System for Building Animated Presentations over the Web | 2003 | B. A., Colombo; Demetrescu, Camil; Finocchi, Irene; Laura, Luigi | |
Algorithm Engineering | 2003 | Demetrescu, Camil; Finocchi, Irene; G. F., Italiano | |
DYNAMIC GRAPH ALGORITHMS | 2003 | Demetrescu, Camil; Finocchi, Irene; G. F., Italiano | |
Combinatorial algorithms for feedback problems in directed graphs | 2003 | Demetrescu, Camil; Finocchi, Irene |
Legenda icone
- file ad accesso aperto
- file disponibili sulla rete interna
- file disponibili agli utenti autorizzati
- file disponibili solo agli amministratori
- file sotto embargo
- nessun file disponibile