CATS 2012: Melbourne, Victoria, Australia
Julián Mestre (Ed.): Eighteenth Computing: The Australasian Theory Symposium, CATS 2012, Melbourne, Australia, January 2012. Australian Computer Society 2012 CRPIT 128 ISBN 978-1-921770-09-8- Yung H. Tsin: Decomposing a Multigraph into Split Components. 3-12
- Cong Zhang, Hiroshi Nagamochi: The Next-to-Shortest Path in Undirected Graphs with Nonnegative Weights. 13-20
- Tadao Takaoka: Efficient Algorithms for the All Pairs Shortest Path Problem with Limited Edge Costs. 21-26
- Franz-Josef Brandenburg: On the Curve Complexity of Upward Planar Drawings. 27-36
- Radwa El Shawi, Joachim Gudmundsson, Christos Levcopoulos: Quickest Path Queries on Transportation Network. 37-46
- Pavel Valtr: On empty pentagons and hexagons in planar point sets. 47-48
- Lee Naish, Harald Søndergaard, Benjamin Horsfall: Logic Programming: From Underspecification to Undefinedness. 49-58
- Meena Mahajan, Nitin Saurabh, Karteek Sreenivasaiah: Counting paths in planar width 2 branching programs. 59-68
- Kewen Liao, Hong Shen: Approximating the Reliable Resource Allocation Problem Using Inverse Dual Fitting. 75-82
- Martin Oslen: On Defining and Computing Communities. 97-102
- Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen: The Weak-Heap Family of Priority Queues in Theory and Praxis. 103-112
- Aniruddh Gandhi, Bakhadyr Khoussainov, Jiamou Liu: Solving infinite games on trees with back-edges. 113-122
- Toshimasa Ishii: Augmenting Outerplanar Graphs to Meet Diameter Requirements. 123-132
- Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono: Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty. 139-146
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-16T203152 by the dblp team