Discrete Applied Mathematics logo Elsevier logo

Publisher: Elsevier

Volume 121, Number 1, 15 September 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

The disjunctive procedure and blocker duality
pp. 1-13(13)
Authors: Aguilera N.E.; Escalante M.S.; Nasini G.L.

Complexity of finding dense subgraphs
pp. 15-26(12)
Authors: Asahiro Y.; Hassin R.; Iwama1 K.

Annealed replication: a new heuristic for the maximum clique problem
pp. 27-49(23)
Authors: Bomze I.M.; Budinich M.; Pelillo M.; Rossi C.

An upper bound for the minimum number of queens covering the nxn chessboard
pp. 51-60(10)
Authors: Burger A.P.; Mynhardt C.M.

A simple algorithm to find the steps of double-loop networks
pp. 61-72(12)
Authors: Chi-Feng Chan R.; Chen C.; Hong Z.-X.

The graph sandwich problem for 1-join composition is NP-complete
pp. 73-82(10)
Authors: de Figueiredo C.M.H.; Klein S.; Vuskovic K.

Generalized balances in Sturmian words
pp. 83-101(19)
Authors: Fagnot I.; Vuillon L.

Media theory
pp. 103-118(16)
Authors: Falmagne J.-C.; Ovchinnikov S.

Total domination number of grid graphs
pp. 119-128(10)
Author: Gravier S.

Orientations of digraphs almost preserving diameter
pp. 129-138(10)
Authors: Gutin G.; Yeo A.

NeST graphs
pp. 139-153(15)
Authors: Hayward R.B.; Kearney P.E.; Malton A.

On claw-free asteroidal triple-free graphs
pp. 155-180(26)
Authors: Hempel H.; Kratsch1 D.

Pushing vertices in digraphs without long induced cycles
pp. 181-192(12)
Authors: Huang J.; MacGillivray G.; Yeo A.

On the bound for anonymous secret sharing schemes
pp. 193-202(10)
Authors: Kishimoto W.; Okada K.; Kurosawa K.; Ogata W.

Families of optimal codes for strong identification
pp. 203-213(11)
Authors: Laihonen1 T.; Ranto S.

Greedy algorithms for tracking mobile users in special mobility graphs
pp. 215-227(13)
Authors: Olariu S.; Pinotti M.C.; Wilson L.

Families of non-IRUP instances of the one-dimensional cutting stock problem
pp. 229-245(17)
Authors: Rietz J.; Scheithauer G.; Terno J.

A framework for the greedy algorithm
pp. 247-260(14)
Author: Vince A.

Matchings in colored bipartite networks
pp. 261-277(17)
Authors: Yi T.; Murty K.G.; Spera C.

A survey on maximum distance holey packings
pp. 279-294(16)
Author: Yin J.

Ordering graphs with small index and its application
pp. 295-306(12)
Authors: Zhang1 F.; Chen2 Z.

Optimal arrangement of data in a tree directory - [Discrete Appl. Math 113 (2001) 243-253]
pp. 307-315(9)
Authors: Luczak M.J.; Noble S.D.

Author index
pp. 317-318(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