Computing and combinatorics. 5th annual international conference. COCOON '99, Tokyo, Japan, July 26--28, 1999. Proceedings (Q1296331)

The articles of mathematical interest will be reviewed individually. The preceding conference (4th, 1998) has been announced (see Zbl 0895.00047). Indexed articles: \textit{Tarui, Jun; Toda, Seinosuke}, Some observations on the computational complexity of graph accessibility problem. (Extended abstract), 18-30 [Zbl 0942.68582] \textit{Nagamochi, Hiroshi; Ibaraki, Toshihide}, An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree, 31-40 [Zbl 0955.68085] \textit{Lin, Guo-Hui; Xue, Guoliang}, Signed genome rearrangement by reversals and transpositions: Models and approximations, 71-80 [Zbl 0945.92007] \textit{Cai, Jin-Yi}, A new transference theorem in the geometry of numbers, 113-122 [Zbl 0995.11042] \textit{Damm, Carsten; Kim, Ki Hang; Roush, Fred}, On covering and rank problems for Boolean matrices and their applications, 123-133 [Zbl 0939.05020] \textit{Mahajan, Meena; Subramanya, P. R.; Vinay, V.}, A combinatorial algorithm for Pfaffians, 134-143 [Zbl 0946.05056] \textit{Nardelli, Enrico; Proietti, Guido; Widmayer, Peter}, How to swap a failing edge of a single source shortest paths tree, 144-153 [Zbl 0955.68086] \textit{Bezrukov, S. L.; Elsässer, R.; Schroeder, U.-P.}, On bounds for the \(k\)-partitioning of graphs, 154-163 [Zbl 0949.05042] \textit{Nagamochi, Hiroshi; Katayama, Shigeki; Ibaraki, Toshihide}, A faster algorithm for computing minimum 5-way and 6-way cuts in graphs, 164-173 [Zbl 0938.05057] \textit{Ambainis, Andris; Bonner, Richard; Freivalds, Rūsiņš; Ķikusts, Arnolds}, Probabilities to accept languages by quantum finite automata, 174-183 [Zbl 0944.68118] \textit{Amano, Kazuyuki; Maruoka, Akira; Tarui, Jun}, On the negation-limited circuit complexity of merging, 204-209 [Zbl 0953.94043] \textit{Miltersen, Peter Bro; Vinodchandran, N. V.; Watanabe, Osamu}, Super-polynomial versus half-exponential circuit size in the exponential hierarchy, 210-220 [Zbl 0944.68074] \textit{Halldórsson, Magnús M.}, Approximations of weighted independent set and hereditary subset problems, 261-270 [Zbl 0945.68146] \textit{Bernasconi, Anna; Damm, Carsten; Shparlinski, Igor E.}, On the average sensitivity of testing square-free numbers., 291-299 [Zbl 1133.11320] \textit{Zheng, Xizhong}, Binary enumerability of real numbers. (Extended abstract), 300-309 [Zbl 0941.03048] \textit{Cooperman, Gene; Feisel, Sandra; von zur Gathen, Joachim; Havas, George}, GCD of many integers. (Extended abstract), 310-317 [Zbl 0977.11055] \textit{Jurdziński, Tomasz; Kutyłowski, Mirosław; Loryś, Krzysztof}, Multi-party finite computations, 318-329 [Zbl 0945.68066] \textit{Nakata, Toshio; Imahayashi, Hiroshi; Yamashita, Masafumi}, Probabilistic local majority voting for the agreement problem on finite graphs, 330-338 [Zbl 0938.91013] \textit{Uno, Takeaki}, A new approach for speeding up enumeration algorithms and its application for matroid bases, 349-359 [Zbl 0944.68075] \textit{Matsubayashi, Akira; Takasu, Ryo}, Minimum congestion embedding of complete binary trees into tori, 370-378 [Zbl 0955.68087] \textit{Otto, Friedrich}, On s-regular prefix-rewriting systems and automatic structures, 422-431 [Zbl 0944.68086] \textit{Hirata, Kouichi; Yamada, Keizo; Harao, Masateru}, Tractable and intractable second-order matching problems, 432-441 [Zbl 0944.68087] \textit{Lau, H. Y.; Ting, H. F.}, The greedier the better: An efficient algorithm for approximating maximum independent sets, 483-492 [Zbl 0939.05076]