Publisher: Elsevier

Related content
Volume 56, Number 1, 13 October 1995

< previous issue | all issues | next issue >

Favourites:Add to Favourites

Illumination of polygons with vertex lights
pp. 9-13(5)
Authors: Estivill-Castro, V.; O'Rourke, J.; Urrutia, J.; Xu, D.

Favourites:Add to Favourites

Efficient learning with equivalence queries of conjunctions of modulo functions
pp. 15-17(3)
Authors: Bertoni, A.; Cesa-Bianchi, N.; Fiorino, G.

Favourites:Add to Favourites
Favourites:Add to Favourites

A real-time algorithm for the (n2 - 1)-puzzle
pp. 23-28(6)
Author: Parberry, I.

Favourites:Add to Favourites

Node-to-node cluster fault tolerant routing in star graphs
pp. 29-35(7)
Authors: Gu Q.-P.; Peng, S.

Favourites:Add to Favourites

Parallel algorithms for connectivity problems on interval graphs
pp. 37-44(8)
Authors: Saxena, S.; Rao, N.M.

Favourites:Add to Favourites

Counting convex polygons in planar point sets
pp. 45-49(5)
Authors: Mitchell, J.S.B.; Rote, G.; Sundaram, G.; Woeginger, G.

Favourites:Add to Favourites

Tighter bounds on a heuristic for a partition problem
pp. 51-57(7)
Authors: Leung, J.Y.; Wei, W.

Favourites:Add to Favourites

The parallel complexity of integer prefix summation
pp. 59-64(6)
Author: Hagerup, T.

Favourites:Add to Favourites

Recognizing strict 2-threshold graphs in O(m) time
pp. 65-65(1)
Authors: Petreschi, R.; Sterbini, A.

Share Content

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more