Information Processing Letters, Volume 102

Volume 102, Number 1, April 2007

• Ken S. Hu, Shyun-Shyun Yeoh, Chiuyuan Chen, Lih-Hsing Hsu:
  Node-pancyclicity and edge-pancyclicity of hypercube variants. 1-7
  
• M. Jiang, Y. P. Luo, S. Y. Yang:
  Stochastic convergence analysis and parameter selection of the standard particle swarm optimization algorithm. 8-16
  
• Henrik Brosenne, Carsten Damm, Matthias Homeister, Stephan Waack:
  On approximation by XOR-OBDDs. 17-21
  
• Wen-Hung Kuo, Dar-Li Yang:
  Single machine scheduling with past-sequence-dependent setup times and learning effects. 22-26
  
• Yung H. Tsin:
  An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity. 27-34
  
• Cho-Chin Lin, Hao-Yun Yin:
  Bounds on the multi-clients incremental computing for homogeneous decreasing computation sequences. 35-40
  

Volume 102, Numbers 2-3, April 2007

• Min Ji, T. C. Edwin Cheng:
  An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan. 41-47
  
• Zhilin Wu:
  A note on the characterization of TL[EF]. 48-54
  
• Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Yong Zhang, Hong Zhu:
  Greedy online frequency allocation in cellular networks. 55-61
  
• Jiong Guo, Falk Hüffner, Hannes Moser:
  Feedback arc set in bipartite tournaments is NP-complete. 62-65
  
• Xuehou Tan:
  Sweeping simple polygons with the minimum number of chain guards. 66-71
  
• Benjamin Van Roy:
  A short proof of optimality for the MIN cache replacement algorithm. 72-73
  
• Narad Rampersad:
  On the context-freeness of the set of words containing overlaps. 74-78
  
• Hiroshi Nagamochi, Yoko Kamidoi:
  Minimum cost subpartitions in graphs. 79-84
  
• Luo Xiaofang:
  The 4-choosability of toroidal graphs without intersecting triangles. 85-91
  
• Iiro S. Honkala, Tero Laihonen:
  On a new class of identifying codes in graphs. 92-98
  
• Kuo-Si Huang, Chang-Biau Yang, Kuo-Tsung Tseng, Yung-Hsing Peng, Hsing-Yen Ann:
  Dynamic programming algorithms for the mosaic longest common subsequence problem. 99-103
  
• Alexander A. Sherstov:
  Powering requires threshold depth 3. 104-107
  
• Lenin Mehedy, Md. Kamrul Hasan, Mohammad Kaykobad:
  An improved degree based condition for Hamiltonian cycles. 108-112
  
• Travis Gagie:
  Dynamic Shannon coding. 113-117
  
• Kwangkeun Yi, Hosik Choi, Jaehwang Kim, Yongdai Kim:
  An empirical study on classification methods for alarms from a bug-finding static C analyzer. 118-123
  
• Vaston Costa, Edward Hermann Haeusler, Eduardo Sany Laber, Loana Tito Nogueira:
  A note on the size of minimal covers. 124-126
  
• Fabien Laguillaumie, Damien Vergnaud:
  Multi-designated verifiers signatures: anonymity without encryption. 127-132
  

Volume 102, Number 4, May 2007

• Jaume Martí-Farré:
  A note on secret sharing schemes with three homogeneous access structure. 133-137
  
• Gildas Avoine, Serge Vaudenay:
  How to safely close a discussion. 138-142
  
• Min-Sheng Lin:
  Fast and simple algorithms to count the number of vertex covers in an interval graph. 143-146
  
• Elzbieta Sidorowicz:
  The game chromatic number and the game colouring number of cactuses. 147-151
  
• Peter Brass:
  Multidimensional heaps and complementary range searching. 152-155
  
• Narsingh Deo, Aurel Cami:
  Preferential deletion in dynamic models of web-like networks. 156-162
  
• Partha P. Goswami, Sandip Das, Subhas C. Nandy:
  Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point set. 163-168
  
• Jan Vahrenhold:
  An in-place algorithm for Klee's measure problem in two dimensions. 169-174
  

Volume 102, Number 5, May 2007

• Fabrizio Luccio, Antonio Mesa Enriques, Linda Pagli:
  k-Restricted rotation distance between binary trees. 175-180
  
• Wim H. Hesselink:
  A linear-time algorithm for Euclidean feature transform sets. 181-186
  
• Edward Chlebus, Jordy Brazier:
  Nonstationary Poisson modeling of web browsing session arrivals. 187-190
  
• Lukasz Kowalik:
  Adjacency queries in dynamic sparse graphs. 191-195
  
• Shahram Latifi:
  A study of fault tolerance in star graph. 196-200
  
• Mauricio Ayala-Rincón, Bruno T. de Abreu, José de Siqueira: A variant of the Ford-Johnson algorithm that is more space efficient. 201-207
• Laurent Doyen:
  Robust parametric reachability for timed automata. 208-213
  
• Richard Hammack:
  Minimum cycle bases of direct products of complete graphs. 214-218
  

Volume 102, Number 6, June 2007

• Oren Ben-Zwi, Oded Lachish, Ilan Newman:
  Lower bounds for testing Euclidean Minimum Spanning Trees. 219-225
  
• Jun-Ming Xu, Chao Yang:
  Fault diameter of product graphs. 226-228
  
• Thierry Lecroq:
  Fast exact string matching algorithms. 229-235
  
• François Laroussinie, Jeremy Sproston:
  State explosion in almost-sure probabilistic reachability. 236-241
  
• Chang-Hsiung Tsai:
  Cycles embedding in hypercubes with node failures. 242-246
  
• Sidi Mohamed Sedjelmaci:
  Jebelean-Weber's algorithm without spurious factors. 247-252
  
• Nenad Obradoviç, Joseph Peters, Goran Ruzic:
  Efficient domination in circulant graphs with two chord lengths. 253-258
  
• Deshi Ye, Guochuan Zhang:
  Maximizing the throughput of parallel jobs on hypercubes. 259-263