Sfoglia
Prodotti della tipologia (ordinati per Data di deposito in Decrescente ordine): 3.281 a 3.300 di 9.297
Sparse dynamic programming II : convex and concave cost functions
1992 Eppstein, D; Galil, Z; Giancarlo, R; Italiano, Giuseppe Francesco
Sparse dynamic programming I: linear cost functions
1992 Eppstein, D; Galil, Z; Giancarlo, R; Italiano, Giuseppe Francesco
Maintaining the 3-edge-connected components of a graph on-line
1993 Galil, Z.; Italiano, Giuseppe Francesco
Separator based sparsification I: planarity testing and minimum spanning trees
1996 Eppstein, D.; Galil, Z.; Italiano, Giuseppe Francesco; Spencer, T.
Sparsification: A technique for speeding up dynamic graph algorithms
1997 Eppstein, D.; Galil, Z.; Italiano, Giuseppe Francesco; Nissenzweig, A.
An empirical study of dynamic graph algorithms
1997 Alberts, D; Cattaneo, G; Italiano, Giuseppe Francesco
Fully dynamic planarity testing with applications
1999 Galil, Z.; Italiano, Giuseppe Francesco; Sarnak, N.
Separator based sparsification II: edge and vertex connectivity
1999 Eppstein, D.; Galil, Z.; Italiano, Giuseppe Francesco; Spencer, T.
Algorithm Engineering
1999 Cattaneo, G.; Italiano, Giuseppe Francesco
An algorithm for finding a k-median in a directed tree
2000 A., Vigneron; L., Gao; M., Golin; Italiano, Giuseppe Francesco; B., Li
Dynamically switching vertices in planar graphs
2000 Frigioni, D.; Italiano, Giuseppe Francesco
CATAI: Cooperative Algorithm and Data Types Animation over the Internet
2002 G., Cattaneo; U., FERRARO PETRILLO; Italiano, Giuseppe Francesco
Wavelength Rerouting in Optical Networks, or the Venetian Routing Problem
2002 A., Caprara; Italiano, Giuseppe Francesco; G., Mohan; A., Panconesi; A., Srinivasan
A new approach to dynamic all pairs shortest paths
2004 C., Demetrescu; Italiano, Giuseppe Francesco
Trade-Offs for Fully Dynamic Transitive Closure on DAGs: Breaking Through the O(n2) Barrier
2005 Demetrescu, C; Italiano, Giuseppe Francesco
Dynamic Shortest Paths and Transitive Closure: Algorithmic Techniques and Data Structures
2006 Demetrescu, C; Italiano, Giuseppe Francesco
Fully Dynamic All Pairs Shortest Paths with Real Edge Weights
2006 Demetrescu, C; Italiano, Giuseppe Francesco
Design of trees in the hose model: The balanced case
2006 Italiano, Giuseppe Francesco; Leonardi, S; Oriolo, G
Experimental Analysis of Dynamic All Pairs Shortest Path Algorithms
2006 Demetrescu, C; Italiano, Giuseppe Francesco
Novel Local-Search-Based Approaches to University Examination Timetabling
2008 M., Caramia; P., Dell'Olmo; Italiano, Giuseppe Francesco
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| Sparse dynamic programming II : convex and concave cost functions | 1992 | Eppstein, D; Galil, Z; Giancarlo, R; Italiano, Giuseppe Francesco | |
| Sparse dynamic programming I: linear cost functions | 1992 | Eppstein, D; Galil, Z; Giancarlo, R; Italiano, Giuseppe Francesco | |
| Maintaining the 3-edge-connected components of a graph on-line | 1993 | Galil, Z.; Italiano, Giuseppe Francesco | |
| Separator based sparsification I: planarity testing and minimum spanning trees | 1996 | Eppstein, D.; Galil, Z.; Italiano, Giuseppe Francesco; Spencer, T. | |
| Sparsification: A technique for speeding up dynamic graph algorithms | 1997 | Eppstein, D.; Galil, Z.; Italiano, Giuseppe Francesco; Nissenzweig, A. | |
| An empirical study of dynamic graph algorithms | 1997 | Alberts, D; Cattaneo, G; Italiano, Giuseppe Francesco | |
| Fully dynamic planarity testing with applications | 1999 | Galil, Z.; Italiano, Giuseppe Francesco; Sarnak, N. | |
| Separator based sparsification II: edge and vertex connectivity | 1999 | Eppstein, D.; Galil, Z.; Italiano, Giuseppe Francesco; Spencer, T. | |
| Algorithm Engineering | 1999 | Cattaneo, G.; Italiano, Giuseppe Francesco | |
| An algorithm for finding a k-median in a directed tree | 2000 | A., Vigneron; L., Gao; M., Golin; Italiano, Giuseppe Francesco; B., Li | |
| Dynamically switching vertices in planar graphs | 2000 | Frigioni, D.; Italiano, Giuseppe Francesco | |
| CATAI: Cooperative Algorithm and Data Types Animation over the Internet | 2002 | G., Cattaneo; U., FERRARO PETRILLO; Italiano, Giuseppe Francesco | |
| Wavelength Rerouting in Optical Networks, or the Venetian Routing Problem | 2002 | A., Caprara; Italiano, Giuseppe Francesco; G., Mohan; A., Panconesi; A., Srinivasan | |
| A new approach to dynamic all pairs shortest paths | 2004 | C., Demetrescu; Italiano, Giuseppe Francesco | |
| Trade-Offs for Fully Dynamic Transitive Closure on DAGs: Breaking Through the O(n2) Barrier | 2005 | Demetrescu, C; Italiano, Giuseppe Francesco | |
| Dynamic Shortest Paths and Transitive Closure: Algorithmic Techniques and Data Structures | 2006 | Demetrescu, C; Italiano, Giuseppe Francesco | |
| Fully Dynamic All Pairs Shortest Paths with Real Edge Weights | 2006 | Demetrescu, C; Italiano, Giuseppe Francesco | |
| Design of trees in the hose model: The balanced case | 2006 | Italiano, Giuseppe Francesco; Leonardi, S; Oriolo, G | |
| Experimental Analysis of Dynamic All Pairs Shortest Path Algorithms | 2006 | Demetrescu, C; Italiano, Giuseppe Francesco | |
| Novel Local-Search-Based Approaches to University Examination Timetabling | 2008 | M., Caramia; P., Dell'Olmo; Italiano, Giuseppe Francesco |
Prodotti della tipologia (ordinati per Data di deposito in Decrescente ordine): 3.281 a 3.300 di 9.297
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
Scopri
Collezione
- 01 - Pubblicazione su rivista (JOURNAL ARTICLE)9297
Data di pubblicazione
- In corso di stampa97
- 2020 - 20263015
- 2010 - 20193323
- 2000 - 20091782
- 1990 - 1999710
- 1980 - 1989321
- 1970 - 197947
- 1969 - 19691
Editore
- Elsevier185
- Il Mulino136
- Giuffre Editore Spa:via Busto Arsizio 40, I 20151 Milan Italy:011 39 02 38089200, EMAIL: [email protected], INTERNET: http://www.giuffre.it, Fax: 011 39 02 38009582112
- Springer107
- Routledge83
- Oxford University Press79
- Giuffrè68
- Giuffrè Francis Lefebvre60
- Societa Editrice il Mulino Spa:Strada Maggiore 37, I 40125 Bologna Italy:011 39 051 256011, EMAIL: [email protected], INTERNET: http://www.mulino.it, Fax: 011 39 051 25603456
- Il Sole 24 Ore50
Rivista
- RIVISTA TRIMESTRALE DI DIRITTO PUBBLICO129
- FEDERALISMI.IT109
- GIORNALE DI DIRITTO AMMINISTRATIVO108
- AMMINISTRAZIONE IN CAMMINO95
- ANALISI GIURIDICA DELL'ECONOMIA85
- IL FORO ITALIANO78
- QUADERNI COSTITUZIONALI66
- GIURISPRUDENZA COMMERCIALE59
- OSSERVATORIO SULLE FONTI57
- IL SOLE 24 ORE51
Keyword
- Italy60
- Economics and Econometrics40
- European Union38
- COVID-1931
- DEMOCRAZIA29
- Innovation28
- Management of Technology and Innovation27
- Russia24
- Finance22
- corporate governance21
Lingua
- ita4251
- eng4150
- fre81
- spa65
- ger26
- und9
- por7
- dut5
- ara2
- jpn2
Accesso al fulltext
- reserved4284
- no fulltext2717
- open2131
- partially open150
- restricted10
- embargoed3
- mixed2