CATS 2005: Newcastle, NSW, Australia

• Michael Compton:
  Stenning's Protocol Implemented in UDP and Verified in Isabelle. 21-30
  
• Anthony H. Dekker, Bernard D. Colbert:
  The Symmetry Ratio of a Network. 13-20
  
• Rodney G. Downey, Catherine McCartin:
  Bounded Persistence Pathwidth. 51-56
  
• Andres Figueroa, Avraham Goldstein, Tao Jiang, Maciej Kurowski, Andrzej Lingas, Mia Persson:
  Approximate Clustering of Fingerprint Vectors with Missing Values. 57-60
  
• Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba:
  On Packing Squares with Resource Augmentation: Maximizing the Profit. 61-67
  
• Doug Goldson, Brijesh Dongol:
  Concurrent Program Design in the Extended Theory of Owicki and Gries. 41-50
  
• David Hemer, Gregory Long, Paul A. Strooper:
  Plug-in Proof Support for Formal Development Environments. 69-79
  
• Jan Hidders, Marlon Dumas, Wil M. P. van der Aalst, Arthur H. M. ter Hofstede, Jan Verelst:
  When are two Workflows the Same? 3-11
  
• Marieke Huisman, Kerry Trentelman:
  Factorising Temporal Specifications. 87-96
  
• Toshimasa Ishii, Hitoshi Fujita, Hiroshi Nagamochi:
  Minimum Cost Source Location Problem with Local 3-Vertex-Connectivity Requirements. 97-105
  
• Mark Lanthier, Doron Nussbaum, Tsuo-Jung Wang:
  Calculating the Meeting Point of Scattered Robots on Weighted Terrain Surfaces. 107-118
  
• Hidetomo Machi, Kohji Tomita, Chiharu Hosono:
  The Relative Completeness of a Version of CTL*. 81-85
  
• Chris Pollett, Norman Danner:
  Circuit Principles and Weak Pigeonhole Variants. 31-40
  
• Elena Prieto:
  The Method of Extremal Structure on the k-Maximum Cut Problem. 119-126
  
• Shane Saunders, Tadao Takaoka:
  Efficient Algorithms for Solving Shortest Paths on Nearly Acyclic Directed Graphs. 127-131
  

Last update Tue May 22 23:23:21 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page