Bibliography

1

G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie and M. Talamo. Algorithms for the on-line traveling-salesman. Algorithmica, Vol 9, n. 4, pp. 560-581, 2001.

2

G. Ausiello, P.G. Franciosa, and D. Frigioni. Directed hypergraphs: Problems, algorithmic results, and a novel decremental algorithm. ICTCS 2001, Lecture Notes in Computer Science 2202, 312-327, Springer 2001

3

B. Awerbuch, Y. Azar, A. Fiat, S. Leonardi and A. Rosèn. On-line competititive algorithms for call control in optical networks. Algorithmica 31(1), pp. 29-43, 2001.

4

L. Becchetti, F. Delli Priscoli, T. Inzerilli, P. Mahonen, and L. Munoz. Enhancing IP service provision over heterogeneous wireless networks: a path toward 4G. IEEE Communications Magazine, Vol.: 39, Issue: 8, pp. 74-81, Aug. 2001

5

L. Becchetti and S. Leonardi. Non-Clairvoyant Scheduling to Minimize the Average Flow Time on Single and Parallel Machines. In Proc. 33-rd ACM Symposium on the Theory of Computing, pp. 94-103, 2001.

6

L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela and K. Pruhs. Online Weighted Flow Time and Deadline Scheduling. In Proc. APPROX 01, LNCS 2129, Springer eds., pp. 36-47, 2001.

7

C. Demetrescu.
Fully Dynamic Algorithms for Path Problems on Directed Graphs.
PhD thesis, Department of Computer and Systems Science, University of Rome ``La Sapienza'', February 2001.

8

C. Demetrescu and I. Finocchi.
Smooth Animation of Algorithms in a Declarative Framework. Journal of Visual Languages and Computing (JVLC), 12(3), Special Issue devoted to selected papers from the 15th IEEE Symposium on Visual Languages, Academic Press, 2001.

9

C. Demetrescu, I. Finocchi, G.F. Italiano, and S. Naeher.
Visualization in algorithm engineering: Tools and techniques.
In Experimental Algorithmics State-of-the-Art Survey. R. Fleischer (ed.), LNCS, Springer Verlag, 2001.

10

C. Demetrescu, I. Finocchi, and J.T. Stasko.
Specifying algorithm visualizations: Interesting events or state mapping?
In Software Visualization State-of-the-Art Survey. S. Diehl (ed.), LNCS 2269, Springer Verlag, 2001.

11

C. Demetrescu and G.F. Italiano.
Fully dynamic all pairs shortest paths with real edge weights.
In Proc. of the 42nd IEEE Annual Symposium on Foundations of Computer Science (FOCS'01), Las Vegas, NE, October 14-17, 2001.

12

P.G. Franciosa, D. Frigioni and R. Giaccio. Semi-dynamic breadth-first search in digraphs. Theoretical Computer Science, 250(1-2), pp. 201-217, 2001.

13

R. Jana, T. Johnson, S. Muthukrishnan and A. Vitaletti. Location based services in a wireless WAN using cellular digital packet data (CDPD). MobiDE 2001: 74-80

14

S. Leonardi, A. Marchetti-Spaccamela, A. Presciutti and A. Rosén. On-line Randomized Call-Control Revisited. SIAM Journal on Computing 31(1), pp. 86-112, 2001.