The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Applied Mathematics
1998, volume: 87, number: 1-3

  1. Egon Balas, Maarten Oosten
    On the Dimension of Projected Polyhedra. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:87, n:1-3, pp:1-9 [Journal]
  2. 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]
  3. Joe D. Chavez, Rolland Trapp
    The Cyclic Cutwidth of Trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:87, n:1-3, pp:25-32 [Journal]
  4. Krzysztof Diks, Evangelos Kranakis, Andrzej Pelc
    Perfect Broadcasting in Unlabeled Networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:87, n:1-3, pp:33-47 [Journal]
  5. Ronald D. Dutton
    Inversions in k-sorted Permutations. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:87, n:1-3, pp:49-56 [Journal]
  6. Hikoe Enomoto, Yoshiaki Oda, Katsuhiro Ota
    Pyramidal Tours with Step-backs and the Asymmetric Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:87, n:1-3, pp:57-65 [Journal]
  7. Péter L. Erdös, András Frank, László A. Székely
    Minimum Multiway Cuts in Trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:87, n:1-3, pp:67-75 [Journal]
  8. 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]
  9. Paola Flocchini, Alessandro Roncato, Nicola Santoro
    Symmetries and Sense of Direction in Labeled Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:87, n:1-3, pp:99-115 [Journal]
  10. Nili Guttmann-Beck, Refael Hassin
    Approximation Algorithms for Minimum Tree Partition. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:87, n:1-3, pp:117-137 [Journal]
  11. 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]
  12. 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]
  13. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:87, n:1-3, pp:159-185 [Journal]
  14. Chuan-Ming Liu, Ming-Shing Yu
    An Optimal Parallel Algorithm for Node Ranking of Cographs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:87, n:1-3, pp:187-201 [Journal]
  15. Chin Lung Lu, Chuan Yi Tang
    Solving the Weighted Efficient Edge Domination Problem on Bipartite Permutation Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:87, n:1-3, pp:203-211 [Journal]
  16. Fred S. Roberts, Li Sheng
    Phylogeny Numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:87, n:1-3, pp:213-228 [Journal]
  17. 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]
  18. 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]
  19. 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]
  20. Abdo Y. Alfakih, Katta G. Murty
    Adjacency on the Constrained Assignment Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:87, n:1-3, pp:269-274 [Journal]
  21. Sergei L. Bezrukov, Ulf-Peter Schroeder
    The Cyclic Wirelength of Trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:87, n:1-3, pp:275-277 [Journal]
  22. Zhongfu Zhang, Linzhong Liu, Jianxun Zhang, Jianfang Wang
    On the Relations Between Arboricity and Independent Number Or Covering Number. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:87, n:1-3, pp:279-283 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002