Journal: Inf. Process. Lett.

Volume 101, Issue 6

227 -- 232Hong-Chun Hsu, Pao-Lien Lai, Chang-Hsiung Tsai. Geodesic pancyclicity and balanced pancyclicity of Augmented cubes
233 -- 238Vardges Melkonian. LP-based solution methods for the asymmetric TSP
239 -- 244Shuang Luan, Jared Saia, Maxwell Young. Approximation algorithms for minimizing segments in radiation therapy
245 -- 249Martin Dietzfelbinger, Henning Wunderlich. A characterization of average case communication complexity
250 -- 254Moritz G. Maaß. Computing suffix links for suffix trees and arrays
255 -- 261Paulo Sérgio Almeida, Carlos Baquero, Nuno M. Preguiça, David Hutchison. Scalable Bloom Filters
262 -- 267Rami Al Na mneh, W. David Pan. Five-step FFT algorithm with reduced computational complexity

Volume 101, Issue 5

181 -- 184David Eisenstat, Dana Angluin. The VC dimension of k-fold union
185 -- 189Min Xu, Jun Ming Xu. The forwarding indices of augmented cubes
190 -- 198Emmanuelle Anceaume, Roy Friedman, Maria Gradinariu. Managed Agreement: Generalizing two fundamental distributed agreement problems
199 -- 202Péter Biró, Katarína Cechlárová. Inapproximability of the kidney exchange problem
203 -- 208Shiyan Hu. A linear time algorithm for max-min length triangulation of a convex polygon
209 -- 214Carlos Martín-Vide, Victor Mitrana. Remarks on arbitrary multiple pattern interpretations
215 -- 219Louis Esperet, Pascal Ochem. Oriented colorings of 2-outerplanar graphs
220 -- 226J. Guadalupe Ramos, Josep Silva, Germán Vidal. Ensuring the quasi-termination of needed narrowing computations

Volume 101, Issue 4

139 -- 140Joost Engelfriet. A Kleene characterization of computability
141 -- 147Katrin Erk, Joachim Niehren. Dominance constraints in stratified context unification
148 -- 155Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich. A global parallel algorithm for the hypergraph transversal problem
156 -- 162Yoann Dieudonné, Franck Petit. Circle formation of weak robots and Lyndon words
163 -- 167Jan Krajícek. Substitutions into propositional tautologies
168 -- 173Chi-Hung Tzeng, Jehn-Ruey Jiang, Shing-Tsaan Huang. A self-stabilizing (Delta+4)-edge-coloring algorithm for planar graphs in anonymous uniform systems
174 -- 179Wenbin Chen 0002, Jiangtao Meng. An improved lower bound for approximating Shortest Integer Relation in ::::l::::::infinity:: norm (SIR::infinity::)

Volume 101, Issue 3

93 -- 97Chang-Hsiung Tsai, Shu-Yun Jiang. Path bipancyclicity of hypercubes
98 -- 100Lev Reyzin, Nikhil Srivastava. On the longest path algorithm for reconstructing trees from distance matrices
101 -- 106Tobias Riege, Jörg Rothe, Holger Spakowski, Masaki Yamamoto. An improved exact algorithm for the domatic number problem
107 -- 111Ulrich Ultes-Nitsche. A power-set construction for reducing Büchi automata to non-determinism degree two
112 -- 118Dana Ron, Amir Rosenfeld, Salil P. Vadhan. The hardness of the Expected Decision Depth problem
119 -- 125Maria Patricia Dobson, Marisa Gutierrez, Michel Habib, Jayme Luiz Szwarcfiter. On transitive orientations with restricted covering graphs
126 -- 128Marcin Peczarski. The Ford-Johnson algorithm still unbeaten for less than 47 elements
129 -- 133Michael J. Collins, David Kempe, Jared Saia, Maxwell Young. Nonnegative integral subset representations of integer sets
134 -- 138Min Chen, André Raspaud, Weifan Wang. Three-coloring planar graphs without short cycles

Volume 101, Issue 2

53 -- 54Peter Clifford, Raphaël Clifford. Simple deterministic wildcard matching
55 -- 59Michael H. Albert, Mike D. Atkinson, Doron Nussbaum, Jörg-Rüdiger Sack, Nicola Santoro. On the longest increasing subsequence of a circular list
60 -- 65Ittai Abraham, Gregory Chockler, Idit Keidar, Dahlia Malkhi. Wait-free regular storage from Byzantine components
66 -- 71Daniel Sawitzki. Lower bounds on the OBDD size of two fundamental functions graphs
72 -- 77Yuuki Tanaka, Hiroyuki Kawai, Yukio Shibata. Isomorphic factorization, the Kronecker product and the line digraph
78 -- 85MoonBae Song, KwangJin Park, Ki-Sik Kong, SangKeun Lee. Bottom-up nearest neighbor search for R-trees
86 -- 92Eric Bach. Bounds for the expected duration of the monopolist game

Volume 101, Issue 1

1 -- 5Joost Engelfriet, Tjalling Gelsema. An exercise in structural congruence
6 -- 12Houman Alborzi, Hanan Samet. Execution time analysis of a top-down R-tree construction algorithm
13 -- 19Eric McDermid, Christine Cheng, Ichiro Suzuki. Hardness results on the man-exchange stable marriage problem with short preference lists
20 -- 25Junhu Wang. Binary equality implication constraints, normal forms and data redundancy
26 -- 29Uriel Feige, James R. Lee. An improved approximation ratio for the minimum linear arrangement problem
30 -- 35Vardges Melkonian. Flows in dynamic networks with aggregate arc capacities
36 -- 40Faisal N. Abu-Khzam, Michael A. Langston. Linear-time algorithms for problems on planar graphs with fixed disk dimension
41 -- 45Richard S. Bird, Stefan Sadnicki. Minimal on-line labelling
46 -- 51Yoshinobu Kawabe, Ken Mano, Hideki Sakurada, Yasuyuki Tsukada. Theorem-proving anonymity of infinite-state systems