Information Processing Letters, Volume 107

Volume 107, Number 1, June 2008

• Fanica Gavril:
  Minimum weight feedback vertex sets in circle graphs. 1-6
  Electronic Edition (link) BibTeX
• Frank Pok Man Chu:
  A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements. 7-12
  Electronic Edition (link) BibTeX
• Pedro García, Manuel Vazquez de Parga, Damián López:
  On the efficient construction of quasi-reversible automata for reversible languages. 13-17
  Electronic Edition (link) BibTeX
• Pao-Lien Lai, Hong-Chun Hsu:
  The two-equal-disjoint path cover problem of Matching Composition Network. 18-23
  Electronic Edition (link) BibTeX
• Jianxin Wang, Jianer Chen, Min Huang:
  An improved lower bound on approximation algorithms for the Closest Substring problem. 24-28
  Electronic Edition (link) BibTeX
• Michael Segal:
  Fast algorithm for multicast and data gathering in wireless networks. 29-33
  Electronic Edition (link) BibTeX
• Artur Alves Pessoa:
  A note on the construction of error detecting/correcting prefix codes. 34-38
  Electronic Edition (link) BibTeX
• Shai Gutner:
  Elementary approximation algorithms for prize collecting Steiner tree problems. 39-44
  Electronic Edition (link) BibTeX

Volume 107, Number 2, July 2008

• Justie Su-tzu Juan, Chun-Ming Huang, I-Fan Sun:
  The strong distance problem on the Cartesian product of graphs. 45-51
  Electronic Edition (link) BibTeX
• Jorge Almeida, Marc Zeitoun:
  Description and analysis of a bottom-up DFA minimization algorithm. 52-59
  Electronic Edition (link) BibTeX
• Ken R. Duffy, N. O'Connell, Artëm Sapozhnikov:
  Complexity analysis of a decentralised graph colouring algorithm. 60-63
  Electronic Edition (link) BibTeX
• Yvonne Bleischwitz, Florian Schoppmann:
  New efficiency results for makespan cost sharing. 64-70
  Electronic Edition (link) BibTeX
• Jean-Baptiste Yunès:
  A 4-states algebraic solution to linear cellular automata synchronization. 71-75
  Electronic Edition (link) BibTeX
• Mario A. Lopez, Shlomo Reisner:
  Hausdorff approximation of 3D convex polytopes. 76-82
  Electronic Edition (link) BibTeX
• Kyung-Ah Shim:
  Rogue-key attacks on the multi-designated verifiers signature scheme. 83-86
  Electronic Edition (link) BibTeX

Volume 107, Numbers 3-4, July 2008

• Jun Yan, Jian Zhang:
  An efficient method to generate feasible paths for basis path testing. 87-92
  Electronic Edition (link) BibTeX
• Joanna Skowronek-Kaziów:
  1, 2 Conjecture - the multiplicative version. 93-95
  Electronic Edition (link) BibTeX
• Sören Laue, Domagoj Matijevic:
  Approximating k-hop minimum spanning trees in Euclidean metrics. 96-101
  Electronic Edition (link) BibTeX
• Haihui Zhang, Zhiren Sun:
  On 3-choosability of planar graphs without certain cycles. 102-106
  Electronic Edition (link) BibTeX
• Mickaël Montassier, André Raspaud, Weifan Wang, Yingqian Wang:
  A relaxation of Havel's 3-color problem. 107-109
  Electronic Edition (link) BibTeX
• Jung-Sheng Fu:
  Conditional fault Hamiltonicity of the complete graph. 110-113
  Electronic Edition (link) BibTeX
• Lawrence S. Moss:
  Confusion of memory. 114-119
  Electronic Edition (link) BibTeX
• Joseph S. B. Mitchell, Valentin Polishchuk:
  Minimum-perimeter enclosures. 120-124
  Electronic Edition (link) BibTeX
• François Delbot, Christian Laforest:
  A better list heuristic for vertex cover. 125-127
  Electronic Edition (link) BibTeX
• John S. Fitzgerald, Cliff B. Jones:
  The connection between two ways of reasoning about partial functions. 128-132
  Electronic Edition (link) BibTeX