The SCEAS System
Navigation Menu

Journals in DBLP

Int. J. Found. Comput. Sci.
1999, volume: 10, number: 2

  1. Koji Nakano, Stephan Olariu
    Guest Editors' Introduction. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:2, pp:123-126 [Journal]
  2. Florian Roussel, Irena Rusu
    Holes and Dominoes in Meyniel Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:2, pp:127-146 [Journal]
  3. Michel Habib, Christophe Paul, Laurent Viennot
    Partition Refinement Techniques: An Interesting Algorithmic Tool Kit. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:2, pp:147-170 [Journal]
  4. Shuji Isobe, Xiao Zhou, Takao Nishizeki
    A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:2, pp:171-194 [Journal]
  5. Kazuyuki Miura, Daishiro Takahashi, Shin-Ichi Nakano, Takao Nishizeki
    A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four Connected Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:2, pp:195-210 [Journal]
  6. Savio S. H. Tse, Francis C. M. Lau
    On the Complexity of Some Adaptive Polling Algorithms in General Networks. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:2, pp:211-224 [Journal]
  7. Michael Holzrichter, Suely Oliveira
    A Graph Based Davidson Algorithm for the Graph Partitioning Problem. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:2, pp:225-0 [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