11. SIROCCO 2004: Smolenice Castle, Slovakia

@proceedings{DBLP:conf/sirocco/2004,
  editor    = {Rastislav Kralovic and
               Ondrej S{\'y}kora},
  title     = {Structural Information and Communication Complexity, 11th International
               Colloquium , SIROCCO 2004, Smolenice Castle, Slowakia, June 21-23,
               2004, Proceedings},
  booktitle = {SIROCCO},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {3104},
  year      = {2004},
  isbn      = {3-540-22230-8},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Eric Angel, Evripidis Bampis, Fanny Pascual:
  Traffic Grooming in a Passive Star WDM Network. 1-12
  Electronic Edition (link) BibTeX
• Vittorio Bilò, Luca Moscardelli:
  The Price of Anarchy in All-Optical Networks. 13-22
  Electronic Edition (link) BibTeX
• Paul Boone, Edgar Chávez, Lev Gleitzky, Evangelos Kranakis, Jaroslav Opatrny, Gelasio Salazar, Jorge Urrutia:
  Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks. 23-34
  Electronic Edition (link) BibTeX
• Anat Bremler-Barr, Leah Epstein:
  Path Layout on Tree Networks: Bounds in Different Label Switching Models. 35-46
  Electronic Edition (link) BibTeX
• Miroslav Chlebík, Janka Chlebíková:
  On Approximability of the Independent Set Problem for Low Degree Graphs. 47-56
  Electronic Edition (link) BibTeX
• Bogdan S. Chlebus, Mariusz A. Rokicki:
  Asynchronous Broadcast in Radio Networks. 57-68
  Electronic Edition (link) BibTeX
• Sébastien Choplin, Lata Narayanan, Jaroslav Opatrny:
  Two-Hop Virtual Path Layout in Tori. 69-78
  Electronic Edition (link) BibTeX
• Reuven Cohen, David Peleg:
  Robot Convergence via Center-of-Gravity Algorithms. 79-88
  Electronic Edition (link) BibTeX
• Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Alberto Negro, Vittorio Scarano:
  F-Chord: Improved Uniform Routing on Chord: (Extended Abstract). 89-98
  Electronic Edition (link) BibTeX
• Aleksej Di Salvo, Guido Proietti:
  Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor. 99-110
  Electronic Edition (link) BibTeX
• Stefan Dobrev, Paola Flocchini, Nicola Santoro:
  Improved Bounds for Optimal Black Hole Search with a Network Map. 111-122
  Electronic Edition (link) BibTeX
• Yon Dourisboure, Cyril Gavoille:
  Sparse Additive Spanners for Bounded Tree-Length Graphs. 123-137
  Electronic Edition (link) BibTeX
• Guillaume Fertin, André Raspaud, Ondrej Sýkora:
  No-Hole L(p, 0) Labelling of Cycles, Grids and Hypercubes. 138-148
  Electronic Edition (link) BibTeX
• Alessandro Ferrante, Mimmo Parente:
  Existence of Nash Equilibria in Selfish Routing Problems. 149-160
  Electronic Edition (link) BibTeX
• Paola Flocchini, Evangelos Kranakis, Danny Krizanc, Flaminia L. Luccio, Nicola Santoro, Cindy Sawchuk:
  Mobile Agents Rendezvous When Tokens Fail. 161-172
  Electronic Edition (link) BibTeX
• Leszek Gasieniec, Igor Potapov, Qin Xin:
  Time Efficient Gossiping in Known Radio Networks. 173-184
  Electronic Edition (link) BibTeX
• Chryssis Georgiou, Peter M. Musial, Alexander A. Shvartsman:
  Long-Lived Rambo: Trading Knowledge for Communication. 185-196
  Electronic Edition (link) BibTeX
• Arvind Gupta, Ján Manuch, Ladislav Stacho:
  Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach. 197-208
  Electronic Edition (link) BibTeX
• Flaminia L. Luccio, Jop F. Sibeyn:
  Tighter Bounds on Feedback Vertex Sets in Mesh-Based Networks. 209-220
  Electronic Edition (link) BibTeX
• Luciano Margara, Alessandro Pistocchi, Marco Vassura:
  Perfect Token Distribution on Trees. 221-232
  Electronic Edition (link) BibTeX
• Rachel Matichin, David Peleg:
  Approximation Algorithm for Hotlink Assignment in the Greedy Model. 233-244
  Electronic Edition (link) BibTeX
• Michel Paquette, Andrzej Pelc:
  Optimal Decision Strategies in Byzantine Environments. 245-254
  Electronic Edition (link) BibTeX
• Paolo Penna, Carmine Ventre:
  Sharing the Cost of Multicast Transmissions in Wireless Networks. 255-266
  Electronic Edition (link) BibTeX
• Rui Wang, Francis C. M. Lau, Yan Yan Liu:
  NP-Completeness Results for All-Shortest-Path Interval Routing. 267-278
  Electronic Edition (link) BibTeX
• Deshi Ye, Guochuan Zhang:
  On-Line Scheduling of Parallel Jobs. 279-290
  Electronic Edition (link) BibTeX
• Deshi Ye, Hu Zhang:
  The Range Assignment Problem in Static Ad-Hoc Networks on Metric Spaces. 291-302
  Electronic Edition (link) BibTeX