External Links

    Journal: Algorithmica

    Volume 56, Issue 4

    383 -- 393Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca. On Independent Vertex Sets in Subclasses of Apple-Free Graphs
    394 -- 412Vladimir Kolmogorov. A Faster Algorithm for Computing the Principal Sequence of Partitions of a Graph
    413 -- 436Toshimasa Ishii, Yoko Akiyama, Hiroshi Nagamochi. Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs
    437 -- 447Satoru Iwata, Yusuke Kobayashi. An Algorithm for Minimum Cost Arc-Connectivity Orientations
    448 -- 479Eyal Amir. Approximation Algorithms for Treewidth
    480 -- 504Sudheer Sahu, John H. Reif. Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-Assembly
    529 -- 549Danny Segev, Gil Segev. Approximate ::::k::::-Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing
    550 -- 576Antonio Fernández, Ernesto Jiménez, Michel Raynal, Gilles Trédan. A Timing Assumption and Two ::::t::::-Resilient Protocols for Implementing an Eventual Leader Service in Asynchronous Shared Memory Systems
    577 -- 604Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao. ::::::::l::::::::::2:::::2::: Spreading Metrics for Vertex Ordering Problems
    605 -- 620Chris Studholme, Ian F. Blake. Random Matrices and Codes for the Erasure Channel

    Volume 56, Issue 3

    281 -- 282Xiaodong Hu, Jie Wang. Recent Advances in Computation and Combinatorial Optimization
    283 -- 296Jianxin Wang, Minzhu Xie, Jianer Chen. A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI
    297 -- 312Li-Pu Yeh, Biing-Feng Wang, Hsin-Hao Su. Efficient Algorithms for the Problems of Enumerating Cuts by Non-decreasing Weights
    313 -- 332Epameinondas Fritzilas, Martin Milanic, Sven Rahmann, Yasmin A. Rios-Solis. Structural Identifiability in Low-Rank Matrix Factorization
    333 -- 341Xianyue Li, Feng Zou, Yaochun Huang, Donghyun Kim, Weili Wu. A Better Constant-Factor Approximation for Selected-Internal Steiner Minimum Tree
    342 -- 363Ulrich Hertrampf, Christoph Minnameier. Resource Bounded Frequency Computations with Three Errors
    364 -- 382Xi Chen, Xiaoming Sun, Shang-Hua Teng. Quantum Separation of Local Search and Fixed Point Computation

    Volume 56, Issue 2

    129 -- 140L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan. Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes
    141 -- 159Nicolas Broutin, Luc Devroye, Erin McLeish. Note on the Structure of Kruskal s Algorithm
    160 -- 179Alfredo García Olaverri, Ferran Hurtado, Marc Noy, Javier Tejel. Augmenting the Connectivity of Outerplanar Graphs
    180 -- 197Piotr Sankowski, Marcin Mucha. Fast Dynamic Transitive Closure with Lookahead
    198 -- 213Viswanath Nagarajan, R. Ravi. Approximation Algorithms for Requirement Cut on Graphs
    214 -- 234Amihood Amir, Eran Chencinski. Faster Two Dimensional Scaled Matching
    235 -- 269Maarten Löffler, Marc J. van Kreveld. Largest and Smallest Convex Hulls for Imprecise Points
    270 -- 280Nikhil Bansal, Moshe Lewenstein, Bin Ma, Kaizhong Zhang. On the Longest Common Rigid Subsequence Problem

    Volume 56, Issue 1

    1 -- 2Takeshi Tokuyama. Foreword
    3 -- 16Takeaki Uno. An Efficient Algorithm for Solving Pseudo Clique Enumeration Problem
    17 -- 34Hiroshi Nagamochi. Minimum Degree Orderings
    35 -- 50Anna Urbanska. Faster Combinatorial Algorithms for Determinant and Pfaffian
    51 -- 88Thomas Sauerwald. On Mixing and Edge Expansion Properties in Randomized Broadcasting
    89 -- 104Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang. A Constant-Competitive Algorithm for Online OVSF Code Assignment
    105 -- 127M. Ziaur Rahman, J. Ian Munro. Integer Representation and Counting in the Bit Probe Model
    runs on