External Links

    Journal: Discrete Applied Mathematics

    Volume 59, Issue 3

    203 -- 214Lars Døvling Andersen, Herbert Fleischner. The NP-completeness of Finding A-trails in Eulerian Graphs and of Finding Spanning Trees in Hypergraphs
    215 -- 224Michal Benelli, Refael Hassin. optimal Separable Partitioning in the Plane
    225 -- 235Martin C. Carlisle, Errol L. Lloyd. on the K-coloring of Intervals
    237 -- 266Yuri N. Sotskov, Natalia V. Shakhlevich. NP-hardness of Shop-scheduling Problems with Three Jobs
    267 -- 283Ramjee P. Swaminathan, Donald K. Wagner. The Arborescence-realization Problem
    285 -- 292Arthur T. Benjamin, Cherlyn Converse, Henry A. Krieger. How Do I Marry Thee? Let Me Count the Ways!
    293 -- 298Marco Carpentieri. Some Democratic Secret Sharing Schemes

    Volume 59, Issue 2

    103 -- 114José Gómez, Paz Morillo, Carles Padró. Large (d, D, D , s) - bipartite Digraphs
    115 -- 127Scott W. Hadley. Approximation Techniques for Hypergraph Partitioning Problems
    129 -- 136Sandi Klavzar, Norbert Seifter. Dominating Cartesian Products of Cycles
    137 -- 151Weiguo Liu, Anthony Vannelli. Generating Lower Bounds for the Linear Arrangement Problem
    153 -- 179Ola Petersson, Alistair Moffat. A Framework for Adaptive Sorting
    181 -- 191Jeremy Spinrad, R. Sritharan. Algorithms for Weakly Triangulated Graphs
    193 -- 199Jared Wunsch. The Shields-Harary Number for Wheel and Broken Wheel Graphs

    Volume 59, Issue 1

    1 -- 10Francis T. Boesch, Xiaoming Li, Jose Rodriguez. Graphs with Most Number of Three Point Induced Connected Subgraphs
    11 -- 21Heidemarie Bräsel, David Kluge, Frank Werner. A Polynomial Algorithm for an open Shop Problem with Unit Processing Times and Tree Constraints
    23 -- 31Thomas Eiter, Pekka Kilpeläinen, Heikki Mannila. Recognizing Renamable Generalized Propositional Horn Formulas Is NP-complete
    33 -- 50Xin He, David B. Sher. on Determining Non-isotopic Configurations of Points on a Circle
    51 -- 56Johan Karlander. Matrices Generated By Semilattices
    57 -- 74Yves Pochet, Laurence A. Wolsey. Integer Knapsack and Flow Covers with Divisible Coefficients: Polyhedra, optimization and Separation
    75 -- 86Vitaly A. Strusevich. Two Machine Flow Shop Scheduling Problem with No Wait in Process: Controllable Machine Speeds
    87 -- 102Jimmy J. M. Tan, Yuang-Cheh Hsueh. A Generalization of the Stable Matching Problem
    runs on