Journal of Automata, Languages and Combinatorics formerly: Journal of Information Processing and Cybernetics / Elektronische Informationsverarbeitung und Kybernetik

Special Issue:
Selected Papers of the Thirteenth Australasian Workshop on Combinatorial Algorithms
(Kingfisher Bay Resort, Fraser Island, Queensland, Australia, July 7–10, 2002)

CONTENTS

• Diane Donovan, Costas S. Iliopoulos, Mirka Miller:
       Editorial.
       Journal of Automata, Languages and Combinatorics 8 (2003) 4, 555.

• Sergey N. Bereg, Andrei V. Kelarev:
       An Algorithm for Analysis of Images in Spatial Information Systems.
       Journal of Automata, Languages and Combinatorics 8 (2003) 4, 557–565.

• Nicholas J. Cavenagh:
       Latin Trade Algorithms and the Smallest Critical Set in a Latin Square.
       Journal of Automata, Languages and Combinatorics 8 (2003) 4, 567–578.

• František Franěk, William F. Smyth, Yudong Tang:
       Computing All Repeats Using Suffix Arrays.
       Journal of Automata, Languages and Combinatorics 8 (2003) 4, 579–591.

• František Franěk, Jan Holub, William F. Smyth, Xiangdong Xiao:
       Computing Quasi Suffix Arrays.
       Journal of Automata, Languages and Combinatorics 8 (2003) 4, 593–606.

• George Lagogiannis, Christos Makris, Yannis Panagis, Spyros Sioutas, Kostas Tsichlas:
       New Dynamic Balanced Search Trees with Worst-Case Constant Update Time.
       Journal of Automata, Languages and Combinatorics 8 (2003) 4, 607–632.

• George Lagogiannis, Christos Makris, Yannis Panagis, Spyros Sioutas, Kostas Tsichlas:
       Rectangle Enclosure Reporting in Linear Space Revisited.
       Journal of Automata, Languages and Combinatorics 8 (2003) 4, 633–645.

• Arnaud Lefebvre, Thierry Lecroq, Joël Alexandre:
       An Improved Algorithm for Finding Longest Repeats with a Modified Factor Oracle.
       Journal of Automata, Languages and Combinatorics 8 (2003) 4, 647–657.

• Charles Curtis Lindner:
       A Small Embedding for Partial 4-Cycle Systems when the Leave is Small.
       Journal of Automata, Languages and Combinatorics 8 (2003) 4, 659–662.

• Prabhu Manyem, Rhonda L. Salt, Marc Simon Visser:
       Approximation Lower Bounds in Online LIB Bin Packing and Covering.
       Journal of Automata, Languages and Combinatorics 8 (2003) 4, 663–674.

• A.N.M. Salman, Hajo Broersma, Edy Tri Baskoro:
       Spanning 2-Connected Subgraphs in Alphabet Graphs, Special Classes of Grid Graphs.
       Journal of Automata, Languages and Combinatorics 8 (2003) 4, 675–681.