Skip to main content

Publisher: Elsevier

Volume 81, Number 2, 31 January 2002

Width-restricted layering of acyclic digraphs with consideration of dummy nodes
pp. 59-63(5)
Authors: Branke, J.; Leppert, S.; Middendorf, M.; Eades, P.

Favourites:
ADD

Transfer theorems via sign conditions
pp. 65-69(5)
Author: Koiran, P.

Favourites:
ADD

A faster off-line algorithm for the TCP acknowledgement problem
pp. 71-73(3)
Authors: Noga, J.; Seiden, S.; Woeginger, G.J.

Favourites:
ADD
Favourites:
ADD

Minimizing the total weighted completion time of deteriorating jobs
pp. 81-84(4)
Authors: Bachman, A.; Janiak, A.; Kovalyov, M.Y.

Favourites:
ADD

A new method for constructing pair-wise covering designs for software testing
pp. 85-91(7)
Authors: Kobayashi, N.; Tsuchiya, T.; Kikuno, T.

Favourites:
ADD

On computing a longest path in a tree
pp. 93-96(4)
Authors: Eindhoven; Bulterman, R.W.; van der Sommen, F.W.; Zwaan, G.; Verhoeff, T.; van Gasteren, A.J.M.; Feijen, W.H.J.

Favourites:
ADD

Extracting indexing information from XML DTDs
pp. 97-103(7)
Authors: Chung T.-S.; Kim, H.

Favourites:
ADD

Removing edge-node intersections in drawings of graphs
pp. 105-110(6)
Authors: Lai, W.; Eades, P.

Favourites:
ADD

An efficient method for computing dynamic program slices
pp. 111-117(7)
Authors: Goswami, D.; Mall, R.

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