Discrete Applied Mathematics logo Elsevier logo

Publisher: Elsevier

Volume 114, Number 1, 30 October 2001
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

Preface
pp. 1-1(1)
Author: Borodin O.

Complexity of finding a join of maximum weight
pp. 3-7(5)
Author: Ageev1 A.A.

Perfect binary (n,3) codes: the structure of graphs of minimum distances
pp. 9-11(3)
Author: Avgustinovich1 S.V.

An efficient algorithm for the uncapacitated facility location problem with totally balanced matrix
pp. 13-22(10)
Author: Beresnev V.L.

Edge and total coloring of interval graphs
pp. 23-28(6)
Author: Bojarshinov V.A.

Acyclic colouring of 1-planar graphs
pp. 29-41(13)
Authors: Borodin1 O.V.; Kostochka2 A.V.; Raspaud A.; Sopena3 E.

Average case complexity for finite Boolean functions
pp. 43-59(17)
Author: Chashkin A.V.

Lower bounds for the complexity of restrictions of Boolean functions
pp. 61-93(33)
Author: Chashkin1 A.V.

On an infinite sequence of improving Boolean bases
pp. 95-108(14)
Author: Cherukhin D.U.

Minimal enumerations of subsets of a finite set and the middle level problem
pp. 109-114(6)
Authors: Evdokimov A.A.; Perezhogin1 A.L.

On the subword complexity of iteratively generated infinite words
pp. 115-120(6)
Author: Frid A.E.

On factor graphs of DOL words
pp. 121-130(10)
Author: Frid A.E.

An approximation guarantee of the greedy descent algorithm for minimizing a supermodular set function
pp. 131-146(16)
Author: Il'ev1 V.P.

On minimal coverings of the Boolean cube by centered antichains
pp. 147-153(7)
Author: Kasim-Zade1 O.M.

On combinatorial properties of the Arshon sequence
pp. 155-169(15)
Authors: Klepinin1 A.V.; Sukhanov1 E.V.

On the asymptotics of the number of binary words with a given length of a maximal series
pp. 171-201(31)
Author: Korshunov1 A.D.

A-closed classes of idempotent functions of many-valued logic definable by binary relations
pp. 203-225(23)
Author: Marchenkov1 S.S.

Upper bounds for the complexity of sequences generated by symmetric Boolean functions
pp. 227-231(5)
Author: Merekin1 Y.V.

On the number of connected sets with the neighborhood of a given size in a graph
pp. 233-247(15)
Author: Sapozhenko1 A.A.

On finding a maximum spanning tree of bounded radius
pp. 249-253(5)
Author: Serdjukov A.I.

A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates
pp. 255-271(17)
Authors: Kashyrskikh1 K.N.; Potts C.N.; Sevastianov2 S.V.

Linear time approximation scheme for the multiprocessor open shop problem
pp. 273-288(16)
Authors: Sevastianov1 S.V.; Woeginger2 G.J.

Cyclic distance-preserving codes on a constant-weight basis
pp. 289-294(6)
Author: van Zanten A.J.

On connected list colorings of graphs
pp. 295-300(6)
Author: Vizing1 V.G.

Locally bounded hereditary subclasses of k-colourable graphs
pp. 301-311(11)
Author: Zverovich I.E.

Author Index to Volume 114 (2001)
pp. 313-313(1)

< 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