default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuido Proietti
Person information
- affiliation: University of L'Aquila, Italy
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i18]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Alessandro Straziota:
Temporal queries for dynamic temporal forests. CoRR abs/2409.18750 (2024)- 2022
- [j52]Davide Bilò, Luciano Gualà, Stefano Leucci
, Guido Proietti:
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. Algorithmica 84(1): 37-59 (2022) - [j51]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Giacomo Scornavacca:
Cutting bamboo down to size. Theor. Comput. Sci. 909: 54-67 (2022) - [j50]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi:
New approximation algorithms for the heterogeneous weighted delivery problem. Theor. Comput. Sci. 932: 102-115 (2022) - [c86]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: 441-446 - [c85]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: 123-131 - [c84]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: 12:1-12:21 - 2021
- [j49]Davide Bilò, Luciano Gualà, Guido Proietti:
Hardness of an Asymmetric 2-Player Stackelberg Network Pricing Game. Algorithms 14(1): 8 (2021) - [j48]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Network Creation Games with Traceroute-Based Strategies. Algorithms 14(2): 35 (2021) - [c83]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Giacomo Scornavacca:
Cutting Bamboo down to Size. FUN 2021: 5:1-5:18 - [c82]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi:
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem. SIROCCO 2021: 167-184 - [i17]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 abs/2106.12293 (2021) - 2020
- [j47]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): 279-299 (2020) - [j46]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Tracking routes in communication networks. Theor. Comput. Sci. 844: 1-15 (2020) - [i16]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Giacomo Scornavacca:
Cutting Bamboo Down to Size. CoRR abs/2005.00168 (2020)
2010 – 2019
- 2019
- [j45]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): 165-184 (2019) - [c81]Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna, Guido Proietti:
Dual-Mode Greedy Algorithms Can Save Energy. ISAAC 2019: 64:1-64:18 - [c80]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Tracking Routes in Communication Networks. SIROCCO 2019: 81-93 - 2018
- [j44]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Fault-Tolerant Approximate Shortest-Path Trees. Algorithmica 80(12): 3437-3460 (2018) - [c79]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: 156-171 - [c78]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: 191-215 - [c77]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi:
On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games. FUN 2018: 8:1-8:15 - [c76]Davide Bilò, Keerti Choudhary, Luciano Gualà, Stefano Leucci, Merav Parter, Guido Proietti:
Efficient Oracles and Routing Schemes for Replacement Paths. STACS 2018: 13:1-13:15 - [i15]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 abs/1801.10416 (2018) - 2017
- [c75]Feliciano Colella, Mattia D'Emidio, Guido Proietti:
Simple and Practically Efficient Fault-tolerant 2-hop Cover Labelings. ICTCS/CILC 2017: 51-62 - [c74]Andrea Clementi, Luciano Gualà, Guido Proietti, Giacomo Scornavacca:
Rational Fair Consensus in the Gossip Model. IPDPS 2017: 163-171 - [c73]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: 14:1-14:13 - [c72]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: 303-317 - [i14]Andrea Clementi, Luciano Gualà, Guido Proietti, Giacomo Scornavacca:
Rational Fair Consensus in the GOSSIP Model. CoRR abs/1705.09566 (2017) - [i13]Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti:
Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges. CoRR abs/1707.08861 (2017) - [i12]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 abs/1710.01516 (2017) - 2016
- [j43]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Exact and approximate algorithms for movement problems on (special classes of) graphs. Theor. Comput. Sci. 652: 86-101 (2016) - [j42]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Locality-Based Network Creation Games. ACM Trans. Parallel Comput. 3(1): 6:1-6:26 (2016) - [c71]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Compact and Fast Sensitivity Oracles for Single-Source Distances. ESA 2016: 13:1-13:14 - [c70]Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, Guido Proietti:
On the Clustered Shortest-Path Tree Problem. ICTCS 2016: 263-268 - [c69]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. STACS 2016: 18:1-18:14 - [c68]Katerina Böhmová, Jérémie Chalopin, Matús Mihalák, Guido Proietti, Peter Widmayer:
Sequence Hypergraphs. WG 2016: 282-294 - [i11]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. CoRR abs/1601.04169 (2016) - [i10]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Locality-based Network Creation Games. CoRR abs/1607.06765 (2016) - [i9]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Compact and Fast Sensitivity Oracles for Single-Source Distances. CoRR abs/1608.04769 (2016) - 2015
- [j41]Davide Bilò, Luciano Gualà, Guido Proietti:
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree. Algorithmica 73(3): 547-570 (2015) - [j40]Evangelos Bampas, Davide Bilò, Guido Drovandi, Luciano Gualà, Ralf Klasing, Guido Proietti:
Network verification via routing table queries. J. Comput. Syst. Sci. 81(1): 234-248 (2015) - [j39]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: 1.5:1.1-1.5:1.33 (2015) - [j38]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Specializations and generalizations of the Stackelberg minimum spanning tree game. Theor. Comput. Sci. 562: 643-657 (2015) - [j37]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
The max-distance network creation game on general host graphs. Theor. Comput. Sci. 573: 43-53 (2015) - [j36]Davide Bilò, Luciano Gualà, Guido Proietti:
Bounded-Distance Network Creation Games. ACM Trans. Economics and Comput. 3(3): 16:1-16:20 (2015) - [c67]Davide Bilò, Fabrizio Grandoni, Luciano Gualà, Stefano Leucci, Guido Proietti:
Improved Purely Additive Fault-Tolerant Spanners. ESA 2015: 167-178 - [c66]Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti:
Path-Fault-Tolerant Approximate Shortest-Path Trees. SIROCCO 2015: 224-238 - [c65]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: 239-253 - [i8]Davide Bilò, Fabrizio Grandoni, Luciano Gualà, Stefano Leucci, Guido Proietti:
Improved Purely Additive Fault-Tolerant Spanners. CoRR abs/1507.00505 (2015) - [i7]Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti:
Path-Fault-Tolerant Approximate Shortest-Path Trees. CoRR abs/1507.01695 (2015) - 2014
- [j35]Davide Bilò, Luciano Gualà, Guido Proietti:
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree. Algorithmica 68(2): 337-357 (2014) - [c64]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Fault-Tolerant Approximate Shortest-Path Trees. ESA 2014: 137-148 - [c63]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Network Creation Games with Traceroute-Based Strategies. SIROCCO 2014: 210-223 - [c62]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Locality-based network creation games. SPAA 2014: 277-286 - [c61]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: 283-294 - [i6]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Exact and approximate algorithms for movement problems on (special classes of) graphs. CoRR abs/1407.0628 (2014) - [i5]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Fault-Tolerant Approximate Shortest-Path Trees. CoRR abs/1407.0637 (2014) - [i4]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
The Max-Distance Network Creation Game on General Host Graphs. CoRR abs/1407.0643 (2014) - [i3]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game. CoRR abs/1407.1167 (2014) - 2013
- [c60]Davide Bilò, Yann Disser, Luciano Gualà, Matús Mihalák, Guido Proietti, Peter Widmayer:
Polygon-Constrained Motion Planning Problems. ALGOSENSORS 2013: 67-82 - [c59]Davide Bilò, Luciano Gualà, Guido Proietti:
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree. ESA 2013: 157-168 - [c58]Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti:
Dynamically Maintaining Shortest Path Trees under Batches of Updates. SIROCCO 2013: 286-297 - [c57]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs. SIROCCO 2013: 322-333 - 2012
- [j34]Davide Bilò, Luciano Gualà, Guido Proietti:
Improved approximability and non-approximability results for graph diameter decreasing problems. Theor. Comput. Sci. 417: 12-22 (2012) - [c56]Annalisa D'Andrea, Guido Proietti:
Reoptimizing the Strengthened Metric TSP on Multiple Edge Weight Modifications. SEA 2012: 111-122 - [c55]Davide Bilò, Luciano Gualà, Guido Proietti:
Bounded-Distance Network Creation Games. WINE 2012: 72-85 - [c54]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
The Max-Distance Network Creation Game on General Host Graphs. WINE 2012: 392-405 - 2011
- [j33]Davide Bilò, Luca Forlizzi, Guido Proietti:
Approximating the Metric TSP in Linear Time. Theory Comput. Syst. 49(3): 615-631 (2011) - [c53]Evangelos Bampas, Davide Bilò, Guido Drovandi, Luciano Gualà, Ralf Klasing, Guido Proietti:
Network Verification via Routing Table Queries. SIROCCO 2011: 270-281 - [i2]Davide Bilò, Luciano Gualà, Guido Proietti:
Bounded-Distance Network Creation Games. CoRR abs/1112.4264 (2011) - 2010
- [c52]Davide Bilò, Luciano Gualà, Guido Proietti:
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree. MFCS 2010: 138-149 - [c51]Davide Bilò, Luciano Gualà, Guido Proietti:
Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems. MFCS 2010: 150-161 - [c50]Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game. WINE 2010: 75-86
2000 – 2009
- 2009
- [j32]Davide Bilò, Luciano Gualà, Guido Proietti:
Dynamic mechanism design. Theor. Comput. Sci. 410(17): 1564-1572 (2009) - [j31]Paolo Penna, Guido Proietti, Peter Widmayer:
Strongly polynomial-time truthful mechanisms in one shot. Theor. Comput. Sci. 410(17): 1607-1615 (2009) - [c49]Davide Bilò, Michael Gatto, Luciano Gualà, Guido Proietti, Peter Widmayer:
Stability of Networks in Stretchable Graphs. SIROCCO 2009: 100-112 - [i1]Davide Bilò, Luciano Gualà, Guido Proietti:
Hardness of an Asymmetric 2-player Stackelberg Network Pricing Game. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j30]Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti:
Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems. Internet Math. 5(4): 411-437 (2008) - [j29]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): 605-617 (2008) - [j28]Davide Bilò, Guido Proietti:
On the complexity of minimizing interference in ad-hoc and sensor networks. Theor. Comput. Sci. 402(1): 43-55 (2008) - [c48]Davide Bilò, Luca Forlizzi, Guido Proietti:
Approximating the Metric TSP in Linear Time. WG 2008: 43-54 - [c47]Davide Bilò, Luciano Gualà, Guido Proietti, Peter Widmayer:
Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game. WINE 2008: 251-262 - 2007
- [j27]Luciano Gualà, Guido Proietti:
Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem. Algorithmica 49(3): 171-191 (2007) - [j26]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): 83-93 (2007) - [j25]Luciano Gualà, Guido Proietti:
Efficient truthful mechanisms for the single-source shortest paths tree problem. Concurr. Comput. Pract. Exp. 19(17): 2285-2297 (2007) - [j24]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): 23-33 (2007) - [c46]Davide Bilò, Jörg Derungs, Luciano Gualà, Guido Proietti, Peter Widmayer:
Locating Facilities on a Network to Minimize Their Average Service Radius. ISAAC 2007: 587-598 - [c45]Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti:
An algorithm composition scheme preserving monotonicity. PODC 2007: 360-361 - [c44]Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti:
Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems. WINE 2007: 503-514 - 2006
- [j23]Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert:
On the Stability of Approximation for Hamiltonian Path Problems. Algorithmic Oper. Res. 1(1) (2006) - [j22]Enrico Nardelli, Guido Proietti:
Efficient unbalanced merge-sort. Inf. Sci. 176(10): 1321-1337 (2006) - [j21]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): 556-565 (2006) - [c43]Davide Bilò, Guido Proietti:
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks. ALGOSENSORS 2006: 13-24 - [c42]Davide Bilò, Luciano Gualà, Guido Proietti:
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem. CAAN 2006: 19-30 - [c41]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: 251-270 - [c40]Guido Proietti, Peter Widmayer:
Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii. ISAAC 2006: 578-587 - [c39]Davide Bilò, Luciano Gualà, Guido Proietti:
On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem. SIROCCO 2006: 295-309 - [c38]Davide Bilò, Luciano Gualà, Guido Proietti:
Dynamic Mechanism Design. WINE 2006: 3-15 - [c37]Paolo Penna, Guido Proietti, Peter Widmayer:
Strongly Polynomial-Time Truthful Mechanisms in One Shot. WINE 2006: 377-388 - 2005
- [c36]Luciano Gualà, Guido Proietti:
A Truthful (2-2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals. COCOON 2005: 390-400 - [c35]Luciano Gualà, Guido Proietti:
Efficient Truthful Mechanisms for the Single-Source Shortest Paths Tree Problem. Euro-Par 2005: 941-951 - [c34]Davide Bilò, Guido Proietti:
Range Augmentation Problems in Static Ad-Hoc Wireless Networks. SIROCCO 2005: 49-64 - [c33]Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert:
On the Stability of Approximation for Hamiltonian Path Problems. SOFSEM 2005: 147-156 - [c32]Guido Proietti, Peter Widmayer:
A truthful mechanism for the non-utilitarian minimum radius spanning tree problem. SPAA 2005: 195-202 - 2004
- [j20]Enrico Nardelli, Guido Proietti, Peter Widmayer:
Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures. Algorithmica 40(2): 119-132 (2004) - [j19]Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger:
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. Theor. Comput. Sci. 326(1-3): 137-153 (2004) - [c31]Giovanna Melideo, Paolo Penna, Guido Proietti, Roger Wattenhofer, Peter Widmayer:
Truthful Mechanisms for Generalized Utilitarian Problems. IFIP TCS 2004: 167-180 - [c30]Davide Bilò, Guido Proietti:
Augmenting the Edge-Connectivity of a Spider Tree. ISAAC 2004: 159-171 - [c29]Aleksej Di Salvo, Guido Proietti:
Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor. SIROCCO 2004: 99-110 - [c28]Davide Bilò, Guido Proietti:
A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path. WAOA 2004: 181-196 - [c27]Michele Conforti, Anna Galluccio, Guido Proietti:
Edge-Connectivity Augmentation and Network Matrices. WG 2004: 355-364 - 2003
- [j18]Enrico Nardelli, Guido Proietti, Peter Widmayer:
Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast. Algorithmica 35(1): 56-74 (2003) - [j17]Anna Galluccio, Guido Proietti:
Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems. Algorithmica 36(4): 361-374 (2003) - [j16]Enrico Nardelli, Guido Proietti, Peter Widmayer:
Finding the most vital node of a shortest path. Theor. Comput. Sci. 296(1): 167-177 (2003) - [c26]Adriano Di Pasquale, Luca Forlizzi, Christian S. Jensen, Yannis Manolopoulos, Enrico Nardelli, Dieter Pfoser, Guido Proietti, Simonas Saltenis, Yannis Theodoridis, Theodoros Tzouramanis, Michael Vassilakopoulos:
Access Methods and Query Processing Techniques. Spatio-Temporal Databases: The CHOROCHRONOS Approach 2003: 203-261 - [c25]Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger:
On k-Edge-Connectivity Problems with Sharpened Triangle Inequality. CIAC 2003: 189-200 - [c24]Carlo Gaibisso, Guido Proietti, Richard B. Tan:
Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs. COCOON 2003: 404-414 - [c23]Vittorio Bilò, Adriano Di Pasquale, Fabio Fioravanti, Michele Flammini, Luca Forlizzi, Francesco Lo Presti, Giovanna Melideo, Enrico Nardelli, Alfredo Navarra, Guido Proietti:
Quality of Service in Wireless Networks. IPDPS 2003: 224 - 2002
- [c22]Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger:
On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality. FSTTCS 2002: 59-70 - [c21]Anna Galluccio, Guido Proietti:
A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation. ISAAC 2002: 150-162 - [c20]Adriano Di Pasquale, Enrico Nardelli, Guido Proietti:
An Improved Upper Bound for Scalable Distributed Search Trees. WDAS 2002: 15-28 - 2001
- [j15]Michele Flammini, Enrico Nardelli, Guido Proietti:
ATM layouts with bounded hop count and congestion. Distributed Comput. 14(2): 65-73 (2001) - [j14]Yannis Manolopoulos, Enrico Nardelli, Guido Proietti, Eleni Tousidou:
A generalized comparison of linear representations of thematic layers. Data Knowl. Eng. 37(1): 1-23 (2001) - [j13]Enrico Nardelli, Guido Proietti, Peter Widmayer:
A faster computation of the most vital edge of a shortest path. Inf. Process. Lett. 79(2): 81-85 (2001) - [j12]Enrico Nardelli, Guido Proietti, Peter Widmayer:
Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures. J. Graph Algorithms Appl. 5(5): 39-57 (2001) - [j11]Guido Proietti, Christos Faloutsos:
Accurate Modeling of Region Data. IEEE Trans. Knowl. Data Eng. 13(6): 874-883 (2001) - [c19]Enrico Nardelli, Guido Proietti, Peter Widmayer:
Finding the Most Vital Node of a Shortest Path. COCOON 2001: 278-287 - [c18]Anna Galluccio, Guido Proietti:
Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths. ISAAC 2001: 345-354 - 2000
- [j10]Enrico Nardelli, Guido Proietti:
An efficient spatial access method for spatial images containing multiple non-overlapping features. Inf. Syst. 25(8): 553-568 (2000) - [j9]Guido Proietti, Christos Faloutsos:
Analysis of Range Queries and Self-Spatial Join Queries on Real Region Datasets Stored Using an R-Tree. IEEE Trans. Knowl. Data Eng. 12(5): 751-762 (2000) - [c17]Enrico Nardelli, Guido Proietti:
Size Estimation of the Intersection Join between Two Line Segment Datasets. ADBIS-DASFAA 2000: 229-238 - [c16]Enrico Nardelli, Guido Proietti, Peter Widmayer:
Maintaining a Minimum Spanning Tree Under Transient Node Failures. ESA 2000: 346-355 - [c15]Guido Proietti:
Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees. WAE 2000: 207-217 - [e1]Michele Flammini, Enrico Nardelli, Guido Proietti, Paul G. Spirakis:
SIROCCO 7, Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity, Laquila, Italy, June 20-22, 2000. Carleton Scientific 2000 [contents]
1990 – 1999
- 1999
- [j8]Guido Proietti:
An Optimal Algorithm for Decomposing a Window into Maximal Quadtree Blocks. Acta Informatica 36(4): 257-266 (1999) - [j7]Carlo Gaibisso, Enrico Nardelli, Guido Proietti:
Intersection Reporting on Two Collections of Disjoint Sets. Inf. Sci. 114(1-4): 41-52 (1999) - [j6]Enrico Nardelli, Guido Proietti:
Probabilistic models for images and quadtrees: differences and equivalences. Image Vis. Comput. 17(9): 659-665 (1999) - [c14]Enrico Nardelli, Guido Proietti:
S*-Tree: An Improved S+-Tree for Coloured Images. ADBIS 1999: 156-167 - [c13]Enrico Nardelli, Guido Proietti, Peter Widmayer:
How to Swap a Failing Edge of a Single Source Shortest Paths Tree. COCOON 1999: 144-153 - [c12]Guido Proietti, Christos Faloutsos:
I/O Complexity for Range Queries on Region Data Stored Using an R-tree. ICDE 1999: 628-635 - [c11]Yihong Gong, Guido Proietti, David LaRose:
A Robust Image Mosaicing Technique Capable of Creating Integrated Panoramas. IV 1999: 24-31 - 1998
- [j5]Enrico Nardelli, Guido Proietti, Peter Widmayer:
Finding the Detour-Critical Edge of a Shortest Path Between Two Nodes. Inf. Process. Lett. 67(1): 51-54 (1998) - [c10]Guido Proietti, Christos Faloutsos:
Selectivity Estimation of Window Queries. CIKM 1998: 340-347 - [c9]Yihong Gong, Guido Proietti, Christos Faloutsos:
Image Indexing and Retrieval Based on Human Perceptual Color Clustering. CVPR 1998: 578-583 - [c8]Enrico Nardelli, Guido Proietti, Peter Widmayer:
Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures. ESA 1998: 55-66 - 1997
- [j4]Enrico Nardelli, Guido Proietti:
Time and Space Efficient Secondary Memory Representation of Quadtrees. Inf. Syst. 22(1): 25-37 (1997) - [j3]Yannis Manolopoulos, Enrico Nardelli, Apostolos Papadopoulos, Guido Proietti:
MOF-Tree: A Spatial Access Method to Manipulate Multiple Overlapping Features. Inf. Syst. 22(8): 465-481 (1997) - [c7]Carlo Gaibisso, Guido Proietti:
Efficient Insertion of Approximately Sorted Seqeunces of Items into a Dictionary. SOFSEM 1997: 399-406 - [c6]Michele Flammini, Enrico Nardelli, Guido Proietti:
ATM Layouts with Bounded Hop Count and Congestion. WDAG 1997: 52-65 - 1996
- [j2]Yannis Manolopoulos, Enrico Nardelli, Guido Proietti, Michael Vassilakopoulos:
On the creation of quadtrees by using a branching process. Image Vis. Comput. 14(2): 159-164 (1996) - [c5]Carlo Gaibisso, Enrico Nardelli, Guido Proietti:
An Output Sensitive Solution to the Set Union and Intersection Problem. SOFSEM 1996: 351-358 - 1995
- [j1]Enrico Nardelli, Guido Proietti:
Efficient Secondary Memory Processing of Window Queries on Spatial Data. Inf. Sci. 84(1&2): 67-83 (1995) - [c4]Yannis Manolopoulos, Enrico Nardelli, Guido Proietti, Michael Vassilakopoulos:
On the Generation of Aggregated Random Spatial Regions. CIKM 1995: 318-325 - 1994
- [c3]Enrico Nardelli, Guido Proietti:
An Accurate Model for Quadtrees Representing Noiseless Images of Spatial Data. ICIP (2) 1994: 610-614 - [c2]Enrico Nardelli, Guido Proietti:
A Hybrid Pointerless Representation of Quadtrees for Efficient Processing of Window Queries. IGIS 1994: 259-269 - 1993
- [c1]Enrico Nardelli, Michelangelo Fossa, Guido Proietti:
Raster to object conversion aided by knowledge based image processing. ICDAR 1993: 951-954
Coauthor Index
[i18] [j52] [j51] [j50] [c84] [j49] [j48] [c83] [c82] [i17] [j47] [j46] [i16] [c80] [j44] [c77] [c76] [c73] [c72] [i13] [i12] [j43] [j42] [c71] [c69] [i11] [i10] [i9] [j41] [j40] [j38] [j37] [j36] [c67] [c65] [i8] [j35] [c64] [c63] [c62] [i6] [i5] [i4] [i3] [c60] [c59] [c57] [j34] [c55] [c54] [j33] [c53] [i2] [c52] [c51] [c50] [j32] [c49] [i1] [j30] [j28] [c48] [c47] [c46] [c45] [c44] [c43] [c42] [c39] [c38] [c34] [c30] [c28]
[i18] [j52] [j51] [j50] [c84] [j49] [j48] [c83] [c82] [i17] [j47] [j46] [i16] [c80] [j44] [c77] [c76] [c74] [c73] [c72] [i14] [i13] [i12] [j43] [j42] [c71] [c69] [i11] [i10] [i9] [j41] [j40] [j38] [j37] [j36] [c67] [c65] [i8] [j35] [c64] [c63] [c62] [i6] [i5] [i4] [i3] [c60] [c59] [c57] [j34] [c55] [c54] [c53] [i2] [c52] [c51] [c50] [j32] [c49] [i1] [j30] [c47] [j27] [j25] [c46] [c45] [c44] [c42] [c39] [c38] [c36] [c35]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-18 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
