Papers are listed according to the following classification:

BASIC RESEARCH
OPTICAL NETWORKS
WIRELESS NETWORKS
SATELLITE SYSTEMS

BASIC RESEARCH

• F. Cicalese, L. Gargano, U. Vaccaro, ``Optimal Approximation of Uniform Distributions with a Biased Coin'', Proceedings of RANDOM'00, Geneva, Switzerland, 2000.

• F. Cicalese, L. Gargano, U. Vaccaro, ``On Searching Strategies, Parallel Questions, and Delayed Answers'', in: Proceedings of Fun with Algorithms (FUN01), E. Lodi, L. Pagli, N. Santoro (Eds.), pp. 27--42, Carleton Scientific Press, 2001.

• Miroslav Chlebik and Jana Chlebikova, New inapproximability results for the Steiner tree problem, Manuscript, 2002.

• Jana Chlebikova and Klaus Jansen, Improved algorithms for the precoloring extension problem restricted to graphs with constant treewidth, Manuscript, 2002

• C. Gavoille, D. Peleg, S. Perennes, and R. Raz. Distance labeling in graphs. In SODA'01, 210--219, 2001.

• Klaus Jansen, Approximate strong separation with application in^M fractional graph coloring and preemptive scheduling, {\em 19th^M International Symposium on Theoretical Aspects of Computer Science^M STACS'02}, LNCS, 2002.

• K. Jansen, Approximation algorithms for fractional covering and packing problems, and applications, (invited talk), to appear in: FCT 2001, Riga.

• Klaus Jansen and Manuela Montangero (*), Approximation Algorithm^M for Weighted Rectangle Packing, Manuscript, 2002.

• K. Jansen and L. Porkolab, On preemptive resource constrained scheduling: polynomial-time approximation schemes, submitted manuscript.

• F. Havet, Trees in tournament, Discrete Mathematics, 243(1--3):121--134, 2002.

• F. Havet and M. Wennink. The push tree problem. In SPAA'01: 13th ACM Symposium on Parallel Algorithms and Architectures, 318--319, Crete , Grece, July 2001.

• P. Moser, Derandomization of the Polynomial Time Hierarchy in a Uniform Setting, submitted manuscript.
  Top of page

• V. Auletta, I. Caragiannis, L. Gargano, C. Kaklamanis, G. Persiano, Sparse and Limited Wavelenght Conversion in Tree Networks, Theoretical Computer Science, to appear.

• V. Auletta, I. Caragiannis, C. Kaklamanis, and P. Persiano. "Randomized Path Coloring on Binary Trees." In Proceedings of the 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2000), LNCS 1913, Springer, pp. 60-71, 2000.

• J-C. Bermond, L. Chacon, D. Coudert, and F. Tillerot. A Note on Cycle Covering. In ACM Symposium on Parallel Algorithms and Architectures -- SPAA}, 310--311, 4-6 July 2001.

• J-C. Bermond, L. Chacon, D. Coudert, and F. Tillerot. Cycle Covering. In International Colloquium on Structural Information and Communication Complexity -- SIROCCO, 21--34, 27-29 June 2001.

• I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Perennes, P. Persiano, H. Rivano. Approximate constrained bipartite edge coloring. 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'01), Lecture Notes in Computer Science, Boltenhagen, Germany, June 2001. Springer-Verlag.

• I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Perennes, H. Rivano. Fractional Path Coloring with Applications to WDM Networks. In Proceedings of the 28th International Colloquium on Automata, Languages, and Programming (ICALP 01), to appear.

• I. Caragiannis, C. Kaklamanis, and P. Persiano. "Symmetric Communication in All-Optical Tree Networks." Parallel Processing Letters, to appear.

• Sebastien Choplin. Virtual path layout in ATM path with given hop count. In International Conference on Networking, ICN01, volume 2094, Part II of LNCS, 527--537. Springer, 2001.

• L. Gargano, A. Rescigno, Coloring Circular Arcs with Applications to WDM Routing, Workshop on Approximation and Randomization Algorithms in Communication Networks (ARACNE'00), July 2000, Geneva, Switzerland.

• T. Erlebach and K. Jansen, Conversion of coloring algorithms into maximum weight independent set algorithms, Workshop on Approximation and Randomization Algorithms in Communication Networks, ARACNE 2000, Geneva, Carleton Scientific, 2000, 135-146.

• K. Jansen, Approximation algorithms for fractional covering and packing problems, and applications, (invited talk), to appear in: FCT 2001, Riga.

• T. Erlebach and K. Jansen, Implementation of approximation algorithms for weighted and unweighted edge-disjoint paths in bidirected trees, to appear in: WAE 2000, Saarbr\"ucken.

• C. Kaklamanis. "Bandwidth Allocation in WDM Tree Networks." In Proceedings of the 1st International Workshop on Scheduling and Telecommunications (IWST 2001).

• Herve Rivano. Planification de reseaux optiques wdm k-fibres. In AlgoTel'01, pages 41--46, Saint Jean de Luz, France, may 2001.
  Top of page

• G. Bongiovanni, A. E. F. Clementi, P. Penna (2000). A Note on Parallel Read Operations on Large Public Databases. ICALP Satellite Workshops 2000: 123-134.

• I. Caragiannis, C. Kaklamanis, E. Papaioannou. Competiti ve Analysis of On-line Randomized Call Control in Cellular Networks. In Proceedings of the 15th International Parallel and Distributed Processing Symposium (IPDPS 2001), IEEE Computer Society Press.

• I. Caragiannis, C. Kaklamanis, E. Papaioannou. Randomize d Call Control in Sparse Wireless Cellular Networks. In Proceedings of the 8th International Conference on Advances in Communications and Control (COMCON 01), to appear.

• I. Chatzigiannakis, S. Nikoletseas and P. Spirakis, "An Efficient Routing Protocol for Hierarchical Ad-hoc Mobile Networks", to appear in the Proceedings of the 1st International Workshop on Parallel and Distributed Computing Issues in Wireless Networks and Mobile Computing, IPDPS 2001 WORKSHOPS, Hyatt Regency, San Francisco, April 23-27, 2001.

• I. Chatzigiannakis, S. Nikoletseas and P. Spirakis, "Self-Organizing Ad-Hoc Mobile Networks: The problem of end-to-end communication", to appear as a short paper in the Proceedings of the Twentieth (20th) ACM Symposium on Principles of Distributed Computing (PODC 2001), Newport, Rhode Island, August 26-29, 2001.

• A. Clementi, P. Crescenzi, P. Penna, G. Rossi, P. Vocca, On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. Proc. of STACS`01, 18th Ann. Symp. on Theoretical Aspects of Computer Science, LNCS, 2001.

• A. Clementi, A. Ferreira, P. Penna, S. Perennes, R. Silvestri, The Minimum Range Assignment Problem on Linear Radio Networks. Proc. of ESA'00, 8th Ann. European Symp. on Algorithms, LNCS 1879.

• A. Clementi, A. Monti, and R. Silvestri, Selective families, superimposed codes, and broadcasting on unknow radio networks, Proc. of ACM Symp. On Discrete Algorithms (SODA'01), 2001.

• A. Clementi, A. Monti, and R. Silvestri. Distributed Multi-Broadcast in Unknown Radio Networks. 20th ACM Symposium on Principles of Distributed Computing (PODC'01), 2001.

• A. Clementi, P. Crescenzi, A. Monti, P. Penna, R. Silvestri, On Computing Ad-hoc Selective Families, 5th Int. Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM'01), LNCS, 2001.

• G. De Marco and A. Pelc, ``Deterministic broadcasting time with partial knowledge of the network'', Proc. of International Symp. on Algorithms and Computation (ISAAC '00), Taipei, 374-385.

• T. Erlebach, K. Jansen and E. Seidel, Polynomial-time approximation schemes for geometric graphs, 12th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2001, Washington, 671-679.

• T. Erlebach, K. Jansen and E. Seidel, Polynomial-time approximation schemes for geometric graphs, 12th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2001, Washington, 671-679.

• J. Fiala, K. Jansen, V.B. Le and E. Seidel, Graph subcolorings: compexity and algorithms, to appear in: WG 2001.

• J. Fiala, A.V. Fishkin and F. Fomin, Off-line and on-line distance constrained labeling of disk graphs, 9th Anual European Symposium on Algorithms, ESA 2001}, Arhus, LNCS 2161, 2001, 464-475.

• D. Fotakis, S. Nikoletseas, V. Papadopoulou and P. Spirakis, "Hardness Results and Efficient Approximations for Frequency Assignment Problems: Radio Labelling and Radio Coloring", Computers and Artificial Intelligence (CAI), Vol. 20(2), pp. 121--180, 2001.

• F. Havet (2001). Channel assignment and multicolouring of the induced subgraphs of the triangular lattice. {\em Discrete Mathematics}, 233, 219--231.

• K. Jansen, M. Karpinski, A. Lingas and E. Seidel, Polynomial time approximation schemes for max-bisection on planar and geometric graphs, Symposium on Theoretical Aspects of Computer Science, STACS 2001, Dresden, LNCS 2010, 2001, 365-375.

• S. Nikoletseas, G. Prasinos, P. Spirakis and C. Zaroliagis, "Attack Propagation in Networks", in the Thirteenth (13th) Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2001).

• J.Diaz, D. Koukopoulos, S.Nikoletseas, M.Serna, P.Spirakis and D. Thilikos "Stability and non-stability of the FIFO protocol", in the Thirteenth (13th) Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2001).
  Top of page

• P. Berg\'e and A. Ferreira and J. Galtier and J.-N. Petit, A Probabilistic Study of Inter-Satellite Links Load in Polar Orbit Satellite Constellations, International Journal on Telecommunication Systems, To appear,

• A. Ferreira and J. Galtier and J.-N. Petit and H. Rivano, Annales des Telecommunications, Rerouting algorithms in a meshed satellite constellation, To appear

• A. Ferreira and J. Galtier and P. Mahey and G. Mateus and A. Oliveira, An Optimization Model for Routing in Low Earth Orbit Satellite Constellations, Proceedings of ISPAN, IEEE CS Press 2000

• A. Ferreira, J. Galtier and P. Penna, Topological design, routing and hand-over in satellite networks, Handbook of Wireless Networks and Mobile Computing, John Wiley and Sons, 2001

• J. Galtier, Geographical reservation for guaranteed handover and routing in low earth orbit constellations, Telecommunication Systems, To appear

• J. Galtier and A. Oliveira, A proposal to study satellite constellation routing via classical linear programming methods, 43rd conference of the Canadian Operations Research Society, 2001

• J. Galtier and P. Penna, Complexity links between matrix multiplication, Klee's measure and call access control for satellite constellations, {INRIA}, 2001, 4166 Top of page

If you are looking for a paper in the list above click here.