Discrete Applied Mathematics logo Elsevier logo

Publisher: Elsevier

Related content
Volume 116, Number 3, 15 February 2002

< previous issue | all issues | next issue >

Partitioning problems in dense hypergraphs
pp. 179-191(13)
Author: Czygrinow A.

The vehicle routing problem with pickups and deliveries on some special graphs
pp. 193-229(37)
Authors: Eilam Tzoreff1 T.; Granot D.; Granot F.; Sosic G.

Group testing and fault detection for replicated files
pp. 231-242(12)
Authors: Hwang F.K.; Zang1 W.

Partitioning a matrix with non-guillotine cuts to minimize the maximum cost
pp. 243-260(18)
Authors: Mingozzi A.; Morigi S.

Recognizing pseudo-median graphs
pp. 261-269(9)
Author: Vesel A.

A note on orientations of mixed graphs
pp. 271-278(8)
Authors: Arkin1 E.M.; Hassin R.

On the complexity of exchange-stable roommates
pp. 279-287(9)
Author: Cechlarova K.

On infinite words generated by polynomial D0L systems
pp. 297-305(9)
Author: Honkala J.

< 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