WAAC03 Program

July 3

• Session 1: Networks (9:30--10:45)
  • Y. Asano, H. Imai, M. Toyoda, M. Kitsuregawa: Mining Communities From the Web Using a Site-Oriented Framework
  • C. Marcel: On Routing in Update Networks
  • H. Saito, T. Fujie, T. Matsui: A Polyhedral Approach to the Hub Network Design Problem
• Break (10:45--11:00)
• Session 2: Quantum Algorithms, Random Walk (11:00--12:40)
  • J. Hasegawa, F. Yura: An Analysis of Quantum Search and Counting Against Errors
  • T. Yamada, J. Niwa, F. Yura and H. Imai: An Analysis of Quantum Factorization Algorithm by Simulation --Thorough Simulation and Effects of Approximate Quantum Fourier Transform--
  • T. Matsui, M. Motoki, N. Kamatani: A Rapidly Mixing Approximate Sampler of Dirichlet Distribution
  • S. Kijima, T. Matsui: Sampling Algorithm for Two-rowed Contingency Tables
• Lunch (12:40--13:50)
• Session 3: Invited Talk (13:50--14:45)
  • Kunsoo Park: Recent Developments in Linear-Time Construction of Suffix Arrays
• Break (14:45--15:00)
• Session 4: Computer Vision/Computational Geometry (15:00--16:40)
  • Shinji Sasahara, Tetsuo Asano: Adaptive Cluster Arrangement for Cluster-dot Halftoning Using Bubble Packing Method
  • S. E. Bae, T. Takaoka: Parallel Approaches to the Maximum Subarray Problem
  • T. Shimamoto, T. Asano: How to Arrange Fewest Possible Probes to Detect a Hidden Object
  • J. Chun, K. Sadakane, T. Tokuyama: Linear Time Algorithm for Appproximating a Curve by a Single-Peaked Curve
• Break (16:40---16:55)
• Session 5: Cryptography/Security (16:55--17:45)
  • K. Koizumi, T. Mizuki, T. Nishizeki: Necessary and Sufficient Numbers of Cards for the Transformation Protocol
  • S.-Y. Park, S.-J. Park, S.-H. Lee: Dynamic Threshold Proxy Signatures in a Hierarchical Group
• Banquet (18:15--20:15) --- at Hotel JAL City Sendai

  July 4

• Session 6: Distributed/Parallel Algorithms (9:20--10:35)
  • Satoshi Fujita: Optimal Neighbourhood Broadcast in Binary n-Cube
  • A. Okashita, T. Araki, Y. Shibata: Adaptive Diagnosis of Variants of Hypercubes with Small Number of Parallel Testing Rounds
  • H. Lee, K.-Y. Chwa: Nearly Optimal Gossiping by Short Messages in Rectangular Grids
• Break (10:35--10:50)
• Session 7: Graph Algorithms (10:50--12:30)
  • H. Nagamochi, T. Suzuki, T. Ishii: A Simple Recognition of Maximal Planar Graphs
  • X. Zhou, Y. Matsuo, T. Nishizeki: Complexity and Algorithms of List Total Coloring of Series-Parallel Graph
  • H. Nagamochi, N. Yamada: Fast Algorithms for Counting Bilayer Crossing
  • H. Nagamochi, K. Iwata, T. Ishii: A Simple and Robust Algorithm for Bisecting a Triconnected Graph with Two Resource Sets
• Lunch (12:30--13:30)
• Session 8: Combinatorial Optimization --- Scheduling and Knapsack (13:30--14:45)
  • K. Iwama, G. Zhang: Removable Online Knapsack---Weighted Case
  • T. Asano, E. Chiba: A New Approach to Transportation Scheduling Problem Based on Network Flow Theory
  • J.-H. Huh, T.-M. Chang: The Application of Two-Level Cache in RAID 5 System
• Break (14:45--15:00)
• Session 9: Graph Drawing (15:00--16:15)
  • M. S. Rahman, N. Egi, T. Nishizeki: No-Bend Orthogonal Drawing of Subdivisions of Planar Triconnected Cubic Graphs
  • N. Abe, S. Masuda, K. Yamaguchi: An Algorithm for Drawing a Graph with Vertex Labels
  • S.-H. Hong, P. Eades: Drawing Disconnected Graphs Symmetrically