External Links

    Journal: Algorithmica

    Volume 54, Issue 4

    471 -- 0Guohui Lin, Zhipeng Cai. Editorial, COCOON 2007 Special Issue
    472 -- 489Jianer Chen, Songjian Lu. Improved Parameterized Set Splitting Algorithms: A Probabilistic Approach
    490 -- 500Hamid Zarrabi-Zadeh, Timothy M. Chan. An Improved Algorithm for Online Unit Clustering
    501 -- 529Zhi-Zhong Chen, Lusheng Wang, Zhanyong Wang. Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats
    530 -- 543Yunlong Liu, Jianer Chen, Jianxin Wang. On Counting 3-D Matchings of Size ::::k::::
    544 -- 556Noga Alon, Shai Gutner. Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs
    557 -- 567Yong Zhang, Francis Y. L. Chin, Hong Zhu. A 1-Local Asymptotic 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs

    Volume 54, Issue 3

    269 -- 317Sashka Davis, Russell Impagliazzo. Models of Greedy Algorithms for Graph Problems
    318 -- 336Boris Aronov, Paz Carmi, Matthew J. Katz. Minimum-Cost Load-Balancing Partitions
    337 -- 352Lars Arge, Vasilis Samoladas, Ke Yi. Optimal External Memory Planar Point Enclosure
    353 -- 378Pei-Chi Huang, Hsin-Wen Wei, Wan-Chen Lu, Wei Kuan Shih, Tsan-sheng Hsu. Smallest Bipartite Bridge-Connectivity Augmentation
    379 -- 399Yury Lifshits, Shay Mozes, Oren Weimann, Michal Ziv-Ukelson. Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions
    400 -- 412Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd. A Note on Multiflows and Treewidth
    413 -- 469Anil Maheshwari, Norbert Zeh. I/O-Efficient Algorithms for Graphs of Bounded Treewidth

    Volume 54, Issue 2

    141 -- 0Tetsuo Asano. Editorial
    142 -- 180Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi. Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner s Contraction
    181 -- 207Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Alexey A. Stepanov. On Two Techniques of Combining Branching and Treewidth
    208 -- 225Saswata Shannigrahi, Sudebkumar Prasant Pal. Efficient Prüfer-Like Coding and Counting Labelled Hypertrees
    226 -- 242Ferdinando Cicalese, Fredrik Manne, Qin Xin. Faster Deterministic Communication in Radio Networks
    243 -- 255Frank Neumann, Carsten Witt. Runtime Analysis of a Simple Ant Colony Optimization Algorithm
    256 -- 267Kazuo Iwama, Hiroki Morizumi, Jun Tarui. Negation-Limited Complexity of Parity and Inverters

    Volume 54, Issue 1

    1 -- 24Radu Mihaescu, Dan Levy, Lior Pachter. Why Neighbor-Joining Works
    25 -- 53Giuseppe Di Battista, Fabrizio Frati. Small Area Drawings of Outerplanar Graphs
    54 -- 71Rajiv Gandhi, Julián Mestre. Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
    72 -- 88Hee-Kap Ahn, Sang Won Bae, Siu-Wing Cheng, Kyung-Yong Chwa. Casting an Object with a Core
    89 -- 106Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz. Resource Allocation in Bounded Degree Trees
    107 -- 117Hsiao-Fei Liu, Kun-Mao Chao. On Locating Disjoint Segments with Maximum Sum of Densities
    118 -- 139Bogdan S. Chlebus, Dariusz R. Kowalski, Tomasz Radzik. Many-to-Many Communication in Radio Networks
    runs on