Journals in DBLP

Int. J. Found. Comput. Sci.
1993, volume: 4, number: 2

1. Shin-Ichi Nakano, Takao Nishizeki
   Scheduling File Transfers Under Port and Channe; Constraints. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 1993, v:4, n:2, pp:101-115 [Journal]
   
2. Iain A. Stewart
   On Two Approximation Algorithms for the Clique Problem. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 1993, v:4, n:2, pp:117-133 [Journal]
   
3. Oscar H. Ibarra, Tao Jiang, Nicholas Q. Trân, Hui Wang
   On the Equivalence of Two-Way Pushdown Automata and Counter Machines Over Bounded Languages. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 1993, v:4, n:2, pp:135-146 [Journal]
   
4. Matthew Dickerson
   General Polynomial Decomposition and the s-1-Decomposition are NP-Hard. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 1993, v:4, n:2, pp:147-156 [Journal]
   
5. Steffen Lange, Thomas Zeugmann
   Learning Recursive Languages with Bounded Mind Changes. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 1993, v:4, n:2, pp:157-178 [Journal]
   
6. Krzysztof Diks, Oscar Garrido, Andrzej Lingas
   Parallel Algorithms for Finding Maximal k-Dependent Sets and Maximal f-Matchings. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 1993, v:4, n:2, pp:179-192 [Journal]