| 2026 | ESA | Hierarchical Spanners. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti, Alessandro Straziota |
| 2025 | Algosensors | Almost Tight Oracles for Fastest-Path Queries on Temporal Trees. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti, Alessandro Straziota |
| 2024 | ISAAC | Temporal Queries for Dynamic Temporal Forests. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti, Alessandro Straziota |
| 2022 | CBMS | 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, Joo Manuel R. S. Tavares, Francesca Vittorini, Filippo Mignosi |
| 2022 | STACS | Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers. | Davide Bil, Gianlorenzo D'Angelo, Luciano Gual, Stefano Leucci, Guido Proietti, Mirko Rossi |
| 2021 | FUN | Cutting Bamboo down to Size. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti, Giacomo Scornavacca |
| 2021 | SIROCCO | New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti, Mirko Rossi |
| 2019 | ISAAC | Dual-Mode Greedy Algorithms Can Save Energy. | Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna, Guido Proietti |
| 2019 | SIROCCO | Tracking Routes in Communication Networks. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2018 | FUN | On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti, Mirko Rossi |
| 2018 | STACS | Efficient Oracles and Routing Schemes for Replacement Paths. | Davide Bil, Keerti Choudhary, Luciano Gual, Stefano Leucci, Merav Parter, Guido Proietti |
| 2017 | ISAAC | An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. | Davide Bil, Feliciano Colella, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2017 | SIROCCO | Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges. | Davide Bil, Feliciano Colella, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2016 | ESA | Compact and Fast Sensitivity Oracles for Single-Source Distances. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2016 | STACS | Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2016 | WG | Sequence Hypergraphs. | Katerina Bhmov, Jrmie Chalopin, Mats Mihalk, Guido Proietti, Peter Widmayer |
| 2015 | ESA | Improved Purely Additive Fault-Tolerant Spanners. | Davide Bil, Fabrizio Grandoni, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2015 | SIROCCO | A Faster Computation of All the Best Swap Edges of a Tree Spanner. | Davide Bil, Feliciano Colella, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2015 | SIROCCO | Path-Fault-Tolerant Approximate Shortest-Path Trees. | Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti |
| 2014 | ESA | Fault-Tolerant Approximate Shortest-Path Trees. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2014 | SPAA | Locality-based network creation games. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2014 | SIROCCO | Network Creation Games with Traceroute-Based Strategies. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2013 | Algosensors | Polygon-Constrained Motion Planning Problems. | Davide Bil, Yann Disser, Luciano Gual, Mats Mihalk, Guido Proietti, Peter Widmayer |
| 2013 | ESA | A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree. | Davide Bil, Luciano Gual, Guido Proietti |
| 2013 | SIROCCO | Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2013 | SIROCCO | Dynamically Maintaining Shortest Path Trees under Batches of Updates. | Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti |
| 2011 | SIROCCO | Network Verification via Routing Table Queries. | Evangelos Bampas, Davide Bil, Guido Drovandi, Luciano Gual, Ralf Klasing, Guido Proietti |
| 2010 | MFCS | Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree. | Davide Bil, Luciano Gual, Guido Proietti |
| 2010 | MFCS | Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems. | Davide Bil, Luciano Gual, Guido Proietti |
| 2009 | SIROCCO | Stability of Networks in Stretchable Graphs. | Davide Bil, Michael Gatto, Luciano Gual, Guido Proietti, Peter Widmayer |
| 2008 | WG | Approximating the Metric TSP in Linear Time. | Davide Bil, Luca Forlizzi, Guido Proietti |
| 2007 | ISAAC | Locating Facilities on a Network to Minimize Their Average Service Radius. | Davide Bil, Jrg Derungs, Luciano Gual, Guido Proietti, Peter Widmayer |
| 2007 | PODC | An algorithm composition scheme preserving monotonicity. | Davide Bil, Luca Forlizzi, Luciano Gual, Guido Proietti |
| 2006 | Algosensors | On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks. | Davide Bil, Guido Proietti |
| 2006 | ISAAC | Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii. | Guido Proietti, Peter Widmayer |
| 2006 | SIROCCO | On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem. | Davide Bil, Luciano Gual, Guido Proietti |
| 2005 | COCOON | A Truthful (2-2/ | Luciano Gual, Guido Proietti |
| 2005 | EuroPar | Efficient Truthful Mechanisms for the Single-Source Shortest Paths Tree Problem. | Luciano Gual, Guido Proietti |
| 2005 | SPAA | A truthful mechanism for the non-utilitarian minimum radius spanning tree problem. | Guido Proietti, Peter Widmayer |
| 2005 | SIROCCO | Range Augmentation Problems in Static Ad-Hoc Wireless Networks. | Davide Bil, Guido Proietti |
| 2005 | SOFSEM | On the Stability of Approximation for Hamiltonian Path Problems. | Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert |
| 2004 | ISAAC | Augmenting the Edge-Connectivity of a Spider Tree. | Davide Bil, Guido Proietti |
| 2004 | SIROCCO | Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor. | Aleksej Di Salvo, Guido Proietti |
| 2004 | WAOA | A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path. | Davide Bil, Guido Proietti |
| 2004 | WG | Edge-Connectivity Augmentation and Network Matrices. | Michele Conforti, Anna Galluccio, Guido Proietti |
| 2003 | CIAC | On k-Edge-Connectivity Problems with Sharpened Triangle Inequality. | Hans-Joachim Bckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger |
| 2003 | COCOON | Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs. | Carlo Gaibisso, Guido Proietti, Richard B. Tan |
| 2002 | ISAAC | A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation. | Anna Galluccio, Guido Proietti |
| 2001 | COCOON | Finding the Most Vital Node of a Shortest Path. | Enrico Nardelli, Guido Proietti, Peter Widmayer |
| 2001 | ISAAC | Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths. | Anna Galluccio, Guido Proietti |
| 2000 | ADBIS | Size Estimation of the Intersection Join between Two Line Segment Datasets. | Enrico Nardelli, Guido Proietti |
| 2000 | ESA | Maintaining a Minimum Spanning Tree Under Transient Node Failures. | Enrico Nardelli, Guido Proietti, Peter Widmayer |
| 1999 | ADBIS | S*-Tree: An Improved S | Enrico Nardelli, Guido Proietti |
| 1999 | COCOON | How to Swap a Failing Edge of a Single Source Shortest Paths Tree. | Enrico Nardelli, Guido Proietti, Peter Widmayer |
| 1999 | ICDE | I/O Complexity for Range Queries on Region Data Stored Using an R-tree. | Guido Proietti, Christos Faloutsos |
| 1999 | IV | A Robust Image Mosaicing Technique Capable of Creating Integrated Panoramas. | Yihong Gong, Guido Proietti, David LaRose |
| 1998 | CIKM | Selectivity Estimation of Window Queries. | Guido Proietti, Christos Faloutsos |
| 1998 | CVPR | Image Indexing and Retrieval Based on Human Perceptual Color Clustering. | Yihong Gong, Guido Proietti, Christos Faloutsos |
| 1998 | ESA | Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures. | Enrico Nardelli, Guido Proietti, Peter Widmayer |
| 1997 | SOFSEM | Efficient Insertion of Approximately Sorted Seqeunces of Items into a Dictionary. | Carlo Gaibisso, Guido Proietti |
| 1996 | SOFSEM | An Output Sensitive Solution to the Set Union and Intersection Problem. | Carlo Gaibisso, Enrico Nardelli, Guido Proietti |
| 1995 | CIKM | On the Generation of Aggregated Random Spatial Regions. | Yannis Manolopoulos, Enrico Nardelli, Guido Proietti, Michael Vassilakopoulos |
| 1994 | ICIP | An Accurate Model for Quadtrees Representing Noiseless Images of Spatial Data. | Enrico Nardelli, Guido Proietti |
| 1993 | ICDAR | Raster to object conversion aided by knowledge based image processing. | Enrico Nardelli, Michelangelo Fossa, Guido Proietti |