|
| | | |
Volume 128 - Eighteenth Computing: The Australasian Theory Symposium(CATS 2012), Melbourne, Australia, January 2012This volume contains papers presented at the Eighteenth Computing: The Australasian Theory Symposium (CATS 2012), Melbourne, Australia, January 2012. Where indicated, the paper is available for download in PDF or Postscript format. The series is published by, and most papers are copyright of, the Australian Computer Society Inc. Reproduction for academic research and not-for-profit purposes is granted provided the copyright notice on the first page of each paper is included. | | | Acceptance Rate Information.The full papers in this volume were peer refereed, in full, by an international programme committee. The acceptance rate was 52.9% (18 from 34). |
Volume CitationMestre, J. Eds. (2012). Proceedings of the Eighteenth Computing: The Australasian Theory Symposium (CATS 2012). CRPIT. 128. Melbourne, Australia, ACS.
Papers Included in the VolumeTsin, Y. H. (2012). Decomposing a Multigraph into Split Components. In Proc. Computing: The Australasian Theory Symposium (CATS 2012), Melbourne, Australia. CRPIT, 128. Mestre, J. Eds., ACS. 3-12. |
| Zhang, C. and Nagamochi, H. (2012). The Next-to-Shortest Path in Undirected Graphs with Nonnegative Weights. In Proc. Computing: The Australasian Theory Symposium (CATS 2012), Melbourne, Australia. CRPIT, 128. Mestre, J. Eds., ACS. 13-20. |
| Takaoka, T. (2012). Efficient Algorithms for the All Pairs Shortest Path Problem with Limited Edge Costs. In Proc. Computing: The Australasian Theory Symposium (CATS 2012), Melbourne, Australia. CRPIT, 128. Mestre, J. Eds., ACS. 21-26. |
| Brandenburg, F. J. (2012). On the Curve Complexity of Upward Planar Drawings. In Proc. Computing: The Australasian Theory Symposium (CATS 2012), Melbourne, Australia. CRPIT, 128. Mestre, J. Eds., ACS. 27-36. |
| Shawi, R. E., Gudmudsson, J. and Levcopoulos, C. (2012). Quickest Path Queries on Transportation Network. In Proc. Computing: The Australasian Theory Symposium (CATS 2012), Melbourne, Australia. CRPIT, 128. Mestre, J. Eds., ACS. 37-46. |
| Valtr, P. (2012). On empty pentagons and hexagons in planar point sets. In Proc. Computing: The Australasian Theory Symposium (CATS 2012), Melbourne, Australia. CRPIT, 128. Mestre, J. Eds., ACS. 47-48. |
| Naish, L., Soendergaard, H. and Horsfall, B. (2012). Logic Programming: From Underspecification to Undefinedness. In Proc. Computing: The Australasian Theory Symposium (CATS 2012), Melbourne, Australia. CRPIT, 128. Mestre, J. Eds., ACS. 49-58. |
| Mahajan, M., Saurabh, N. and Sreenivasaiah, K. (2012). Counting paths in planar width 2 branching programs. In Proc. Computing: The Australasian Theory Symposium (CATS 2012), Melbourne, Australia. CRPIT, 128. Mestre, J. Eds., ACS. 59-68. |
| Iwamoto, C., Sasaki, K. and Morita, K. (2012). Computational Complexity of String Puzzles. In Proc. Computing: The Australasian Theory Symposium (CATS 2012), Melbourne, Australia. CRPIT, 128. Mestre, J. Eds., ACS. 69-74. |
| Liao, K. and Shen, H. (2012). Approximating the Reliable Resource Allocation Problem Using Inverse Dual Fitting. In Proc. Computing: The Australasian Theory Symposium (CATS 2012), Melbourne, Australia. CRPIT, 128. Mestre, J. Eds., ACS. 75-82. |
| Kakimura, N. and Takamatsu, M. (2012). Matching Problems with Delta-Matroid Constraints . In Proc. Computing: The Australasian Theory Symposium (CATS 2012), Melbourne, Australia. CRPIT, 128. Mestre, J. Eds., ACS. 83-92. |
| Fujito, T. and Sakamaki, T. (2012). How to guard a graph against tree movements. In Proc. Computing: The Australasian Theory Symposium (CATS 2012), Melbourne, Australia. CRPIT, 128. Mestre, J. Eds., ACS. 93-96. |
| Olsen, M. (2012). On Defining and Computing Communities. In Proc. Computing: The Australasian Theory Symposium (CATS 2012), Melbourne, Australia. CRPIT, 128. Mestre, J. Eds., ACS. 97-102. |
| Edelkamp, S., Elmasry, A. and Katajainen, J. (2012). The Weak-Heap Family of Priority Queues in Theory and Praxis. In Proc. Computing: The Australasian Theory Symposium (CATS 2012), Melbourne, Australia. CRPIT, 128. Mestre, J. Eds., ACS. 103-112. |
| Gandhi, A., Khoussainov, B. and Liu, J. (2012). Solving infinite games on trees with back-edges. In Proc. Computing: The Australasian Theory Symposium (CATS 2012), Melbourne, Australia. CRPIT, 128. Mestre, J. Eds., ACS. 113-122. |
| Ishii, T. (2012). Augmenting Outerplanar Graphs to Meet Diameter Requirements. In Proc. Computing: The Australasian Theory Symposium (CATS 2012), Melbourne, Australia. CRPIT, 128. Mestre, J. Eds., ACS. 123-132. |
| Kawarabayashi, K. and Wood, D. R. (2012). Cliques in Odd-Minor-Free Graphs. In Proc. Computing: The Australasian Theory Symposium (CATS 2012), Melbourne, Australia. CRPIT, 128. Mestre, J. Eds., ACS. 133-138. |
| Asahiro, Y., Jansson, J., Miyano, E. and Ono, H. (2012). Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty. In Proc. Computing: The Australasian Theory Symposium (CATS 2012), Melbourne, Australia. CRPIT, 128. Mestre, J. Eds., ACS. 139-146. |
|
Papers listed: 18
|