Discrete Applied Mathematics logo Elsevier logo

Publisher: Elsevier

Related content
Volume 134, Number 1, 5 January 2004

< previous issue | all issues | next issue >

Editorial Board
pp. v-vii(3)

Contents
pp. ix-x(2)

Open shop scheduling problems with late work criteria
pp. 1-24(24)
Authors: Blazewicz J.; Pesch E.; Sterna M.; Werner F.

The maximum deviation just-in-time scheduling problem
pp. 25-50(26)
Authors: Brauner N.; Crama Y.

On the complexity of graph tree partition problems
pp. 51-65(15)
Authors: Cordone R.; Maffioli F.

The insulation sequence of a graph
pp. 77-90(14)
Author: Grigorescu E.

Algorithms for graphs with small octopus
pp. 105-128(24)
Authors: Fomin F.V.; Kratsch D.; Muller H.

Two sensitivity theorems in fuzzy integer programming
pp. 129-140(12)
Authors: Asratian A.S.; Kuzjurin N.N.

Scheduling groups of tasks with precedence constraints on three dedicated processors
pp. 141-168(28)
Authors: Mansini R.; Grazia Speranza M.; Tuza Z.

Lattice-theoretic properties of MPR-posets in phylogeny
pp. 169-192(24)
Authors: Miyakawa K.; Narushima H.

Lift and project relaxations for the matching and related polytopes
pp. 193-212(20)
Authors: Aguilera N.E.; Bianchi S.M.; Nasini G.L.

Hereditary dominating pair graphs
pp. 239-261(23)
Authors: Przulj N.; Corneil D.G.; Kohler E.

Cartels via the modiclus
pp. 263-302(40)
Authors: Rosenmuller J.; Sudholter P.

A characterization of Thompson digraphs
pp. 317-337(21)
Authors: Giammarresi D.; Ponty J.-L.; Wood D.; Ziadi D.

Z-transformation graphs of maximum matchings of plane bipartite graphs
pp. 339-350(12)
Authors: Zhang H.; Zha R.; Yao H.

Author index to volume
pp. 361-362(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