Discrete Applied Mathematics logo Elsevier logo

Publisher: Elsevier

Volume 116, Number 3, 15 February 2002
Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content

< previous issue | next issue > | all issues

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.

The underlying line digraph structure of some (0,1)-matrix equations
pp. 289-296(8)
Authors: Gimbert J.; Wu1 Y.

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

Author Index to Volume 116 (2002)
pp. 307-308(2)

< previous issue | next issue > | all issues

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages.
Page Help Click here for Page Help
Shopping cart
Tools
Sign in






Need to register?
Sign up here
Text size: A | A | A | A