GUALA', LUCIANO
GUALA', LUCIANO
Dipartimento di Ingegneria dell'Impresa "Mario Lucertini"
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree
2014-07-12 Bilo, D; Guala', L; Proietti, G
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree
2013-01-01 Bilò, D; Guala', L; Proietti, G
A faster computation of all the best swap edges of a tree spanner
2015-01-01 Bilò, D; Colella, F; Guala', L; Leucci, S; Proietti, G
A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors
2018-08-01 Clementi, A; Ghaffari, M; Guala', L; Natale, E; Pasquale, F; Scornavacca, G
A Truthful (2-2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals
2005-01-01 Guala', L; Proietti, G
An algorithm composition scheme preserving monotonicity
2007-01-01 Bilò, D; Forlizzi, L; Guala', L; Proietti, G
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner
2020-01-01 Bilo, D; Colella, F; Guala, L; Leucci, S; Proietti, G
An improved algorithm for computing all the best swap edges of a tree spanner
2017-01-01 Bilò, D; Colella, F; Gualà, L; Leucci, S; Proietti, G
Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems
2007-01-01 Bilò, D; Forlizzi, L; Guala', L; Proietti, G
Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems
2008-01-01 Bilò, D; Forlizzi, L; Guala', L; Proietti, G
Bejeweled, Candy Crush and other match-three games are (NP-)hard
2014-01-01 Guala', L; Leucci, S; Natale, E
Blackout-tolerant temporal spanners
2024-05-01 Bilò, D; D'Angelo, G; Guala', L; Leucci, S; Rossi, M
Blackout-Tolerant Temporal Spanners
2022-01-01 Bilo, D; D'Angelo, G; Guala', L; Leucci, S; Rossi, M
Bounded-Distance Network Creation Games
2015-06-01 Bilò, D; Guala', L; Proietti, G
Bounded-Distance Network Creation Games
2012-01-01 Bilò, D; Guala', L; Proietti, G
Brief announcement: On the parallel undecided-state dynamics with two colors
2017-01-01 Clementi, A; Gualà, L; Pasquale, F; Scornavacca, G
Coalition Resilient Outcomes in Max k-Cut Games
2019-01-01 Carosi, R; Fioravanti, S; Gualà, L; Monaco, G
Compact and fast sensitivity oracles for single-source distances
2016-01-01 Bilo, D; Guala', L; Leucci, S; Proietti, G
Computational aspects of a 2-player Stackelberg shortest paths tree game
2008-01-01 Bilò, D; Guala', L; Proietti, G; Widmayer, P
Consensus vs broadcast, with and without noise
2020-01-01 Clementi, A; Guala, L; Natale, E; Pasquale, F; Scornavacca, G; Trevisan, L
| Data di pubblicazione | Titolo | Autore(i) | Tipo | File |
|---|---|---|---|---|
| 12-lug-2014 | A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree | Bilo, D; Guala', L; Proietti, G | Articolo su rivista | |
| 1-gen-2013 | A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree | Bilò, D; Guala', L; Proietti, G | Intervento a convegno | |
| 1-gen-2015 | A faster computation of all the best swap edges of a tree spanner | Bilò, D; Colella, F; Guala', L; Leucci, S; Proietti, G | Intervento a convegno | |
| 1-ago-2018 | A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors | Clementi, A; Ghaffari, M; Guala', L; Natale, E; Pasquale, F; Scornavacca, G | Intervento a convegno | |
| 1-gen-2005 | A Truthful (2-2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals | Guala', L; Proietti, G | Intervento a convegno | |
| 1-gen-2007 | An algorithm composition scheme preserving monotonicity | Bilò, D; Forlizzi, L; Guala', L; Proietti, G | Intervento a convegno | |
| 1-gen-2020 | An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner | Bilo, D; Colella, F; Guala, L; Leucci, S; Proietti, G | Articolo su rivista | |
| 1-gen-2017 | An improved algorithm for computing all the best swap edges of a tree spanner | Bilò, D; Colella, F; Gualà, L; Leucci, S; Proietti, G | Intervento a convegno | |
| 1-gen-2007 | Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems | Bilò, D; Forlizzi, L; Guala', L; Proietti, G | Intervento a convegno | |
| 1-gen-2008 | Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems | Bilò, D; Forlizzi, L; Guala', L; Proietti, G | Articolo su rivista | |
| 1-gen-2014 | Bejeweled, Candy Crush and other match-three games are (NP-)hard | Guala', L; Leucci, S; Natale, E | Intervento a convegno | |
| 1-mag-2024 | Blackout-tolerant temporal spanners | Bilò, D; D'Angelo, G; Guala', L; Leucci, S; Rossi, M | Articolo su rivista | |
| 1-gen-2022 | Blackout-Tolerant Temporal Spanners | Bilo, D; D'Angelo, G; Guala', L; Leucci, S; Rossi, M | Intervento a convegno | |
| 1-giu-2015 | Bounded-Distance Network Creation Games | Bilò, D; Guala', L; Proietti, G | Articolo su rivista | |
| 1-gen-2012 | Bounded-Distance Network Creation Games | Bilò, D; Guala', L; Proietti, G | Intervento a convegno | |
| 1-gen-2017 | Brief announcement: On the parallel undecided-state dynamics with two colors | Clementi, A; Gualà, L; Pasquale, F; Scornavacca, G | Intervento a convegno | |
| 1-gen-2019 | Coalition Resilient Outcomes in Max k-Cut Games | Carosi, R; Fioravanti, S; Gualà, L; Monaco, G | Intervento a convegno | |
| 1-gen-2016 | Compact and fast sensitivity oracles for single-source distances | Bilo, D; Guala', L; Leucci, S; Proietti, G | Intervento a convegno | |
| 1-gen-2008 | Computational aspects of a 2-player Stackelberg shortest paths tree game | Bilò, D; Guala', L; Proietti, G; Widmayer, P | Intervento a convegno | |
| 1-gen-2020 | Consensus vs broadcast, with and without noise | Clementi, A; Guala, L; Natale, E; Pasquale, F; Scornavacca, G; Trevisan, L | Intervento a convegno |