Discrete Applied Mathematics logo Elsevier logo

Publisher: Elsevier

Related content
Volume 122, Number 1, 15 October 2002

< previous issue | all issues | next issue >

Increasing digraph arc-connectivity by arc addition, reversal and complement
pp. 13-22(10)
Authors: Arkin E.M.; Hassin R.; Shahar S.

Quasi-median graphs from sets of partitions
pp. 23-35(13)
Authors: Bandelt H.-J.; Huber K.T.; Moulton V.

2-Point site Voronoi diagrams
pp. 37-54(18)
Authors: Barequet G.; Dickerson M.T.; Scot Drysdale R.L.

Pyramids and weak hierarchies in the ordinal model for clustering
pp. 55-81(27)
Authors: Bertrand P.; Janowitz M.F.

Total interval numbers of complete r-partite graphs
pp. 83-92(10)
Authors: Chen M.; Chang G.J.

Algorithms for the fixed linear crossing number problem
pp. 93-115(23)
Author: Cimikowski R.

Projective planes and congestion-free networks
pp. 117-126(10)
Author: Colbourn C.J.

Wiener index versus maximum degree in trees
pp. 127-137(11)
Authors: Fischermann M.; Hoffmann A.; Rautenbach D.; Volkmann L.

The structure of stable marriage with indifference
pp. 167-181(15)
Author: Manlove D.F.

Shattering a set of objects in 2D
pp. 183-194(12)
Authors: Nandy S.C.; Asano T.; Harayama T.

Single machine scheduling with assignable due dates
pp. 211-233(23)
Authors: Qi X.; Yu G.; Bard J.F.

Some analytic features of algebraic data
pp. 235-249(15)
Author: Ricci G.

On Wiener numbers of polygonal nets
pp. 251-261(11)
Authors: Shiu W.C.; Lam P.C.B.; Poon K.K.

Author index
pp. 293-294(2)

< previous issue | all issues | next issue >

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

Text size:

A | A | A | A
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages. print icon Print this page