Raster to object conversion aided by knowledge based image processing. - Enrico Nardelli; Michelangelo Fossa; Guido Proietti (ICDAR, 1993)

An Accurate Model for Quadtrees Representing Noiseless Images of Spatial Data. - Enrico Nardelli; Guido Proietti (ICIP (2), 1994)

A Hybrid Pointerless Representation of Quadtrees for Efficient Processing of Window Queries. - Enrico Nardelli; Guido Proietti (IGIS, 1994)

On the Generation of Aggregated Random Spatial Regions. - Yannis Manolopoulos; Enrico Nardelli; Guido Proietti; Michael Vassilakopoulos (CIKM, 1995)

Efficient Secondary Memory Processing of Window Queries on Spatial Data. - Enrico Nardelli; Guido Proietti (Inf. Sci., 1995)

An Output Sensitive Solution to the Set Union and Intersection Problem. - Carlo Gaibisso; Enrico Nardelli; Guido Proietti (SOFSEM, 1996)

On the creation of quadtrees by using a branching process. - Yannis Manolopoulos; Enrico Nardelli; Guido Proietti; Michael Vassilakopoulos (Image Vis. Comput., 1996)

Efficient Insertion of Approximately Sorted Seqeunces of Items into a Dictionary. - Carlo Gaibisso; Guido Proietti (SOFSEM, 1997)

MOF-Tree: A Spatial Access Method to Manipulate Multiple Overlapping Features. - Yannis Manolopoulos; Enrico Nardelli; Apostolos Papadopoulos; Guido Proietti (Inf. Syst., 1997)

Time and Space Efficient Secondary Memory Representation of Quadtrees. - Enrico Nardelli; Guido Proietti (Inf. Syst., 1997)

Selectivity Estimation of Window Queries. - Guido Proietti; Christos Faloutsos (CIKM, 1998)

Image Indexing and Retrieval Based on Human Perceptual Color Clustering. - Yihong Gong; Guido Proietti; Christos Faloutsos (CVPR, 1998)

Finding the Detour-Critical Edge of a Shortest Path Between Two Nodes. - Enrico Nardelli; Guido Proietti; Peter Widmayer (Inf. Process. Lett., 1998)

S*-Tree: An Improved S+-Tree for Coloured Images. - Enrico Nardelli; Guido Proietti (ADBIS, 1999)

How to Swap a Failing Edge of a Single Source Shortest Paths Tree. - Enrico Nardelli; Guido Proietti; Peter Widmayer (COCOON, 1999)

I/O Complexity for Range Queries on Region Data Stored Using an R-tree. - Guido Proietti; Christos Faloutsos (ICDE, 1999)

A Robust Image Mosaicing Technique Capable of Creating Integrated Panoramas. - Yihong Gong; Guido Proietti; David LaRose (IV, 1999)

An Optimal Algorithm for Decomposing a Window into Maximal Quadtree Blocks. - Guido Proietti (Acta Informatica, 1999)

Intersection Reporting on Two Collections of Disjoint Sets. - Carlo Gaibisso; Enrico Nardelli; Guido Proietti (Inf. Sci., 1999)

Probabilistic models for images and quadtrees: differences and equivalences. - Enrico Nardelli; Guido Proietti (Image Vis. Comput., 1999)

Size Estimation of the Intersection Join between Two Line Segment Datasets. - Enrico Nardelli; Guido Proietti (ADBIS-DASFAA, 2000)

Maintaining a Minimum Spanning Tree Under Transient Node Failures. - Enrico Nardelli; Guido Proietti; Peter Widmayer (ESA, 2000)

Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees. - Guido Proietti (WAE, 2000)

An efficient spatial access method for spatial images containing multiple non-overlapping features. - Enrico Nardelli; Guido Proietti (Inf. Syst., 2000)

Analysis of Range Queries and Self-Spatial Join Queries on Real Region Datasets Stored Using an R-Tree. - Guido Proietti; Christos Faloutsos (IEEE Trans. Knowl. Data Eng., 2000)

Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths. - Anna Galluccio; Guido Proietti (ISAAC, 2001)

ATM layouts with bounded hop count and congestion. - Michele Flammini; Enrico Nardelli; Guido Proietti (Distributed Comput., 2001)

A generalized comparison of linear representations of thematic layers. - Yannis Manolopoulos; Enrico Nardelli; Guido Proietti; Eleni Tousidou (Data Knowl. Eng., 2001)

A faster computation of the most vital edge of a shortest path. - Enrico Nardelli; Guido Proietti; Peter Widmayer (Inf. Process. Lett., 2001)

Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures. - Enrico Nardelli; Guido Proietti; Peter Widmayer (J. Graph Algorithms Appl., 2001)

Accurate Modeling of Region Data. - Guido Proietti; Christos Faloutsos (IEEE Trans. Knowl. Data Eng., 2001)

A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation. - Anna Galluccio; Guido Proietti (ISAAC, 2002)

An Improved Upper Bound for Scalable Distributed Search Trees. - Adriano Di Pasquale; Enrico Nardelli; Guido Proietti (WDAS, 2002)

Access Methods and Query Processing Techniques. - Adriano Di Pasquale; Luca Forlizzi; Christian S. Jensen; Yannis Manolopoulos; Enrico Nardelli; Dieter Pfoser; Guido Proietti; Simonas Saltenis; Yannis Theodoridis; Theodoros Tzouramanis; Michael Vassilakopoulos (Spatio-Temporal Databases: The CHOROCHRONOS Approach, 2003)

On k-Edge-Connectivity Problems with Sharpened Triangle Inequality. - Hans-Joachim Böckenhauer; Dirk Bongartz; Juraj Hromkovic; Ralf Klasing; Guido Proietti; Sebastian Seibert; Walter Unger (CIAC, 2003)

Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs. - Carlo Gaibisso; Guido Proietti; Richard B. Tan (COCOON, 2003)

Quality of Service in Wireless Networks. - Vittorio Bilò; Adriano Di Pasquale; Fabio Fioravanti; Michele Flammini; Luca Forlizzi; Francesco Lo Presti; Giovanna Melideo; Enrico Nardelli; Alfredo Navarra; Guido Proietti (IPDPS, 2003)

Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems. - Anna Galluccio; Guido Proietti (Algorithmica, 2003)

Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast. - Enrico Nardelli; Guido Proietti; Peter Widmayer (Algorithmica, 2003)

Finding the most vital node of a shortest path. - Enrico Nardelli; Guido Proietti; Peter Widmayer (Theor. Comput. Sci., 2003)

Truthful Mechanisms for Generalized Utilitarian Problems. - Giovanna Melideo; Paolo Penna; Guido Proietti; Roger Wattenhofer; Peter Widmayer (IFIP TCS, 2004)

Augmenting the Edge-Connectivity of a Spider Tree. - Davide Bilò; Guido Proietti (ISAAC, 2004)

A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path. - Davide Bilò; Guido Proietti (WAOA, 2004)

Edge-Connectivity Augmentation and Network Matrices. - Michele Conforti; Anna Galluccio; Guido Proietti (WG, 2004)

Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures. - Enrico Nardelli; Guido Proietti; Peter Widmayer (Algorithmica, 2004)

On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. - Hans-Joachim Böckenhauer; Dirk Bongartz; Juraj Hromkovic; Ralf Klasing; Guido Proietti; Sebastian Seibert; Walter Unger (Theor. Comput. Sci., 2004)

A Truthful (2-2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals. - Luciano Gualà; Guido Proietti (COCOON, 2005)

Range Augmentation Problems in Static Ad-Hoc Wireless Networks. - Davide Bilò; Guido Proietti (SIROCCO, 2005)

A truthful mechanism for the non-utilitarian minimum radius spanning tree problem. - Guido Proietti; Peter Widmayer (SPAA, 2005)

Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem. - Davide Bilò; Luciano Gualà; Guido Proietti (CAAN, 2006)

Reusing Optimal TSP Solutions for Locally Modified Input Instances. - Hans-Joachim Böckenhauer; Luca Forlizzi; Juraj Hromkovic; Joachim Kneis; Joachim Kupke 002; Guido Proietti; Peter Widmayer (IFIP TCS, 2006)

Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii. - Guido Proietti; Peter Widmayer (ISAAC, 2006)

On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem. - Davide Bilò; Luciano Gualà; Guido Proietti (SIROCCO, 2006)

On the Stability of Approximation for Hamiltonian Path Problems. - Luca Forlizzi; Juraj Hromkovic; Guido Proietti; Sebastian Seibert (Algorithmic Oper. Res., 2006)

Efficient unbalanced merge-sort. - Enrico Nardelli; Guido Proietti (Inf. Sci., 2006)

Efficient management of transient station failures in linear radio communication networks with bases. - Carlo Gaibisso; Guido Proietti; Richard B. Tan (J. Parallel Distributed Comput., 2006)

Locating Facilities on a Network to Minimize Their Average Service Radius. - Davide Bilò; Jörg Derungs; Luciano Gualà; Guido Proietti; Peter Widmayer (ISAAC, 2007)

An algorithm composition scheme preserving monotonicity. - Davide Bilò; Luca Forlizzi; Luciano Gualà; Guido Proietti (PODC, 2007)

Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem. - Luciano Gualà; Guido Proietti (Algorithmica, 2007)

On the Approximability of TSP on Local Modifications of Optimally Solved Instances. - Hans-Joachim Böckenhauer; Luca Forlizzi; Juraj Hromkovic; Joachim Kneis; Joachim Kupke 002; Guido Proietti; Peter Widmayer (Algorithmic Oper. Res., 2007)

Efficient truthful mechanisms for the single-source shortest paths tree problem. - Luciano Gualà; Guido Proietti (Concurr. Comput. Pract. Exp., 2007)

Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor. - Aleksej Di Salvo; Guido Proietti (Theor. Comput. Sci., 2007)

Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game. - Davide Bilò; Luciano Gualà; Guido Proietti; Peter Widmayer (WINE, 2008)

Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems. - Davide Bilò; Luca Forlizzi; Luciano Gualà; Guido Proietti (Internet Math., 2008)

On k-connectivity problems with sharpened triangle inequality. - Hans-Joachim Böckenhauer; Dirk Bongartz; Juraj Hromkovic; Ralf Klasing; Guido Proietti; Sebastian Seibert; Walter Unger (J. Discrete Algorithms, 2008)

On the complexity of minimizing interference in ad-hoc and sensor networks. - Davide Bilò; Guido Proietti (Theor. Comput. Sci., 2008)

Stability of Networks in Stretchable Graphs. - Davide Bilò; Michael Gatto; Luciano Gualà; Guido Proietti; Peter Widmayer (SIROCCO, 2009)

Dynamic mechanism design. - Davide Bilò; Luciano Gualà; Guido Proietti (Theor. Comput. Sci., 2009)

Strongly polynomial-time truthful mechanisms in one shot. - Paolo Penna; Guido Proietti; Peter Widmayer (Theor. Comput. Sci., 2009)

Approximating the Metric TSP in Linear Time. - Davide Bilò; Luca Forlizzi; Guido Proietti (Theory Comput. Syst., 2011)

Reoptimizing the Strengthened Metric TSP on Multiple Edge Weight Modifications. - Annalisa D'Andrea; Guido Proietti (SEA, 2012)

Improved approximability and non-approximability results for graph diameter decreasing problems. - Davide Bilò; Luciano Gualà; Guido Proietti (Theor. Comput. Sci., 2012)

Polygon-Constrained Motion Planning Problems. - Davide Bilò; Yann Disser; Luciano Gualà; Matús Mihalák; Guido Proietti; Peter Widmayer (ALGOSENSORS, 2013)

Dynamically Maintaining Shortest Path Trees under Batches of Updates. - Annalisa D'Andrea; Mattia D'Emidio; Daniele Frigioni; Stefano Leucci 001; Guido Proietti (SIROCCO, 2013)

Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches. - Annalisa D'Andrea; Mattia D'Emidio; Daniele Frigioni; Stefano Leucci 001; Guido Proietti (SEA, 2014)

Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree. - Davide Bilò; Luciano Gualà; Guido Proietti (Algorithmica, 2014)

Improved Purely Additive Fault-Tolerant Spanners. - Davide Bilò; Fabrizio Grandoni 001; Luciano Gualà; Stefano Leucci 001; Guido Proietti (ESA, 2015)

A Faster Computation of All the Best Swap Edges of a Tree Spanner. - Davide Bilò; Feliciano Colella; Luciano Gualà; Stefano Leucci 001; Guido Proietti (SIROCCO, 2015)

Path-Fault-Tolerant Approximate Shortest-Path Trees. - Annalisa D'Andrea; Mattia D'Emidio; Daniele Frigioni; Stefano Leucci 001; Guido Proietti (SIROCCO, 2015)

A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree. - Davide Bilò; Luciano Gualà; Guido Proietti (Algorithmica, 2015)

Network verification via routing table queries. - Evangelos Bampas; Davide Bilò; Guido Drovandi; Luciano Gualà; Ralf Klasing; Guido Proietti (J. Comput. Syst. Sci., 2015)

Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments. - Annalisa D'Andrea; Mattia D'Emidio; Daniele Frigioni; Stefano Leucci 001; Guido Proietti (ACM J. Exp. Algorithmics, 2015)

The max-distance network creation game on general host graphs. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (Theor. Comput. Sci., 2015)

Specializations and generalizations of the Stackelberg minimum spanning tree game. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (Theor. Comput. Sci., 2015)

Bounded-Distance Network Creation Games. - Davide Bilò; Luciano Gualà; Guido Proietti (ACM Trans. Economics and Comput., 2015)

Compact and Fast Sensitivity Oracles for Single-Source Distances. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (ESA, 2016)

On the Clustered Shortest-Path Tree Problem. - Mattia D'Emidio; Luca Forlizzi; Daniele Frigioni; Stefano Leucci 001; Guido Proietti (ICTCS, 2016)

Sequence Hypergraphs. - Katerina Böhmová; Jérémie Chalopin; Matús Mihalák; Guido Proietti; Peter Widmayer (WG, 2016)

Exact and approximate algorithms for movement problems on (special classes of) graphs. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (Theor. Comput. Sci., 2016)

Locality-Based Network Creation Games. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (ACM Trans. Parallel Comput., 2016)

Simple and Practically Efficient Fault-tolerant 2-hop Cover Labelings. - Feliciano Colella; Mattia D'Emidio; Guido Proietti (ICTCS/CILC, 2017)

Rational Fair Consensus in the Gossip Model. - Andrea Clementi; Luciano Gualà; Guido Proietti; Giacomo Scornavacca (IPDPS, 2017)

Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges. - Davide Bilò; Feliciano Colella; Luciano Gualà; Stefano Leucci 001; Guido Proietti (SIROCCO, 2017)

Sequence Hypergraphs: Paths, Flows, and Cuts. - Katerina Böhmová; Jérémie Chalopin; Matús Mihalák; Guido Proietti; Peter Widmayer (Adventures Between Lower Bounds and Higher Altitudes, 2018)

Stability of Reapproximation Algorithms for the beta β -Metric Traveling Salesman (Path) Problem. - Annalisa D'Andrea; Luca Forlizzi; Guido Proietti (Adventures Between Lower Bounds and Higher Altitudes, 2018)

On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti; Mirko Rossi (FUN, 2018)

Efficient Oracles and Routing Schemes for Replacement Paths. - Davide Bilò; Keerti Choudhary; Luciano Gualà; Stefano Leucci 001; Merav Parter; Guido Proietti (STACS, 2018)

Fault-Tolerant Approximate Shortest-Path Trees. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (Algorithmica, 2018)

Dual-Mode Greedy Algorithms Can Save Energy. - Barbara Geissmann; Stefano Leucci 001; Chih-Hung Liu 001; Paolo Penna; Guido Proietti (ISAAC, 2019)

Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem. - Mattia D'Emidio; Luca Forlizzi; Daniele Frigioni; Stefano Leucci 001; Guido Proietti (J. Comb. Optim., 2019)

An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. - Davide Bilò; Feliciano Colella; Luciano Gualà; Stefano Leucci 001; Guido Proietti (Algorithmica, 2020)

Tracking routes in communication networks. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (Theor. Comput. Sci., 2020)

Network Creation Games with Traceroute-Based Strategies. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (Algorithms, 2021)

Hardness of an Asymmetric 2-Player Stackelberg Network Pricing Game. - Davide Bilò; Luciano Gualà; Guido Proietti (Algorithms, 2021)

Finding single-source shortest p-disjoint paths: fast computation and sparse preservers. - Davide Bilò; Gianlorenzo D'Angelo; Luciano Gualà; Stefano Leucci 001; Guido Proietti; Mirko Rossi (CoRR, 2021)

Optimizing Nozzle Travel Time in Proton Therapy. - 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 (CBMS, 2022)

A Manifesto for Applied Data Science - Reasoning from a Business Perspective. - 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; et al. (itaDATA, 2022)

Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers. - Davide Bilò; Gianlorenzo D'Angelo; Luciano Gualà; Stefano Leucci 001; Guido Proietti; Mirko Rossi (STACS, 2022)

Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (Algorithmica, 2022)

Cutting bamboo down to size. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti; Giacomo Scornavacca (Theor. Comput. Sci., 2022)

New approximation algorithms for the heterogeneous weighted delivery problem. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti; Mirko Rossi (Theor. Comput. Sci., 2022)

Temporal Queries for Dynamic Temporal Forests. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti; Alessandro Straziota (ISAAC, 2024)