Office of Academic Resources
Chulalongkorn University
Chulalongkorn University

Home / Help

AuthorCOCOON 2003 (2003 : Big Sky, Mont.)
TitleComputing and combinatorics : 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003 : proceedings / Tandy Warnow, Binhai Zhu (eds.)
Imprint Berlin : Springer, c2003
Descript xiii, 560 p. : ill. ; 24 cm

CONTENT

Liar! / Joel Spencer -- Experiments for algorithm engineering / Jon Bentley -- Empirical exploration of perfect phylogeny haplotyping and haplotypers / Ren Hua Chung, Dan Gusfield -- Cylindrical hierarchy for deforming necklaces / Sergei Bespamyatnikh -- Geometric algorithms for agglomerative hierarchical clustering / Danny Z. Chen, Bin Xu -- Traveling salesman problem of segments / Jinhui Xu, Yang Yang, Zhiyong Lin -- Subexponential-time algorithms for maximum independent set and related problems on box graphs / Andrzej Lingas, Martin Wahlen -- A space efficient algorithm for sequence alignment with inversions / Yong Gao, Junfeng Wu, Robert Niewiadomski, Yang Wang, Zhi-Zhong Chen, Guohui Lin -- On the similarity of sets of permutations and its applications to genome comparison / Anne Bergeron, Jens Stoye -- On all-substrings alignment problems / Wei Fu, Wing-Kai Hon, Wing-Kin Sung -- The specker-blatter theorem revisited / E. Fischer, J. A. Makowsky -- On the divergence bounded computable real numbers / Xizhong Zheng -- Sparse parity-Check matrices over finite fields / Hanno Lefmann -- On the full and bottleneck full steiner tree problems / Yen Hung Chen, Chin Lung Lu, Chuan Yi Tang -- The structure and number of global roundings of a graph / Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama -- On even triangulations of 2-connected embedded graphs / Huaming Zhang, Xin He -- Petri nets with simple circuits / Hsu-Chun Yen, Lien-Po Yu -- Automatic verification of multi-queue discrete timed automata / Pierluigi San Pietro, Zhe Dang -- List total colorings of series-parallel graphs / Xiao Zhou, Yuki Matsuo, Takao Nishizeki -- Finding hidden independent sets in interval graphs / Therese Biedl, Brona Brejova, Erik D. Demaine, Angele M. Hamel, Alejandro Lopez-Ortiz, Tomas Vinar -- Matroid representation of clique complexes / Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno -- On proving circuit lower bounds against the polynomial-time hierarchy: Positive and negative results / Jin-Yi Cai, Osamu Watanabe -- The complexity of boolean matrix root computation / Martin Kutz -- A fast bit-parallel algorithm for matching extended regular expressions / Hiroaki Yamamoto, Takashi Miyazaki -- Group mutual exclusion algorithms based on ticket orders / Masataka Takamura, Yoshihide Igarashi -- Distributed algorithm for better approximation of the maximum matching / A. Czygrinow, M. Hanckowiak -- Efficient mappings for parity-declustered data layouts / Eric J. Schwabe, Ian M. Sutherland -- Approximate rank aggregation / Xiaotie Deng, Qizhi Fang, Shanfeng Zhu -- Perturbation of the hyper-linked environment / Hyun Chul Lee, Allan Borodin -- Fast construction of generalized suffix trees over a very large alphabet / Zhixiang Chen, Richard Fowler, Ada Wai-Chee Fu, Chunyue Wang -- Complexity theoretic aspects of some cryptographic functions / Eike Kiltz, Hans Ulrich Simon -- Quantum sampling for balanced allocations / Kazuo Iwama, Akinori Kawachi, Shigeru Yamashita -- Fault-hamiltonicity of product graph of path and cycle / Jung-Heum Park, Hee-Chul Kim -- How to obtain the complete list of caterpillars / Yosuke Kikuchi, Hiroyuki Tanaka, Shin-ichi Nakano, Yukio Shibata -- Randomized approximation of the stable marriage problem / Magnus Halldorsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa -- Tetris is hard, even to approximate / Erik D. Demaine, Susan Hohenberger, David Liben-Nowell -- Approximate MST for UDG locally / Xiang-Yang Li -- Efficient construction of low weight bounded degree planar spanner / Xiang-Yang Li, Yu Wang -- Isoperimetric inequalities and the width parameters of graphs / L. Sunil Chandran, T. Kavitha, C. R. Subramanian -- Graph coloring and the immersion order / Faisal N. Abu-Khzam, Michael A. Langston -- Optimal MST maintenance for transient deletion of every node in planar graphs / Carlo Gaibisso, Guido Proietti, Richard B. Tan -- Scheduling broadcasts with deadlines / Jae-Hoon Kim, Kyung-Yong Chwa -- Improved competitive algorithms for online scheduling with partial job values / Francis Y. L. Chin, Stanley P. Y. Fung -- Majority equilibrium for public facility allocation / Lihua Chen, Xiaotie Deng, Qizhi Fang, Feng Tian -- On constrained minimum pseudotriangulations / Gunter Rote, Cao An Wang, Lusheng Wang, Yinfeng Xu -- Pairwise data clustering and applications / Xiaodony Wu, Danny Z. Chen, James J. Mason, Steven R. Schmid -- Covering a set of points with a minimum number of turns / Michael J. Collins -- Area-efficient order-preserving planar straight-line drawings of ordered trees / Ashim Gorg, Adrian Rusu -- Bounds for convex crossing numbers / Farhad Shahrokhi, Ondrej Sykora, Laszlo A. Szekely, Imrich Vrt'o -- On spectral graph drawing / Yehuda Koren -- On a conjecture on wiener indices in combinatorial chemistry / Yin-En Andrew Ban, Sergei Bespamyatnikh, Nabil H. Mustafa -- Double digest revisited: complexity and approximability in the presence of noisy data / Mark Cieliebak, Stephan Eidenbenz, Gerhard J. Woeginger -- Fast and space-efficient location of heavy or dense segments in run-length encoded sequences / Ronald I. Greenberg -- Genomic distances under deletions and insertions / Mark Marron, Krister M. Swenson, Bernard M. E. Moret -- Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable / Stefan Szeider


Computer science -- Congresses Combinatorial analysis -- Congresses

LOCATIONCALL#STATUS
Central Library (4th Floor)004 C667C 2003CHECK SHELVES

Chulalinet's Book Delivery Request




Location



Office of Academic Resources, Chulalongkorn University, Phayathai Rd. Pathumwan Bangkok 10330 Thailand

Contact Us

Tel. 0-2218-2929,
0-2218-2927 (Library Service)
0-2218-2903 (Administrative Division)
Fax. 0-2215-3617, 0-2218-2907

Social Network

  line

facebook   instragram