| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Guido Proietti 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 Carlo Gaibisso , Guido Proietti, Richard B. Tan : Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs. COCOON 2003 : 404-414 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 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 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) Anna Galluccio , Guido Proietti: Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems. Algorithmica 36 (4): 361-374 (2003) Enrico Nardelli , Guido Proietti, Peter Widmayer : Finding the most vital node of a shortest path. Theor. Comput. Sci. 296 (1): 167-177 (2003) 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 Anna Galluccio , Guido Proietti: A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation. ISAAC 2002 : 150-162 Adriano Di Pasquale , Enrico Nardelli , Guido Proietti: An Improved Upper Bound for Scalable Distributed Search Trees. WDAS 2002 : 15-28 Enrico Nardelli , Guido Proietti, Peter Widmayer : Finding the Most Vital Node of a Shortest Path. COCOON 2001 : 278-287 Anna Galluccio , Guido Proietti: Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths. ISAAC 2001 : 345-354 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) Michele Flammini , Enrico Nardelli , Guido Proietti: ATM layouts with bounded hop count and congestion. Distributed Computing 14 (2): 65-73 (2001) Guido Proietti, Christos Faloutsos : Accurate Modeling of Region Data. IEEE Trans. Knowl. Data Eng. 13 (6): 874-883 (2001) 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) 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) 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 Enrico Nardelli , Guido Proietti: Size Estimation of the Intersection Join between Two Line Segment Datasets. ADBIS-DASFAA 2000 : 229-238 Guido Proietti: Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees. Algorithm Engineering 2000 : 207-217 Enrico Nardelli , Guido Proietti, Peter Widmayer : Maintaining a Minimum Spanning Tree Under Transient Node Failures. ESA 2000 : 346-355 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) Enrico Nardelli , Guido Proietti: An efficient spatial access method for spatial images containing multiple non-overlapping features. Inf. Syst. 25 (8): 553-568 (2000) Enrico Nardelli , Guido Proietti: S*-Tree: An Improved S + -Tree for Coloured Images. ADBIS 1999 : 156-167 Enrico Nardelli , Guido Proietti, Peter Widmayer : How to Swap a Failing Edge of a Single Source Shortest Paths Tree. COCOON 1999 : 144-153 Guido Proietti, Christos Faloutsos : I/O Complexity for Range Queries on Region Data Stored Using an R-tree. ICDE 1999 : 628-635 Yihong Gong , Guido Proietti, David LaRose : A Robust Image Mosaicing Technique Capable of Creating Integrated Panoramas. IV 1999 : 24- Guido Proietti: An Optimal Algorithm for Decomposing a Window into Maximal Quadtree Blocks. Acta Inf. 36 (4): 257-266 (1999) Enrico Nardelli , Guido Proietti: Probabilistic models for images and quadtrees: differences and equivalences. Image Vision Comput. 17 (9): 659-665 (1999) Carlo Gaibisso , Enrico Nardelli , Guido Proietti: Intersection Reporting on Two Collections of Disjoint Sets. Inf. Sci. 114 (1-4): 41-52 (1999) Guido Proietti, Christos Faloutsos : Selectivity Estimation of Window Queries. CIKM 1998 : 340-347 Yihong Gong , Guido Proietti, Christos Faloutsos : Image Indexing and Retrieval Based on Human Perceptual Color Clustering. CVPR 1998 : 578-585 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 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) Carlo Gaibisso , Guido Proietti: Efficient Insertion of Approximately Sorted Seqeunces of Items into a Dictionary. SOFSEM 1997 : 399-406 Michele Flammini , Enrico Nardelli , Guido Proietti: ATM Layouts with Bounded Hop Count and Congestion. WDAG 1997 : 52-65 Enrico Nardelli , Guido Proietti: Time and Space Efficient Secondary Memory Representation of Quadtrees. Inf. Syst. 22 (1): 25-37 (1997) 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) Carlo Gaibisso , Enrico Nardelli , Guido Proietti: An Output Sensitive Solution to the Set Union and Intersection Problem. SOFSEM 1996 : 351-358 Yannis Manolopoulos , Enrico Nardelli , Guido Proietti, Michael Vassilakopoulos : On the creation of quadtrees by using a branching process. Image Vision Comput. 14 (2): 159-164 (1996) Yannis Manolopoulos , Enrico Nardelli , Guido Proietti, Michael Vassilakopoulos : On the Generation of Aggregated Random Spatial Regions. CIKM 1995 : 318-325 Enrico Nardelli , Guido Proietti: Efficient Secondary Memory Processing of Window Queries on Spatial Data. Inf. Sci. 84 (1&2): 67-83 (1995) Enrico Nardelli , Guido Proietti: An Accurate Model for Quadtrees Representing Noiseless Images of Spatial Data. ICIP (2) 1994 : 610-614 Enrico Nardelli , Guido Proietti: A Hybrid Pointerless Representation of Quadtrees for Efficient Processing of Window Queries. IGIS 1994 : 259-269 1 [ 42 ] 2 [ 37 ] [ 44 ] 3 [ 37 ] [ 44 ] 4 [ 13 ] [ 14 ] [ 19 ] [ 23 ] [ 30 ] 5 [ 42 ] 6 [ 9 ] [ 27 ] [ 31 ] [ 42 ] 7 [ 41 ] [ 42 ] 8 [ 6 ] [ 10 ] [ 15 ] [ 43 ] 9 [ 33 ] [ 36 ] [ 39 ] 10 [ 13 ] [ 18 ] 11 [ 37 ] [ 44 ] 12 [ 41 ] 13 [ 37 ] [ 44 ] 14 [ 18 ] 15 [ 4 ] [ 5 ] [ 7 ] [ 32 ] [ 41 ] 16 [ 42 ] 17 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 11 ] [ 12 ] [ 15 ] [ 16 ] [ 20 ] [ 21 ] [ 22 ] [ 24 ] [ 26 ] [ 27 ] [ 28 ] [ 29 ] [ 31 ] [ 32 ] [ 34 ] [ 35 ] [ 38 ] [ 40 ] [ 41 ] [ 42 ] 18 [ 42 ] 19 [ 7 ] 20 [ 35 ] [ 41 ] [ 42 ] 21 [ 41 ] 22 [ 42 ] 23 [ 41 ] 24 [ 37 ] [ 44 ] 25 [ 27 ] 26 [ 43 ] 27 [ 41 ] 28 [ 32 ] 29 [ 41 ] 30 [ 37 ] [ 44 ] 31 [ 4 ] [ 5 ] [ 41 ] 32 [ 11 ] [ 12 ] [ 20 ] [ 24 ] [ 28 ] [ 29 ] [ 34 ] [ 38 ] [ 40 ]  ©2004 Association for Computing Machinery |
