Algorithms and computation. 9th international symposium, ISAAC '98. Taejon, Korea, December 14--16, 1998. Proceedings (Q1273580)

The articles of mathematical interest will be reviewed individually. The preceding conference (8th, 1997) has been announced (see Zbl 0879.00060). Indexed articles: \textit{Eiter, Thomas; Ibaraki, Toshihide; Makino, Kazuhisa}, Disjunctions of Horn theories and their cores, 49-58 [Zbl 0923.03055] \textit{Mutzel, Petra; Weiskircher, René}, Two-layer planarization in graph drawing, 69-78 [Zbl 0948.68136] \textit{Ishii, Toshimasa; Nagamochi, Hiroshi; Ibaraki, Toshihide}, \(k\)-edge and 3-vertex connectivity augmentation in an arbitrary multigraph, 159-168 [Zbl 0947.68114] \textit{Nagamochi, Hiroshi; Ibaraki, Toshihide}, Polyhedral structure of submodular and posi-modular systems, 169-178 [Zbl 0923.90124] \textit{Lam, Tak Wah; Ting, Hing Fung}, Selecting the \(k\) largest elements with parity tests, 189-198 [Zbl 0936.68056] \textit{Mihara, Takashi; Sung, Shao Chin}, A quantum polynomial time algorithm in worst case for Simon's problem, 229-236 [Zbl 0930.68059] \textit{Nock, Richard; Jappy, Pascal; Sallantin, Jean}, Generalized graph colorability and compressibility of Boolean formulae, 237-246 [Zbl 0930.68138] \textit{Lange, Klaus-Jörn; McKenzie, Pierre}, On the complexity of free monoid morphisms, 247-256 [Zbl 0930.68081] \textit{Hsieh, Sun-Yuan; Ho, Chin-Wen; Hsu, Tsan-Sheng; Ko, Ming-Tat; Chen, Gen-Huey}, Characterization of efficiently solvable problems on distance-hereditary graphs, 257-266 [Zbl 0947.68115] \textit{Lin, Yaw-Ling}, Fast algorithms for independent domination and efficient domination in trapezoid graphs, 267-276 [Zbl 0923.05032] \textit{Hong, Seok-Hee; Eades, Peter; Lee, Sang-Ho}, Finding planar geometric automorphisms in planar graphs (extended abstract), 277-286 [Zbl 0923.05022] \textit{Akutsu, Tatsuya}, Approximation and exact algorithms for RNA secondary structure prediction and recognition of stochastic context-free languages, 337-346 [Zbl 0924.92008] \textit{Fellows, Michael; Hallett, Michael; Stege, Ulrike}, On the multiple gene duplication problem, 347-356 [Zbl 0924.92016] \textit{Hamaguchi, Shin-ya; Katoh, Naoki}, A capacitated vehicle routing problem on a tree, 397-406 [Zbl 0922.90057] \textit{Zhou, Xiao; Nishizeki, Takao}, The edge-disjoint paths problem is NP-complete for partial \(k\)-trees, 417-426 [Zbl 0947.68078] \textit{Nagamochi, Hiroshi; Hasunuma, Toru}, An efficient \({\mathcal NC}\) algorithm for a sparse \(k\)-edge-connectivity certificate, 447-456 [Zbl 0947.68116] \textit{Diaz, J.; Petit, J.; Psycharis, P.; Serna, M.}, A parallel algorithm for sampling matchings from an almost uniform distribution, 457-466 [Zbl 0947.68171]