External Links

    Journal: Algorithmica

    Volume 36, Issue 4

    331 -- 341Satoru Iwata. Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation
    343 -- 359Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting. Escaping a Grid by Edge-Disjoint Paths
    361 -- 374Anna Galluccio, Guido Proietti. Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems
    375 -- 408Hans Leo Bodlaender, Udi Rotics. Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition
    runs on