Journals in DBLP

Int. J. Found. Comput. Sci.
2000, volume: 11, number: 3

1. Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle
   Mod-2 Independence and Domination in Graphs. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2000, v:11, n:3, pp:355-363 [Journal]
   
2. Ljubomir Perkovic, Bruce A. Reed
   An Improved Algorithm for Finding Tree Decompositions of Small Width. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2000, v:11, n:3, pp:365-371 [Journal]
   
3. Öjvind Johansson
   NLC₂-Decomposition in Polynomial Time. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2000, v:11, n:3, pp:373-395 [Journal]
   
4. Anne Berry, Jean Paul Bordat, Olivier Cogis
   Generating All the Minimal Separators of a Graph. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2000, v:11, n:3, pp:397-403 [Journal]
   
5. Anna Accornero, Massimo Ancona, Sonia Varini
   All Separating Triangles in a Plane Graph Can Be Optimally "Broken" in Polynomial Time. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2000, v:11, n:3, pp:405-421 [Journal]
   
6. Martin Charles Golumbic, Udi Rotics
   On the Clique-Width of Some Perfect Graph Classes. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2000, v:11, n:3, pp:423-443 [Journal]
   
7. Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
   Finding Smallest Supertrees Under Minor Containment. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2000, v:11, n:3, pp:445-465 [Journal]
   
8. Annegret Liebers, Dorothea Wagner, Karsten Weihe
   On the Hardness of Recognizing Bundles in Time Table Graphs. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2000, v:11, n:3, pp:467-484 [Journal]
   
9. Seonghun Cho, Sartaj Sahni
   A New Weight Balanced Binary Search Tree. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2000, v:11, n:3, pp:485-513 [Journal]
   
10. Takeshi Okadome
    Some Sufficient Conditions of Learnability in the Limit From Positive Data. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2000, v:11, n:3, pp:515-524 [Journal]