If you are experiencing problems downloading PDF or HTML fulltext, our helpdesk recommend clearing your browser cache and trying again. If you need help in clearing your cache, please click here . Still need help? Email help@ingentaconnect.com

Publisher: Elsevier

Related content
Volume 86, Number 2, 30 April 2003

< previous issue | all issues | next issue >

Favourites:Add to Favourites

Board of Editors
pp. CO2-CO2(1)

Favourites:Add to Favourites

Flaw and modification of the iKP electronic payment protocols
pp. 57-62(6)
Authors: Ogata, K.; Futatsugi, K.

Favourites:Add to Favourites

A linear time 53-approximation for the minimum strongly-connected spanning subgraph problem
pp. 63-70(8)
Authors: Zhao, L.; Nagamochi, H.; Ibaraki, T.

Favourites:Add to Favourites

On the spectrum of projective norm-graphs
pp. 71-74(4)
Author: Szabo, T.

Favourites:Add to Favourites
Favourites:Add to Favourites

A 53-approximation algorithm for scheduling vehicles on a path with release and handling times
pp. 87-91(5)
Authors: Gaur, D.R.; Gupta, A.; Krishnamurti, R.

Favourites:Add to Favourites
Favourites:Add to Favourites

On the complexity of digraph packings
pp. 101-106(6)
Authors: Brewster, R.C.; Rizzi, R.

Favourites:Add to Favourites

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