External Links

    Journal: Nord. J. Comput.

    Volume 1, Issue 4

    387 -- 0Sven Skyum. Guest Editor s Foreword
    389 -- 401Peter Becker. A New Algorithm for the Construction of Optimal B-Trees
    402 -- 432Eric Schenk. Parallel Dynamic Lowest Common Ancestors
    433 -- 457Gautam Das, Paul J. Heffernan, Giri Narasimhan. Finding all Weakly-Visible Chords of a Polygon in Linear Time
    458 -- 474Sven Schuierer. An O(log log n) Time Algorithm to Compute the Kernel of a Polygon
    475 -- 492Magnús M. Halldórsson, Jaikumar Radhakrishnan. Improved Approximations of Independent Sets in Bounded-Degree Graphs via Subgraph Removal
    493 -- 0Marcus Peinado. Hard Graphs for the Randomized Boppana-Halldörsson Algorithm for MAXCLIQUE
    runs on