Guido Proietti

ORCID

Publication Activity (10 Years)

Years Active: 1993-2022
Publications (10 Years): 39

Top Venues

Publications

Matteo Spezialetti, Renata Di Filippo, Ramon Gimenez De Lorenzo, Giovanni Luca Gravina, Giuseppe Placidi, Guido Proietti, Fabrizio Rossi, Stefano Smriglio, João Manuel R. S. Tavares, Francesca Vittorini, Filippo Mignosi
Optimizing Nozzle Travel Time in Proton Therapy. CBMS (2022)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. Algorithmica 84 (1) (2022)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Giacomo Scornavacca
Cutting bamboo down to size. Theor. Comput. Sci. 909 (2022)
Bahne Christiansen, Uwe Neuhaus, Michael Schulz, Adrian Hargreaves, Antinisca Di Marco, Guido Proietti, Fabrizio Rossi, Giovanni Stilo, Mark H. Haney, Andrew Duncan, Daniele Tessera, Tilman Todt, Andreas Brandenberg, Patricia Feubli
A Manifesto for Applied Data Science - Reasoning from a Business Perspective. itaDATA (2022)
Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers. STACS (2022)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
New approximation algorithms for the heterogeneous weighted delivery problem. Theor. Comput. Sci. 932 (2022)
Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
Finding single-source shortest p-disjoint paths: fast computation and sparse preservers. CoRR (2021)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Network Creation Games with Traceroute-Based Strategies. Algorithms 14 (2) (2021)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem. SIROCCO (2021)
Davide Bilò, Luciano Gualà, Guido Proietti
Hardness of an Asymmetric 2-Player Stackelberg Network Pricing Game. Algorithms 14 (1) (2021)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Giacomo Scornavacca
Cutting Bamboo down to Size. FUN (2021)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Tracking routes in communication networks. Theor. Comput. Sci. 844 (2020)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Giacomo Scornavacca
Cutting Bamboo Down to Size. CoRR (2020)
Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. Algorithmica 82 (2) (2020)
Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, Guido Proietti
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem. J. Comb. Optim. 38 (1) (2019)
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna, Guido Proietti
Dual-Mode Greedy Algorithms Can Save Energy. ISAAC (2019)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Tracking Routes in Communication Networks. SIROCCO (2019)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games. FUN (2018)
Katerina Böhmová, Jérémie Chalopin, Matús Mihalák, Guido Proietti, Peter Widmayer
Sequence Hypergraphs: Paths, Flows, and Cuts. Adventures Between Lower Bounds and Higher Altitudes (2018)
Annalisa D'Andrea, Luca Forlizzi, Guido Proietti
Stability of Reapproximation Algorithms for the \beta β -Metric Traveling Salesman (Path) Problem. Adventures Between Lower Bounds and Higher Altitudes (2018)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Fault-Tolerant Approximate Shortest-Path Trees. Algorithmica 80 (12) (2018)
Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, Guido Proietti
Hardness, Approximability, and Fixed-Parameter Tractability of the Clustered Shortest-Path Tree Problem. CoRR (2018)
Davide Bilò, Keerti Choudhary, Luciano Gualà, Stefano Leucci, Merav Parter, Guido Proietti
Efficient Oracles and Routing Schemes for Replacement Paths. STACS (2018)
Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. CoRR (2017)
Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. ISAAC (2017)
Andrea E. F. Clementi, Luciano Gualà, Guido Proietti, Giacomo Scornavacca
Rational Fair Consensus in the Gossip Model. IPDPS (2017)
Andrea E. F. Clementi, Luciano Gualà, Guido Proietti, Giacomo Scornavacca
Rational Fair Consensus in the GOSSIP Model. CoRR (2017)
Feliciano Colella, Mattia D'Emidio, Guido Proietti
Simple and Practically Efficient Fault-tolerant 2-hop Cover Labelings. ICTCS/CILC (2017)
Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges. CoRR (2017)
Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges. SIROCCO (2017)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Locality-based Network Creation Games. CoRR (2016)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Locality-Based Network Creation Games. ACM Trans. Parallel Comput. 3 (1) (2016)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Compact and Fast Sensitivity Oracles for Single-Source Distances. CoRR (2016)
Katerina Böhmová, Jérémie Chalopin, Matús Mihalák, Guido Proietti, Peter Widmayer
Sequence Hypergraphs. WG (2016)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Compact and Fast Sensitivity Oracles for Single-Source Distances. ESA (2016)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. CoRR (2016)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. STACS (2016)
Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, Guido Proietti
On the Clustered Shortest-Path Tree Problem. ICTCS (2016)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Exact and approximate algorithms for movement problems on (special classes of) graphs. Theor. Comput. Sci. 652 (2016)
Evangelos Bampas, Davide Bilò, Guido Drovandi, Luciano Gualà, Ralf Klasing, Guido Proietti
Network verification via routing table queries. J. Comput. Syst. Sci. 81 (1) (2015)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
The max-distance network creation game on general host graphs. Theor. Comput. Sci. 573 (2015)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Specializations and generalizations of the Stackelberg minimum spanning tree game. Theor. Comput. Sci. 562 (2015)
Davide Bilò, Luciano Gualà, Guido Proietti
Bounded-Distance Network Creation Games. ACM Trans. Economics and Comput. 3 (3) (2015)
Davide Bilò, Luciano Gualà, Guido Proietti
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree. Algorithmica 73 (3) (2015)
Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti
Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments. ACM J. Exp. Algorithmics 20 (2015)
Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti
Path-Fault-Tolerant Approximate Shortest-Path Trees. CoRR (2015)
Davide Bilò, Fabrizio Grandoni, Luciano Gualà, Stefano Leucci, Guido Proietti
Improved Purely Additive Fault-Tolerant Spanners. CoRR (2015)
Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
A Faster Computation of All the Best Swap Edges of a Tree Spanner. SIROCCO (2015)
Davide Bilò, Fabrizio Grandoni, Luciano Gualà, Stefano Leucci, Guido Proietti
Improved Purely Additive Fault-Tolerant Spanners. ESA (2015)
Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti
Path-Fault-Tolerant Approximate Shortest-Path Trees. SIROCCO (2015)
Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti
Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches. SEA (2014)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Fault-Tolerant Approximate Shortest-Path Trees. CoRR (2014)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
The Max-Distance Network Creation Game on General Host Graphs. CoRR (2014)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Locality-based network creation games. SPAA (2014)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Network Creation Games with Traceroute-Based Strategies. SIROCCO (2014)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game. CoRR (2014)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Fault-Tolerant Approximate Shortest-Path Trees. ESA (2014)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Exact and approximate algorithms for movement problems on (special classes of) graphs. CoRR (2014)
Davide Bilò, Luciano Gualà, Guido Proietti
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree. Algorithmica 68 (2) (2014)
Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti
Dynamically Maintaining Shortest Path Trees under Batches of Updates. SIROCCO (2013)
Davide Bilò, Yann Disser, Luciano Gualà, Matús Mihalák, Guido Proietti, Peter Widmayer
Polygon-Constrained Motion Planning Problems. ALGOSENSORS (2013)
Davide Bilò, Luciano Gualà, Guido Proietti
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree. ESA (2013)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs. SIROCCO (2013)
Davide Bilò, Luciano Gualà, Guido Proietti
Bounded-Distance Network Creation Games. WINE (2012)
Annalisa D'Andrea, Guido Proietti
Reoptimizing the Strengthened Metric TSP on Multiple Edge Weight Modifications. SEA (2012)
Davide Bilò, Luciano Gualà, Guido Proietti
Improved approximability and non-approximability results for graph diameter decreasing problems. Theor. Comput. Sci. 417 (2012)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
The Max-Distance Network Creation Game on General Host Graphs. WINE (2012)
Evangelos Bampas, Davide Bilò, Guido Drovandi, Luciano Gualà, Ralf Klasing, Guido Proietti
Network Verification via Routing Table Queries. SIROCCO (2011)
Davide Bilò, Luciano Gualà, Guido Proietti
Bounded-Distance Network Creation Games CoRR (2011)
Davide Bilò, Luca Forlizzi, Guido Proietti
Approximating the Metric TSP in Linear Time. Theory Comput. Syst. 49 (3) (2011)
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game. WINE (2010)
Davide Bilò, Luciano Gualà, Guido Proietti
Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems. MFCS (2010)
Davide Bilò, Luciano Gualà, Guido Proietti
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree. MFCS (2010)
Paolo Penna, Guido Proietti, Peter Widmayer
Strongly polynomial-time truthful mechanisms in one shot. Theor. Comput. Sci. 410 (17) (2009)
Davide Bilò, Luciano Gualà, Guido Proietti
Hardness of an Asymmetric 2-player Stackelberg Network Pricing Game. Electron. Colloquium Comput. Complex. 16 (2009)
Davide Bilò, Luciano Gualà, Guido Proietti
Dynamic mechanism design. Theor. Comput. Sci. 410 (17) (2009)
Davide Bilò, Michael Gatto, Luciano Gualà, Guido Proietti, Peter Widmayer
Stability of Networks in Stretchable Graphs. SIROCCO (2009)
Davide Bilò, Guido Proietti
On the complexity of minimizing interference in ad-hoc and sensor networks. Theor. Comput. Sci. 402 (1) (2008)
Davide Bilò, Luca Forlizzi, Guido Proietti
Approximating the Metric TSP in Linear Time. WG (2008)
Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti
Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems. Internet Math. 5 (4) (2008)
Davide Bilò, Luciano Gualà, Guido Proietti, Peter Widmayer
Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game. WINE (2008)
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
On k-connectivity problems with sharpened triangle inequality. J. Discrete Algorithms 6 (4) (2008)
Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovic, Joachim Kneis, Joachim Kupke, Guido Proietti, Peter Widmayer
On the Approximability of TSP on Local Modifications of Optimally Solved Instances. Algorithmic Oper. Res. 2 (2) (2007)
Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti
Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems. WINE (2007)
Luciano Gualà, Guido Proietti
Efficient truthful mechanisms for the single-source shortest paths tree problem. Concurr. Comput. Pract. Exp. 19 (17) (2007)
Davide Bilò, Jörg Derungs, Luciano Gualà, Guido Proietti, Peter Widmayer
Locating Facilities on a Network to Minimize Their Average Service Radius. ISAAC (2007)
Luciano Gualà, Guido Proietti
Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem. Algorithmica 49 (3) (2007)
Aleksej Di Salvo, Guido Proietti
Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor. Theor. Comput. Sci. 383 (1) (2007)
Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti
An algorithm composition scheme preserving monotonicity. PODC (2007)
Davide Bilò, Luciano Gualà, Guido Proietti
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem. CAAN (2006)
Enrico Nardelli, Guido Proietti
Efficient unbalanced merge-sort. Inf. Sci. 176 (10) (2006)
Paolo Penna, Guido Proietti, Peter Widmayer
Strongly Polynomial-Time Truthful Mechanisms in One Shot. WINE (2006)
Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert
On the Stability of Approximation for Hamiltonian Path Problems. Algorithmic Oper. Res. 1 (1) (2006)
Carlo Gaibisso, Guido Proietti, Richard B. Tan
Efficient management of transient station failures in linear radio communication networks with bases. J. Parallel Distributed Comput. 66 (4) (2006)
Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovic, Joachim Kneis, Joachim Kupke, Guido Proietti, Peter Widmayer
Reusing Optimal TSP Solutions for Locally Modified Input Instances. IFIP TCS (2006)
Davide Bilò, Luciano Gualà, Guido Proietti
Dynamic Mechanism Design. WINE (2006)
Davide Bilò, Luciano Gualà, Guido Proietti
On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem. SIROCCO (2006)
Guido Proietti, Peter Widmayer
Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii. ISAAC (2006)
Davide Bilò, Guido Proietti
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks. ALGOSENSORS (2006)
Luciano Gualà, Guido Proietti
Efficient Truthful Mechanisms for the Single-Source Shortest Paths Tree Problem. Euro-Par (2005)

Guido Proietti.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Guido Proietti