External Links

    Journal: Discrete Applied Mathematics

    Volume 28, Issue 3

    191 -- 195Douglas Bauer, S. Louis Hakimi, Edward F. Schmeichel. Recognizing tough graphs is NP-hard
    197 -- 205E. Andrew Boyd, Ulrich Faigle. An algorithmic characterization of antimatroids
    207 -- 221Jon Lee. Canonical equation sets for classes of concordant polytopes
    223 -- 230John W. Mamer, Kenneth Schilling. On the growth of random knapsacks
    231 -- 249Masahiro Miyakawa, Ivo G. Rosenberg, Ivan Stojmenovic. Classification of three-valued logical functions preserving 0
    251 -- 263Jennifer Ryan. The structure of an integral monoid and integer programming feasibility
    265 -- 269Suzanne M. Seager. The double competition number of some triangle-free graphs
    271 -- 285Marcelo J. Weinberger, Abraham Lempel. Factorization of symmetric circulant matrices in finite fields
    287 -- 296Heiko Wittenberg. Local medians in chordal graphs
    297 -- 301Adam Idzik. Communication in m-connected graphs
    303 -- 307Moni Naor. Succinct representation of general unlabeled graphs
    309 -- 312Gérald E. Séguin. Low complexity normal bases for F::2:::mn:::::

    Volume 28, Issue 2

    83 -- 91Franz Aurenhammer. A relationship between Gale transforms and Voronoi diagrams
    93 -- 109Ruay Shiung Chang, Richard C. T. Lee. On the continuous working problem
    111 -- 134Peter Eades, Nicholas C. Wormald. Fixed edge-length graph drawing is NP-hard
    135 -- 147Michael A. Langston, Michael P. Morford. Resource allocation under limited sharing
    149 -- 156Charles T. Ryan, Kevin M. Ryan. The minimum weight of the Grassmann codes C(k, n),
    157 -- 169Zhuocheng Yang. On optimal strategies for a betting game
    171 -- 176Zoltán Füredi. Perfect error-correcting databases
    177 -- 181Zhixiong Wang. The solution of a nonlinear partial difference equation
    183 -- 186Toshimasa Watanabe, Akira Nakamura. A smallest augmentation to 3-connect a graph

    Volume 28, Issue 1

    1 -- 0Toshihide Ibaraki. Preface
    3 -- 9Annelie von Arnim, Ulrich Faigle, Rainer Schrader. The permutahedron of series-parallel posets
    11 -- 20Jacek Blazewicz, Maciej Drozdowski, G. Schmidt, Dominique de Werra. Scheduling independent two processor tasks on a uniform duo-processor system
    21 -- 34Rainer E. Burkard, En-Yu Yao. Constrained partitioning problems
    35 -- 44Peter L. Hammer, Uri N. Peled, Xiaorong Sun. Difference graphs
    45 -- 57Dorit S. Hochbaum, Ron Shamir. Minimizing the number of tardy job units under release time constraints
    59 -- 70Silvano Martello, Paolo Toth. Lower bounds and reduction procedures for the bin packing problem
    71 -- 81Feng Yang, Ding-Zhu Du. The complexity of determinacy problem on group testing
    runs on