RicercaInizia una nuova ricerca
NOTA: è possibile cercare una corrispondenza esatta usando i doppi apici, ad es: "evoluzione della specie". Qualora si cerchi un identificativo, è consigliabile cercarlo in due modi differenti: tra apici con caratteri speciali es: "978-94-6366-274" oppure senza caratteri speciali solo come sequenza numerica: es 978946366274.
An algorithm for finding a k-median in a directed tree
2000 A., Vigneron; L., Gao; M., Golin; Italiano, Giuseppe Francesco; B., Li
An empirical study of dynamic graph algorithms
1997 Alberts, D; Cattaneo, G; Italiano, Giuseppe Francesco
Approximating the smallest 2-vertex connected spanning subgraph of a directed graph
2020 Georgiadis, L.; Italiano, Giuseppe Francesco; Karanasiou, A.
CATAI: Cooperative Algorithm and Data Types Animation over the Internet
2002 G., Cattaneo; U., FERRARO PETRILLO; Italiano, Giuseppe Francesco
CHECKCOL: Improved local search for graph coloring
2006 Caramia, M; Dell'Olmo, P; Italiano, Giuseppe Francesco
Computing critical nodes in directed graphs
2018 Paudel, Nilakantha; Georgiadis, Loukas; Italiano, Giuseppe Francesco
Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming
2010 Ausiello, G; Franciosa, P; Italiano, Giuseppe Francesco; Ribichini, A
Data structures and algorithms for disjoint set union problems
1991 Galil, Z; Italiano, Giuseppe Francesco
Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries
2013 Ferraro Petrillo, U; Grandoni, Fabrizio; Italiano, Giuseppe Francesco
Decremental 2- and 3-connectivity on planar graphs
1996 Giammarresi, D.; Italiano, Giuseppe Francesco
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| An algorithm for finding a k-median in a directed tree | 2000 | A., Vigneron; L., Gao; M., Golin; Italiano, Giuseppe Francesco; B., Li | |
| An empirical study of dynamic graph algorithms | 1997 | Alberts, D; Cattaneo, G; Italiano, Giuseppe Francesco | |
| Approximating the smallest 2-vertex connected spanning subgraph of a directed graph | 2020 | Georgiadis, L.; Italiano, Giuseppe Francesco; Karanasiou, A. | |
| CATAI: Cooperative Algorithm and Data Types Animation over the Internet | 2002 | G., Cattaneo; U., FERRARO PETRILLO; Italiano, Giuseppe Francesco | |
| CHECKCOL: Improved local search for graph coloring | 2006 | Caramia, M; Dell'Olmo, P; Italiano, Giuseppe Francesco | |
| Computing critical nodes in directed graphs | 2018 | Paudel, Nilakantha; Georgiadis, Loukas; Italiano, Giuseppe Francesco | |
| Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming | 2010 | Ausiello, G; Franciosa, P; Italiano, Giuseppe Francesco; Ribichini, A | |
| Data structures and algorithms for disjoint set union problems | 1991 | Galil, Z; Italiano, Giuseppe Francesco | |
| Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries | 2013 | Ferraro Petrillo, U; Grandoni, Fabrizio; Italiano, Giuseppe Francesco | |
| Decremental 2- and 3-connectivity on planar graphs | 1996 | Giammarresi, D.; Italiano, Giuseppe Francesco |
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
Opzioni
Scopri
Collezione
- 01 - Pubblicazione su rivista (JOURNAL ARTICLE) 72
- 01 - Pubblicazione su rivista (JOURNAL ARTICLE)::01.1 - Articolo su rivista (Article) 72
Data di pubblicazione
- 2020 - 2023 6
- 2010 - 2019 21
- 2000 - 2009 18
- 1990 - 1999 24
- 1986 - 1989 3
Editore
- Elsevier 2
- ACM (Association for Computing Machinery) 1
- Association for Computing Machinery 1
- Society for Industrial and Applied Mathematics Publications 1
Rivista
- THEORETICAL COMPUTER SCIENCE 9
- ALGORITHMICA 8
- JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY 6
- SIAM JOURNAL ON COMPUTING 6
- ACM JOURNAL OF EXPERIMENTAL ALGORITHMICS 3
- ACM TRANSACTIONS ON ALGORITHMS 3
- INFORMATION AND COMPUTATION 3
- INFORMATION PROCESSING LETTERS 3
- JOURNAL OF ALGORITHMS 3
- JOURNAL OF DISCRETE ALGORITHMS 3
Keyword
- Dynamic graph algorithms 5
- Approximation algorithms 3
- Directed graphs 3
- Graph algorithms 3
- Shortest paths 3
- Analysis of algorithms 2
- Combinatorial optimization 2
- Critical nodes 2
- Design and Analysis of Algorithms 2
- Dynamic data structures 2
Lingua
- eng 72
Accesso al fulltext
- no fulltext 53
- reserved 17
- open 2