Computing and combinatorics. 6th annual international conference, COCOON 2000, Sydney, Australia, July 26--28, 2000. Proceedings (Q1572747)

The articles of mathematical interest will be reviewed individually. The preceding conference (5th, 1999) has been indicated (see Zbl 0918.00033). Indexed articles: \textit{Papadimitriou, Christos H.}, Theoretical problems related to the Internet (extended abstract), 1-2 [Zbl 0988.68750] \textit{Brent, Richard P.}, Recent progress and prospects for integer factorisation algorithms, 3-22 [Zbl 0988.11056] \textit{Aurenhammer, Franz; Katoh, Naoki; Kojima, Hiromichi; Ohsaki, Makoto; Xu, Yinfeng}, Approximating uniform triangular meshes in polygons, 23-33 [Zbl 0988.68198] \textit{Duckworth, William; Wormald, Nicholas C.; Zito, Michele}, Maximum induced matchings of random cubic graphs, 34-43 [Zbl 0989.05114] \textit{Barequet, Gill}, A duality between small-face problems in arrangements of lines and Heilbronn-type problems, 44-53 [Zbl 0988.68201] \textit{Hernando, Carmen; Houle, Michael E.; Hurtado, Ferran}, On local transformation of polygons with visibility properties, 54-63 [Zbl 0988.68200] \textit{Di Battista, Giuseppe; Liotta, Giuseppe; Lubiw, Anna; Whitesides, Sue}, Embedding problems for paths with direction constrained edges, 64-73 [Zbl 0988.68633] \textit{Healy, Patrick; Kuusik, Ago; Leipert, Sebastian}, Characterization of level non-planar graphs by minimal patterns, 74-84 [Zbl 0988.68631] \textit{Rahman, Md. Saidur; Nakano, Shin-ichi; Nishizeki, Takao}, Rectangular drawings of plane graphs without designated corners (extended abstract), 85-94 [Zbl 0988.68638] \textit{Mutzel, Petra; Weiskircher, René}, Computing optimal embeddings for planar graphs, 95-104 [Zbl 0988.68632] \textit{Chen, Zhi-Zhong}, Approximation algorithms for independent sets in map graphs, 105-114 [Zbl 0989.05110] \textit{Chen, Zhi-Zhong; He, Xin}, Hierarchical topological inference on planar disc maps, 115-125 [Zbl 0988.68199] \textit{Lin, Yaw-Ling; Hsu, Fang Rong; Tsai, Yin-Te}, Efficient algorithms for the minimum connected domination of trapezoid graphs, 126-136 [Zbl 0989.05112] \textit{Khot, Subhash; Raman, Venkatesh}, Parameterized complexity of finding subgraphs with hereditary properties, 137-147 [Zbl 0988.68081] \textit{Reznik, Yuriy A.}, Some results on tries with adaptive branching, 148-158 [Zbl 0988.68056] \textit{Cicalese, Ferdinando; Mundici, Daniele}, Optimal coding with one asymmetric error: Below the sphere packing bound, 159-169 [Zbl 0996.94054] \textit{Zheng, Xizhong}, Closure properties of real number classes under limits and computable operators, 170-179 [Zbl 0988.03064] \textit{Dinneen, Michael J.; Xiong, Liu}, A characterization of graphs with vertex cover six, 180-192 [Zbl 0989.05109] \textit{Miller, Mirka; Slamin}, On the monotonicity of minimum diameter with respect to order and maximum out-degree, 193-201 [Zbl 0988.68134] \textit{Halldórsson, Magnús M.; Iwama, Kazuo; Miyazaki, Shuichi; Taketomi, Shiro}, Online independent sets, 202-209 [Zbl 0988.68568] \textit{Fujita, Satoshi; Hada, Takeshi}, Two-dimensional on-line bin packing problem with rotatable items, 210-220 [Zbl 0988.68836] \textit{Bach, Eric; Boyar, Joan; Jiang, Tao; Larsen, Kim S.; Lin, Guo-Hui}, Better bounds on the accomodating ratio for the seat reservation problem (extended abstract), 221-231 [Zbl 0988.68837] \textit{Tan, Zhiyi; He, Yong}, Ordinal on-line scheduling on two uniform machines, 232-241 [Zbl 0988.68017] \textit{Ghosh, Sukumar}, Agents, distributed algorithms, and stabilization, 242-251 [Zbl 0988.68664] \textit{Shiau, Shyue-Horng; Yang, Chang-Biau}, A fast sorting algorithm and its generalization on broadcast communications, 252-261 [Zbl 0988.68548] \textit{Kim, Sung-Ryul; Park, Kunsoo}, Efficient list ranking algorithms on reconfigurable mesh, 262-271 [Zbl 0988.68692] \textit{Tiskin, Alexandre}, Tripoids do not pack densely, 272-280 [Zbl 0988.68636] \textit{Nandy, Subhas C.}, An efficient \(k\) nearest neighbor searching algorithm for a query line, 281-290 [Zbl 0988.68549] \textit{Wang, Cao An; Yang, Boting}, Tetrahedralization of two nested convex polyhedra, 291-298 [Zbl 0988.68635] \textit{Kim, Sung Kwon; Shin, Chan-Su}, Efficient algorithms for two-center problems for a convex polygon (extended abstract), 299-309 [Zbl 0988.68637] \textit{Deng, Xiaotie; Li, Zhongfei; Wang, Shouyang}, On computation of arbitrage for markets with friction, 310-319 [Zbl 1087.91508] \textit{Qin, Zhongping; Xu, Yinfeng; Zhu, Binhai}, On some optimization problems in obnoxious facility location, 320-329 [Zbl 1039.90037] \textit{Ruskey, Frank; Sawada, Joe}, Generating necklaces and strings with forbidden substrings, 330-339 [Zbl 0988.68570] \textit{Klau, Gunnar W.; Mutzel, Petra}, Optimal labelling of point features in the slider model (extended abstract), 340-350 [Zbl 0988.68634] \textit{Bertossi, Alan A.; Pinotti, M. Cristina}, Mappings for conflict-free access of paths in elementary data structures, 351-361 [Zbl 0988.68546] \textit{Takaoka, Tadao}, Theory of trinomial heaps, 362-372 [Zbl 0988.68547] \textit{Oswald, Marcus; Reinelt, Gerhard}, Polyhedral aspects of the consecutive ones problem, 373-382 [Zbl 1039.90041] \textit{Weis, Stephan; Reischuk, Rüdiger}, The complexity of physical mapping with strict chimerism, 383-395 [Zbl 0994.68072] \textit{Ono, Hirotaka; Makino, Kazuhisa; Ibaraki, Toshihide}, Logical analysis of data with decomposable structures, 396-406 [Zbl 0988.68545] \textit{Cheung H. C., Shirley}, Learning from approximate data, 407-415 [Zbl 0988.68553] \textit{Safavi-Naini, Reihaneh; Wang, Yejing}, A combinatorial approach to asymmetric traitor tracing, 416-425 [Zbl 0995.94526] \textit{Di Crescenzo, Giovanni}, Removing complexity assumptions from concurrent zero-knowledge proofs (extended abstract), 426-435 [Zbl 0994.94520] \textit{Yamasaki, Tomohiro; Kobayashi, Hirotada; Tokunaga, Yuuki; Imai, Hiroshi}, One-way probabilistic reversible and quantum one-counter automata, 436-446 [Zbl 0988.68098] \textit{Jiang, Zhuhan; Litow, Bruce; de Vel, Olivier}, Similarity enrichment in image compression through weighted finite automata, 447-456 [Zbl 0988.68639] \textit{Yamamoto, Hiroaki}, On the power of input-synchronized alternating finite automata, 457-466 [Zbl 0988.68097] \textit{Nakanishi, Masaki; Hamaguchi, Kiyoharu; Kashiwabara, Toshinobu}, Ordered quantum branching programs are more powerful than ordered probabilistic branching programs under a bounded-width restriction, 467-476 [Zbl 0988.68071]