Journals

1.     New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem

D. Bilò, L. Gualà, S. Leucci, G. Proietti, and M. Rossi

Theoretical Computer Science, 932: 102-115 (2022).

(A preliminary version of this paper got the best student paper award at the 28th International Colloquium on Structural Information and Communication Complexity (SIROCCO’21), June 28 - July 1, Wrocław, Poland, 167-184, 2021.)

2.     Cutting Bamboo Down to Size

D. Bilò, L. Gualà, S. Leucci, G. Proietti, and G. Scornavacca

Theoretical Computer Science, 909: 54-67 (2022).

(A preliminary version of this paper got the best paper award at the 10th International Conference on Fun with Algorithms (FUN'20), May 30-June 3, 2022, Favignana, Italy. Vol. 157 of LIPIcs Series, Schloss Dagstuhl, 5:1-5:18, 2020.)

3.     Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees

D. Bilò, L. Gualà, S. Leucci, and G. Proietti

Algorithmica, 84(1), 37-59 (2022).

(A preliminary version of this paper was presented at the 33rd International Symposium on Theoretical Aspects of Computer Science (STACS’16), February 17-20, 2016, Orléans, France. Vol. 47 of LIPIcs Series, Schloss Dagstuhl, 18:1-18:14, 2016.)

4.     Network Creation Games with Traceroute-Based Strategies

D. Bilò, L. Gualà, S. Leucci, and G. Proietti

Algorithms 14(2): 35 (2021)

(A preliminary version of this paper was presented at the 21th International Colloquium on Structural Information and Communication Complexity (SIROCCO’14), July 23-25, 2014, Hida Takayama, Japan.

Vol. 8576 of Lecture Notes in Computer Science, Springer, 210-223, 2014.)

5.     Hardness of an Asymmetric 2-Player Stackelberg Network Pricing Game

D. Bilò, L. Gualà, and G. Proietti, Algorithms, 14(1):8 (2021).

6.     Tracking Routes in Communication Networks

D. Bilò, L. Gualà, S. Leucci, and G. Proietti

Theoretical Computer Science, 844:1-15 (2020).

(A preliminary version of this paper was presented at the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO’19), 1-4 July 2019, L’Aquila, Italy.

Vol. 11639 of Lecture Notes in Computer Science, Springer, 81-93, 2019.)

7.     An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner

D. Bilò, F. Colella, L. Gualà, S. Leucci, and G. Proietti

Algorithmica, 82(2), 279-299 (2020).

(Special Journal Issue on selected papers from the 28th International Symposium on Algorithms and Computation (ISAAC’17) 9-12 December 2017, Phuket, Thailand.

Vol. 92 of LIPIcs Series, Schloss Dagstuhl, 14:1-14:13, 2017.)

8.     Hardness, Approximability, and Fixed-parameter Tractability of the Clustered Shortest-path Tree Problem

M. D’Emidio, L. Forlizzi, D. Frigioni, S. Leucci, and G. Proietti

Journal of Combinatorial Optimization, 38(1):165-184 (2019).

9.     Fault-Tolerant Approximate Shortest-Path Trees

D. Bilò, L. Gualà, S. Leucci, and G. Proietti

Algorithmica, 80:3437-3460 (2018).

(A preliminary version of this paper was presented at the 22nd European Symposium on Algorithms (ESA’14), September 8-10, 2014, Wroclaw, Poland.

Vol. 8737 of Lecture Notes in Computer Science, Springer, 137-148, 2014.)

10.  Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs

D. Bilò, L. Gualà, S. Leucci, and G. Proietti

Theoretical Computer Science, 652:86–101 (2016).

(A preliminary version of this paper was presented at the 20th Colloquium on Structural Information and Communication Complexity (SIROCCO'13), July 1-3, 2013, Ischia, Italy. Vol. 8179 of Lecture Notes in Computer Science, Springer, 322-333, 2013.)

11.  Locality-Based Network Creation Games

D. Bilò, L. Gualà, S. Leucci, and G. Proietti

ACM Transactions on Parallel Computing, 3(1), Article 6, (2016).

(Special Journal Issue on selected papers from the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'14),  June 23-25, 2014, Prague, Czech Republic.

ACM Press, 277-286.)

12.  Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments

A. D’Andrea, M. D’Emidio, D. Frigioni, S. Leucci, and G. Proietti

ACM Journal on Experimental Algorithmics, 20(1), Article 5, (2015).

13.  A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree

D. Bilò, L. Gualà, and G. Proietti

Algorithmica, 73(3):547-570 (2015).

(Special Journal Issue on selected papers from the 21st European Symposium on Algorithms (ESA'13), September 2-4, 2013, Sophia Antipolis, France.

Vol. 8125 of Lecture Notes in Computer Science, Springer, 157-168.)

14.  Bounded-Distance Network Creation Games

D. Bilò, L. Gualà, and G. Proietti

ACM Transactions on Economics and Computation, 3(3), Article 16, (2015).

(A preliminary version of this paper was presented at the 8th International Workshop on Internet & Network Economics (WINE'12), December 9-12, 2012, Liverpool, UK. Vol. 7695 of Lecture Notes in Computer Science, Springer, 72–85.)

15.  The Max-Distance Network Creation Game on General Host Graphs

D. Bilò, L. Gualà, S. Leucci, and G. Proietti

Theoretical Computer Science, 573:43-53 (2015).

(A preliminary version of this paper was presented at the 8th International Workshop on Internet & Network Economics (WINE'12), December 9-12, 2012, Liverpool, UK.

Vol. 7695 of Lecture Notes in Computer Science, Springer, 393–406.)

16.  Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game

D. Bilò, L. Gualà, S. Leucci, and G. Proietti
Theoretical Computer Science, 562:643-657 (2015).

(A preliminary version of this paper was presented at the 6th International Workshop on Internet & Network Economics (WINE'10), December 13-17, 2010, Stanford, California, USA. Vol. 6484 of Lecture Notes in Computer Science, Springer, 75-86.)

17.  Network Verification via Routing Table Queries

E. Bampas, D. Bilò, G. Drovandi, L. Gualà, R. Klasing, and G. Proietti

Journal of Computer and System Sciences, 81(1):234-248 (2015).

(A preliminary version of this paper was presented at the 18th Colloquium on Structural Information and Communication Complexity (SIROCCO'11), June 26-29, 2011, Gdansk, Polonia.
Vol. 6796 of Lecture Notes in Computer Science, Springer, 270-281.)

18.  Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree

D. Bilò, L. Gualà, and G. Proietti

Algorithmica, 68(2):337-357 (2014).

(A preliminary version of this paper was presented at the 35th International Symposium on Mathematical Foundations of Computer Science (MFCS’10), August 23-27, 2010, Brno, Czech Republic. Vol. 6281 of Lecture Notes in Computer Science, Springer, 138-149.)

19.  Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems

D. Bilò, L. Gualà, and G. Proietti
Theoretical Computer Science, 417:12-22 (2012)

(Special Journal Issue on selected papers from the 35th International Symposium on Mathematical Foundations of Computer Science (MFCS’10), August 23-27, 2010, Brno, Czech Republic.

Vol. 6281 of Lecture Notes in Computer Science, Springer, 150-161.)

20.  Approximating the Metric TSP in Linear Time
D. Bilò, L. Forlizzi, and G. Proietti
Theory of Computing Systems, 49(3):615-631 (2011).

(A preliminary version of this paper was presented at the 34th Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG'08), 30 June-2 July, 2008, Durham University, UK. Vol. 5344 of Lecture Notes in Computer Science, Springer, 43-54.)

21.  Approximate Mechanisms for the Metric TSP and other Graph Traversal Problems
D. Bilò, L. Forlizzi, L. Gualà, and G. Proietti
Internet Mathematics, 5(4):411–435 (2010).

(Special Journal Issue on selected papers from the 3rd International Workshop on Internet & Network Economics (WINE'07), December 12-14, 2007, San Diego, USA. Vol. 4858 of Lecture Notes in Computer Science, Springer, 503-514.)

22.  Dynamic Mechanism Design
D. Bilò, L. Gualà, and G. Proietti
Theoretical Computer Science, 410(17):1564-1572 (2009).
(Special Journal Issue on selected papers from the 2nd International Workshop on Internet and Network Economics (WINE'06), December 15-17, 2006, Patras, Greece. Vol. 4286 of Lecture Notes in Computer Science, Springer, 3-15.)
 

23.  Strongly Polynomial-Time Truthful Mechanisms in One Shot
P. Penna, G. Proietti, and P. Widmayer
Theoretical Computer Science, 410(17):1607-1615 (2009).
(Special Journal Issue on selected papers from the 2nd International Workshop on Internet and Network Economics (WINE'06), December 15-17, 2006, Patras, Greece. Vol. 4286 of Lecture Notes in Computer Science, Springer-Verlag, 77-88.)

24.  On k-Connectivity Problems with Sharpened Triangle Inequality
H.J. Böckenhauer, D. Bongartz, J. Hromkovic, R. Klasing, G. Proietti, S. Seibert, and W. Unger
Journal of Discrete Algorithms, 6(4):605-617 (2008).
(A preliminary version of this paper was presented at the 5th Italian Conference on Algorithms and Complexity (CIAC'03), May 28-30, 2003 Rome, Italy. Vol. 2653 of Lecture Notes in Computer Science, Springer-Verlag, 189--200.)
 

25.  On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks
D. Bilò and G. Proietti
Theoretical Computer Science, 402(1):43-55 (2008).
(Special Journal Issue on selected papers from the 2nd International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS'06), July 15, 2006, Venezia, Italy. Vol. 4240 of Lecture Notes in Computer Science, Springer-Verlag, 13-24.)
 

26.  Exact and Approximate Truthful Mechanisms for the Shortest-Paths Tree Problem
L. Gualà and G. Proietti
Algorithmica, 49(3):171-191 (2007).
 

27.  On the Approximability of TSP on Local Modifications of Optimally Solved Instances
H.-J. Böckenhauer, L. Forlizzi, J. Hromkovic, J. Kneis, J. Kupke, G. Proietti, and P. Widmayer.
Algorithmic Operations Research, 2(2):83-93 (2007).
 

28.  Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor
A. Di Salvo and G. Proietti
Theoretical Computer Science, 383(1):23-33 (2007).
(Special Journal Issue on selected papers from the 11th Coll. on Structural Information and Communication Complexity (SIROCCO'04), June 21-23, 2004, Smolenice Castle, Slovakia. Vol. 3104 of Lecture Notes in Computer Science, Springer-Verlag, 99-110.)
 

29.  Efficient Truthful Mechanisms for the Single-source Shortest Paths Tree Problem
L. Gualà and G. Proietti
Concurrency and Computation: Practice and Experience, 19(17):2285-2297 (2007).
(Special Journal Issue on selected papers from the 11th International Euro-Par Conference (EURO-PAR'05), August 30-September 2, 2005, Lisboa, Portugal. Vol. 3648 of Lecture Notes in Computer Science, Springer-Verlag, 941-951.)
 

30.  Efficient Management of Transient Station Failures in Linear Radio Communication Networks with Bases
C. Gaibisso, G. Proietti, and R. Tan
Journal of Parallel and Distributed Computing, 66(4):556-565 (2006).
(A preliminary version of this paper was presented at the 2nd International Workshop on Approximation and Randomized Algorithms in Communication Networks (ARACNE'01), August 27th, 2001, BRICS, University of Aarhus, Denmark. Vol. 12 of Proceedings in Informatics, Carleton Scientific, 37-54.)
 

31.  On the Stability of Approximation for Hamiltonian Path Problems
L. Forlizzi, J. Hromkovic, G. Proietti, and S. Seibert
Algorithmic Operations Research, 1(1):31-45 (2006).
(A preliminary version of this paper was presented at the 31st Annual Conf. on Current Trends in Theory and Practice of Informatics (SOFSEM'05), January 22-28, 2005, Liptovsky Jan, Slovak Republic. Vol. 3381 of Lecture Notes in Computer Science, Springer-Verlag, 147-156.)
 

32.  Efficient Unbalanced Merge-Sort
E. Nardelli and G. Proietti
Information Sciences, 176(10):1321-1337 (2006).
 

33.  On the Hardness of Constructing Minimal Biconnected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality
H.J. Böckenhauer, D. Bongartz, J. Hromkovic, R. Klasing, G. Proietti, S. Seibert, and W. Unger
Theoretical Computer Science, 326(1-3):137-153 (2004).
(A preliminary version of this paper was presented at the 22nd Foundations of Software Technology and Theoretical Computer Science (FSTTCS'02), December 12-14, 2002, Kanpur, India. Vol. 2556 of Lecture Notes in Computer Science, Springer, 59-70.)
 

34.  Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures
E. Nardelli, G. Proietti, and P. Widmayer
Algorithmica, 40(2):119-132 (2004).
 

35.  Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems
A. Galluccio and G. Proietti
Algorithmica, 36(4):361-374 (2003).
 

36.  Swapping a Failing Edge of a Single Source Shortest Paths Tree is Good and Fast
E. Nardelli, G. Proietti, and P. Widmayer
Algorithmica, 35(1):56-74 (2003).
 

37.  Finding the Most Vital Node of a Shortest Path
E. Nardelli, G. Proietti, and P. Widmayer
Theoretical Computer Science, 296(1):167-177 (2003).
(Special Journal Issue on selected papers from the 7th Annual Int. Computing and Combinatorics Conf. (COCOON'01),
Guilin, China, August 20-23, 2001. Vol. 2108 of Lecture Notes in Computer Science, Springer, 278-287.)
 

38.  Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures
E. Nardelli, G. Proietti, and P. Widmayer
Journal of Graph Algorithms and Applications, 5(5):39-57 (2001).
(A preliminary version of this paper was presented at the 6th European Symp. on Algorithms (ESA'98), Venice, Italy, 24-26 September 1998. Vol. 1461 of Lecture Notes in Computer Science, Springer, 55-66.)
 

39.  Efficient ATM Layouts with Bounded Hop Count and Congestion
M. Flammini, E. Nardelli, and G. Proietti
Distributed Computing, 14(2):65-73 (2001).
(A preliminary version of this paper was presented at the 8th Workshop on Distributed Algorithms (WDAG'97), Saarbrucken, Germany, 1997. Vol. 1320 of Lecture Notes in Computer Science, Springer, 52-65.)

40.  A Faster Computation of the Most Vital Edge of a Shortest Path
E. Nardelli, G. Proietti, and P. Widmayer
Information Processing Letters, 79(2):81-85 (2001).
 

41.  Accurate Modeling of Region Data
G. Proietti and C. Faloutos
IEEE Transactions on Knowledge and Data Engineering, 13(6):874-883 (2001).
 

42.  A Generalized Comparison of Linear Representations of Thematic Layers
Y. Manolopoulos, E. Nardelli, G. Proietti, and E. Tousidou
Data and Knowledge Engineering, 37(1):1-23 (2001).
 

43.  An Efficient Spatial Access Method for Spatial Images Containing Multiple Non-Overlapping Features
E. Nardelli and G. Proietti
Information Systems, 25(8):553-558 (2000).
 

44.  Analysis of Range Queries and Self Spatial Join Queries on Real Region Datasets Stored Using an R-tree
G. Proietti and C. Faloutsos
IEEE Transactions on Knowledge and Data Engineering, 12(5):751-762 (2000).
 

45.  An Optimal Algorithm for Decomposing a Window into its Maximal Quadtree Blocks
G. Proietti
Acta Informatica, 36(4):257-266 (1999).
 

46.  Probabilistic Models for Images and Quadtrees: Differences and Equivalences
E. Nardelli and G. Proietti
Image and Vision Computing, 17:659-665 (1999).
 

47.  Intersection Reporting on Two Collection of Disjoint Sets
C. Gaibisso, E. Nardelli, and G. Proietti
Information Sciences, 114:41-52 (1999).
 

48.  Finding the Detour-Critical Edge of a Shortest Path between Two Nodes
E. Nardelli, G. Proietti, and P. Widmayer
Information Processing Letters, 67(1):51-54 (1998).
 

49.  MOF-tree: a Spatial Access Method to Manipulate Multiple Overlapping Features
Y. Manolopoulos, E. Nardelli, A. Papadopoulos, and G. Proietti
Information Systems, 22(8):465-481 (1997).
 

50.  Time and Space Efficient Secondary Memory Representation of Quadtrees
E. Nardelli and G. Proietti
Information Systems, 22(1):26-37 (1997).
 

51.  The MOF+-tree: a Space Efficient Representation of Images Containing Multiple Overlapping Features
G. Proietti
Journal of Computing and Information, 2:42-56 (1996).
 

52.  On the Creation of Quadtrees by Using a Branching Process
Y. Manolopoulos, E. Nardelli, G. Proietti, and M. Vassilakopoulos
Image and Vision Computing, 14:159-164 (1996).
 

53.  Efficient Secondary Memory Processing of Window Queries on Spatial Data
E. Nardelli and G. Proietti
Information Sciences, 84:67-83 (1995).

54.  An Optimal Resolution Sensitive Pyramid Representation for Hierarchical Memory Models
E. Nardelli and G. Proietti
Journal of Computing ad Information, 1:385-402 (1994).

Conferences

1.     Temporal Queries for Dynamic Temporal Forests. 

D. Bilò, L. Gualà, S. Leucci, G. Proietti, and A. Straziota

35th International Symposium on Algorithms and Computation, (ISAAC’24), December 8-11, 2024, Sydney, Australia.

Vol. 322 of LIPIcs Series, Schloss Dagstuhl, 11:1-11:16, 2024.

2.     Optimizing Nozzle Travel Time in Proton Therapy

M. Spezialetti, R. Di Filippo, R. Gimenez De Lorenzo, G.L. Gravina, G. Placidi, G. Proietti, F. Rossi, S. Smriglio, J.M.R.S. Tavares, F. Vittorini, and F. Mignosi

35th IEEE International Symposium on Computer-Based Medical Systems (CBMS’22), July 21-23, 2022, Shenzen, China.

IEEE Computer Society, 441-446, 2022.

3.     Single-source Shortest p-disjoint Paths: Fast Computation and Sparse Preservers

D. Bilò, G. D'Angelo, L. Gualà, S. Leucci, G. Proietti, and M. Rossi

39th International Symposium on Theoretical Aspects of Computer Science (STACS’22), March 15-18, 2022, Marseille, France.

Vol. 219 of LIPIcs Series, Schloss Dagstuhl, 12:1-12:21, 2022.

4.     Dual-mode Greedy Algorithms Can Save Energy

B. Geissmann, S. Leucci, C.-H. Liu, P. Penna and G. Proietti

30th International Symposium on Algorithms and Computation (ISAAC'19), December 8-11, 2019, Shanghai, China.

Vol. 149 of LIPIcs Series, Schloss Dagstuhl, 64:1-64:18, 2019.

5.     On the PSPACE-completeness of Peg Duotaire and other Peg-jumping Games

D. Bilò, L. Gualà, S. Leucci, G. Proietti, and M. Rossi

9th International Conference on Fun with Algorithms (FUN'18), June 13-15, 2018, La Maddalena, Italy.

Vol. 100 of LIPIcs Series, Schloss Dagstuhl, 8:1-8:15, 2018.

6.     Efficient Oracles and Routing Schemes for Replacement Paths

D. Bilò, K. Choudhary, L. Gualà, S. Leucci, M. Parter, and G. Proietti

35th International Symposium on Theoretical Aspects of Computer Science (STACS’18), February 28-March 3, 2018, Caen, France.

Vol. 96 of LIPIcs Series, Schloss Dagstuhl, 13:1-13:15, 2018.

7.     Simple and Practically Efficient Fault-Tolerant 2-Hop Cover Labelings

F. Colella, M. D'Emidio, and G. Proietti

18th Italian Conference on Theoretical Computer Science (ICTCS’17) 26-29 September 2017, Naples, Italy.

CEUR Workshop Proceedings 1949, 51-62, 2017.

8.     Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges

D. Bilò, F. Colella, L. Gualà, S. Leucci, and G. Proietti

24th International Colloquium on Structural Information and Communication Complexity (SIROCCO’17), 19-22 June 2017, Porquerolles, France

Vol. 10641 of Lecture Notes in Computer Science, Springer, 303-317, 2017.

9.     Rational Fair Consensus in the GOSSIP Model

A. Clementi, L. Gualà, G. Proietti, and G. Scornavacca

31st IEEE International Parallel & Distributed Processing Symposium (IPDPS’17), May 29-June 2, 2017, Orlando, Florida, USA.

IEEE Computer Society, 163-171, 2017.

10.  On the Clustered Shortest-Path Tree Problem (Short Communication)

M. D’Emidio, L. Forlizzi, D. Frigioni, S. Leucci, and G. Proietti

17th Italian Conference on Theoretical Computer Science (ICTCS'16), September 7-9, 2016, Lecce, Italy.

Vol. 1720 of CEUR Workshop Proceedings, 263--268, 2016.

11.  Compact and Fast Sensitivity Oracles for Single-Source Distances

D. Bilò, L. Gualà, S. Leucci, and G. Proietti

24th European Symposium on Algorithms (ESA’16), August 22-24, 2016, Aarhus, Denmark.

Vol. 57 of LIPIcs Series, Schloss Dagstuhl, 13:1-13:14, 2016.

12.  Sequence Hypergraphs

K. Bohmova, J. Chalopin, M. Mihalák, G. Proietti and P. Widmayer

42nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG’16), June 22-24, 2016, İstanbul, Turkey.

Vol. 9941 of Lecture Notes in Computer Science, Springer, 1-13, 2016.

13.  Path-Fault-Tolerant Approximate Shortest-Path Trees

A. D’Andrea, M. D’Emidio, D. Frigioni, S. Leucci, and G. Proietti

22nd International Colloquium on Structural Information and Communication Complexity (SIROCCO’15), July 15-17, 2015, Mont Serrat, Spain.

Vol. 9439 of Lecture Notes in Computer Science, Springer, 224-238, 2015.

14.  A Faster Computation of All the Best Swap Edges of a Tree Spanner

D. Bilò, F. Colella, L. Gualà, S. Leucci, and G. Proietti

22nd International Colloquium on Structural Information and Communication Complexity (SIROCCO’15), July 15-17, 2015, Mont Serrat, Spain.

Vol. 9439 of Lecture Notes in Computer Science, Springer, 239-253, 2015.

15.  Improved Purely Additive Fault-Tolerant Spanners

D. Bilò, F. Grandoni, L. Gualà, S. Leucci, and G. Proietti

23rd European Symposium on Algorithms (ESA’15), September 14-16, 2015, Patras, Greece.

Vol. 9294 of Lecture Notes in Computer Science, Springer, 167-178, 2015.

16.  Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches

A. D’Andrea, M. D’Emidio, D. Frigioni, S. Leucci, and G. Proietti

13th International Symposium on Experimental Algorithms (SEA'14), June 29-July 1, 2014, Copenhagen, Denmark.

Vol. 8504 of Lecture Notes in Computer Science, Springer, 283-294, 2014.

17.  Polygon-Constrained Motion Planning Problems

D. Bilò, Y. Disser, L. Gualà, M. Mihal’ak, G. Proietti, and P. Widmayer, 

9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS'13), September 5-6, 2013, Sophia Antipolis, France.

Vol. 8243 of Lecture Notes in Computer Science, Springer, 67-82, 2013.

18.  Dynamically Maintaining Shortest Path Trees Under Batches of Updates

A. D’Andrea, M. D’Emidio, D. Frigioni, S. Leucci, and G. Proietti

20th Colloquium on Structural Information and Communication Complexity (SIROCCO'13), July 1-3, 2013, Ischia, Italy.

Vol. 8179 of Lecture Notes in Computer Science, Springer, 286-297, 2013.

19.  Reoptimizing the Strengthened Metric TSP on Multiple Edge Weight Modifications

A. D'Andrea and G. Proietti
11th International Symposium on Experimental Algorithms (SEA'12), June 7-9, 2012, Bordeaux, France.

Vol. 7276 of Lecture Notes in Computer Science, Springer, 111-122.

20.  Stability of Networks in Stretchable Graphs

D. Bilò, M. Gatto, L. Gualà, G. Proietti, and P. Widmayer
16th Colloquium on Structural Information and Communication Complexity (SIROCCO'09), May 25-27, 2009, Piran, Slovenia.
Vol. 5869 of Lecture Notes in Computer Science, Springer, 100-112.

21.  Computational Aspects of a 2-player Stackelberg Shortest Paths Tree Game
D. Bilò, L. Gualà, G. Proietti, and P. Widmayer
4th International Workshop on Internet & Network Economics (WINE'08), December 17-20, 2008, Shanghai, China.
Vol. 5385 of Lecture Notes in Computer Science, Springer, 251-262.
   

22.  Locating Facilities on a Network to Minimize their Average Service Radius
D. Bilò, J. Derungs, L. Gualà, G. Proietti, and P. Widmayer
18th International Symposium on Algorithms and Computation (ISAAC'07), December 17-19, 2007, Sendai, Japan.
Vol. 4835 of Lecture Notes in Computer Science, Springer, 587-598.
 

23.  An Algorithm Composition Scheme Preserving Monotonicity
D. Bilò, L. Forlizzi, L. Gualà, and G. Proietti
26th ACM Symposium on Principles of Distributed Computing (PODC'07), August 12-15, 2007, Portland, USA.
ACM Press, 360-361.
 

24.  Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii
G. Proietti and P. Widmayer
17th Annual International Symposium on Algorithms and Computation (ISAAC'06), December 18-20, 2006, Kolkata, India.
Vol. 4288 of Lecture Notes in Computer Science, Springer-Verlag, 578-587.
 

25.  Reusing Optimal TSP Solutions for Locally Modified Input Instances
H.J. Böckenhauer, J. Kneis, J. Kupke, J. Hromkovic, L. Forlizzi, G. Proietti, and P. Widmayer
4th IFIP International Conference on Theoretical Computer Science (TCS'06), August 20-25, 2006, Santiago, Chile.
Vol. 209 of IFIP International Federation for Information Processing, Springer, 251-270.
 

26.  Hardness of Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem
D. Bilò, L. Gualà, and G. Proietti
3rd Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN'06), July 2, 2006, Chester, UK.
Vol. 4235 of Lecture Notes in Computer Science, Springer-Verlag, 19-30.
 

27.  On the Existence of Truthful Mechanisms for the Minimum-cost Approximate Shortest-paths Tree Problem
D. Bilò, L. Gualà, and G. Proietti
13th Colloquium on Structural Information and Communication Complexity (SIROCCO'06), July 3-5, 2006, Chester, UK.
Vol. 4056 of Lecture Notes in Computer Science, Springer-Verlag, 295-309.
 

28.  A Truthful Mechanism for the Non-utilitarian Minimum Radius Spanning Tree Problem
G. Proietti and P. Widmayer
17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'05), July 17-20, 2005, Las Vegas, NV, USA.
ACM Press, 195-202.
 

29.  A Truthful (2-2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals
L. Gualà and G. Proietti
11th Int. Computing and Combinatorics Conference (COCOON'05), August 16-19, 2005, Kunming, China.
Vol. 3595 of Lecture Notes in Computer Science, Springer-Verlag, 390-400.
 

30.  Range Augmentation Problems in Static Ad-hoc Wireless Networks
D. Bilò and G. Proietti
12th Coll. on Structural Information and Communication Complexity (SIROCCO'05), May 24-26, 2005, Mont-St-Michel, France.
Vol. 3499 of Lecture Notes in Computer Science, Springer-Verlag, 49-64.
 

31.  Augmenting the Edge-connectivity of a Spider Tree
D. Bilò and G. Proietti
15th Annual International Symposium on Algorithms and Computation (ISAAC'04), December 20-22, 2004, Hong Kong.
Vol. 3341 of Lecture Notes in Computer Science, Springer-Verlag, 157-169.
 

32.  A 5/4-approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path
D. Bilò and G. Proietti
2nd Workshop on Approximation and Online Algorithms (WAOA'04), September 14-16, 2004, Bergen, Norway.
Vol. 3351 of Lecture Notes in Computer Science, Springer-Verlag, 181-196.
 

33.  Truthful Mechanisms for Building Trust in E-commerce
G. Melideo and G. Proietti,
2nd International Workshop on Certification and Security in Inter-Organizational E-Services (CSES'04), August 26-27, 2004, Toulouse, France.
IFIP Workshop Proceedings, Springer, 101-112.
 

34.  A Lower Bound for the DRT* with Complete Correction Technique
A. Di Pasquale, E. Nardelli, and G. Proietti
6th International Workshop on Distributed Data & Structures (WDAS'04), July 5-7, 2004, Lausanne, Switzerland.
 

35.  Edge-connectivity Augmentation and Network Matrices
M. Conforti, A. Galluccio, and G. Proietti
30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'04), June 21-23, 2004, Bonn, Germany.
Vol. 3353 of Lecture Notes in Computer Science, Springer-Verlag, 355-364.
 

36.  Truthful Mechanisms for Generalized Utilitarian Problems
G. Melideo, P. Penna, G. Proietti, R. Wattenhofer, and P. Widmayer
3rd IFIP International Conference on Theoretical Computer Science (TCS'04), August 24-26, 2004, Toulouse, France.
IFIP Conference Proceedings, Kluwer Academic Press, 167-180.
 

37.  An RP* Extension with Almost Constant Amortized Costs
A. Di Pasquale, E. Nardelli, and G. Proietti
5th International Workshop on Distributed Data & Structures (WDAS'03)
June 12-13, 2003, Aristotle University of Thessaloniki, Greece.
Vol. 19 of Proceedings in Informatics, Carleton Scientific, 1-16.
 

38.  Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs
C. Gaibisso, G. Proietti, and R. Tan
9th Annual Int. Computing and Combinatorics Conf. (COCOON'03), July 25-28, 2003, Big Sky, MT, USA.
Vol. 2697 of Lecture Notes in Computer Science, Springer-Verlag, 404-414.
 

39.  Quality of Service in Wireless Networks
V. Bilò, A. Di Pasquale, F. Fioravanti, M. Flammini, L. Forlizzi, F. Lo Presti, G. Melideo, E. Nardelli, A. Navarra, and G. Proietti
3rd International Workshop on Wireless, Mobile and Ad Hoc Networks (WMAN'03),
April 22-26, 2003, Nice, France.
 

40.  A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation
A. Galluccio and G. Proietti
13th Annual International Symposium on Algorithms and Computation (ISAAC'02),
November 21-23, 2002, Vancouver, Canada.
Vol. 2518 of Lecture Notes in Computer Science, Springer-Verlag, 150-162.
 

41.  An Improved Upper Bound for Scalable Distributed Search Trees
A. Di Pasquale, E. Nardelli, and G. Proietti
4th International Workshop on Distributed Data & Structures (WDAS'02)
March 20-23, 2002, University Paris 9 Dauphine, Paris, France.
Vol. 14 of Proceedings in Informatics, Carleton Scientific, 133-142.
 

42.  Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths
A. Galluccio and G. Proietti,
Twelfth Annual International Symposium on Algorithms and Computation (ISAAC'01),
Christchurch, New Zealand, December 19-21, 2001,
Vol. 2223 of Lecture Notes in Computer Science, Springer-Verlag, 345-354.
 

43.  Dynamic Maintenance Versus Swapping: an Experimental Study on Shortest Paths Trees,
G. Proietti
3rd Workshop on Algorithm Engineering (WAE 2000),
Saarbrucken, Germany, September 5-8, 2000,
Vol. 1982 of Lecture Notes in Computer Science, Springer-Verlag, 207-217.
 

44.  Maintaning a Minimum Spanning Tree Under Transient Node Failures
E. Nardelli, G. Proietti, and P. Widmayer
8th European Symp on Algorithms (ESA 2000),
Saarbrucken, Germany, September 5-8, 2000,
Vol. 1879 of Lecture Notes in Computer Science, Springer-Verlag, 346-355.
 

45.  Size Estimation of the Intersection Join Between Two Line Segment Datasets
E. Nardelli and G. Proietti
Advances in Databases and Information Syst. (ADBIS 2000),
Prague, Czech Republic, September 5-8, 2000
Vol. 1884 of Lecture Notes in Computer Science, Springer-Verlag, 229-238.
 

46.  S*-tree: an Improved S+-tree for Coloured Images
E. Nardelli and G. Proietti
Advances in Databases and Information Syst. (ADBIS'99),
Maribor, Slovenija, September 13-16, 1999,
Vol. 1691 of Lecture Notes in Computer Science, Springer-Verlag, 156-167.
`

47.  A Roboust Image Mosaicing Technique Capable of Creating Integrated Panoramas
Y. Gong, G. Proietti, and D. La Rose
IEEE Int. Conf. on Information Visualization (IV'99),
London, United Kingdom, July 16-18, 1999, 24-29.
 

48.  How to Swap a Failing Edge of a Single Source Shortest Paths Tree
E. Nardelli, G. Proietti, and P. Widmayer
5th Annual Int. Computing and Combinatorics Conf. (COCOON'99),
Tokjo, Japan, July 23-26, 1999, Vol. 1627 of Lecture Notes in
Computer Science, Springer-Verlag, 144-153.
 

49.  I/O Complexity for Range Queries on Region Data Stored Using an R-tree
G. Proietti and C. Faloutsos
15th IEEE Int. Conf on Data Engineering (ICDE'99),
Sidney, Australia, March 23-26, 1999, 628-635.
 

50.  Selectivity Estimation of Spatial Queries for Line Segment Datasets
G. Proietti and C. Faloutsos
7th ACM Int. Conf of Information and Knowledge Management (CIKM'98),
November 3-7, 1998, Washington D.C., USA, 340-347.
 

51.  Image Indexing and Retrieval Based on Human Perceptual Color Clustering
Y. Gong, G. Proietti, and C. Faloutsos
IEEE Int. Conf. on Computer Vision nad Pattern Recognition (CVPR'98)
Santa Barbara, California, USA, June 23-25, 1998, 578-583.
 

52.  Efficient Inserting of Approximately Sorted Sequences of Elements into a Dictionary
C. Gaibisso and G. Proietti
24th Seminar on Current Trends in Theory and Practice of Informatics (SOFSEM'97),
Milovy, Czech Republic, 1997,
Vol. 1338 of Lecture Notes in Computer Science, Springer-Verlag, 399-406.
 

53.  Efficient ATM Layouts with Bounded Hop Count and Congestion
M. Flammini, E. Nardelli, and G. Proietti
8th Workshop on Distributed Algorithms (WDAG'97),
Saarbrucken, Germany, 1997,
Vol. 1320 of Lecture Notes in Computer Science, Springer-Verlag, 52-65.
 

54.  An Output Sensitive Solution to the Set Union and Intersection Problem
C. Gaibisso, E. Nardelli, and G. Proietti
23th Seminar on Current Trends in Theory and Practice of Informatics (SOFSEM'96),
Czech Republic, 1996,
Vol. 1175 of Lecture Notes in Computer Science, K.Jeffery et al. eds., (1996), Springer-Verlag, 351-358.
 

55.  QR-tree: a Hybrid Spatial Data Structure
Y. Manolopoulos, E. Nardelli, A. Papadopoulos, and G. Proietti
Int. Conf. on GIS in Urban, Environmental and Regional Planning (SAMOS'96),
Isole Samos, Greece, 1996, 247-259.
 

56.  On the Generation of Aggregated Random Spatial Regions
Y. Manolopoulos, E. Nardelli, G. Proietti, and M. Vassilakopoulos
4th ACM Int. Conf of Information and Knowledge Management (CIKM'95),
Baltimore, Maryland, USA, 1995, 318--325.
 

57.  A multistage approach to complex document interpretation
M. Fossa, E. Nardelli, and G. Proietti
8th International Symposium in Informatics Applications (INFONOR'94),
Antofagasta, Chile, 1994.
 

58.  Managing overlapping features in spatial database applications
E. Nardelli and G. Proietti
International Computer Symposium (ICS'94),
Hsinchu, Taiwan, 1994, 1297--1302.
 

59.  An Accurate Model for Quadtrees Representing Noiseless Images
E. Nardelli and G. Proietti
1st IEEE Int. Conf. on Image Processing (ICIP'94),
Austin, Texas, 1994, 610-614.
 

60.  A Hybrid Pointerless Representation of Quadtrees for Efficient Processing of Window Queries
E. Nardelli and G. Proietti
Int. Workshop on Advanced Research in Geographic Images of Spatial Data (IGIS'94),
Ascona, Switzerland, April 1994,
Vol. 884 of Lecture Notes in Computer Science, Springer-Verlag, 259-269.
 

61.  Raster to Object Conversion Aided by Knowledge Based Image Processing
M. Fossa, E. Nardelli, and G. Proietti
2nd IEEE Int. Conf. on Document Analysis and Recognition (ICDAR'93),
Tokio, Japan, 1993, 951-954.