Skip to main content

Publisher: Elsevier

Volume 54, Number 5, 9 June 1995

Favourites:
ADD

A linear time algorithm to compute a dominating path in an AT-free graph
pp. 253-257(5)
Authors: Corneil, D.G.; Olariu, S.; Stewart, L.

Favourites:
ADD

Stabilizing phase-clocks
pp. 259-265(7)
Authors: Herman, T.; Ghosh, S.

Favourites:
ADD

On-the-fly analysis of distributed computations
pp. 267-274(8)
Authors: Fromentin, E.; Jard, C.; Jourdan, G.; Raynal, M.

Favourites:
ADD

Why is the 3D Delaunay triangulation difficult to construct?
pp. 275-280(6)
Authors: Sugihara, K.; Inagaki, H.

Favourites:
ADD

3-SAT = SAT for a class of normal modal logics
pp. 281-287(7)
Author: demri, S.

Favourites:
ADD

Exponential lower bounds for the tree-like Hajos calculus
pp. 289-294(6)
Authors: Iwama, K.; Pitassi, T.

Favourites:
ADD

An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images
pp. 295-300(6)
Authors: Fujiwara, A.; Masuzawa, T.; Fujiwara, H.

Favourites:
ADD

On the equivalence covering number of splitgraphs
pp. 301-304(4)
Authors: Blokhuis, A.; Kloks, T.

Favourites:
ADD

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