49: Pei Shi Hui, Zhao Yong Zhe and Zhao Hong Wei.
Construct Public Key Encryption Scheme Using Ergodic Matrices over GF(2)

56: Sun-Yuan Hsieh, Huang-Ming Gao and Shih-Cheng Yang.
On the Internal Steiner Tree Problem

60: Yufeng Wang, Yoshiaki Hori and Kouichi SAKURAI.
Studying on economic-inspired mechanism for routing and forwarding in wireless Ad hoc network

64: Pan Li, Zhao Weidong, Wang Zhicheng and Wei Gang.
The Concurrently Enabled Transition Set Problem for Petri Nets is NP-complete

98: Wenbo Zhao.
Approximation to the Minimum Rooted Star Cover Problem

109: Boting Yang and Yi Cao.
Directed Searching Digraphs: Monotonicity and Complexity

114: Indranil Saha and Debapriyay Mukhopadhyay.
A Distributed Algorithm of Fault Recovery For Stateful Failover

131: Yingchao Zhao and Shanghua Teng.
Combinatorial and Spectral Aspects of Nearest Neighbor Graphs in Doubling Dimensional and Nearly-Euclidean Spaces

134: Feng Liu and Keqin Feng.
Efficient Computation of Algebraic Immunity of Symmetric Boolean Functions

141: Mariya Ivanova Soskova and S. Barry Cooper.
The Strongest Nonsplitting Theorem

148: Sun-Yuan Hsieh.
Path Embedding on Folded Hypercubes

151: Chuzo Iwamoto, Harumasa Yoneda, Kenichi Morita and Katsunobu Imai.
A Time Hierarchy Theorem for Nondeterministic Cellular Automata

163: Peng Zhang.
An Approximation Algorithm to the k-Steiner Forest Problem

172: Zhimin Li and Xiang Li.
Learnable Algorithm on the Continuum

173: Shin-ishi Nakano, Ryuhei Uehara and Takeaki Uno.
A New Approach to Graph Recognition and Applications to Distance Hereditary Graphs

176: Wangsen Feng, Li'ang Zhang, Wanling Qu and Hanpin Wang.
Approximation algorithms for maximum edge coloring problem

179: Shin-ishi Nakano, Ryuhei Uehara and Takeaki Uno.
Efficient Algorithms for Airline Problem

181: Angsheng Li.
Elementary Differences Among Jump Hierarchies

183: Rongquan Feng and Hongfeng Wu.
Encapsulated scalar multiplications and line functions in the computation of Tate pairings

184: Yatao Xu and Tanja Grubba.
Computability on Subsets of Locally Compact Spaces

191: Hiroki Morizumi and Jun Tarui.
Linear-Size Log-Depth Negation-Limited Inverter for $k$-tonic Binary Sequences

197: Marc Thurley.
Kernelizations for Parameterized Counting Problems

200: Sushmita Gupta.
Feedback Arc Set Problem in Bipartite Tournaments

204: Takaaki Mizuki, Yoshinori Kugimoto and Hideaki Sone.
Secure Multiparty Computations Using a Dial Lock

210: Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thoele and Henning Thomas.
Approximation Algorithms for 3D Orthogonal Knapsack

236: Jin Yi and Wenhui Zhang.
Enhancing Simulation for Checking Language Containment

255: Hong Ryoo and Kwangsoo Kim.
Separation of Data via Concurrently Determined Discriminant Functions

259: Cristina Tirnauca and Satoshi Kobayashi.
A Characterization of the Language Classes Learnable with Correction Queries

264: MV Panduranga Rao.
Bounding run-times of local adiabatic algorithms

280: Xiaoming hu and Shangteng huang.
A Provably Secure Blind Signature Scheme

283: S. Q. Zheng, Bing Yang and Enyue Lu.
A Comparative Study of Efficient Algorithms for Partitioning Sequences into Subsequences

285: Qi Cheng and Elizabeth Murray.
On Deciding Deep Holes of Reed-Solomon Codes

287: He Sun and Chung Keung Poon.
Two Improved Range-Efficient Estimating Algorithms

310: Michael Dom, Jiong Guo and Rolf Niedermeier.
Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems

312: QingShun Zhang and DaoYun Xu.
The Existence of Unsatisfiable Formulas in k-LCNF for k not less than 3

320: Minming Li, Ze Feng, Ronald L. Graham and Frances Yao.
Approximately Optimal Trees for Group Key Management with Batch Updates

327: Markus Hinkelmann, Andreas Jakoby and Peer Stechert.
t-Private and Secure Auctions

331: Decheng Ding, Klaus Weihrauch and Yongcheng wu.
Absolutely Non-Effective Predicates and Functions in Computable Analysis

332: Akifumi Kawaguchi and Hiroshi Nagamochi.
Orthogonal Drawings for Plane Graphs with Specified Face Areas

336: Joseph Wun-Tat Chan, Tak-Wah Lam, Kin-Sum Mak and Prudence W.H. Wong.
Online Deadline Scheduling with Bounded Energy Efficiency

337: Andreas Jakoby, Maciej Liskiewicz, Ruediger Reischuk and Christian Schindelhauer.
Improving the  Average Delay of Sorting

345: Conghua Zhou, Zhenyu Chen and Zhihong Tao.
QBF-based Symbolic Model Checking  for Knowledge and Time

348: Xuehou Tan.
Searching a polygonal region by two guards

349: Xingwu Liu, Zhiwei Xu and Juhua Pu.
Revisiting the Impossibility for Boosting Service Resilience

355: Fan Yun .
There is an sw-cuppable strongly c.e. real

377: Zhenhua Duan and Cong Tian.
Decidability of Propositional Projection Temporal Logic with Infinite Models

384: Trahtman A.N.
Synchronization of some DFA

392: Mingji Xia.
Maximum Edge-Disjoint Paths Problem in Planar Graphs

394: Andrew C. C. Yao, Frances F. Yao and Yunlei Zhao.
A Note on Universal Composable Zero-Knowledge in the Common Reference String Model

403: Iordanis Kerenidis.
Quantum multiparty communication complexity and circuit lower bounds

425: Ehab Morsy and Hiroshi Nagamochi.
Approximating Capacitated Tree-Routings in Networks

434: Andrew C. C. Yao, Frances Yao and Yunlei Zhao.
A Note on the Feasibility of Generalized Universal Composability

435: Wang Jiexun, Zhao Liang, Hiroshi Nagamochi and Akutsu Tatsuya.
An Efficient Algorithm for Generating Colored Outerplanar Graphs

444: Yong Li and Jun-Hai Yong.
Efficient exact arithmetic over constructive reals

452: Xin Li, Tian Liu, Han Peng, Hongtao Sun, Jin Xu, Ke Xu and Jiaqi Zhu.
Improved Exponential Time Lower Bound of Knapsack Problem under BT Model

463: Jin Wang, Daxing Li and Xi Bai.
Protecting Against Key Escrow and Key Exposure in Identity-Based Cryptosystem

464: Fanyu Kong, Jia Yu, Zhun Cai and Daxing Li.
New Left-to-right Radix-r Signed-digit Recoding Algorithm for Pairing-based Cryptosystems

466: Sheng-Lung Peng and Yi-Chuan Yang.
On the treewidth and pathwidth of biconvex bipartite graphs

473: Andrzej Lingas and Martin Wahlen.
On Exact Complexity of Subgraph Homeomorphism

474: Haiyang Hou and Guochuan Zhang.
The Hardness of Selective Network Design for Bottleneck Routing Games

478: Hitoshi Yamasaki and Takayoshi Shoudai.
A Polynomial Time Algorithm for Finding Linear Interval Graph Patterns

480: Stuart Kurtz and Janos Simon.
The Undecidability of the Generalized Collatz Problem

483: Jianxin Wang, Xiaoshuang Xu and Jianer Chen.
An Approximation Algorithm based on Chain Implication for Constrained Minimum Vertex Cover in Bipartite Graphs

489: Yunlong Liu, Jianer Chen and Jianxin Wang.
On Efficient FPT Algorithms for Weighted Matching and Packing Problems

493: Giordano Fusco and Eric Bach.
Phase Transition of Multivariate Polynomial Systems

497: Jun Tarui.
Finding a Duplicate and a Missing Item in a Stream

519: George Barmpalias, Andrew Lewis and Mariya Ivanova Soskova.
Working with the LR Degrees