The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Applied Mathematics
2003, volume: 126, number: 2-3

  1. Marcella Anselmo
    A non-ambiguous decomposition of regular languages and factorizing codes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:126, n:2-3, pp:129-165 [Journal]
  2. Guiqing Li, Wenlong Su, Haipeng Luo
    Edge colorings of the complete graph K149 and the lower bounds of three Ramsey numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:126, n:2-3, pp:167-179 [Journal]
  3. Refael Hassin, Asaf Levin
    Subgraphs decomposable into two trees and k-edge-connected subgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:126, n:2-3, pp:181-195 [Journal]
  4. Daniel Kobler, Udi Rotics
    Edge dominating set and colorings on graphs with fixed clique-width. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:126, n:2-3, pp:197-221 [Journal]
  5. Dale Peterson
    Gridline graphs: a review in two dimensions and an extension to higher dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:126, n:2-3, pp:223-239 [Journal]
  6. Antonio Restivo, Pedro V. Silva
    Periodicity vectors for labelled trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:126, n:2-3, pp:241-260 [Journal]
  7. Stefan Szeider
    Finding paths in graphs avoiding forbidden transitions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:126, n:2-3, pp:261-273 [Journal]
  8. Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
    A primal-dual approximation algorithm for the survivable network design problem in hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:126, n:2-3, pp:275-289 [Journal]
  9. Jinquan Dong, Yanpei Liu, Cun-Quan Zhang
    Determination of the star valency of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:126, n:2-3, pp:291-296 [Journal]
  10. Marisa Gutierrez, João Meidanis
    Recognizing clique graphs of directed edge path graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:126, n:2-3, pp:297-304 [Journal]
  11. Kazuhisa Makino
    Efficient dualization of O(log n)-term monotone disjunctive normal forms. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:126, n:2-3, pp:305-312 [Journal]
  12. Shuichi Sakai, Mitsunori Togasaki, Koichi Yamazaki
    A note on greedy algorithms for the maximum weighted independent set problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:126, n:2-3, pp:313-322 [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