Guido Proietti

159 papers A* 3A 14B 36C 5Misc 6Journal 70Unranked 25

Year	Rank	Type	Title / Venue / Authors
2025	—	`conf`	Almost Tight Oracles for Fastest-Path Queries on Temporal Trees. ALGOWIN Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Alessandro Straziota
2024	B	`conf`	Temporal Queries for Dynamic Temporal Forests. ISAAC Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Alessandro Straziota
2024	J	`jnl`	Temporal queries for dynamic temporal forests. CoRR Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Alessandro Straziota
2022	—	`conf`	A Manifesto for Applied Data Science - Reasoning from a Business Perspective. itaDATA 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
2022	J	`jnl`	Cutting bamboo down to size. Theor. Comput. Sci. Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Giacomo Scornavacca
2022	J	`jnl`	Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. Algorithmica Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2022	J	`jnl`	New approximation algorithms for the heterogeneous weighted delivery problem. Theor. Comput. Sci. Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
2022	B	`conf`	Optimizing Nozzle Travel Time in Proton Therapy. CBMS 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
2022	A	`conf`	Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers. STACS Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
2021	Misc	`conf`	Cutting Bamboo down to Size. FUN Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Giacomo Scornavacca
2021	J	`jnl`	Finding single-source shortest p-disjoint paths: fast computation and sparse preservers. CoRR Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
2021	J	`jnl`	Hardness of an Asymmetric 2-Player Stackelberg Network Pricing Game. Algorithms Davide Bilò, Luciano Gualà, Guido Proietti
2021	J	`jnl`	Network Creation Games with Traceroute-Based Strategies. Algorithms Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2021	B	`conf`	New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem. SIROCCO Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
2020	J	`jnl`	An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. Algorithmica Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
2020	J	`jnl`	Cutting Bamboo Down to Size. CoRR Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Giacomo Scornavacca
2020	J	`jnl`	Tracking routes in communication networks. Theor. Comput. Sci. Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2019	B	`conf`	Dual-Mode Greedy Algorithms Can Save Energy. ISAAC Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna, Guido Proietti
2019	J	`jnl`	Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem. J. Comb. Optim. Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, Guido Proietti
2019	B	`conf`	Tracking Routes in Communication Networks. SIROCCO Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2018	A	`conf`	Efficient Oracles and Routing Schemes for Replacement Paths. STACS Davide Bilò, Keerti Choudhary, Luciano Gualà, Stefano Leucci, Merav Parter, Guido Proietti
2018	J	`jnl`	Fault-Tolerant Approximate Shortest-Path Trees. Algorithmica Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2018	J	`jnl`	Hardness, Approximability, and Fixed-Parameter Tractability of the Clustered Shortest-Path Tree Problem. CoRR Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, Guido Proietti
2018	Misc	`conf`	On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games. FUN Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
2018	—	`conf`	Sequence Hypergraphs: Paths, Flows, and Cuts. Adventures Between Lower Bounds and Higher Altitudes Katerina Böhmová, Jérémie Chalopin, Matús Mihalák, Guido Proietti, Peter Widmayer
2018	—	`conf`	Stability of Reapproximation Algorithms for the \beta β -Metric Traveling Salesman (Path) Problem. Adventures Between Lower Bounds and Higher Altitudes Annalisa D'Andrea, Luca Forlizzi, Guido Proietti
2017	B	`conf`	An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. ISAAC Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
2017	J	`jnl`	An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. CoRR Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
2017	B	`conf`	Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges. SIROCCO Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
2017	J	`jnl`	Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges. CoRR Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
2017	J	`jnl`	Rational Fair Consensus in the GOSSIP Model. CoRR Andrea Clementi, Luciano Gualà, Guido Proietti, Giacomo Scornavacca
2017	A	`conf`	Rational Fair Consensus in the Gossip Model. IPDPS Andrea Clementi, Luciano Gualà, Guido Proietti, Giacomo Scornavacca
2017	—	`conf`	Simple and Practically Efficient Fault-tolerant 2-hop Cover Labelings. ICTCS/CILC Feliciano Colella, Mattia D'Emidio, Guido Proietti
2016	A	`conf`	Compact and Fast Sensitivity Oracles for Single-Source Distances. ESA Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2016	J	`jnl`	Compact and Fast Sensitivity Oracles for Single-Source Distances. CoRR Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2016	J	`jnl`	Exact and approximate algorithms for movement problems on (special classes of) graphs. Theor. Comput. Sci. Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2016	J	`jnl`	Locality-Based Network Creation Games. ACM Trans. Parallel Comput. Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2016	J	`jnl`	Locality-based Network Creation Games. CoRR Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2016	A	`conf`	Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. STACS Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2016	J	`jnl`	Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. CoRR Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2016	—	`conf`	On the Clustered Shortest-Path Tree Problem. ICTCS Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, Guido Proietti
2016	B	`conf`	Sequence Hypergraphs. WG Katerina Böhmová, Jérémie Chalopin, Matús Mihalák, Guido Proietti, Peter Widmayer
2015	J	`jnl`	A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree. Algorithmica Davide Bilò, Luciano Gualà, Guido Proietti
2015	B	`conf`	A Faster Computation of All the Best Swap Edges of a Tree Spanner. SIROCCO Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
2015	J	`jnl`	Bounded-Distance Network Creation Games. ACM Trans. Economics and Comput. Davide Bilò, Luciano Gualà, Guido Proietti
2015	J	`jnl`	Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments. ACM J. Exp. Algorithmics Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti
2015	A	`conf`	Improved Purely Additive Fault-Tolerant Spanners. ESA Davide Bilò, Fabrizio Grandoni, Luciano Gualà, Stefano Leucci, Guido Proietti
2015	J	`jnl`	Improved Purely Additive Fault-Tolerant Spanners. CoRR Davide Bilò, Fabrizio Grandoni, Luciano Gualà, Stefano Leucci, Guido Proietti
2015	J	`jnl`	Network verification via routing table queries. J. Comput. Syst. Sci. Evangelos Bampas, Davide Bilò, Guido Drovandi, Luciano Gualà, Ralf Klasing, Guido Proietti
2015	B	`conf`	Path-Fault-Tolerant Approximate Shortest-Path Trees. SIROCCO Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti
2015	J	`jnl`	Path-Fault-Tolerant Approximate Shortest-Path Trees. CoRR Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti
2015	J	`jnl`	Specializations and generalizations of the Stackelberg minimum spanning tree game. Theor. Comput. Sci. Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2015	J	`jnl`	The max-distance network creation game on general host graphs. Theor. Comput. Sci. Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2014	J	`jnl`	Exact and approximate algorithms for movement problems on (special classes of) graphs. CoRR Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2014	B	`conf`	Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches. SEA Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti
2014	A	`conf`	Fault-Tolerant Approximate Shortest-Path Trees. ESA Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2014	J	`jnl`	Fault-Tolerant Approximate Shortest-Path Trees. CoRR Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2014	J	`jnl`	Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree. Algorithmica Davide Bilò, Luciano Gualà, Guido Proietti
2014	B	`conf`	Locality-based network creation games. SPAA Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2014	B	`conf`	Network Creation Games with Traceroute-Based Strategies. SIROCCO Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2014	J	`jnl`	Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game. CoRR Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2014	J	`jnl`	The Max-Distance Network Creation Game on General Host Graphs. CoRR Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2013	A	`conf`	A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree. ESA Davide Bilò, Luciano Gualà, Guido Proietti
2013	B	`conf`	Dynamically Maintaining Shortest Path Trees under Batches of Updates. SIROCCO Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti
2013	B	`conf`	Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs. SIROCCO Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2013	C	`conf`	Polygon-Constrained Motion Planning Problems. ALGOSENSORS Davide Bilò, Yann Disser, Luciano Gualà, Matús Mihalák, Guido Proietti, Peter Widmayer
2012	—	`conf`	Bounded-Distance Network Creation Games. WINE Davide Bilò, Luciano Gualà, Guido Proietti
2012	J	`jnl`	Improved approximability and non-approximability results for graph diameter decreasing problems. Theor. Comput. Sci. Davide Bilò, Luciano Gualà, Guido Proietti
2012	B	`conf`	Reoptimizing the Strengthened Metric TSP on Multiple Edge Weight Modifications. SEA Annalisa D'Andrea, Guido Proietti
2012	—	`conf`	The Max-Distance Network Creation Game on General Host Graphs. WINE Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2011	J	`jnl`	Approximating the Metric TSP in Linear Time. Theory Comput. Syst. Davide Bilò, Luca Forlizzi, Guido Proietti
2011	J	`jnl`	Bounded-Distance Network Creation Games CoRR Davide Bilò, Luciano Gualà, Guido Proietti
2011	B	`conf`	Network Verification via Routing Table Queries. SIROCCO Evangelos Bampas, Davide Bilò, Guido Drovandi, Luciano Gualà, Ralf Klasing, Guido Proietti
2010	B	`conf`	Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree. MFCS Davide Bilò, Luciano Gualà, Guido Proietti
2010	B	`conf`	Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems. MFCS Davide Bilò, Luciano Gualà, Guido Proietti
2010	—	`conf`	Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game. WINE Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2009	J	`jnl`	Dynamic mechanism design. Theor. Comput. Sci. Davide Bilò, Luciano Gualà, Guido Proietti
2009	J	`jnl`	Hardness of an Asymmetric 2-player Stackelberg Network Pricing Game. Electron. Colloquium Comput. Complex. Davide Bilò, Luciano Gualà, Guido Proietti
2009	B	`conf`	Stability of Networks in Stretchable Graphs. SIROCCO Davide Bilò, Michael Gatto, Luciano Gualà, Guido Proietti, Peter Widmayer
2009	J	`jnl`	Strongly polynomial-time truthful mechanisms in one shot. Theor. Comput. Sci. Paolo Penna, Guido Proietti, Peter Widmayer
2008	J	`jnl`	Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems. Internet Math. Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti
2008	B	`conf`	Approximating the Metric TSP in Linear Time. WG Davide Bilò, Luca Forlizzi, Guido Proietti
2008	—	`conf`	Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game. WINE Davide Bilò, Luciano Gualà, Guido Proietti, Peter Widmayer
2008	J	`jnl`	On k-connectivity problems with sharpened triangle inequality. J. Discrete Algorithms Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
2008	J	`jnl`	On the complexity of minimizing interference in ad-hoc and sensor networks. Theor. Comput. Sci. Davide Bilò, Guido Proietti
2007	A*	`conf`	An algorithm composition scheme preserving monotonicity. PODC Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti
2007	—	`conf`	Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems. WINE Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti
2007	J	`jnl`	Efficient truthful mechanisms for the single-source shortest paths tree problem. Concurr. Comput. Pract. Exp. Luciano Gualà, Guido Proietti
2007	J	`jnl`	Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem. Algorithmica Luciano Gualà, Guido Proietti
2007	B	`conf`	Locating Facilities on a Network to Minimize Their Average Service Radius. ISAAC Davide Bilò, Jörg Derungs, Luciano Gualà, Guido Proietti, Peter Widmayer
2007	J	`jnl`	On the Approximability of TSP on Local Modifications of Optimally Solved Instances. Algorithmic Oper. Res. Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovic, Joachim Kneis, Joachim Kupke, Guido Proietti, Peter Widmayer
2007	J	`jnl`	Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor. Theor. Comput. Sci. Aleksej Di Salvo, Guido Proietti
2006	—	`conf`	Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem. CAAN Davide Bilò, Luciano Gualà, Guido Proietti
2006	—	`conf`	Dynamic Mechanism Design. WINE Davide Bilò, Luciano Gualà, Guido Proietti
2006	J	`jnl`	Efficient management of transient station failures in linear radio communication networks with bases. J. Parallel Distributed Comput. Carlo Gaibisso, Guido Proietti, Richard B. Tan
2006	J	`jnl`	Efficient unbalanced merge-sort. Inf. Sci. Enrico Nardelli, Guido Proietti
2006	C	`conf`	On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks. ALGOSENSORS Davide Bilò, Guido Proietti
2006	B	`conf`	On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem. SIROCCO Davide Bilò, Luciano Gualà, Guido Proietti
2006	J	`jnl`	On the Stability of Approximation for Hamiltonian Path Problems. Algorithmic Oper. Res. Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert
2006	B	`conf`	Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii. ISAAC Guido Proietti, Peter Widmayer
2006	—	`conf`	Reusing Optimal TSP Solutions for Locally Modified Input Instances. IFIP TCS Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovic, Joachim Kneis, Joachim Kupke, Guido Proietti, Peter Widmayer
2006	—	`conf`	Strongly Polynomial-Time Truthful Mechanisms in One Shot. WINE Paolo Penna, Guido Proietti, Peter Widmayer
2005	Misc	`conf`	A Truthful (2-2/ COCOON Luciano Gualà, Guido Proietti
2005	B	`conf`	A truthful mechanism for the non-utilitarian minimum radius spanning tree problem. SPAA Guido Proietti, Peter Widmayer
2005	—	`conf`	Efficient Truthful Mechanisms for the Single-Source Shortest Paths Tree Problem. Euro-Par Luciano Gualà, Guido Proietti
2005	B	`conf`	On the Stability of Approximation for Hamiltonian Path Problems. SOFSEM Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert
2005	B	`conf`	Range Augmentation Problems in Static Ad-Hoc Wireless Networks. SIROCCO Davide Bilò, Guido Proietti
2004	B	`conf`	A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path. WAOA Davide Bilò, Guido Proietti
2004	B	`conf`	Augmenting the Edge-Connectivity of a Spider Tree. ISAAC Davide Bilò, Guido Proietti
2004	B	`conf`	Edge-Connectivity Augmentation and Network Matrices. WG Michele Conforti, Anna Galluccio, Guido Proietti
2004	J	`jnl`	Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures. Algorithmica Enrico Nardelli, Guido Proietti, Peter Widmayer
2004	J	`jnl`	On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. Theor. Comput. Sci. Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
2004	B	`conf`	Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor. SIROCCO Aleksej Di Salvo, Guido Proietti
2004	—	`conf`	Truthful Mechanisms for Generalized Utilitarian Problems. IFIP TCS Giovanna Melideo, Paolo Penna, Guido Proietti, Roger Wattenhofer, Peter Widmayer
2003	—	`conf`	Access Methods and Query Processing Techniques. Spatio-Temporal Databases: The CHOROCHRONOS Approach Adriano Di Pasquale, Luca Forlizzi, Christian S. Jensen, Yannis Manolopoulos, Enrico Nardelli, Dieter Pfoser, Guido Proietti, Simonas Saltenis, Yannis Theodoridis, Theodoros Tzouramanis, Michael Vassilakopoulos
2003	J	`jnl`	Finding the most vital node of a shortest path. Theor. Comput. Sci. Enrico Nardelli, Guido Proietti, Peter Widmayer
2003	C	`conf`	On k-Edge-Connectivity Problems with Sharpened Triangle Inequality. CIAC Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
2003	Misc	`conf`	Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs. COCOON Carlo Gaibisso, Guido Proietti, Richard B. Tan
2003	J	`jnl`	Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems. Algorithmica Anna Galluccio, Guido Proietti
2003	A	`conf`	Quality of Service in Wireless Networks. IPDPS Vittorio Bilò, Adriano Di Pasquale, Fabio Fioravanti, Michele Flammini, Luca Forlizzi, Francesco Lo Presti, Giovanna Melideo, Enrico Nardelli, Alfredo Navarra, Guido Proietti
2003	J	`jnl`	Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast. Algorithmica Enrico Nardelli, Guido Proietti, Peter Widmayer
2002	B	`conf`	A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation. ISAAC Anna Galluccio, Guido Proietti
2002	—	`conf`	An Improved Upper Bound for Scalable Distributed Search Trees. WDAS Adriano Di Pasquale, Enrico Nardelli, Guido Proietti
2002	—	`conf`	On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality. FSTTCS Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
2001	J	`jnl`	A faster computation of the most vital edge of a shortest path. Inf. Process. Lett. Enrico Nardelli, Guido Proietti, Peter Widmayer
2001	J	`jnl`	A generalized comparison of linear representations of thematic layers. Data Knowl. Eng. Yannis Manolopoulos, Enrico Nardelli, Guido Proietti, Eleni Tousidou
2001	J	`jnl`	ATM layouts with bounded hop count and congestion. Distributed Comput. Michele Flammini, Enrico Nardelli, Guido Proietti
2001	J	`jnl`	Accurate Modeling of Region Data. IEEE Trans. Knowl. Data Eng. Guido Proietti, Christos Faloutsos
2001	J	`jnl`	Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures. J. Graph Algorithms Appl. Enrico Nardelli, Guido Proietti, Peter Widmayer
2001	Misc	`conf`	Finding the Most Vital Node of a Shortest Path. COCOON Enrico Nardelli, Guido Proietti, Peter Widmayer
2001	B	`conf`	Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths. ISAAC Anna Galluccio, Guido Proietti
2000	J	`jnl`	An efficient spatial access method for spatial images containing multiple non-overlapping features. Inf. Syst. Enrico Nardelli, Guido Proietti
2000	J	`jnl`	Analysis of Range Queries and Self-Spatial Join Queries on Real Region Datasets Stored Using an R-Tree. IEEE Trans. Knowl. Data Eng. Guido Proietti, Christos Faloutsos
2000	—	`conf`	Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees. WAE Guido Proietti
2000	A	`conf`	Maintaining a Minimum Spanning Tree Under Transient Node Failures. ESA Enrico Nardelli, Guido Proietti, Peter Widmayer
2000	B	`ed.`	SIROCCO 7, Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity, Laquila, Italy, June 20-22, 2000 SIROCCO Michele Flammini, Enrico Nardelli, Guido Proietti, Paul G. Spirakis
2000	—	`conf`	Size Estimation of the Intersection Join between Two Line Segment Datasets. ADBIS-DASFAA Enrico Nardelli, Guido Proietti
1999	C	`conf`	A Robust Image Mosaicing Technique Capable of Creating Integrated Panoramas. IV Yihong Gong, Guido Proietti, David LaRose
1999	J	`jnl`	An Optimal Algorithm for Decomposing a Window into Maximal Quadtree Blocks. Acta Informatica Guido Proietti
1999	Misc	`conf`	How to Swap a Failing Edge of a Single Source Shortest Paths Tree. COCOON Enrico Nardelli, Guido Proietti, Peter Widmayer
1999	A*	`conf`	I/O Complexity for Range Queries on Region Data Stored Using an R-tree. ICDE Guido Proietti, Christos Faloutsos
1999	J	`jnl`	Intersection Reporting on Two Collections of Disjoint Sets. Inf. Sci. Carlo Gaibisso, Enrico Nardelli, Guido Proietti
1999	J	`jnl`	Probabilistic models for images and quadtrees: differences and equivalences. Image Vis. Comput. Enrico Nardelli, Guido Proietti
1999	C	`conf`	S*-Tree: An Improved S ADBIS Enrico Nardelli, Guido Proietti
1998	A	`conf`	Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures. ESA Enrico Nardelli, Guido Proietti, Peter Widmayer
1998	J	`jnl`	Finding the Detour-Critical Edge of a Shortest Path Between Two Nodes. Inf. Process. Lett. Enrico Nardelli, Guido Proietti, Peter Widmayer
1998	A*	`conf`	Image Indexing and Retrieval Based on Human Perceptual Color Clustering. CVPR Yihong Gong, Guido Proietti, Christos Faloutsos
1998	A	`conf`	Selectivity Estimation of Window Queries. CIKM Guido Proietti, Christos Faloutsos
1997	—	`conf`	ATM Layouts with Bounded Hop Count and Congestion. WDAG Michele Flammini, Enrico Nardelli, Guido Proietti
1997	B	`conf`	Efficient Insertion of Approximately Sorted Seqeunces of Items into a Dictionary. SOFSEM Carlo Gaibisso, Guido Proietti
1997	J	`jnl`	MOF-Tree: A Spatial Access Method to Manipulate Multiple Overlapping Features. Inf. Syst. Yannis Manolopoulos, Enrico Nardelli, Apostolos Papadopoulos, Guido Proietti
1997	J	`jnl`	Time and Space Efficient Secondary Memory Representation of Quadtrees. Inf. Syst. Enrico Nardelli, Guido Proietti
1996	B	`conf`	An Output Sensitive Solution to the Set Union and Intersection Problem. SOFSEM Carlo Gaibisso, Enrico Nardelli, Guido Proietti
1996	J	`jnl`	On the creation of quadtrees by using a branching process. Image Vis. Comput. Yannis Manolopoulos, Enrico Nardelli, Guido Proietti, Michael Vassilakopoulos
1995	J	`jnl`	Efficient Secondary Memory Processing of Window Queries on Spatial Data. Inf. Sci. Enrico Nardelli, Guido Proietti
1995	A	`conf`	On the Generation of Aggregated Random Spatial Regions. CIKM Yannis Manolopoulos, Enrico Nardelli, Guido Proietti, Michael Vassilakopoulos
1994	—	`conf`	A Hybrid Pointerless Representation of Quadtrees for Efficient Processing of Window Queries. IGIS Enrico Nardelli, Guido Proietti
1994	—	`conf`	An Accurate Model for Quadtrees Representing Noiseless Images of Spatial Data. ICIP (2) Enrico Nardelli, Guido Proietti
1993	A	`conf`	Raster to object conversion aided by knowledge based image processing. ICDAR Enrico Nardelli, Michelangelo Fossa, Guido Proietti