Discrete Applied Mathematics, Volume 87

Volume 87, Number 1-3, October 1998

• Egon Balas, Maarten Oosten:
  On the Dimension of Projected Polyhedra. 1-9
  Electronic Edition (link) BibTeX
• Alberto Caprara:
  Properties of some ILP Formulations of a Class of Partitioning Problems. 11-23
  Electronic Edition (link) BibTeX
• Joe D. Chavez, Rolland Trapp:
  The Cyclic Cutwidth of Trees. 25-32
  Electronic Edition (link) BibTeX
• Krzysztof Diks, Evangelos Kranakis, Andrzej Pelc:
  Perfect Broadcasting in Unlabeled Networks. 33-47
  Electronic Edition (link) BibTeX
• Ronald D. Dutton:
  Inversions in k-sorted Permutations. 49-56
  Electronic Edition (link) BibTeX
• Hikoe Enomoto, Yoshiaki Oda, Katsuhiro Ota:
  Pyramidal Tours with Step-backs and the Asymmetric Traveling Salesman Problem. 57-65
  Electronic Edition (link) BibTeX
• Péter L. Erdös, András Frank, László A. Székely:
  Minimum Multiway Cuts in Trees. 67-75
  Electronic Edition (link) BibTeX
• Miguel Angel Fiol, Ernest Garriga:
  The Alternating and Adjacency Polynomials, and Their Relation with the Spectra and Diameters of Graphs. 77-97
  Electronic Edition (link) BibTeX
• Paola Flocchini, Alessandro Roncato, Nicola Santoro:
  Symmetries and Sense of Direction in Labeled Graphs. 99-115
  Electronic Edition (link) BibTeX
• Nili Guttmann-Beck, Refael Hassin:
  Approximation Algorithms for Minimum Tree Partition. 117-137
  Electronic Edition (link) BibTeX
• Tom Head:
  Splicing Representations of Strictly Locally Testable Languages. 139-147
  Electronic Edition (link) BibTeX
• Eugene Levner, Vladimir Kats:
  A Parametric Critical Path Problem and an Application for Cyclic Scheduling. 149-158
  Electronic Edition (link) BibTeX
• Marek Libura, Edo S. Van der Poort, Gerard Sierksma, Jack A. A. van der Veen:
  Stability Aspects of the Traveling Salesman Problem Based on K-best Solutions. 159-185
  Electronic Edition (link) BibTeX
• Chuan-Ming Liu, Ming-Shing Yu:
  An Optimal Parallel Algorithm for Node Ranking of Cographs. 187-201
  Electronic Edition (link) BibTeX
• Chin Lung Lu, Chuan Yi Tang:
  Solving the Weighted Efficient Edge Domination Problem on Bipartite Permutation Graphs. 203-211
  Electronic Edition (link) BibTeX
• Fred S. Roberts, Li Sheng:
  Phylogeny Numbers. 213-228
  Electronic Edition (link) BibTeX
• Arie Tamir:
  Fully Polynomial Approximation Schemes for Locating a Tree-shaped Facility: a Generalization of the Knapsack Problem. 229-243
  Electronic Edition (link) BibTeX
• Hong-Gwa Yeh, Gerard J. Chang:
  Weighted Connected Domination and Steiner Trees in Distance-hereditary Graphs. 245-253
  Electronic Edition (link) BibTeX
• Zhu Nan:
  A Relation Between the Knapsack, Group Knapsack Problems. 255-268
  Electronic Edition (link) BibTeX
• Abdo Y. Alfakih, Katta G. Murty:
  Adjacency on the Constrained Assignment Problem. 269-274
  Electronic Edition (link) BibTeX
• Sergei L. Bezrukov, Ulf-Peter Schroeder:
  The Cyclic Wirelength of Trees. 275-277
  Electronic Edition (link) BibTeX
• Zhongfu Zhang, Linzhong Liu, Jianxun Zhang, Jianfang Wang:
  On the Relations Between Arboricity and Independent Number Or Covering Number. 279-283
  Electronic Edition (link) BibTeX