5. CIAC 2003: Rome, Italy

Tutorials

• David Peleg:
  Localized Network Representations. 1
  
• Jayme Luiz Szwarcfiter:
  Optimal Binary Search Trees with Costs Depending on the Access Paths. 2
  
• Jayme Luiz Szwarcfiter:
  On the Generation of Extensions of a Partially Ordered Set. 3
  
• Luca Trevisan:
  Error-Correcting Codes in Complexity Theory. 4
  

Invited Talks

• Charles E. Leiserson:
  Cache-Oblivious Algorithms. 5
  
• David Peleg:
  Spanning Trees with Low Maximum/Average Stretch. 6
  
• Michael O. Rabin:
  Hyper Encryption and Everlasting Secrets. 7-10
  
• John E. Savage:
  Computing with Electronic Nanotechnologies. 11
  

Regular Contributions

• Richard Bruce, Michael Hoffmann, Danny Krizanc, Rajeev Raman:
  Efficient Update Strategies for Geometric Computing with Uncertainty. 12-23
  
• Euripides Markou, Stathis Zachos, Christodoulos Fragoudakis:
  Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete. 24-35
  
• Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya:
  An Improved Algorithm for Point Set Pattern Matching under Rigid Motion. 36-45
  
• Bala Kalyanasundaram, Mahendran Velauthapillai, John G. Waclawsky:
  Unlocking the Advantages of Dynamic Service Selection and Pricing. 46-57
  
• Joan Boyar, Lene M. Favrholdt:
  The Relative Worst Order Ratio for On-Line Algorithms. 58-69
  
• Wun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudence W. H. Wong:
  On-Line Stream Merging, Max Span, and Min Coverage. 70-82
  
• William Duckworth, Bernard Mans:
  Randomised Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular Graphs. 83-95
  
• Victor Chepoi, Feodor F. Dragan, Chenyu Yan:
  Additive Spanners for k-Chordal Graphs. 96-107
  
• Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
  Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation. 108-119
  
• Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi:
  Reconciling Gene Trees to a Species Tree. 120-131
  
• Jayme Luiz Szwarcfiter:
  Generating All Forest Extensions of a Partially Ordered Set. 132-139
  
• Alessandra Gabriele, Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
  Indexing Structures for Approximate String Matching. 140-151
  
• Miroslav Chlebík, Janka Chlebíková:
  Approximation Hardness for Small Occurrence Instances of NP-Hard Problems. 152-164
  
• Andreas Baltz, Anand Srivastav:
  Fast Approximation of Minimum Multicast Congestion - Implementation versus Theory. 165-177
  
• Joep Aerts, Jan H. M. Korst, Frits C. R. Spieksma:
  Approximation of a Retrieval Problem for Parallel Disks. 178-188
  
• Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger:
  On k-Edge-Connectivity Problems with Sharpened Triangle Inequality. 189-200
  
• Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig:
  The Complexity of Detecting Fixed-Density Clusters. 201-212
  
• Tomoyuki Yamakami:
  Nearly Bounded Error Probabilistic Sets. 213-226
  
• Kazuyuki Amano, Akira Maruoka:
  Some Properties of MOD_m Circuits Computing Simple Functions. 227-237
  
• Gian Carlo Bongiovanni, Paolo Penna:
  XOR-Based Schemes for Fast Parallel IP Lookups. 238-250
  
• Dimitrios Koukopoulos, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis:
  The Impact of Network Structure on the Stability of Greedy Protocols. 251-263
  
• Evangelos Kranakis, Paolo Penna, Konrad Schlude, David Scot Taylor, Peter Widmayer:
  Improving Customer Proximity to Railway Stations. 264-276
  
• Cristina Bazgan, Refael Hassin, Jérôme Monnot:
  Differential Approximation for Some Routing Problems. 277-288
  

Last update Fri May 24 18:36:43 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page