Journal: Int. J. Found. Comput. Sci.

Volume 21, Issue 6

873 -- 874Oscar H. Ibarra, Hsu-Chun Yen. Preface
875 -- 891Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang. One-Space Bounded Algorithms for Two-Dimensional Bin Packing
893 -- 904Anna Adamaszek, Artur Czumaj, Andrzej Lingas. Ptas for k-Tour Cover Problem on the Plane for Moderately Large Values of k
905 -- 924Marek Karpinski, Andrzej Rucinski, Edyta Szymanska. Computational Complexity of the Perfect Matching Problem in Hypergraphs with Subcritical Density
925 -- 939Ping-Hui Hsu, Kuan-Yu Chen, Kun-Mao Chao. Finding All Approximate Gapped Palindromes
963 -- 978Paul C. Bell, Igor Potapov. On the Undecidability of the Identity Correspondence Problem and its Applications for Word and Matrix Semigroups
979 -- 991Cheng-Chi Lee, Rui-Xiang Chang, Hsien-Ju Ko. Improving Two Novel Three-Party Encrypted Key Exchange Protocols with Perfect Forward Secrecy
993 -- 1004Radu-Florian Atanasiu. Parikh Matrix Mapping and Languages
1005 -- 1019Ming Xu, Liangyu Chen, Zhenbing Zeng, Zhi-Bin Li. Termination Analysis of Linear Loops
1021 -- 1033Adrian Atanasiu. Parikh Matrices, Amiability and Istrail Morphism
1035 -- 1047Alberto Apostolico, Claudia Tagliacollo. Optimal Extraction of Irredundant Motif Bases
1049 -- 1063Yanli Ren, Dawu Gu, Shuozhong Wang, Xinpeng Zhang. Hierarchical Identity-Based Proxy Re-Encryption without Random Oracles
1065 -- 1071Tomi Kärki. A New Proof of the Three-Squares Lemma for Partial Words with One Hole
1073 -- 1088Junping Zhou, Ping Huang, Minghao Yin, Chunguang Zhou. Phase Transitions of EXPSPACE-Complete Problems
1089 -- 1100Vamsi Kundeti, Sanguthevar Rajasekaran. On the Hardness of the Border Length Minimization Problem on a Rectangular Array