CATS 2008
Computing: The Australasian Theory Symposium

Session 2: Logic and Types
Wednesday 10:30 to 12:00
Chair: Stefan Szeider

Martin Bunder.
The Inhabitation Problem for Intersection Types

Xiaowei Huang, Li Jiao and Weiming Lu.
Weak Parametric Failure Equivalences and Their Congruence Formats

Olga Ohrimenko and Peter Stuckey (student paper)
Modelling for Lazy Clause Generation

Session 3: Optimisation
Wednesday 1:00 to 3:00
Chair: Richard Brent

Samuel Huston, Jakob Puchinger and Peter Stuckey (student paper)
The Core Concept for 0/1 Integer Programming

Matthew Asquith, Joachim Gudmundsson and Damian Merrick (student paper)
An ILP for the Line Ordering Problem

Elena Morozova.
A Multidimensional Bisection Method for Unconstrained Minimization Problem

Nita H. Shah, Ajay S. Gor and Hui Wee.
Optimal Joint Vendor-Buyer Inventory Strategy for Deteriorating Items with Salvage Value

Session 4: Parameterised Complexity
Wednesday 3:30 to 5:30
Chair: James Harland

Marko Samer and Stefan Szeider.
Tractable Cases of the Extended Global Cardinality Constraint

Egbert Mujuni and Frances Rosamond.
Parameterized Complexity of the Clique Partition Problem

Luke Mathieson and Stefan Szeider.
The Parameterized Complexity of Regular Subgraph Problems and Generalizations

Session 5: Graph Algorithms
Thursday 8:30 to 10:00
Chair: Joachim Gudmundsson

Vadim Levit and Eugen Mandrescu.
Well-covered Graphs and Greedoids

Minh Nguyen, Mirka Miller and Guillermo Pineda-Villavicencio (student paper)
On the Non-existence of Even Degree Graphs with Diameter Two and Defect Two

Yuichi Asahiro, Eiji Miyano and Hirotaka Ono.
Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree

Session 6: Algorithms
Thursday 1:00 to 3:00
Chair: Richard Taylor

Frank Ruskey and Aaron Williams (student paper)
Generating Balanced Parentheses and Binary Trees by Prefix Shifts

Ching-Lueh Chang, Yen-Wu Ti and Yuh-Dauh Lyuu.
Testing Embeddability Between Metric Spaces

Shi Bai and Richard P. Brent (student paper)
On the Efficiency of Pollard's Rho Method for Discrete Logarithms

Lindsay Groves.
Verifying Michael and Scott's Lock-Free Queue Algorithm using Trace Reduction