Carleton Scientific: Sirocco '97
Table of Contents

 

• Danny Krizanc and Peter Widmayer
  Preface

 

• D. Peleg
  Approximating Minimum Communication Spanning Trees

 

• Fred S. Annexstein, Kenneth A. Berman, and Ram Swaminathan
  Approximation Algorithms for Optimal-Depth Independent Spanning Trees and st-Numberings

 

• Vincenzo Auletta Ioannis Caragiannis, Christos Kaklamanis, and Pino Persiano
  Bandwidth Allocation Algorithms on Tree--Shaped All--Optical Networks with Wavelength Converters

 

• P. Berthomé, J. Cohen, and A. Ferreira
  Embedding Tori in Partitioned Optical Passive Star Networks

 

• Stefan Dobrev and Peter Ruzicka
  Linear Broadcasting and N log log N Election in Unoriented Hypercubes

 

• Krzysztof Diks, Andrzej Lingas, and Andrzej Pelc
  An Optimal Algorithm for Broadcasting Multiple Messages in Trees

 

• Michalis Faloutsos, Rajesh Pankaj, and Kenneth C. Sevcik
  Bounds for the On-line Multicast Problem in Directed Graphs

 

• T. Eilam, S. Moran, and S. Zaks
  The Complexity of the Characterization of Networks Supporting Shortest-Path Interval Routing (Extended Abstract)

 

• Savio S.H. Tse and Francis C.M. Lau
  An Optimal Lower Bound for Interval Routing in General Networks

 

• Lata Narayanan and Jaroslav Opatrny
  Compact Routing on Chordal Rings of Degree Four

 

• Uwe Schöning
  Better Expanders and Superconcentrators by Kolmogorov Complexity

 

• D. Peleg
  Size Bounds for Dynamic Monopolies

 

• Cyril Gavoille and Marc Gengler
  Space-Efficiency for Routing Schemes of Stretch Factor Three (Extended Abstract)

 

• Fred S. Annexstein and Chris Giannella
  An Empirical Study of ``Lazy'' Protocols for Routing Information in Dynamic Networks

 

• Yves Métivier, Anca Muscholl, and Pierre-André Wacrenier
  About the Local Detection of Termination of Local Computations in Graphs

 

• Paolo Boldi and Sebastiano Vigna
  Computing Vector Functions on Anonymous Networks

 

• Lata Narayanan and Sunil Shende
  Static Frequency Assignment in Cellular Networks

 

• Marcelo Feighelstein and Shmuel Zaks
  Duality in Chain ATM Virtual Path Layouts (Extended Abstract)

 

• Pierre Fraigniaud and Sandrine Vial
  Heuristic Algorithms for Personalized Communication Problems in Point-to-Point Networks

 

• Michal Soch and Pavel Tvrdik
  Optimal Gossip in Noncombining 2-D Meshes

 

• Panagiota Fatourou, Marios Mavronicolas, and Paul Spirakis
  Advances in Rate-Based Flow Control

 

• Arnold L. Rosenberg
  Theoretical Research on Networks: Models and Methodology

 

• Paola Flocchini and Nicola Santoro
  Symmetries and Minimal Sense of Direction

 

• Evangelos Kranakis, Danny Krizanc, and Jorge Urrutia
  Representing Graphs with Shortest Path Information

 

• Pierre Fraigniaud and Sandrine Vial
  Greedy Gossiping

 

• Johanne Cohen and Pierre Fraigniaud
  NP-completeness of Gossiping in the Line Model