- Konstantin Kutzkov:
**New upper bound for the #3-SAT problem.**1-5

- Erfang Shan, T. C. Edwin Cheng, Liying Kang:
**Absorbant of generalized de Bruijn digraphs.**6-11

- Jia Jie Liu, Guan-Shieng Huang, Yue-Li Wang, Richard C. T. Lee:
**Edit distance for a run-length-encoded string and an uncompressed string.**12-16

- Pratik Worah, Sandeep Sen:
**A linear time deterministic algorithm to find a small subset that approximates the centroid.**17-19

- Lun-Min Shih, Jimmy J. M. Tan, Lih-Hsing Hsu:
**Edge-bipancyclicity of conditional faulty hypercubes.**20-25

- Tetsuo Asano:
**Aspect-ratio Voronoi diagram and its complexity bounds.**26-31

- Holger Petersen:
**String matching with simple devices.**32-34

- Dawei Hong:
**Analysis of noise-induced phase synchronization in nervous systems: from algorithmic perspective.**35-39

- Tian-Ming Bu, Xiaotie Deng, Qi Qi:
**Forward looking Nash equilibrium for keyword auction.**41-46

- Robert L. Scot Drysdale, Asish Mukhopadhyay:
**An O(nlogn) algorithm for the all-farthest-segments problem for a planar set of points.**47-51

- Yuri Breitbart, Hassan Gobjuka:
**Characterization of layer-2 unique topologies.**52-57

- Asish Mukhopadhyay, Chanchal Kumar, Eugene Greene, Binay K. Bhattacharya:
**On intersecting a set of parallel line segments with a convex polygon of minimum area.**58-64

- Guillaume Fertin, André Raspaud:
**Acyclic coloring of graphs of maximum degree five: Nine colors are enough.**65-72

- Sergio Cabello, Panos Giannopoulos, Christian Knauer:
**On the parameterized complexity of d-dimensional point set pattern matching.**73-77

- Prashant Sasatte:
**Improved FPT algorithm for feedback vertex set problem in bipartite tournament.**79-82

- Peyman Afshani, Hamed Hatami:
**Approximation and inapproximability results for maximum clique of disc graphs in high dimensions.**83-87

- Nattapat Attiratanasunthron, Jittat Fakcharoenphol:
**A running time analysis of an Ant Colony Optimization algorithm for shortest paths in directed acyclic graphs.**88-92

- Frank Nielsen, Richard Nock:
**On the smallest enclosing information disk.**93-97

- Gabriela Araujo, József Balogh, Ruy Fabila Monroy, Gelasio Salazar, Jorge Urrutia:
**A note on harmonic subgraphs in labelled geometric graphs.**98-102

- Hamid Zarrabi-Zadeh:
**Flying over a polyhedral terrain.**103-107

- Farshad Rostamabadi, Iman Sadeghi, Mohammad Ghodsi, Ramtin Khosravi:
**Optimal point removal in closed-2PM labeling.**108-113

- Yijie Han:
**A note of an O(n**114-116^{3}/logn) time algorithm for all pairs shortest paths.

- Jyh-haw Yeh:
**A secure time-bound hierarchical key assignment scheme based on RSA public key cryptosystem.**117-120

- Jana Dietel, Hans-Dietrich Hecker, Andreas Spillner:
**A note on optimal floodlight illumination of stages.**121-123

- Graham Farr, Johannes Schmidt:
**On the number of Go positions on lattice graphs.**124-130

- A. Kooshesh, B. Ravikumar:
**Efficient implementation of algorithms for approximate exponentiation.**131-137

- Ohad Lipsky, Ely Porat:
**Approximate matching in the L**138-140_{infinity}metric.

- Ohad Lipsky, Ely Porat:
**L**141-143_{1}pattern matching lower bound.

- Inge Li Gørtz:
**Asymmetric k-center with minimum coverage.**144-149

- Sushmita Gupta:
**Feedback arc set problem in bipartite tournaments.**150-154

- Chris H. Hamilton, Andrew Rau-Chaplin:
**Compact Hilbert indices: Space-filling curves for domains with unequal side lengths.**155-163

- Gábor Salamon, Gábor Wiener:
**On finding spanning trees with few leaves.**164-169

- Frank Gurski:
**Polynomial algorithms for protein similarity search for restricted mRNA structures.**170-176

- Hsin-Hao Lai, Gerard J. Chang, Ko-Wei Lih:
**On fully orientability of 2-degenerate graphs.**177-181

- Szymon Grabowski, Kimmo Fredriksson:
**Bit-parallel string matching under Hamming distance in O(n[m/w]) worst case time.**182-187

- Kuo-Si Huang, Chang-Biau Yang, Kuo-Tsung Tseng, Hsing-Yen Ann, Yung-Hsing Peng:
**Efficient algorithms for finding interleaving relationship between sequences.**188-193

- Markus Bläser, Thomas Heynen, Bodo Manthey:
**Adding cardinality constraints to integer programs with applications to maximum satisfiability.**194-198

- Pavlos Efraimidis:
**The complexity of linear programming in (gamma, kappa)-form.**199-201

- Sun-Yuan Hsieh, Chih-Sheng Cheng:
**Finding a maximum-density path in a tree under the weight and length constraints.**202-205

- Yingqian Wang, Huajing Lu, Ming Chen:
**A note on 3-choosability of planar graphs.**206-211

- Stefano Crespi-Reghizzi, Matteo Pradella:
**A CKY parser for picture grammars.**213-217

- Costas S. Iliopoulos, Mohammad Sohel Rahman:
**Faster index for property matching.**218-223

- Dror Aiger, Klara Kedem:
**Applying graphics hardware to achieve extremely fast geometric pattern matching in two and three dimensional transformation space.**224-230

- Xingjuan Cai, Zhihua Cui, Jianchao Zeng, Ying Tan:
**Dispersed particle swarm optimization.**231-235

- Ulrich Kühn:
**Breaking the Shin-Shin-Rhee remotely keyed encryption schemes.**236-240

- Amy Glen, Aaron Lauve, Franco V. Saliola:
**A note on the Markoff condition and central words.**241-244

- Sreyash Kenkre, Sundar Vishwanathan:
**The common prefix problem on trees.**245-248

- A. Álvarez, Sergio Arévalo, Vicent Cholvi, Antonio Fernández, Ernesto Jiménez:
**On the interconnection of message passing systems.**249-254