External Links

    Journal: Discrete Applied Mathematics

    Volume 55, Issue 3

    197 -- 218Esther M. Arkin, Refael Hassin. Approximation Algorithms for the Geometric Covering Salesman Problem
    219 -- 232Hans Leo Bodlaender, Klaus Jansen, Gerhard J. Woeginger. Scheduling with Incompatible Jobs
    233 -- 239Mao-cheng Cai. An Algorithm for an Eulerian Trail Traversing Specified Edges in Given order
    241 -- 258Grant A. Cheston, Gerd Fricke. Classes of Graphs for Which Upper Fractional Domination Equals Independence, Upper Domination, and upper Irredundance
    259 -- 272J. A. Hoogeveen, Steef L. van de Velde, Bart Veltman. Complexity of Scheduling Multiprocessor Tasks with Prespecified Processor Allocations
    273 -- 279Gilbert Laffond, Jean-François Laslier, Michel Le Breton. The Copeland Measure of Condorcet Choice Functions
    281 -- 293Thierry Mautor, Catherine Roucairol. A New Exact Algorithm for the Solution of Quadratic Assignment Problems
    295 -- 301Takao Nishizeki, Svatopluk Poljak. k-Connectivity and Decomposition of Graphs into Forests

    Volume 55, Issue 2

    95 -- 105Amotz Bar-Noy, Shlomo Kipnis. Broadcasting Multiple Messages in Simultaneous Send/receive Systems
    107 -- 111Dominique de Werra. on an optimization Problem occurring in FMSs: A Hypergraph-theoretical Formulation
    113 -- 132Antoine Gautier, Frieda Granot. on the Equivalence of Constrained and Unconstrained Flows
    133 -- 143Chính T. Hoàng. Efficient Algorithms for Minimum Weighted Colouring of Some Classes of Perfect Graphs
    145 -- 162Antoon W. J. Kolen, A. H. G. Rinnooy Kan, C. P. M. van Hoesel, Albert P. M. Wagelmans. Sensitivity Analysis of List Scheduling Heuristics
    163 -- 182Jon Lee, Walter D. Morris Jr.. Geometric Comparison of Combinatorial Polytopes

    Volume 55, Issue 1

    1 -- 13Endre Boros, Peter L. Hammer, Xiaorong Sun. Recognition of q-Horn Formulae in Linear Time
    15 -- 35Helen Cameron, Derick Wood. Maximal Path Length of Binary Trees
    37 -- 57Rudi Penne. Isostatic Bar and Joint Frameworks in the Plane with Irreducible Pure Conditions
    59 -- 82Sergey Vasil evich Sevast janov. on Some Geometric Methods in Scheduling Theory: A Survey
    83 -- 86. Some Combinatorial Properties of Self-reading Sequences
    87 -- 89Stanislaw Krynski. Graphs in Which All Hamiltonian Cycles Have the Same Length
    91 -- 93Abraham P. Punnen, Kunhiraman Nair. Improved Complexity Bound for the Maximum Cardinality Bottleneck Bipartite Matching Problem
    runs on