Journal: Inf. Process. Lett.

Volume 89, Issue 6

267 -- 272Hendrik Jan Hoogeboom, Walter A. Kosters. Tetris and decidability
273 -- 279Nikolaos Laoutaris, Vassilis Zissimopoulos, Ioannis Stavrakakis. Joint object placement and node dimensioning for Internet content distribution
281 -- 286Mayer Goldberg. A construction of one-point bases in extended lambda calculi
287 -- 292Yung-Ling Lai, Gerard J. Chang. On the profile of the corona of two graphs
293 -- 296Hemangee K. Kapoor, Mark B. Josephs. Modelling and verification of delay-insensitive circuits using CCS and the Concurrency Workbench
297 -- 301Maciej Liskiewicz, Bodo Manthey. New lower and upper bounds for the competitive ratio of transmission protocols
303 -- 308Laurent Alonso, Philippe Chassaing, Edward M. Reingold, René Schott. The worst-case chip problem
309 -- 314Tetsuo Yokoyama, Zhenjiang Hu, Masato Takeichi. Deterministic second-order patterns

Volume 89, Issue 5

215 -- 221Bruno Codenotti, Gianluca De Marco, Mauro Leoncini, Manuela Montangero, Massimo Santini. Approximation algorithms for a hierarchically structured bin packing problem
223 -- 226Hiroshi Nagamochi, Takahisa Suzuki, Toshimasa Ishii. A simple recognition of maximal planar graphs
227 -- 231Guilin Wang. Universal forgery on a group signature scheme using self-certified public keys
233 -- 235Vladlen Koltun. Ready, Set, Go! The Voronoi diagram of moving points that start from a line
237 -- 245Jérôme Durand-Lose. A Kleene theorem for splitable signals
247 -- 254Irit Dinur, Shmuel Safra. On the hardness of approximating label-cover
255 -- 259Elias Dahlhaus, Peter Dankelmann, R. Ravi. A linear-time algorithm to compute a MAD tree of an interval graph
261 -- 265Harald Fecher. A completed hierarchy of true concurrent equivalences

Volume 89, Issue 4

159 -- 164Manoel B. Campêlo, Ricardo C. Corrêa, Yuri Frota. Cliques, holes and the vertex coloring polytope
165 -- 173Andreas Brandstädt, Van Bang Le, H. N. de Ridder. Efficient robust algorithms for the Maximum Weight Stable Set Problem in chair-free graph classes
175 -- 179Pierluigi Crescenzi, Federico Greco. The minimum likely column cover problem
181 -- 185András Kovács, Tamás Kis. Partitioning of trees for minimizing height and cardinality
187 -- 189Leroy Johnson. Tumble, a fast simple iteration algorithm for Fibonacci
191 -- 201Salvador Lucas. Strong and NV-sequentiality of constructor systems
203 -- 208Fu-Hsing Wang, Yue-Li Wang, Jou-Ming Chang. Feedback vertex sets in star graphs
209 -- 213Ciprian Doru Giurcaneanu. On some properties of the NML estimator for Bernoulli strings

Volume 89, Issue 3

105 -- 110L. Sunil Chandran. Minimum cuts, girth and a spectral threshold
111 -- 114Florian Hess. On the security of the verifiably-encrypted signature scheme of Boneh, Gentry, Lynn and Shacham
115 -- 121Joo-Won Jung, Kyung-Yong Chwa. Labeling points with given rectangles
123 -- 130Christel Baier, Holger Hermanns, Joost-Pieter Katoen. Probabilistic weak simulation is decidable in polynomial time
131 -- 135Iordanis Kerenidis, Ashwin Nayak. Weak coin flipping with small bias
137 -- 139Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz. Computing all large sums-of-pairs in ::R:::n::::: and the discrete planar two-watchtower problem
141 -- 149Thomas Perst, Helmut Seidl. Macro forest transducers
151 -- 157Guilherme Dias da Fonseca, Celina M. Herrera de Figueiredo, Paulo Cezar Pinto Carvalho. Kinetic hanger

Volume 89, Issue 2

53 -- 56Suzanne M. Seager. The greedy algorithm for domination in graphs of maximum degree 3
57 -- 63Rudolf Fleischer, Mordecai J. Golin, Chin-Tau A. Lea, Steven Wong. Finding optimal paths in MREP routing
65 -- 70Wojciech Fraczak, Anna Podolak. A characterization of s-languages
71 -- 74Stasys Jukna. On the minimum number of negations leading to super-polynomial savings
75 -- 83Ralf Klasing, Christian Laforest. Hardness results and approximation algorithms of k-tuple domination in graphs
85 -- 90Dániel Marx. List edge multicoloring in graphs with few cycles
91 -- 98Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy. Optimal algorithm for a special point-labeling problem
99 -- 103Paul Valiant. The Log-Rank Conjecture and low degree polynomials

Volume 89, Issue 1

1 -- 7Ruggero Lanotte, Andrea Maggiolo-Schettini, Simone Tini. Epsilon-transitions in Concurrent Timed Automata
9 -- 14Iiro S. Honkala, Tero Laihonen. On identifying codes in the hexagonal mesh
15 -- 18Doratha E. Drake, Stefan Hougardy. On approximation algorithms for the terminal Steiner tree problem
19 -- 23Timothy M. Chan. A note on maximum independent sets in rectangle intersection graphs
25 -- 29Millist W. Vincent, Jixue Liu. Irrelevant updates and self-maintainability in transitive closure database views
31 -- 35Floris Geerts, Bart Kuijpers. Topological formulation of termination properties of iterates of functions
37 -- 42Gunter Grieser, Steffen Lange. Incremental learning of approximations from positive data
43 -- 47N. V. Vinodchandran. AM::exp::[nsube](NP[cap]coNP)/poly
49 -- 52Bruce K. Durgan. Compact searchable static binary trees