The SCEAS System
Navigation Menu

Journals in DBLP

Int. J. Found. Comput. Sci.
1996, volume: 7, number: 2

  1. Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe
    Linear-Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1996, v:7, n:2, pp:95-110 [Journal]
  2. Ton Kloks
    Treewidth of Circle Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1996, v:7, n:2, pp:111-120 [Journal]
  3. Gautam Das, Paul J. Heffernan
    Constructing Degree-3 Spanners with Other Sparseness Properties. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1996, v:7, n:2, pp:121-136 [Journal]
  4. Rudolf Fleischer
    A Simple Balanced Search Tree with O(1) Worst-Case Update Time. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1996, v:7, n:2, pp:137-150 [Journal]
  5. Keijo Ruohonen
    An Effective Cauchy-Peano Existence Theorem for Unique Solutions. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1996, v:7, n:2, pp:151-160 [Journal]
  6. Raymond Greenlaw
    Subtree Isomorphism is in DLOG for Nested Trees. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1996, v:7, n:2, pp:161-168 [Journal]
  7. Kim S. Larsen, Rolf Fagerberg
    Efficient Rebalancing of B-Trees with Relaxed Balance. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1996, v:7, n:2, pp:169-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