Algorithms and computation. 8th international symposium, ISAAC '97, Singapore, December 17--19, 1997. Proceedings (Q1374898)

The articles of mathematical interest will be reviewed individually. The preceding conference (7th, 1996) has been announced (see Zbl 0856.00043). Indexed articles: \textit{Uno, Takeaki}, Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs, 92-101 [Zbl 0897.05066] \textit{Ishii, Toshimasa; Nagamochi, Hiroshi; Ibaraki, Toshihide}, Augmenting edge and vertex connectivities simultaneously, 102-111 [Zbl 0974.05074] \textit{Eiter, Thomas; Ibaraki, Toshihide; Makino, Kazuhisa}, Two-face Horn extensions, 112-121 [Zbl 0884.06013] \textit{Ausiello, Giorgio; Franciosa, Paolo Giulio; Frigioni, Daniele; Giaccio, Roberto}, Decremental maintenance of reachability in hypergraphs and minimum models of Horn formulae, 122-131 [Zbl 0889.05071] \textit{Tamaki, Hisao; Tokuyama, Takeshi}, A characterization of planar graphs by pseudo-line arrangements, 133-142 [Zbl 0894.05046] \textit{Chen, Zhi-Zhong}, Approximating unweighted connectivity problems in parallel, 202-211 [Zbl 0974.05073] \textit{Ryabko, Boris; Fionov, Andrey}, Homophonic coding with logarithmic memory size, 253-262 [Zbl 1125.94329] \textit{Möhring, Rolf H.; Müller-Hannemann, Matthias}, Complexity and modeling aspects of mesh refinement into quadrilaterals, 263-272 [Zbl 0888.65009] \textit{Ott, Matthias; Stephan, Frank}, The complexity of learning branches and strategies from queries, 283-292 [Zbl 0886.68113] \textit{Haxell, P. E.; Loebl, M.}, On defect sets in bipartite graphs (extended abstract), 334-343 [Zbl 0910.05063] \textit{Kao, Ming-Yang; Lam, Tak Wah; Sung, Wing Kin; Ting, Hing Fung}, All-cavity maximum matchings, 364-373 [Zbl 0892.05043] \textit{Kellerer, Hans; Pferschy, Ulrich; Speranza, Maria Grazia}, An efficient approximation scheme for the subset-sum problem, 394-403 [Zbl 0888.90123]