Information Processing Letters

On the hardness of approximating the minimum consistent acyclic DFA and decision diagram
pp. 165-170(6)
Authors: Debusschere B.; Ragland K.W.; Shimozono S.; Hirata K.; Shinohara A.

Traveling the boundary of Minkowski sums
pp. 171-174(4)
Authors: Iyer S.V.; Vafai K.; Fekete S.P.; Pulleyblank W.R.

Efficient token-based control in rings
pp. 175-180(6)
Authors: Brandriss M.E.; O'Neil J.R.; Edlund M.B.; Stoermer E.F.; Stanton D.W.; Rutland C.J.; Feuerstein E.; Leonardi S.; Marchetti-Spaccamela A.; Santoro N.

Broadcasting in unlabeled hypercubes with a linear number of messages
pp. 181-186(6)
Authors: Niewohner C.; Hensen C.; Kasten S.; Zabel M.; Schulz H.D.; Maruyama S.; Diks K.; Dobrev S.; Kranakis E.; Pelc A.; Ruzicka P.

Depth-first layout algorithm for trees
pp. 187-194(8)
Authors: Jannot M.; Kunc T.; Miyadera Y.; Anzai K.; Unno H.; Yaku T.

On the properties of combination set operations
pp. 195-199(5)
Authors: Wolff E.G.; Schneider D.A.; Okuno H.G.; Minato S.-i.; Isozaki H.

Fault tolerant token ring embedding in double loop networks
pp. 201-207(7)
Authors: Martin A.R.; Saltiel^b C.; Chai J.; Shyy W.; Sung T.-Y.; Lin C.-Y.; Chuang Y.-C.; Hsu L.-H.

Linear time algorithms for graph search and connectivity determination on complement graphs
pp. 209-213(5)
Authors: Urusov V.S.; Dudnikova V.B.; Petit D.; Hachette R.; Ito H.; Yokoyama M.

On the arrangement graph
pp. 215-219(5)
Authors: Carroll S.; Mroczek E.; Alai M.; Ebert M.; Kim W.-H.; Na S.-J.; Chiang W.-K.; Chen R.-J.