The SCEAS System
Navigation Menu

Conferences in DBLP

Graph Theory and Algorithms (gta)
1980 (conf/gta/1980)

  1. Wataru Mayeda
    Dividing a system into almost unidirectional blocks. [Citation Graph (0, 0)][DBLP]
    Graph Theory and Algorithms, 1980, pp:1-8 [Conf]
  2. Norishige Chiba, Takao Nishizeki, Nobuji Saito
    A linear algorithm for five-coloring a planar graph. [Citation Graph (0, 0)][DBLP]
    Graph Theory and Algorithms, 1980, pp:9-19 [Conf]
  3. Shuji Tsukiyama, Ernest S. Kuh, Isao Shirakawa
    On the layering problem of multilayer PWB wiring. [Citation Graph (0, 0)][DBLP]
    Graph Theory and Algorithms, 1980, pp:20-37 [Conf]
  4. Jin Akiyama
    A status on the linear arboricity. [Citation Graph (0, 0)][DBLP]
    Graph Theory and Algorithms, 1980, pp:38-44 [Conf]
  5. G. Kishi
    On centrality functions of a graph. [Citation Graph (0, 0)][DBLP]
    Graph Theory and Algorithms, 1980, pp:45-52 [Conf]
  6. Satoru Fujishige
    Canonical decompositions of symmetric submodular systems. [Citation Graph (0, 0)][DBLP]
    Graph Theory and Algorithms, 1980, pp:53-64 [Conf]
  7. T. Hirata, M. Kimura
    The subgraph homeomorphism problem on reducible flow graphs. [Citation Graph (0, 0)][DBLP]
    Graph Theory and Algorithms, 1980, pp:65-78 [Conf]
  8. K. Takamizawa, Takao Nishizeki, Nobuji Saito
    Combinatorial problems on series-parallel graphs. [Citation Graph (0, 0)][DBLP]
    Graph Theory and Algorithms, 1980, pp:79-94 [Conf]
  9. Takao Ozawa, H. Takahashi
    A graph-planarization algorithm and its application to random graphs. [Citation Graph (0, 0)][DBLP]
    Graph Theory and Algorithms, 1980, pp:95-107 [Conf]
  10. Claude Berge
    Some common properties for regulizable graphs, edge-critical graphs and B-graphs. [Citation Graph (0, 0)][DBLP]
    Graph Theory and Algorithms, 1980, pp:108-123 [Conf]
  11. Masao Iri
    "Dualities" in graph theory and the related fields viewed from the metatheoretical standpoint. [Citation Graph (0, 0)][DBLP]
    Graph Theory and Algorithms, 1980, pp:124-136 [Conf]
  12. S. Shinoda, T. Kawamoto
    On central trees of a graph. [Citation Graph (0, 0)][DBLP]
    Graph Theory and Algorithms, 1980, pp:137-151 [Conf]
  13. Takumi Kasai, Akeo Adachi
    On polynominal time computable problems. [Citation Graph (0, 0)][DBLP]
    Graph Theory and Algorithms, 1980, pp:152-158 [Conf]
  14. Masakazu Nasu
    Homomorphisms of graphs and their global maps. [Citation Graph (0, 0)][DBLP]
    Graph Theory and Algorithms, 1980, pp:159-170 [Conf]
  15. Toshinobu Kashiwabara
    Algorithms for some intersection graphs. [Citation Graph (0, 0)][DBLP]
    Graph Theory and Algorithms, 1980, pp:171-181 [Conf]
  16. Takao Asano, S. Kikuchi, Nobuji Saito
    An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph. [Citation Graph (0, 0)][DBLP]
    Graph Theory and Algorithms, 1980, pp:182-195 [Conf]
  17. H. Hosoya
    Characterization of polyhex graphs as applied to chemistry. [Citation Graph (0, 0)][DBLP]
    Graph Theory and Algorithms, 1980, pp:196-206 [Conf]
  18. Tatsuo Ohtsuki
    The two disjoint path problem and wire routing design. [Citation Graph (0, 0)][DBLP]
    Graph Theory and Algorithms, 1980, pp:207-216 [Conf]
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