default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 87
Volume 87, Number 1-3, October 1998
- Egon Balas, Maarten Oosten:
On the Dimension of Projected Polyhedra. 1-9 - Alberto Caprara:
Properties of some ILP Formulations of a Class of Partitioning Problems. 11-23 - Joe D. Chavez, Rolland Trapp:
The Cyclic Cutwidth of Trees. 25-32 - Krzysztof Diks, Evangelos Kranakis
, Andrzej Pelc:
Perfect Broadcasting in Unlabeled Networks. 33-47 - Ronald D. Dutton:
Inversions in k-sorted Permutations. 49-56 - Hikoe Enomoto, Yoshiaki Oda, Katsuhiro Ota:
Pyramidal Tours with Step-backs and the Asymmetric Traveling Salesman Problem. 57-65 - Péter L. Erdös, András Frank, László A. Székely:
Minimum Multiway Cuts in Trees. 67-75 - Miguel Angel Fiol, Ernest Garriga:
The Alternating and Adjacency Polynomials, and Their Relation with the Spectra and Diameters of Graphs. 77-97 - Paola Flocchini, Alessandro Roncato, Nicola Santoro:
Symmetries and Sense of Direction in Labeled Graphs. 99-115 - Nili Guttmann-Beck, Refael Hassin:
Approximation Algorithms for Minimum Tree Partition. 117-137 - Tom Head:
Splicing Representations of Strictly Locally Testable Languages. 139-147 - Eugene Levner, Vladimir Kats:
A Parametric Critical Path Problem and an Application for Cyclic Scheduling. 149-158 - 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 - Chuan-Ming Liu, Ming-Shing Yu:
An Optimal Parallel Algorithm for Node Ranking of Cographs. 187-201 - Chin Lung Lu, Chuan Yi Tang:
Solving the Weighted Efficient Edge Domination Problem on Bipartite Permutation Graphs. 203-211 - Fred S. Roberts, Li Sheng:
Phylogeny Numbers. 213-228 - Arie Tamir:
Fully Polynomial Approximation Schemes for Locating a Tree-shaped Facility: a Generalization of the Knapsack Problem. 229-243 - Hong-Gwa Yeh, Gerard J. Chang:
Weighted Connected Domination and Steiner Trees in Distance-hereditary Graphs. 245-253 - Zhu Nan:
A Relation Between the Knapsack, Group Knapsack Problems. 255-268 - Abdo Y. Alfakih, Katta G. Murty:
Adjacency on the Constrained Assignment Problem. 269-274 - Sergei L. Bezrukov, Ulf-Peter Schroeder:
The Cyclic Wirelength of Trees. 275-277 - Zhongfu Zhang, Linzhong Liu, Jianxun Zhang, Jianfang Wang:
On the Relations Between Arboricity and Independent Number Or Covering Number. 279-283
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-04-13 22:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
