
Programme
Keynote speaker Professor Nik Ruskuc, University of St Andrews
Decidability Questions for Pattern Avoidance Classes of Permutations
Accepted papers

C. McCartin, R. Downey: Bounded Persistence Pathwidth

A. Dekker: The Symmetry Ratio of a Network

E. Prieto: The Method of Extremal Structure on the kMaximum Cut Problem

B. Dongol: Concurrent Program Design in the Extended Theory of Owicki and Gries

S. Saunders: Efficient Algorithms for Solving Shortest Paths on Nearly Acyclic Digraphs

T. Ishil: Minimum Cost Source Location Problem with Local 3VertexConnectivity Requirements

M. Dumas: When are two Workflow Processes the Same?

N. Danner, C. Pollett: Circuit Principles and Weak Pigeonhole Variants

K. Trentelman: Factorising temporal specifications

M. Lanthier: Calculating the Meeting Point of Scattered Robots on Weighted Terrain Surfaces

R. SolisOba: On packing squares with resource augmentation: maximizing the profit

M. Compton: Stenning's Protocol Implemented in UDP and Verified in Isabelle

D. Hemer: Plugin proof support for formal development environments

H. Machi: The Relative Completeness of the FirstOrder CTL*

M. Persson: Approximate Clustering of Fingerprint Vectors with Missing Values
Informal submissions
 M. H. Albert: Sorting with transposition switches
 G. Farr: The complexity of counting colourings
of subgraphs of the grid.
Timetable
CATS sessions will be held during ACSW at the following
times:
Keynote session
11.00am 1 February
Regular paper sessions
4.00pm 30 January
9.00am, 2.00pm, 4.00pm 1 February
11.00am 2 February
