Alberto Caprara Properties of some ILP Formulations of a Class of Partitioning Problems. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1998, v:87, n:1-3, pp:11-23 [Journal]
Miguel Angel Fiol, Ernest Garriga The Alternating and Adjacency Polynomials, and Their Relation with the Spectra and Diameters of Graphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1998, v:87, n:1-3, pp:77-97 [Journal]
Tom Head Splicing Representations of Strictly Locally Testable Languages. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1998, v:87, n:1-3, pp:139-147 [Journal]
Eugene Levner, Vladimir Kats A Parametric Critical Path Problem and an Application for Cyclic Scheduling. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1998, v:87, n:1-3, pp:149-158 [Journal]
Arie Tamir Fully Polynomial Approximation Schemes for Locating a Tree-shaped Facility: a Generalization of the Knapsack Problem. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1998, v:87, n:1-3, pp:229-243 [Journal]
Hong-Gwa Yeh, Gerard J. Chang Weighted Connected Domination and Steiner Trees in Distance-hereditary Graphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1998, v:87, n:1-3, pp:245-253 [Journal]
Zhu Nan A Relation Between the Knapsack, Group Knapsack Problems. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1998, v:87, n:1-3, pp:255-268 [Journal]