External Links

    Journal: J. Algorithms

    Volume 43, Issue 2

    155 -- 176Kazuhisa Makino. A linear time algorithm for recognizing regular Boolean functions
    177 -- 189Marek Chrobak, Leszek Gasieniec, Wojciech Rytter. Fast broadcasting and gossiping in radio networks
    190 -- 200Hans L. Bodlaender, Fedor V. Fomin. Approximation of pathwidth of outerplanar graphs
    201 -- 219Uriel Feige, Marek Karpinski, Michael Langberg. Improved approximation of Max-Cut on graphs of bounded degree
    220 -- 263Richard Edwin Stearns, Harry B. Hunt III. Exploiting structure in quantified formulas
    264 -- 283David Liben-Nowell. Gossip is synteny: Incomplete gossip and the syntenic distance between genomes

    Volume 43, Issue 1

    1 -- 16Wen-Lian Hsu. A Simple Test for the Consecutive Ones Property
    17 -- 50Volker Heun, Ernst W. Mayr. Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes
    51 -- 84Volker Heun, Ernst W. Mayr. Efficient Dynamic Embeddings of Binary Trees into Hypercubes
    85 -- 105Robert W. Irving, David Manlove. The Stable Roommates Problem with Ties
    106 -- 119Hans Leo Bodlaender, Dieter Kratsch. Kayles and Nimbers
    120 -- 137Edward G. Coffman Jr., Predrag R. Jelenkovic, Petar Momcilovic. The Dyadic Stream Merging Algorithm
    138 -- 152Daya Ram Gaur, Toshihide Ibaraki, Ramesh Krishnamurti. Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem
    runs on