The 18th CATS symposium (Computing: the Australasian Theory Symposium) will be held in Melbourne, Australia, in February 2012. CATS is an annual conference held in the Australia-New Zealand region, dedicated to theoretical computer science.
CATS is part of the Australasian Computer Society Week (ACSW). This year the ACSW is organized by the RMIT University in Melbourne, Australia.
Authors are invited to submit papers that present original, unpublished research in all areas of theoretical computer science. Typical but not exclusive areas of interest include:
Papers related to other theoretical aspects of computer science will also be considered.
Contact: cats2012@easychair.org
This CATS tutorial will offer parameterized complexity theory and techniques to deal with intractable (NP-hard) problems. Fine-grained complexity analysis and algorithm design has an almost universal mission, much of it unexplored. There will be examples across many fields; such as, massive parallel processing of huge data sets, computational biology, computational vision, AI, computational social choice (ranking problems and voting theory), approximation, kernelization - very multidisciplinary. It is a tutorial with the basics presented, although some of the latest results and applications will be described. The parameterized complexity research community is strongly interdisciplinary, with great promise for further interdisciplinary opportunities.
For more information, please visit the workshop's webpage.
Webpages hosted at the University of Sydney | Contact: cats2012@easychair.org