Journal: Inf. Process. Lett.

Volume 94, Issue 6

241 -- 245Philippe Darondeau. Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets
247 -- 252Alexander Thomasian, Yue Li, Lijuan Zhang. Exact ::::k::::-NN queries on clustered SVD datasets
253 -- 257Aleksander Madry. Data exchange: On the complexity of answering queries with inequalities
259 -- 266Sandip Das, Partha P. Goswami, Subhas C. Nandy. Smallest ::::k::::-point enclosing rectangle and square of arbitrary orientation
267 -- 269Jan A. Bergstra, Inge Bethke. An upper bound for the equational specification of finite state services
271 -- 276K. S. Cheung, K. O. Chow. Cycle inclusion property of augmented marked graphs
277 -- 282Sujatha Kashyap, Vijay K. Garg. Intractability results in predicate detection

Volume 94, Issue 5

197 -- 201Steven Minsker. The Little Towers of Antwerpen problem
203 -- 209Ted Herman, Colette Johnen. Strategies for peer-to-peer downloading
211 -- 216Chuan-Min Lee, Ling-Ju Hung, Maw-Shang Chang, Chia-Ben Shen, Chuan Yi Tang. An improved algorithm for the maximum agreement subtree problem
217 -- 224Olivier Danvy, Lasse R. Nielsen. CPS transformation of beta-redexes
225 -- 230Yinfeng Xu, Wenqiang Dai, Binhai Zhu. A lower bound on the edge l::infinitely:: radius of Saitou and Nei s method for phylogenetic reconstruction
231 -- 240Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch. Closure properties and decision problems of dag automata

Volume 94, Issue 4

151 -- 154Vesa Halava, Tero Harju, Michel Latteux. Equality sets of prefix morphisms and regular star languages
155 -- 158Juha Honkala. The class of HDT0L sequences is closed with respect to rational functions
159 -- 164Alex Brodsky. An impossibility gap between width-4 and width-5 permutation branching programs
165 -- 169Guy-Vincent Jourdan, Hasan Ural, Nejib Zaguia. Minimizing the number of inputs while applying adaptive test cases
171 -- 177Orestis Telelis, Vassilis Zissimopoulos. Absolute o(log m) error in approximating random set covering: an average case analysis
179 -- 182Vadim V. Lozin. Between 2- and 3-colorability
183 -- 190Danilo Korze, Aleksander Vesel. ::::L::::(2, 1)-labeling of strong products of cycles
191 -- 195Jun Ming Xu, Min Lü, Meijie Ma, Angelika Hellwig. Super connectivity of line graphs

Volume 94, Issue 3

99 -- 105Gautam Appa, Dimitris Magos, Ioannis Mourtos. On the system of two ::::all_different:::: predicates
107 -- 112Christian Liebchen, Romeo Rizzi. A greedy approach to compute a minimum cycle basis of a directed graph
113 -- 118L. Sunil Chandran, Carlo Mannino, Gianpaolo Oriolo. On the cubicity of certain graphs
119 -- 123Guang Xu, Jinhui Xu. An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
125 -- 130Kuo Chu Lee, Chi-Hung Tzeng, Shing-Tsaan Huang. A space-efficient self-stabilizing algorithm for measuring the size of ring networks
131 -- 135J. Y. Guo, Frank K. Hwang. An almost-linear time and linear space algorithm for the longest common subsequence problem
137 -- 143Mike Burmester, Yvo Desmedt. A secure and scalable Group Key Exchange system
145 -- 150Bruno Codenotti, Daniel Stefankovic. On the computational complexity of Nash equilibria for (0, 1) bimatrix games

Volume 94, Issue 2

49 -- 53Artur Czumaj, Magnús M. Halldórsson, Andrzej Lingas, Johan Nilsson. Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
55 -- 61Evan J. Griffiths, Pekka Orponen. Optimization, block designs and No Free Lunch theorems
63 -- 69Ji-Bo Wang, Zun-Quan Xia. Scheduling jobs under decreasing linear deterioration
71 -- 77Angela Bonifati, Stefano Ceri, Stefano Paraboschi. Event Trace Independence of active behavior
79 -- 84Annabelle McIver, Carroll Morgan. An elementary proof that Herman s Ring is Theta (N:::2:::)
85 -- 91Roy Friedman, Achour Mostéfaoui, Michel Raynal. Asynchronous bounded lifetime failure detectors
93 -- 97Mohammad Sohel Rahman, Mohammad Kaykobad. Complexities of some interesting problems on spanning trees

Volume 94, Issue 1

1 -- 6Janja Jerebic, Sandi Klavzar, Simon Spacapan. Characterizing r-perfect codes in direct products of two and three cycles
7 -- 9Ioannis Koutis. A faster parameterized algorithm for set packing
11 -- 14Róbert Lórencz, Josef Hlavác. Subtraction-free Almost Montgomery Inverse algorithm
15 -- 18Stavros G. Kolliopoulos. Minimum-cost single-source 2-splittable flow
19 -- 27Eric Angel, Evripidis Bampis, Laurent Gourvès. Approximation results for a bicriteria job scheduling problem on a single machine without preemption
29 -- 35Francesco Carrabs, Raffaele Cerulli, Monica Gentili, Gennaro Parlato. A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds
37 -- 41Mohammad Sohel Rahman, Mohammad Kaykobad. On Hamiltonian cycles and Hamiltonian paths
43 -- 47Sanguthevar Rajasekaran, Sandeep Sen. A generalization of the 0-1 principle for sorting