Publications of Guido Proietti

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 Articles in Journals, Collections and Proceedings (or show them all):   (Items found: 74)


2014 | 2007 | 2006 | 2005 | 2004 | 2003 | 2002 | 2001 | 2000 | 1999 | 1998 | 1997 | 1996 | 1995 | 1994 | 1993

2014  [top]
  • Bilò D., Gualà L., Leucci S., Proietti G.: Fault-Tolerant Approximate Shortest-Path Trees, in the Proceedings of Proc. of the 22nd European Symposium on Algorithms (ESA 2014), Lecture Notes in Computer Science, 8737, 2014
  • Bilò D., Gualà L., Leucci S., Proietti G.: Local-knowledge Network Creation Games, in the Proceedings of Proc. of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'14),, 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'14), 2014
  • Bilò D., Gualà L., Leucci S., Proietti G.: Network Creation Games with Traceroute-Based Strategies, in the Proceedings of Proc. of the 21th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2014), Lecture Notes in Computer Science, 8576, 2014
  • Bilò D., Gualà L., Proietti G.: Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree, Algorithmica 68, 337-357, 2014
  • D'Andrea A., D'Emidio M., Frigioni D., Leucci S., Proietti G.: Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches, in the Proceedings of Proc. of the 13th International Symposium on Experimental Algorithms (SEA'14), Lecture Notes in Computer Science, 8504, 2014

2007  [top]
  • Bilò D., Derungs J., Gualà L., Proietti G., Widmayer P.: Locating Facilities on a Network to Minimize their Average Service Radius, in the Proceedings of 18th International Symposium on Algorithms and Computation (ISAAC'07), December 17-19, 2007, Sendai, Japan, Lecture Notes in Computer Science, 4835, 587-598, 2007
  • Bilò D., Forlizzi L., Gualà L., Proietti G.: Approximate Mechanisms for the Metric TSP and other Graph Traversal Problems, in the Proceedings of 3rd International Workshop on Internet & Network Economics (WINE'07), December 12-14, 2007, San Diego, USA, Lecture Notes in Computer Science, 4858, 503-514, 2007
  • Bilò D., Forlizzi L., Gualà L., Proietti G.: An Algorithm Composition Scheme Preserving Monotonicity, in the Proceedings of 26th ACM Symposium on Principles of Distributed Computing (PODC'07), ACM Press Portland, USA, 360-361, 2007
  • Bockenhauer H.J., Forlizzi L., Hromkovič J., Kneis J., Kupke J., Proietti G., 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., Proietti G.: 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., Proietti G.: Efficient Truthful Mechanisms for the Single-source Shortest Paths Tree Problem, Concurrency and Computation-Practice & Experience 19 (17), 2285-2297, 2007
  • Gualà L., Proietti G.: Exact and Approximate Truthful Mechanisms for the Shortest-Paths Tree Problem, Algorithmica 49 (3), 171-191, 2007

2006  [top]
  • Bilò D., Gualà L., Proietti G.: Dynamic Mechanism Design, in the Proceedings of 2nd International Workshop on Internet and Network Economics (WINE '06), Lecture Notes in Computer Science, 4286, Springer-Verlag Patras, Greece, 3-15, 2006
  • Bilò D., Gualà L., Proietti G.: Hardness of Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem, in the Proceedings of 3rd Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN '06), Lecture Notes in Computer Science, 4235, Springer-Verlag Chester, UK, 19-30, 2006
  • Bilò D., Gualà L., Proietti G.: On the Existence of Truthful Mechanisms for the Minimum-cost Approximate Shortest-paths Tree Problem, in the Proceedings of 13th Coll. on Structural Information and Communication Complexity (SIROCCO '06), Lecture Notes in Computer Science, 4056, Springer-Verlag Chester, UK, 295-309, 2006
  • Bilò D., Proietti G.: On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks, in the Proceedings of 2nd Int. Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS '06), Lecture Notes in Computer Science, 4240, Springer-Verlag Venezia, Italy, 13-24, 2006
  • Bockenhauer H.J., Kneis J., Kupke J., Hromkovič J., Forlizzi L., Proietti G., Widmayer P.: Reusing Optimal TSP Solutions for Locally Modified Input Instances, in the Proceedings of 4th IFIP International Conference on Theoretical Computer Science (TCS '06), 209, Springer Santiago, Chile, 251-270, 2006
  • Forlizzi L., Hromkovič J., Proietti G., Seibert S.: On the Stability of Approximation for Hamiltonian Path Problems, Algorithmic Operations Research 1 (1), 31-45, 2006
  • Carlo Gaibisso, Proietti G., 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., Proietti G.: Efficient Unbalanced Merge-Sort, Information Sciences 176 (10), 1321-1337, 2006
  • Penna P., Proietti G., Widmayer P.: Strongly Polynomial-Time Truthful Mechanisms in One Shot, in the Proceedings of 2nd International Workshop on Internet and Network Economics (WINE '06), Lecture Notes in Computer Science, 4286, Springer-Verlag Patras, Greece, 77-88, 2006
  • Proietti G., Widmayer P.: Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii, in the Proceedings of 17th Annual International Symposium on Algorithms and Computation (ISAAC '06), Lecture Notes in Computer Science, 4288, Springer-Verlag Kolcata, India, 578-587, 2006

2005  [top]
  • Bilò D., Proietti G.: Range augmentation problems in static ad-hoc wireless networks, in the Proceedings of 12th Colloquium on Structural Information and Communication Complexity (SIROCCO'05), Lecture Notes in Computer Science, 3499, 49-64, 2005
  • Gualà L., Proietti G.: A Truthful (2-2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals, in the Proceedings of 11th Annual International Conference on Computing and Combinatorics, Lecture Notes in Computer Science, 3595, 390-400, 2005
  • Gualà L., Proietti G.: Efficient Truthful Mechanisms for the Single-Source Shortest Paths Tree Problem, in the Proceedings of 11th International Euro-Par Conference, Lecture Notes in Computer Science, 3468, 941-951, 2005
  • Hromkovič J., Forlizzi L., Proietti G., Seibert S.: On the stability of approximation for Hamiltonian path problems, in the Proceedings of 31st Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2005), 22-28 Gennaio, Lecture Notes in Computer Science, 3381, 147-156, 2005
  • Proietti G., Widmayer P.: A truthful mechanism for the non-utilitarian minimum radius spanning tree problem, in the Proceedings of 17th Annual ACM Symposium on Parallel Algorithms, ISBN/ISSN: 1-58113-986-1, 195-202, 2005

2004  [top]
  • Conforti M., Anna Galluccio, Proietti G.: Edge-connectivity augmentation and network matrices, in: Graph-Theoretic Concepts in Computer Science, Hromkovic J., Nagl M., Westfechtel B. eds., Lecture Notes in Computer Science, 3353, 355-364, 2004

2003  [top]

2002  [top]
  • Böckenhauer H.J., Bongartz D., Hromkovič J., Klasing R., Proietti G., Seibert S., Unger W.: On the Hardness of Constructing Minimal Biconnected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality, in: 22nd Int. Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'02), Lecture Notes in Computer Science, 2556, Springer-Verlag, 59-70, 2002
  • Di Pasquale A., Nardelli E., Proietti G.: An Improved Upper Bound for Scalable Distributed Search Trees, in the Proceedings of Proc. 4th International Workshop on Distributed Data \& Structures (WDAS'02), Proceedings in Informatics, 11, Carleton Scientific, 2002
  • Anna Galluccio, Proietti G.: A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation, in: Proc. 13th Annual International Symposium on Algorithms and Computation (ISAAC'02), Lecture Notes in Computer Science, 2518, Springer-Verlag, 150-162, 2002

2001  [top]
  • Flammini M., Nardelli E., Proietti G.: ATM Layouts with Bounded Hop Count and Congestion, Distributed Computing 14, 65-73, 2001
  • Carlo Gaibisso, Proietti G., Tan R.: Efficient Management of Transient Station Failures in Linear Radio Communication Networks with Bases, in the Proceedings of 2nd International Workshop on Approximation and Randomized Algorithms in Communication Networks (ARACNE'01), 2001
  • Anna Galluccio, Proietti G.: Polynomial-time algorithms for edge-connectivity augmentation of Hamiltonian paths, Lecture Notes in Computer Science, 2223, Springer-Verlag, 345-354, 2001
  • Manolopoulos Y., Nardelli E., Proietti G., Tousidou E.: A Generalized Comparison of Linear Representations of Thematic Layers, Data & Knowledge Engineering 37, 1-23, 2001
  • Nardelli E., Proietti G., Widmayer P.: A Faster Computation of the Most Vital Edge of a Shortest Path, Information Processing Letters 79 (2), 81-85, 2001
  • Nardelli E., Proietti G., Widmayer P.: Finding the Most Vital Node of a Shortest Path, Lecture Notes in Computer Science, 2108, Springer-Verlag, 278-287, 2001
  • Nardelli E., Proietti G., 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
  • Proietti G., Faloutsos C.: Accurate Modeling of Region Data, IEEE Transactions on Knowledge and Data Engineering 13, 874-883, 2001

2000  [top]
  • Nardelli E., Proietti G.: An Efficient Spatial Access Method for Spatial Images Containing Multiple Non-Overlapping Features, Information Systems 25 (8), 553-568, 2000
  • Nardelli E., Proietti G.: Size Estimation of the Intersection Join Between Two Line Segment Datasets, in: Current Issues in Databases and Information Systems - Advances in Databases and Information Systems (ADBIS 2000), Stuller J., Pokorn{ý} J., Thalheim B., Masunaga Y. eds., Lecture Notes in Computer Science, 1884, Springer-Verlag, 229-238, 2000
  • Nardelli E., Proietti G., Widmayer P.: Maintaining a Minimimum Spanning Tree Under Transient Node Failures, in: Algorithms - Annual European Symposium (ESA 2000), Peterson M. ed., Lecture Notes in Computer Science, 1879, Springer-Verlag, 346-355, 2000
  • Proietti G.: Dynamic Maintenance Versus Swapping: an Experimental Study on Shortest Paths Trees, in: Algorithm Engineering (WAE 2000), Näher S., Wagner D. eds., Lecture Notes in Computer Science, 1982, Springer-Verlag, 207-217, 2000
  • Proietti G., 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]
  • Carlo Gaibisso, Nardelli E., Proietti G.: Intersection Reporting on Two Collections of Disjoint Sets, Information Sciences 114, 41-52, 1999
  • Nardelli E., Proietti G.: S$^*$-tree: an Improved S$^+$-tree for Colored Images, in the Proceedings of 3rd East European Conference on Advances in Databases and Information Systems {(ADBIS'99)}, Eder J., Rozman I., Welzer T. eds., Lecture Notes in Computer Science, 1691, Springer-Verlag Maribor, Slovenia, 156-167, 1999
  • Nardelli E., Proietti G., Widmayer P.: How to Swap a Failing Edge of a Single Source Shortest Paths Tree, in the Proceedings of 5th International Conference on Computing and Combinatorics {(COCOON'99)}, Asano T., Imai H., Lee D.T., Nakano S., Tokuyama T. eds., Lecture Notes in Computer Science, 1627, Springer-Verlag Tokyo, Japan, 144-153, 1999

1998  [top]
  • Carlo Gaibisso, Nardelli E., Proietti G.: Intersection Reporting on Two Collections of Disjoint Sets, Information Sciences 114, 41-52, 1998
  • Nardelli E., Proietti G., Widmayer P.: Finding the Detour Critical Edge of a Shortest Path between Two Nodes, Information Processing Letters 67 (1), 51-54, 1998
  • Nardelli E., Proietti G., Widmayer P.: Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures, in the Proceedings of 6th Annual European Symposium on Algorithms {(ESA '98)}, Bilardi G., Italiano G.F., Pietracaprina A., Pucci G. eds., Lecture Notes in Computer Science, 1461, Springer-Verlag Venezia, Italia, 55-66, 1998

1997  [top]
  • Flammini M., Nardelli E., Proietti G.: ATM Layouts with Bounded Hop Count and Congestion, in the Proceedings of 11th International Workshop on Distributed Algorithms {(WDAG'97)}, Mavronicolas M., Tsigas P. eds., Lecture Notes in Computer Science, 1320, Springer-Verlag Saarbrücken, Germany, 52 - 65, 1997
  • Carlo Gaibisso, Proietti G.: Efficient Insertion of Approximately Sorted Sequences of Items into a Dictionary, in: Proceedings of SOFSEM'97: Theory and Practice of Informatics, Milovy, Repubblica Ceca, 22-29 novembre 1997, Jeffrey K.G., Plášil F. eds., Lecture Notes in Computer Science, 1338, Springer-Verlag, 399-406, 1997
  • Nardelli E., Proietti G.: Time and Space Efficient Secondary Memory Representation of Quadtrees, Information Systems 22 (1), 25-37, 1997

1996  [top]
  • Carlo Gaibisso, Proietti G., Nardelli E.: An Output Sensitive Solution to the Set Union and Intersection Problem, in the Proceedings of Proceedings of "SOFSEM '96: Theory and Practice of Informatics", Milovy, Repubblica Ceca, 23-30 novembre 1996., Kral J., Jeffery K., Bartosek M. eds., Lecture Notes in Computer Science, 1996
  • Carlo Gaibisso, Proietti G., Nardelli E.: Incremental Constraints Maintenance in Concurrent Logic Programming, in the Proceedings of Proceedings of ISCIS XI, 11-th Iternational Symposium on Computer and Information Sciences, Antalya, Turchia, 6-8 novembre 1996, 1996
  • Manolopoulos Y., Nardelli E., Papadopoulos A., Proietti G.: QR-tree: a Hybrid Spatial Data Structure, in the Proceedings of Int. Conference on GIS in Urban, Environmental and Regional Planning, 247-259, 1996
  • Manolopoulos Y., Nardelli E., Proietti G., Vassilakopoulos M.: On the Creation of Quadtrees by Using a Branching Process, Image Vision and Computing, Image and Vision Computing 14, 159-164, 1996
  • Proietti G.: The MOF+-tree: A Space Efficient Representation of Images Containing Multiple Overlapping Features, Journal of Computing and Information 2, 42-56, 1996

1995  [top]

1994  [top]
  • Fossa M., Nardelli E., Proietti G.: A Multistage Approach to Complex Document Interpretation, in the Proceedings of International Symposium in Informatics Applications, 1994
  • Nardelli E., Proietti G.: Efficient Secondary Memory Processing of Window Queries on Spatial Data, Information Sciences 80, 1-17, 1994
  • Nardelli E., Proietti G.: An Optimal Resolution Sensitive Pyramid Representation for Hierarchical Memory Models, Journal of Computing and Information 1, 385-402, 1994
  • Nardelli E., Proietti G.: A Hybrid Pointerless Representation of Quadtrees for Efficient Processing of Window Queries, in the Proceedings of Proc. of the International Workshop on Advanced Research in Geographic Information Systems, Nievergelt J., others eds., Springer-Verlag Ascona, Svizzera, 259-269, 1994
  • Nardelli E., Proietti G.: An Accurate Model for Quadtrees Representing Noiseless Images of Spatial Data, in the Proceedings of 1st IEEE International Conference on Image Processing, 610-614, 1994
  • Nardelli E., Proietti G.: Managing Overlapping Features in Spatial Database Applications, in the Proceedings of International Computer Symposium, 1297-1302, 1994

1993  [top]
  • Fossa M., Nardelli E., Proietti G.: Raster to Object Conversion Aided by Knowledge Based Image Processing, in the Proceedings of 2nd IEEE International Conference on Document Analysis and Recognition, 1993
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -