Finding Best Swap Edges Minimizing the Routing Cost of a Spanning TreeBILO, Davide; GUALA, Luciano; PROIETTI, Guido et al.Algorithmica. 2014, Vol 68, Num 2, pp 337-357, issn 0178-4617, 21 p.Article

Nearly linear time minimum spanning tree maintenance for transient node failuresNARDELLI, Enrico; PROIETTI, Guido; WIDMAYER, Peter et al.Algorithmica. 2004, Vol 40, Num 2, pp 119-132, issn 0178-4617, 14 p.Article

Augmenting the edge-connectivity of a spider treeBILO, Davide; PROIETTI, Guido.Lecture notes in computer science. 2004, pp 159-171, issn 0302-9743, isbn 3-540-24131-0, 13 p.Conference Paper

Swapping a failing edge of a single source shortest paths tree is good and fastNARDELLI, Enrico; PROIETTI, Guido; WIDMAYER, Peter et al.Algorithmica. 2003, Vol 35, Num 1, pp 56-74, issn 0178-4617, 19 p.Article

A faster computation of the most vital edge of a shortest pathNARDELLI, Enrico; PROIETTI, Guido; WIDMAYER, Peter et al.Information processing letters. 2001, Vol 79, Num 2, pp 81-85, issn 0020-0190Article

Dynamic maintenance versus swapping: An experimental study on shortest paths treesPROIETTI, Guido.Lecture notes in computer science. 2001, pp 207-217, issn 0302-9743, isbn 3-540-42512-8Conference Paper

Polynomial time algorithms for edge-connectivity augmentation of Hamiltonian pathsGALLUCCIO, Anna; PROIETTI, Guido.Lecture notes in computer science. 2001, pp 345-354, issn 0302-9743, isbn 3-540-42985-9Conference Paper

Finding the most vital node of a shortest pathNARDELLI, Enrico; PROIETTI, Guido; WIDMAYER, Peter et al.Lecture notes in computer science. 2001, pp 278-287, issn 0302-9743, isbn 3-540-42494-6Conference Paper

Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria ProblemBILO, Davide; GUALA, Luciano; PROIETTI, Guido et al.Lecture notes in computer science. 2006, pp 19-30, issn 0302-9743, isbn 3-540-48822-7, 12 p.Conference Paper

Finding the most vital node of a shortest pathNARDELLI, Enrico; PROIETTI, Guido; WIDMAYER, Peter et al.Theoretical computer science. 2003, Vol 296, Num 1, pp 167-177, issn 0304-3975, 11 p.Conference Paper

On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree ProblemBILO, Davide; GUALA, Luciano; PROIETTI, Guido et al.Lecture notes in computer science. 2006, pp 295-309, issn 0302-9743, isbn 3-540-35474-3, 1Vol, 15 p.Conference Paper

Efficient truthful mechanisms for the single-source shortest paths tree problemGUALA, Luciano; PROIETTI, Guido.Lecture notes in computer science. 2005, pp 941-951, issn 0302-9743, isbn 3-540-28700-0, 11 p.Conference Paper

Strongly polynomial-time truthful mechanisms in one shotPENNA, Paolo; PROIETTI, Guido; WIDMAYER, Peter et al.Lecture notes in computer science. 2006, pp 377-388, issn 0302-9743, isbn 3-540-68138-8, 1Vol, 12 p.Conference Paper

Edge-connectivity augmentation and network matricesCONFORTI, Michele; GALLUCCIO, Anna; PROIETTI, Guido et al.Lecture notes in computer science. 2004, pp 355-364, issn 0302-9743, isbn 3-540-24132-9, 10 p.Conference Paper

Dynamic mechanism designBILO, Davide; GUALA, Luciano; PROIETTI, Guido et al.Theoretical computer science. 2009, Vol 410, Num 17, pp 1564-1572, issn 0304-3975, 9 p.Article

Strongly polynomial-time truthful mechanisms in one shotPENNA, Paolo; PROIETTI, Guido; WIDMAYER, Peter et al.Theoretical computer science. 2009, Vol 410, Num 17, pp 1607-1615, issn 0304-3975, 9 p.Article

Dynamic mechanism designBILO, Davide; GUALA, Luciano; PROIETTI, Guido et al.Lecture notes in computer science. 2006, pp 3-15, issn 0302-9743, isbn 3-540-68138-8, 1Vol, 13 p.Conference Paper

Efficient management of transient station failures in linear radio communication networks with basesGAIBISSO, Carlo; PROIETTI, Guido; TAN, Richard B et al.Journal of parallel and distributed computing (Print). 2006, Vol 66, Num 4, pp 556-565, issn 0743-7315, 10 p.Article

On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequalityBÖCKENHAUER, Hans-Joachim; BONGARTZ, Dirk; HROMKOVIC, Juraj et al.Theoretical computer science. 2004, Vol 326, Num 1-3, pp 137-153, issn 0304-3975, 17 p.Article

On k-edge-connectivity problems with sharpened triangle inequality: Extended abstractBÖCKENHAUER, Hans-Joachim; BONGARTZ, Dirk; HROMKOVIC, Juraj et al.Lecture notes in computer science. 2003, pp 189-200, issn 0302-9743, isbn 3-540-40176-8, 12 p.Conference Paper