Algorithms and computation. 3rd international symposium, ISAAC '92. Nagoya, Japan, December 16--18, 1992. Proceedings (Q2565244)

The articles of this volume will be reviewed individually. Indexed articles: \textit{Chen, Maw Hwa; Lee, Sing-Ling}, Linear time algorithms for \(k\)-cutwidth problem, 21-30 [Zbl 0925.05058] \textit{Watanabe, Toshimasa; Mashita, Toshiya; Taoka, Satoshi}, The \(k\)-edge-connectivity augmentation problem of weighted graphs, 31-40 [Zbl 0925.05061] \textit{Patkar, Sachin; Narayanan, H.}, Principal lattice of partitions of submodular functions on graphs: Fast algorithms for principal partition and generic rigidity, 41-50 [Zbl 0925.05066] \textit{Halldorsson, Magnus M.}, Parallel and on-line graph coloring algorithms, 61-70 [Zbl 0925.05060] \textit{Ho, Jan Ming; Ko, M. T.; Ma, Tze Heng; Sung, Ting Yi}, Algorithms for rectilinear optimal multicast tree problem, 106-115 [Zbl 0925.05050] \textit{Kloks, Ton; Bodlaender, Hans}, Approximating tree width and pathwidth of some classes of perfect graphs, 116-125 [Zbl 0925.05052] \textit{Ueno, Shuichi; Yamazaki, Michihiro; Kajitani, Yoji}, Graph spanners and connectivity, 126-134 [Zbl 0915.05078] \textit{Book, Ronald V.}, Relativizations of the \({\text P}\overset {?}=\text{NP}\) and other problems: Some developments in structural complexity theory, 175-186 [Zbl 0915.03035] \textit{Sugihara, Kōkichi}, Topologically consistent algorithms related to convex polyhedra, 209-218 [Zbl 0925.52004] \textit{Itoh, Toshiya; Horikawa, Kenji}, On the complexity of composite numbers, 229-238 [Zbl 0925.94091] \textit{Kobayashi, Kojiro}, On malign input distributions for algorithms, 239-248 [Zbl 0925.68215] \textit{Arvind, V.; Koebler, J.; Mundhenk, M.}, Lowness and the complexity of sparse and tally descriptions, 249-258 [Zbl 0925.68214] \textit{Wang, Jie; Belanger, Jay}, Honest iteration schemes of randomizing algorithms, 259-268 [Zbl 0925.68213] \textit{Akutsu, Tatsuya}, Algorithms for determining the geometrical congruity in two and three dimensions, 279-288 [Zbl 0925.68436] \textit{Jennings, Esther; Lingas, Andrzej}, On the relationships among constrained geometric structures, 289-298 [Zbl 0925.68391] \textit{Madlener, Klaus; Otto, Friedrich; Sattler-Klein, Andrea}, Generating small convergent systems can be extremely hard, 299-308 [Zbl 0925.68243] \textit{Ogawa, Mizuhito}, Chew's theorem revisited: Uniquely normalizing property of nonlinear term rewriting systems, 309-318 [Zbl 0925.03096] \textit{Takahashi, Junya; Suzuki, Hitoshi; Nishizeki, Takao}, Algorithms for finding noncrossing paths with minimum total length in plane graphs, 400-409 [Zbl 0925.05064] \textit{Longpré, Luc; Watanabe, Osamu}, On symmetry of information and polynomial time invertibility, 410-419 [Zbl 0925.68181] \textit{Beigel, Richard; Tarui, Jun; Toda, Seinosuke}, On probabilistic ACC circuits with an exact-threshold output gate, 420-429 [Zbl 0925.94110] \textit{Kurosawa, Kaoru; Watanabe, Osamu}, Computational and statistical indistinguishabilities, 430-438 [Zbl 0925.68178] \textit{Fu, Bin; Li, Hong Zhou}, On symmetric differences of NP-hard sets with weakly-P-selective sets, 439-448 [Zbl 0925.68180]