List of accepted papers (according to the order they were submitted)

        52 out of 114 papers are accepted, acceptance rate = 45.6%

006: The Specker-Blatter theorem revisited: generating functions for definable classes of structures. 
	Authors: E. Fischer and J. Makowsky. 

007: On the full and bottleneck full Steiner tree problem. 
	Authors: Yen Hung Chen, Chin Lung Lu and Chuan Yi Tang. 

008: On the divergence bounded computable real numbers. 
	Authors: Xizhong Zheng. 

009: Group mutual exclusion algorithms based on ticket orders. 
	Authors: M. Takamura and Y. Igarashi. 

012: Tetris is hard, even to approximate.
	Authors: E. Demaine, S. Hohenberger and D. Liben-Nowell. 

015: On constrained minimum pseudotriangulations.
	Authors: G. Rote, C-A Wang, L. Wang and Y. Xu. 

018: The structure and number of global roundings of a graph.
	Authors: T. Asano, N. Katoh, H. Tamaki and T. Tokuyama. 

019: On spectral graph drawing.
	Authors: Yehuda Koren. 

022: Approximate MST for UDG locally.
	Authors: Xiang-Yang Li. 

023: Efficient construction of low weight bounded degree planar spanner.
	Authors: Xiang-Yang Li and Yu Wang. 

026: Pairwise data clustering and applications.
	Authors: Xiaodong Wu, Danny Chen, James Mason and Steven Schmid. 

027: Petri nets with simple circuits.
	Authors: Hsu-Chun Yen and Lien-Po Yu. 

028: List total colorings of series-parallel graphs.
	Authors: Xiao Zhou, Yuki Matsuo and Takao Nishizeki. 

034: Matroid representation of clique complexes.
	Authors: Kenji Kashiwabara, Yoshio Okamoto and Takeaki Uno. 

036: A space efficient algorithm for sequence alignment with inversions.
	Authors: Yong Gao, Junfeng Wu, R. Niewiadomski, Yang Wang, Z-Z Chen and Guohui Lin. 

038: Scheduling broadcasts with deadlines.
	Authors: Jae-Hoon Kim and Kyung-Yong Chwa. 

040: Fault-Hamiltonicity of product graph of path and cycle.
	Authors: Jung-Heum Park and Hee-Chul Kim. 

042: Double digest revisited: complexity and approximability in the presence of noisy data.
	Authors: Mark Cieliebak, Stephan Eidenbenz and Gerhard Woeginger. 

043: Covering a set of points with a minimum number of turns.
	Authors: Michael Collins. 

045: On even triangulations of 2-connected embedded graphs.
	Authors: Huaming Zhang and Xin He. 

047: Distributed algorithm for better approximation of the maximum matching.
	Authors: A. Czygrinow and M. Hanckowiak. 

049: How to obtain the complete list of caterpillars.
	Authors: Yosuke Kikuchi, Hiroyuki Tanaka, Shin-ichi Nakano and Yukio Shibata. 

050: On proving circuit lower bounds against the polynomial-time hierarchy: positive and negative results.
	Authors: Jin-Yi Cai and Osamu Watanabe. 

053: Improved competitiveness algorithms for online scheduling with partial job values.
	Authors: Francis Chin and Stanley Fung. 

055: Finding hidden independent sets in interval graphs.
	Authors: Theresa Biedl, Brona Brejova, Erik Demaine, Angele Hamel, Alex Lopez-Ortiz and Tomas Vinar. 

056: Efficient data mappings for parity-declustered data layouts.
	Authors: Eric Schwabe and Ian Sutherland. 

058: Approximate Rank Aggregation.
	Authors: Xiaotie Deng, Qizhi Fang and Shanfeng Zhu. 

065: The complexity of boolean matrix root computation.
	Authors: Martin Kutz. 

067: A fast bit-parallel algorithm for matching extended regular expressions.
	Authors: Hiroaki Yamamoto and Takashi Miyazaki. 

068: Optimal MST maintenance for transient deletion of every node in planar graphs.
	Authors: Carlo Gaibisso, Guido Proietti and Richard Tan. 

070: Randomized approximation of the stable marriage problem.
	Authors: Magnus Halldorsson, Kazuo Iwama, Shuichi Miyazaki and Hiroki Yanagisawa. 

073: On the similarity of sets of permutations and its applications to genome comparison.
	Authors: Anne Bergeron and Jens Stoye. 

074: Subexponential-time algorithms for maximum independent set and related problems on box graphs.
	Authors: Andrzej Lingas and Martin Wahlen. 

084: Isoperimetric inequalities and the width parameters of graphs
	Authors: Sunil Chandran, T. Kavitha and C.R. Subramanian. 

085: On a conjecture on Wiener indices in combinatorial chemistry.
	Authors: Yih-Eh Ban, Sergei Bespamyatnikh and Nabil Mustafa. 

086: Fast and space-efficient location of heavy or dense segments in run-length encoded sequences.
	Authors: Ronald Greenberg. 

087: Perturbation of the hyper-linked environment.
	Authors: Hyun Chul Lee and Allan Borodin. 

088: Sparse parity-check matrices over finite fields.
	Authors: Hanno Lefmann. 

089: Automatic verification of multi-queue discrete timed automata.
	Authors: Pierluigi Pietro and Zhe Dang. 

093: Complexity theoretic aspects of some cryptographic functions.
	Authors: Eike Kiltz and Hans Ulrich Simon. 

094: On all-substrings alignment problems.
	Authors: Wei Fu, Wing-Kai Hon and Wing-Kin Sung. 

095: Area-efficient order-preserving planar straight-line drawings of ordered trees.
	Authors: Ashim Garg and Adrian Rusu. 

097: Graph coloring and the immersion order.
	Authors: Faisal Abu-Khzam and Michael Langston. 

099: Bounds for convex crossing numbers.
	Authors: Farhad Shahrokni, Ondrej Sykora, Laszlo Szekely and Imrich Vrto. 

102: Genomic distances under deletions and insertions.
	Authors: Mark Marron, Krister Swenson and Bernard Moret. 

103: Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable.
	Authors: Stefan Szeider. 

105: Cylindrical hierarchy for deforming necklaces.
	Authors: Sergei Bespamyatnikh. 

106: Quantum sampling for balanced allocations.
	Authors: Kazuo Iwama, Akinori Kawachi and Shigeru Yamashita.

107: Fast construction of generalized suffix trees over a very large alphabet.
	Authors: Zhixiang Chen, Richard Fowler, Ada Fu and Chunyue Wang.

111: Majority equilibrium for public facility allocation.
	Authors: Lihua Chen, Xiaotie Deng, Qizhi Fang and Feng Tian. 

112: Geometric algorithms for agglomerative hierarchical clustering.
	Authors: Danny Chen and Bin Xu. 

113: Traveling salesman problem of segments.
	Authors: Jinhui Xu, Yang Yang and Zhiyong Lin.