Special Issue with Selected Papers of the Thirteenth Australasian Workshop on Combinatorial Algorithms (AWOCA 2002)
Diane Donovan, Costas Iliopoulos, Mirka Miller: | |
Editorial | 555–555 |
Sergey N. Bereg, Andrei V. Kelarev: | |
An Algorithm for Analysis of Images in Spatial Information Systems | 557–565 |
Nicholas J. Cavenagh: | |
Latin Trade Algorithms and the Smallest Critical Set in a Latin Square | 567–578 |
František Franěk, William F. Smyth, Yudong Tang: | |
Computing all Repeats Using Suffix Arrays | 579–591 |
František Franěk, Jan Holub, William F. Smyth, Xiangdong Xiao: | |
Computing Quasi Suffix Arrays | 593–606 |
George Lagogiannis, Christos Makris, Yannis Panagis, Spyros Sioutas, Kostas Tsichlas: | |
New Dynamic Balanced Search Trees with Worst-Case Constant Update Time | 607–632 |
George Lagogiannis, Christos Makris, Yannis Panagis, Spyros Sioutas, Kostas Tsichlas: | |
Rectangle Enclosure Reporting in Linear Space Revisited | 633–645 |
Arnaud Lefebvre, Thierry Lecroq, Joël Alexandre: | |
An Improved Algorithm for Finding Longest Repeats with a Modified Factor Oracle | 647–657 |
Charles Curtis Lindner: | |
A Small Embedding for Partial 4-Cycle Systems when the Leave is Small | 659–662 |
Prabhu Manyem, Rhonda L. Salt, Marc Simon Visser: | |
Approximation Lower Bounds in Online LIB Bin Packing and Covering | 663–674 |
A. N. M. Salman, Hajo Broersma, Edy Tri Baskoro: | |
Spanning 2-Connected Subgraphs in Alphabet Graphs, Special Classes of Grid Graphs | 675–681 |