CATS 2006: Hobart, Tasmania, Australia
Joachim Gudmundsson, C. Barry Jay (Eds.): Theory of Computing 2006, Proceedings of the Twelfth Computing: The Australasian Theory Symposium (CATS2006). Hobart, Tasmania, Australia, 16-19 January 2006, Proceedings. Australian Computer Society 2006 CRPIT 51 ISBN 1-920682-33-3- Tetsuo Asano: Computational Geometric and Combinatorial Approaches to Digital Halftoning. 3
- Michiel H. M. Smid: Geometric spanners with few edges and degree five. 7-9
- Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo: Graph Orientation Algorithms to Minimize the Maximum Outdegree. 11-20
- Toro Hasunuma: Multilayer Grid Embeddings of Iterated Line Digraphs. 21-26
- Ye Henry Tian: Mechanically Verifying Correctness of CPS Compilation. 41-51
- James Harland: The Busy Beaver, the Placid Platypus and other Crazy Creatures. 79-86
- A. V. Kelarev: A Polynomial Algorithm for Codes Based on Directed Graphs. 87-92
- Jacek Blazewicz, Marta Kasprzak: On the complexity of the DNA Simplified Partial Digest Problem. 93-100
- Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, Mia Persson: On the Approximability of Maximum and Minimum Edge Clique Partition Problems. 101-105
- Shuai Cheng Li: Faster Algorithms for Finding Missing Patterns. 107-111
- Sebastian Link: On the Logical Implication of Multivalued Dependencies with Null Values. 113-122
- Brian Herlihy, Peter Schachte, Harald Søndergaard: Boolean equation solving as graph traversal. 123-132
- M. R. K. Krishna Rao: Learnability of Term Rewrite Systems from Positive Examples. 133-137
- Chung Keung Poon, Feifeng Zheng, Yinfeng Xu: On-demand Bounded Broadcast Scheduling with Tight Deadlines. 139-143
- Giorgio Ausiello, Aristotelis Giannakos, Vangelis Th. Paschos: Greedy algorithms for on-line set-covering and related problems. 145-151
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-17T202759 by the dblp team