External Links

    Journal: Int. J. Found. Comput. Sci.

    Volume 29, Issue 1

    1 -- 16Vojtech Vorel. On Basic Properties of Jumping Finite Automata
    17 -- 62Martin Lück. Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic
    63 -- 90Safia Kedad-Sidhoum, Florence Monna, Grégory Mounié, Denis Trystram. A Family of Scheduling Algorithms for Hybrid Parallel Platforms
    91 -- 100Nianfeng Lin, Damei Lü, Jinhua Wang. L(2, 1)-Edge-Labelings of the Edge-Path-Replacement of a Graph
    101 -- 122Alejandro López-Ortiz, Cynthia B. Perez, Jazmín Romero. Arbitrary Overlap Constraints in Graph Packing Problems
    123 -- 138Ghajendran Poovanandran, Wen Chean Teh. On M-Equivalence and Strong M-Equivalence for Parikh Matrices
    runs on