Information Processing Letters

Board of Editors
pp. CO2-CO2(1)

Approximation algorithms for a hierarchically structured bin packing problem
pp. 215-221(7)
Authors: Codenotti B.; De Marco G.; Leoncini M.; Montangero M.; Santini M.

A simple recognition of maximal planar graphs
pp. 223-226(4)
Authors: Nagamochi H.; Suzuki T.; Ishii T.

Universal forgery on a group signature scheme using self-certified public keys
pp. 227-231(5)
Author: Wang G.

Ready, Set, Go! The Voronoi diagram of moving points that start from a line
pp. 233-235(3)
Author: Koltun V.

A Kleene theorem for splitable signals
pp. 237-245(9)
Author: Durand-Lose J.

On the hardness of approximating label-cover
pp. 247-254(8)
Authors: Dinur I.; Safra S.

A linear-time algorithm to compute a MAD tree of an interval graph
pp. 255-259(5)
Authors: Dahlhaus E.; Dankelmann P.; Ravi R.

A completed hierarchy of true concurrent equivalences
pp. 261-265(5)
Author: Fecher H.