Guido Proietti
Guido Proietti Guido Proietti
Research Associate

Facolta' di Ingeneria, Dipartimento di Ingegneria e scienze dell'Informazione e Matematica - Universita' degli Studi dell'Aquila
Via Vetoio
67100 L'Aquila - Italy


Research groups

Selected publications
  • Bilò D., Gualà L., Leucci S., Guido Proietti: 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., Guido Proietti: 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., Guido Proietti: 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., Guido Proietti: 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., Guido Proietti: 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
  • 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
  • Conforti M., Anna Galluccio, Guido Proietti: 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
  • Conforti M., Anna Galluccio, Guido Proietti: Augmentation problems and network matrices, IASI-CNR, R. 583, 2003
  • Carlo Gaibisso, Guido Proietti, Tan R.: Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs, in: Proceedings of the 9th Annual Int. Computing and Combinatorics Conf. (COCOON'03), Lecture Notes in Computer Science, 2697, Springer-Verlag, 404-414, 2003
  • Carlo Gaibisso, Guido Proietti, Tan R.: Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs, IASI-CNR, R. 586, 02/2003
  • Anna Galluccio, Guido Proietti: Polynomial time algorithms for 2-edge-connectivity augmentation problems, Algorithmica 36, 361-374, 2003
  • Anna Galluccio, Guido Proietti: 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
  • Carlo Gaibisso, Guido Proietti, 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, Guido Proietti: Polynomial time algorithms for 2-edge-connectivity augmentation problems, IASI-CNR, R. 556, 10/2001
  • Anna Galluccio, Guido Proietti: Polynomial-time algorithms for edge-connectivity augmentation of Hamiltonian paths, Lecture Notes in Computer Science, 2223, Springer-Verlag, 345-354, 2001
  • Carlo Gaibisso, Nardelli E., Guido Proietti: Intersection Reporting on Two Collections of Disjoint Sets, Information Sciences 114, 41-52, 1999
  • Anna Galluccio, Guido Proietti: Towards a 4/3-approximation algorithm for biconnectivity, IASI-CNR, R. 506, 06/1999
  • Carlo Gaibisso, Nardelli E., Guido Proietti: Intersection Reporting on Two Collections of Disjoint Sets, Information Sciences 114, 41-52, 1998
  • Carlo Gaibisso, Guido Proietti: 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
  • Carlo Gaibisso, Guido Proietti: Efficient insertion of approximately sorted sequences of items into a dictionary, IASI-CNR, R. 456, 6/1997
  • Carlo Gaibisso, Guido Proietti, 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, Guido Proietti, 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
  • Carlo Gaibisso, Guido Proietti, Nardelli E.: Maintaining on-line the intersection of sets under set union operations, IASI-CNR, R. 398, 12/1994
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -