Algorithms and computation. 14th international symposium, ISAAC 2003, Kyoto, Japan, December 15--17, 2003. Proceedings
type: Item
instance of: scholarly article
title: Algorithms and computation. 14th international symposium, ISAAC 2003, Kyoto, Japan, December 15--17, 2003. Proceedings
zbMATH Open document ID: 1029.00053
published in: Lecture Notes in Computer Science
publication date: 2004-01-11T00:00:00Z
full work available at URL: t2906.htm
review text: The articles of this volume will be reviewed individually. The preceding symposium has been reviewed (see Zbl 1007.00050). Indexed articles: \textit{Nishizeki, Takao}, Drawing plane graphs, 2-5 [Zbl 1205.68267] \textit{Chun, Jinhee; Sadakane, Kunihiko; Tokuyama, Takeshi}, Linear time algorithm for approximating a curve by a single-peaked curve, 6-15 [Zbl 1205.68459] \textit{Maheshwari, Anil; Smid, Michiel}, A dynamic dictionary for priced information with application, 16-25 [Zbl 1205.68131] \textit{Nishida, Tetsushi; Sugihara, Kokichi}, Voronoi diagram in the flow field, 26-35 [Zbl 1205.68469] \textit{Daescu, Ovidiu; Mi, Ningfang}, Polygonal path approximation: a query based approach, 36-46 [Zbl 1205.68461] \textit{Berry, Anne; Heggernes, Pinar; Villanger, Yngve}, A vertex incremental approach for dynamically maintaining chordal graphs, 47-57 [Zbl 1205.68256] \textit{Yamaguchi, Atsuko; Mamitsuka, Hiroshi}, Finding the maximum common subgraph of a partial \(k\)-tree and a graph with a polynomially bounded number of spanning trees, 58-67 [Zbl 1205.68270] \textit{Gerstel, Ori; Kutten, Shay; Matichin, Rachel; Peleg, David}, Hotlink enhancement algorithms for web directories, 68-77 [Zbl 1205.68070] \textit{Lin, Rung-Ren; Kuo, Wen-Hsiung; Chao, Kun-Mao}, Finding a length-constrained maximum-density path in a tree, 78-87 [Zbl 1205.68265] \textit{Manthey, Bodo; Reischuk, Rüdiger}, The intractability of computing the Hamming distance, 88-97 [Zbl 1205.68173] \textit{Beigel, Richard; Fortnow, Lance; Stephan, Frank}, Infinitely-often autoreducible sets, 98-107 [Zbl 1205.68161] \textit{Sung, Shao Chin; Tanaka, Keisuke}, Limiting negations in bounded-depth circuits: an extension of Markov's theorem, 108-116 [Zbl 1205.68176] \textit{Yamakami, Tomoyuki}, Computational complexity measures of multipartite quantum entanglement, 117-128 [Zbl 1205.81065] \textit{Valiente, Gabriel}, A new simple algorithm for the maximum-weight independent set problem on circle graphs, 129-137 [Zbl 1205.…
Mathematics Subject Classification ID: 00B25
Mathematics Subject Classification ID: 68-06
Mathematics Subject Classification ID: 68Wxx
zbMATH DE Number: 2024507
zbMATH Keywords: Algorithms
zbMATH Keywords: Computation
zbMATH Keywords: ISAAC 2003
zbMATH Keywords: Kyoto (Japan)
MaRDI profile type: Publication
OpenAlex ID: W1769833081
DOI: 10.1007/B94771
description: scientific article; zbMATH DE number 2024507