This page shows all publications that appeared in the IASI annual research reports.
Authors currently affiliated with the Institute are always listed with the full name.
You can browse through them using either the links of the following line or those associated with
author names.
Show all publications of the year
ALL, with author Proietti G., in the category Journal Articles
(or show them all): (Items found: 26)
2014 | 2007 | 2006 | 2003 | 2001 | 2000 | 1999 | 1998 | 1997 | 1996 | 1994
2014 [top]
2007 [top]
- Bockenhauer H.J., Forlizzi L., Hromkovič J., Kneis J., Kupke J., Guido Proietti, Widmayer P.: On the Approximability of TSP on Local Modifications of Optimally Solved Instances, Algorithmic Operations Research 2 (2), 83-93, 2007
- Di Salvo A., Guido Proietti: Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor, Theoretical Computer Science 383 (1), 23-33, 2007
- Gualà L., Guido Proietti: Efficient Truthful Mechanisms for the Single-source Shortest Paths Tree Problem, Concurrency and Computation-Practice & Experience 19 (17), 2285-2297, 2007
- Gualà L., Guido Proietti: Exact and Approximate Truthful Mechanisms for the Shortest-Paths Tree Problem, Algorithmica 49 (3), 171-191, 2007
2006 [top]
- Forlizzi L., Hromkovič J., Guido Proietti, Seibert S.: On the Stability of Approximation for Hamiltonian Path Problems, Algorithmic Operations Research 1 (1), 31-45, 2006
- Carlo Gaibisso, Guido Proietti, Tan R.: Efficient Management of Transient Station Failures in Linear Radio Communication Networks with Bases, Journal of Parallel and Distributed Computing 66 (4), 556-565, 2006
- Nardelli E., Guido Proietti: Efficient Unbalanced Merge-Sort, Information Sciences 176 (10), 1321-1337, 2006
2003 [top]
- Anna Galluccio, Guido Proietti: Polynomial time algorithms for 2-edge-connectivity augmentation problems, Algorithmica 36, 361-374, 2003
- Nardelli E., Guido Proietti, Widmayer P.: Finding the Most Vital Node of a Shortest Path, Theoretical Computer Science 296 (1), 166-177, 2003
- Nardelli E., Guido Proietti, Widmayer P.: Swapping a Failing Edge of a Single Source Shortest Paths Tree is Good and Fast, Algorithmica 35 (1), 56-74, 2003
2001 [top]
- Flammini M., Nardelli E., Guido Proietti: ATM Layouts with Bounded Hop Count and Congestion, Distributed Computing 14, 65-73, 2001
- Manolopoulos Y., Nardelli E., Guido Proietti, Tousidou E.: A Generalized Comparison of Linear Representations of Thematic Layers, Data & Knowledge Engineering 37, 1-23, 2001
- Nardelli E., Guido Proietti, Widmayer P.: A Faster Computation of the Most Vital Edge of a Shortest Path, Information Processing Letters 79 (2), 81-85, 2001
- Nardelli E., Guido Proietti, Widmayer P.: Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures, Journal of Graph Algorithms and Applications 5, 39-57, 2001
- Guido Proietti, Faloutsos C.: Accurate Modeling of Region Data, IEEE Transactions on Knowledge and Data Engineering 13, 874-883, 2001
2000 [top]
- Nardelli E., Guido Proietti: An Efficient Spatial Access Method for Spatial Images Containing Multiple Non-Overlapping Features, Information Systems 25 (8), 553-568, 2000
- Guido Proietti, Faloutsos C.: Analysis of Range Queries and Self Spatial Join Queries on Real Region Datasets Stored Using an R-tree, IEEE Transactions on Knowledge and Data Engineering 12 (5), 751-762, 2000
1999 [top]
1998 [top]
- Carlo Gaibisso, Nardelli E., Guido Proietti: Intersection Reporting on Two Collections of Disjoint Sets, Information Sciences 114, 41-52, 1998
- Nardelli E., Guido Proietti, Widmayer P.: Finding the Detour Critical Edge of a Shortest Path between Two Nodes, Information Processing Letters 67 (1), 51-54, 1998
1997 [top]
- Nardelli E., Guido Proietti: Time and Space Efficient Secondary Memory Representation of Quadtrees, Information Systems 22 (1), 25-37, 1997
1996 [top]
- Manolopoulos Y., Nardelli E., Guido Proietti, Vassilakopoulos M.: On the Creation of Quadtrees by Using a Branching Process, Image Vision and Computing, Image and Vision Computing 14, 159-164, 1996
- Guido Proietti: The MOF+-tree: A Space Efficient Representation of Images Containing Multiple Overlapping Features, Journal of Computing and Information 2, 42-56, 1996
1994 [top]
- Nardelli E., Guido Proietti: Efficient Secondary Memory Processing of Window Queries on Spatial Data, Information Sciences 80, 1-17, 1994
- Nardelli E., Guido Proietti: An Optimal Resolution Sensitive Pyramid Representation for Hierarchical Memory Models, Journal of Computing and Information 1, 385-402, 1994
|
