Sfoglia per Autore
Exact and approximate algorithms for movement problems on (special classes of) graphs
2016-01-01 Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
Effective edge-fault-tolerant single-source spanners via best (or good) swap edges
2017-01-01 Bilò, Davide; Colella, Feliciano; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
An improved algorithm for computing all the best swap edges of a tree spanner
2017-01-01 Bilò, Davide; Colella, Feliciano; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
Sorting with recurrent comparison errors
2017-01-01 Geissmann, B.; Leucci, S.; Liu, C. -H.; Penna, P.
No truthful mechanism can be better than n approximate for two natural problems
2018-01-01 Leucci, S.; Mamageishvili, A.; Penna, P.
On the complexity of two dots for narrow boards and few colors
2018-01-01 Bilo', Davide; Gualà, L.; Leucci, S.; Misra, N.
Tracks from hell - When finding a proof may be easier than checking it
2018-01-01 Almanza, M.; Leucci, S.; Panconesi, A.
On the PSPACE - Completeness of peg duotaire and other peg-jumping games
2018-01-01 Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido; Rossi, Mirko
Trainyard is NP-Hard
2018-01-01 Almanza, M.; Leucci, S.; Panconesi, A.
Optimal dislocation with persistent errors in subquadratic time
2018-01-01 Geissmann, B.; Leucci, S.; Liu, C. -H.; Penna, P.
Motif counting beyond five nodes
2018-01-01 Bressan, M.; Chierichetti, F.; Kumar, R.; Leucci, S.; Panconesi, A.
Fault-Tolerant Approximate Shortest-Path Trees
2018-01-01 Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
Effcient oracles and routing schemes for replacement paths
2018-01-01 Bilò, Davide; Choudhary, Keerti; Gualà, Luciano; Leucci, Stefano; Parter, Merav; Proietti, Guido
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem
2019-01-01 D’Emidio, Mattia; Forlizzi, Luca; Frigioni, Daniele; Leucci, Stefano; Proietti, Guido
Resilient dictionaries for randomly unreliable memory
2019-01-01 Leucci, S.; Liu, C. -H.; Meierhans, S.
Tracking Routes in Communication Networks
2019-01-01 Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
Optimal sorting with persistent comparison errors
2019-01-01 Geissmann, B.; Leucci, S.; Liu, C. -H.; Penna, P.
Motivo: Fast Motif Counting via Succinct Color Coding and Adaptive Sampling
2019-01-01 Bressan, Marco; Leucci, Stefano; Panconesi, Alessandro
Dual-mode greedy algorithms can save energy
2019-01-01 Geissmann, B.; Leucci, S.; Liu, C. -H.; Penna, P.; Proietti, G.
Tracks from hell — When finding a proof may be easier than checking it
2020-01-01 Almanza, M.; Leucci, S.; Panconesi, A.
Titolo | Data di pubblicazione | Autore(i) | File |
---|---|---|---|
Exact and approximate algorithms for movement problems on (special classes of) graphs | 1-gen-2016 | Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido | |
Effective edge-fault-tolerant single-source spanners via best (or good) swap edges | 1-gen-2017 | Bilò, Davide; Colella, Feliciano; Gualà, Luciano; Leucci, Stefano; Proietti, Guido | |
An improved algorithm for computing all the best swap edges of a tree spanner | 1-gen-2017 | Bilò, Davide; Colella, Feliciano; Gualà, Luciano; Leucci, Stefano; Proietti, Guido | |
Sorting with recurrent comparison errors | 1-gen-2017 | Geissmann, B.; Leucci, S.; Liu, C. -H.; Penna, P. | |
No truthful mechanism can be better than n approximate for two natural problems | 1-gen-2018 | Leucci, S.; Mamageishvili, A.; Penna, P. | |
On the complexity of two dots for narrow boards and few colors | 1-gen-2018 | Bilo', Davide; Gualà, L.; Leucci, S.; Misra, N. | |
Tracks from hell - When finding a proof may be easier than checking it | 1-gen-2018 | Almanza, M.; Leucci, S.; Panconesi, A. | |
On the PSPACE - Completeness of peg duotaire and other peg-jumping games | 1-gen-2018 | Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido; Rossi, Mirko | |
Trainyard is NP-Hard | 1-gen-2018 | Almanza, M.; Leucci, S.; Panconesi, A. | |
Optimal dislocation with persistent errors in subquadratic time | 1-gen-2018 | Geissmann, B.; Leucci, S.; Liu, C. -H.; Penna, P. | |
Motif counting beyond five nodes | 1-gen-2018 | Bressan, M.; Chierichetti, F.; Kumar, R.; Leucci, S.; Panconesi, A. | |
Fault-Tolerant Approximate Shortest-Path Trees | 1-gen-2018 | Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido | |
Effcient oracles and routing schemes for replacement paths | 1-gen-2018 | Bilò, Davide; Choudhary, Keerti; Gualà, Luciano; Leucci, Stefano; Parter, Merav; Proietti, Guido | |
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem | 1-gen-2019 | D’Emidio, Mattia; Forlizzi, Luca; Frigioni, Daniele; Leucci, Stefano; Proietti, Guido | |
Resilient dictionaries for randomly unreliable memory | 1-gen-2019 | Leucci, S.; Liu, C. -H.; Meierhans, S. | |
Tracking Routes in Communication Networks | 1-gen-2019 | Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido | |
Optimal sorting with persistent comparison errors | 1-gen-2019 | Geissmann, B.; Leucci, S.; Liu, C. -H.; Penna, P. | |
Motivo: Fast Motif Counting via Succinct Color Coding and Adaptive Sampling | 1-gen-2019 | Bressan, Marco; Leucci, Stefano; Panconesi, Alessandro | |
Dual-mode greedy algorithms can save energy | 1-gen-2019 | Geissmann, B.; Leucci, S.; Liu, C. -H.; Penna, P.; Proietti, G. | |
Tracks from hell — When finding a proof may be easier than checking it | 1-gen-2020 | Almanza, M.; Leucci, S.; Panconesi, A. |
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