Guido Proietti
Guido Proietti
Professor of Computer Science, University of L'Aquila
Verified email at univaq.it
Title
Cited by
Cited by
Year
Image indexing and retrieval based on human perceptual color clustering
Y Gong, G Proietti, C Faloutsos
Proceedings. 1998 IEEE Computer Society Conference on Computer Vision and …, 1998
1571998
Finding the most vital node of a shortest path
E Nardelli, G Proietti, P Widmayer
Theoretical computer science 296 (1), 167-177, 2003
1492003
A faster computation of the most vital edge of a shortest path
E Nardelli, G Proietti, P Widmayer
Information Processing Letters 79 (2), 81-85, 2001
1242001
Swapping a failing edge of a single source shortest paths tree is good and fast
E Nardelli, G Proietti, P Widmayer
Algorithmica 35 (1), 56-74, 2003
782003
Finding the detour-critical edge of a shortest path between two nodes
E Nardelli, G Proietti, P Widmayer
Information Processing Letters 67 (1), 51-54, 1998
741998
On the approximability of TSP on local modifications of optimally solved instances
HJ Böckenhauer, L Forlizzi, J Hromkovič, J Kneis, J Kupke, G Proietti, ...
Algorithmic Operations Research 2 (2), 83-93, 2007
642007
Reusing optimal TSP solutions for locally modified input instances
HJ Böckenhauer, L Forlizzi, J Hromkovič, J Kneis, J Kupke, G Proietti, ...
Fourth IFIP International Conference on Theoretical Computer Science-TCS …, 2006
412006
Finding all the best swaps of a minimum diameter spanning tree under transient edge failures
E Nardelli, G Proietti, P Widmayer
Graph Algorithms And Applications 2, 455-473, 2004
392004
I/O complexity for range queries on region data stored using an R-tree
G Proietti, C Faloutsos
Proceedings 15th International Conference on Data Engineering (Cat. No …, 1999
361999
Improved purely additive fault-tolerant spanners
D Bilò, F Grandoni, L Gualà, S Leucci, G Proietti
Algorithms-ESA 2015, 167-178, 2015
352015
Improved approximability and non-approximability results for graph diameter decreasing problems
D Bilò, L Gualà, G Proietti
Theoretical Computer Science 417, 12-22, 2012
352012
Finding the most vital node of a shortest path
E Nardelli, G Proietti, P Widmayer
International Computing and Combinatorics Conference, 278-287, 2001
352001
On the complexity of minimizing interference in ad-hoc and sensor networks
D Bilo, G Proietti
Theoretical Computer Science 402 (1), 43-55, 2008
342008
Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor
A Di Salvo, G Proietti
Theoretical Computer Science 383 (1), 23-33, 2007
312007
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
HJ Böckenhauer, D Bongartz, J Hromkovič, R Klasing, G Proietti, ...
International Conference on Foundations of Software Technology and …, 2002
292002
Bounded-distance network creation games
D Bilò, L Gualà, G Proietti
ACM Transactions on Economics and Computation (TEAC) 3 (3), 1-20, 2015
282015
Locality-based network creation games
D Bilò, L Gualà, S Leucci, G Proietti
ACM Transactions on Parallel Computing (TOPC) 3 (1), 1-26, 2016
262016
Fault-tolerant approximate shortest-path trees
D Bilò, L Gualà, S Leucci, G Proietti
European Symposium on Algorithms, 137-148, 2014
262014
Multiple-edge-fault-tolerant approximate shortest-path trees
D Bilò, L Gualà, S Leucci, G Proietti
arXiv preprint arXiv:1601.04169, 2016
252016
Nearly linear time minimum spanning tree maintenance for transient node failures
E Nardelli, G Proietti, P Widmayer
Algorithmica 40 (2), 119-132, 2004
252004
The system can't perform the operation now. Try again later.
Articles 1–20