External Links

    Journal: J. Algorithms

    Volume 32, Issue 2

    65 -- 86Paola Bonizzoni, Gianluca Della Vedova. An Algorithm for the Modular Decomposition of Hypergraphs
    87 -- 107J. Scott Provan, Roger C. Burk. Two-Connected Augmentation Problems in Planar Graphs
    108 -- 132Joseph Gil, Alon Itai. How to Pack Trees
    133 -- 154Nils Klarlund. An ::::n:::: log ::::n:::: Algorithm for Online BDD Refinement
    155 -- 166Ming Li, Louxin Zhang. Twist-Rotation Transformations of Binary Trees and Arithmetic Expressions
    167 -- 194Hans Leo Bodlaender, Dimitrios M. Thilikos. Graphs with Branchwidth at Most Three
    195 -- 211Ruy Luiz Milidiú, Eduardo Sany Laber, Artur Alves Pessoa. Bounding the Compression Loss of the FGK Algorithm

    Volume 32, Issue 1

    1 -- 20Nader H. Bshouty. Lower Bounds for the Complexity of Functions in a Realistic RAM Model
    21 -- 30Vincenzo Auletta, Yefim Dinitz, Zeev Nutov, Domenico Parente. A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
    31 -- 40Yefim Dinitz, Zeev Nutov. A 3-Approximation Algorithm for Finding Optimum 4, 5-Vertex-Connected Spanning Subgraphs
    41 -- 57Ton Kloks, Dieter Kratsch, Haiko Müller. Approximating the Bandwidth for Asteroidal Triple-Free Graphs
    58 -- 61Samir Khuller, Manfred Göbel, Jochen Walter. Bases for Polynomial Invariants of Conjugates of Permutation Groups
    runs on