The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Guido Proietti: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Enrico Nardelli, Guido Proietti
    Time and Space Efficient Secondary Memory Representation of Quadtrees. [Citation Graph (2, 0)][DBLP]
    Inf. Syst., 1997, v:22, n:1, pp:25-37 [Journal]
  2. Yannis Manolopoulos, Enrico Nardelli, Guido Proietti, Michael Vassilakopoulos
    On the Generation of Aggregated Random Spatial Regions. [Citation Graph (1, 0)][DBLP]
    CIKM, 1995, pp:318-325 [Conf]
  3. Guido Proietti, Christos Faloutsos
    Selectivity Estimation of Window Queries. [Citation Graph (1, 0)][DBLP]
    CIKM, 1998, pp:340-347 [Conf]
  4. Enrico Nardelli, Guido Proietti, Peter Widmayer
    Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures. [Citation Graph (1, 0)][DBLP]
    ESA, 1998, pp:55-66 [Conf]
  5. Guido Proietti, Christos Faloutsos
    I/O Complexity for Range Queries on Region Data Stored Using an R-tree. [Citation Graph (1, 9)][DBLP]
    ICDE, 1999, pp:628-635 [Conf]
  6. Guido Proietti
    An Optimal Algorithm for Decomposing a Window into Maximal Quadtree Blocks. [Citation Graph (1, 0)][DBLP]
    Acta Inf., 1999, v:36, n:4, pp:257-266 [Journal]
  7. Enrico Nardelli, Guido Proietti, Peter Widmayer
    Finding the Detour-Critical Edge of a Shortest Path Between Two Nodes. [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1998, v:67, n:1, pp:51-54 [Journal]
  8. Yannis Manolopoulos, Enrico Nardelli, Apostolos Papadopoulos, Guido Proietti
    MOF-Tree: A Spatial Access Method to Manipulate Multiple Overlapping Features. [Citation Graph (1, 0)][DBLP]
    Inf. Syst., 1997, v:22, n:8, pp:465-481 [Journal]
  9. Enrico Nardelli, Guido Proietti
    Size Estimation of the Intersection Join between Two Line Segment Datasets. [Citation Graph (0, 0)][DBLP]
    ADBIS-DASFAA, 2000, pp:229-238 [Conf]
  10. Enrico Nardelli, Guido Proietti
    S*-Tree: An Improved S+-Tree for Coloured Images. [Citation Graph (0, 7)][DBLP]
    ADBIS, 1999, pp:156-167 [Conf]
  11. Davide Bilò, Guido Proietti
    On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks. [Citation Graph (0, 0)][DBLP]
    ALGOSENSORS, 2006, pp:13-24 [Conf]
  12. Davide Bilò, Luciano Gualà, Guido Proietti
    Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem. [Citation Graph (0, 0)][DBLP]
    CAAN, 2006, pp:19-30 [Conf]
  13. 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. [Citation Graph (0, 0)][DBLP]
    Spatio-Temporal Databases: The CHOROCHRONOS Approach, 2003, pp:203-261 [Conf]
  14. 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. [Citation Graph (0, 0)][DBLP]
    CIAC, 2003, pp:189-200 [Conf]
  15. Carlo Gaibisso, Guido Proietti, Richard B. Tan
    Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:404-414 [Conf]
  16. Luciano Gualà, Guido Proietti
    A Truthful (2-2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:390-400 [Conf]
  17. Enrico Nardelli, Guido Proietti, Peter Widmayer
    Finding the Most Vital Node of a Shortest Path. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:278-287 [Conf]
  18. Enrico Nardelli, Guido Proietti, Peter Widmayer
    How to Swap a Failing Edge of a Single Source Shortest Paths Tree. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:144-153 [Conf]
  19. Yihong Gong, Guido Proietti, Christos Faloutsos
    Image Indexing and Retrieval Based on Human Perceptual Color Clustering. [Citation Graph (0, 0)][DBLP]
    CVPR, 1998, pp:578-585 [Conf]
  20. Enrico Nardelli, Guido Proietti, Peter Widmayer
    Maintaining a Minimum Spanning Tree Under Transient Node Failures. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:346-355 [Conf]
  21. Luciano Gualà, Guido Proietti
    Efficient Truthful Mechanisms for the Single-Source Shortest Paths Tree Problem. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2005, pp:941-951 [Conf]
  22. 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. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:59-70 [Conf]
  23. Enrico Nardelli, Guido Proietti
    An Accurate Model for Quadtrees Representing Noiseless Images of Spatial Data. [Citation Graph (0, 0)][DBLP]
    ICIP (2), 1994, pp:610-614 [Conf]
  24. Giovanna Melideo, Paolo Penna, Guido Proietti, Roger Wattenhofer, Peter Widmayer
    Truthful Mechanisms for Generalized Utilitarian Problems. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2004, pp:167-180 [Conf]
  25. Enrico Nardelli, Guido Proietti
    A Hybrid Pointerless Representation of Quadtrees for Efficient Processing of Window Queries. [Citation Graph (0, 0)][DBLP]
    IGIS, 1994, pp:259-269 [Conf]
  26. 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. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2003, pp:224- [Conf]
  27. Davide Bilò, Guido Proietti
    Augmenting the Edge-Connectivity of a Spider Tree. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:159-171 [Conf]
  28. Anna Galluccio, Guido Proietti
    Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:345-354 [Conf]
  29. Anna Galluccio, Guido Proietti
    A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:150-162 [Conf]
  30. Guido Proietti, Peter Widmayer
    Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:578-587 [Conf]
  31. Yihong Gong, Guido Proietti, David LaRose
    A Robust Image Mosaicing Technique Capable of Creating Integrated Panoramas. [Citation Graph (0, 0)][DBLP]
    IV, 1999, pp:24-0 [Conf]
  32. Davide Bilò, Luciano Gualà, Guido Proietti
    On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2006, pp:295-309 [Conf]
  33. Davide Bilò, Guido Proietti
    Range Augmentation Problems in Static Ad-Hoc Wireless Networks. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:49-64 [Conf]
  34. Aleksej Di Salvo, Guido Proietti
    Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2004, pp:99-110 [Conf]
  35. Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert
    On the Stability of Approximation for Hamiltonian Path Problems. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2005, pp:147-156 [Conf]
  36. Carlo Gaibisso, Enrico Nardelli, Guido Proietti
    An Output Sensitive Solution to the Set Union and Intersection Problem. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1996, pp:351-358 [Conf]
  37. Carlo Gaibisso, Guido Proietti
    Efficient Insertion of Approximately Sorted Seqeunces of Items into a Dictionary. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1997, pp:399-406 [Conf]
  38. Guido Proietti, Peter Widmayer
    A truthful mechanism for the non-utilitarian minimum radius spanning tree problem. [Citation Graph (0, 0)][DBLP]
    SPAA, 2005, pp:195-202 [Conf]
  39. Guido Proietti
    Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 2000, pp:207-217 [Conf]
  40. Davide Bilò, Guido Proietti
    A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path. [Citation Graph (0, 0)][DBLP]
    WAOA, 2004, pp:181-196 [Conf]
  41. Michele Flammini, Enrico Nardelli, Guido Proietti
    ATM Layouts with Bounded Hop Count and Congestion. [Citation Graph (0, 0)][DBLP]
    WDAG, 1997, pp:52-65 [Conf]
  42. Adriano Di Pasquale, Enrico Nardelli, Guido Proietti
    An Improved Upper Bound for Scalable Distributed Search Trees. [Citation Graph (0, 0)][DBLP]
    WDAS, 2002, pp:15-28 [Conf]
  43. Michele Conforti, Anna Galluccio, Guido Proietti
    Edge-Connectivity Augmentation and Network Matrices. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:355-364 [Conf]
  44. Davide Bilò, Luciano Gualà, Guido Proietti
    Dynamic Mechanism Design. [Citation Graph (0, 0)][DBLP]
    WINE, 2006, pp:3-15 [Conf]
  45. Paolo Penna, Guido Proietti, Peter Widmayer
    Strongly Polynomial-Time Truthful Mechanisms in One Shot. [Citation Graph (0, 0)][DBLP]
    WINE, 2006, pp:377-388 [Conf]
  46. Anna Galluccio, Guido Proietti
    Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:36, n:4, pp:361-374 [Journal]
  47. Enrico Nardelli, Guido Proietti, Peter Widmayer
    Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:35, n:1, pp:56-74 [Journal]
  48. Enrico Nardelli, Guido Proietti, Peter Widmayer
    Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:40, n:2, pp:119-132 [Journal]
  49. Michele Flammini, Enrico Nardelli, Guido Proietti
    ATM layouts with bounded hop count and congestion. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2001, v:14, n:2, pp:65-73 [Journal]
  50. Yannis Manolopoulos, Enrico Nardelli, Guido Proietti, Eleni Tousidou
    A generalized comparison of linear representations of thematic layers. [Citation Graph (0, 0)][DBLP]
    Data Knowl. Eng., 2001, v:37, n:1, pp:1-23 [Journal]
  51. Enrico Nardelli, Guido Proietti, Peter Widmayer
    A faster computation of the most vital edge of a shortest path. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:79, n:2, pp:81-85 [Journal]
  52. Enrico Nardelli, Guido Proietti
    An efficient spatial access method for spatial images containing multiple non-overlapping features. [Citation Graph (0, 0)][DBLP]
    Inf. Syst., 2000, v:25, n:8, pp:553-568 [Journal]
  53. Carlo Gaibisso, Enrico Nardelli, Guido Proietti
    Intersection Reporting on Two Collections of Disjoint Sets. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1999, v:114, n:1-4, pp:41-52 [Journal]
  54. Enrico Nardelli, Guido Proietti
    Efficient Secondary Memory Processing of Window Queries on Spatial Data. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1995, v:84, n:1&2, pp:67-83 [Journal]
  55. Enrico Nardelli, Guido Proietti
    Efficient unbalanced merge-sort. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2006, v:176, n:10, pp:1321-1337 [Journal]
  56. Yannis Manolopoulos, Enrico Nardelli, Guido Proietti, Michael Vassilakopoulos
    On the creation of quadtrees by using a branching process. [Citation Graph (0, 0)][DBLP]
    Image Vision Comput., 1996, v:14, n:2, pp:159-164 [Journal]
  57. Enrico Nardelli, Guido Proietti
    Probabilistic models for images and quadtrees: differences and equivalences. [Citation Graph (0, 0)][DBLP]
    Image Vision Comput., 1999, v:17, n:9, pp:659-665 [Journal]
  58. Enrico Nardelli, Guido Proietti, Peter Widmayer
    Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2001, v:5, n:5, pp:39-57 [Journal]
  59. Carlo Gaibisso, Guido Proietti, Richard B. Tan
    Efficient management of transient station failures in linear radio communication networks with bases. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2006, v:66, n:4, pp:556-565 [Journal]
  60. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:137-153 [Journal]
  61. Enrico Nardelli, Guido Proietti, Peter Widmayer
    Finding the most vital node of a shortest path. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:296, n:1, pp:167-177 [Journal]
  62. Guido Proietti, Christos Faloutsos
    Analysis of Range Queries and Self-Spatial Join Queries on Real Region Datasets Stored Using an R-Tree. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Knowl. Data Eng., 2000, v:12, n:5, pp:751-762 [Journal]
  63. Guido Proietti, Christos Faloutsos
    Accurate Modeling of Region Data. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Knowl. Data Eng., 2001, v:13, n:6, pp:874-883 [Journal]
  64. Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert
    On the Stability of Approximation for Hamiltonian Path Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmic Operations Research, 2006, v:1, n:1, pp:- [Journal]
  65. Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti
    An algorithm composition scheme preserving monotonicity. [Citation Graph (0, 0)][DBLP]
    PODC, 2007, pp:360-361 [Conf]
  66. Aleksej Di Salvo, Guido Proietti
    Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:383, n:1, pp:23-33 [Journal]

  67. Reusing Optimal TSP Solutions for Locally Modified Input Instances. [Citation Graph (, )][DBLP]


  68. Locating Facilities on a Network to Minimize Their Average Service Radius. [Citation Graph (, )][DBLP]


  69. Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems. [Citation Graph (, )][DBLP]


  70. Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree. [Citation Graph (, )][DBLP]


  71. Stability of Networks in Stretchable Graphs. [Citation Graph (, )][DBLP]


  72. Approximating the Metric TSP in Linear Time. [Citation Graph (, )][DBLP]


  73. Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game. [Citation Graph (, )][DBLP]


  74. Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems. [Citation Graph (, )][DBLP]


  75. Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem. [Citation Graph (, )][DBLP]


  76. Efficient truthful mechanisms for the single-source shortest paths tree problem. [Citation Graph (, )][DBLP]


Search in 0.029secs, Finished in 0.031secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002