External Links

    Journal: Discrete Applied Mathematics

    Volume 10, Issue 3

    211 -- 225Eric Allender. On the number of cycles possible in digraphs with large girth
    227 -- 240Charles E. Blair, Robert G. Jeroslow. Constructive characterizations of the value function of a mixed-integer program II
    241 -- 253Jacek Blazewicz, Jerzy R. Nawrocki. Dynamic storage allocation with limited compaction - complexity and some practical implications
    255 -- 259Yung-ching Chu. An extended result of Kleitman and Saks concerning binary trees
    261 -- 274Naoki Katoh, Toshihide Ibaraki. An efficient algorithm for the parametric resource allocation problem
    275 -- 285Takashi Kayano. Extremal length of an infinite network related to an accessible boundary point
    287 -- 295Burkhard Monien, Ewald Speckenmeyer. n steps
    297 -- 312Ko-kichi Sugihara. Detection of structural inconsistency in systems of equations with degrees of freedom and its applications
    313 -- 321Jayme Luiz Szwarcfiter, Ronaldo C. M. Persiano, Antonio A. F. Oliveira. Orientations with single source and sink

    Volume 10, Issue 2

    115 -- 0A. H. G. Rinnooy Kan. Preface
    117 -- 124Wolfgang W. Bein, Peter Brucker, Arie Tamir. Minimum cost flow algorithms for series-parallel networks
    125 -- 137Celso C. Ribeiro, Michel Minoux. A heuristic approach to hard constrained shortest path problems
    139 -- 153Martin E. Dyer, Alan M. Frieze. On the complexity of partitioning graphs into connected subgraphs
    155 -- 164C. N. Potts. Analysis of a linear programming heuristic for scheduling unrelated parallel machines
    165 -- 177Manfred Kunde, Horst Steppat. First fit decreasing scheduling on uniform multiprocessors
    179 -- 195Gerald L. Thompson, Sharad Singhal. A successful algorithm for the undirected Hamiltonian path problem
    197 -- 201Colin McDiarmid. On some conditioning results in the probabilistic analysis of algorithms
    203 -- 209W. Cook. A note on matchings and separability

    Volume 10, Issue 1

    1 -- 18Peter Brucker, W. Papenjohann. An out-of-kilter method for the algebraic circulation problem
    19 -- 26Peter Butkovic. Necessary solvability conditions of systems of linear extremal equations
    27 -- 45Don Coppersmith, Uzi Vishkin. Solving NP-hard problems in 'almost trees': Vertex cover
    47 -- 56Alan M. Frieze. On the value of a random minimum spanning tree problem
    57 -- 77Alan M. Frieze, Geoffrey R. Grimmett. The shortest-path problem for graphs with random arc-lengths
    79 -- 92Hiroshi Imai. On combinatorial structures of line drawings of polyhedra
    93 -- 109Fred S. Roberts. Applications of edge coverings by cliques
    111 -- 114A. E. Brouwer. Some new two-weight codes and strongly regular graphs
    runs on