Discrete Applied Mathematics

Preface
pp. 1-1(1)
Authors: Katoh N.; Ibaraki T.; Recski A.

On the binary solitaire cone
pp. 3-14(12)
Authors: Avis D.; Deza A.

Combinatorial problems related to origin-destination matrices
pp. 15-36(22)
Authors: Boros E.; Hammer P.L.; Ricca F.; Simeone B.

An orientation theorem with parity conditions
pp. 37-47(11)
Authors: Frank A.; Jordan T.; Szigeti Z.

Bipartition constrained edge-splitting in directed graphs
pp. 49-62(14)
Authors: Gabow H.N.; Jordan¹ T.

Lengths of tours and permutations on a vertex set of a convex polygon
pp. 63-71(9)
Authors: Hiro I.; Hideyuki U.; Mitsuo Y.

Spanning trees with constraints on the leaf degree
pp. 73-76(4)
Author: Kaneko A.

Crossing-free segments and triangles in point configurations
pp. 77-88(12)
Authors: Karolyi G.; Welzl E.

Subdivisions of integral base polytopes
pp. 89-97(9)
Author: Kashiwabara K.

A large set of non-Hamiltonian graphs
pp. 99-115(17)
Author: Katona¹ G.Y.

Bandwidth and topological bandwidth of graphs with few P₄'s
pp. 117-133(17)
Authors: Kloks T.; Tan R.B.

Topological optimization with a network reliability constraint
pp. 135-149(15)
Authors: Koide T.; Shinmori S.; Ishii H.

Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella
pp. 151-176(26)
Authors: Murota K.; Shioura A.

The edge-disjoint paths problem is NP-complete for series-parallel graphs
pp. 177-186(10)
Authors: Nishizeki T.; Vygen J.; Zhou X.

Rigidity of multi-story buildings
pp. 187-198(12)
Author: Radics N.

Some polynomially solvable subcases of the detailed routing problem in VLSI design
pp. 199-208(10)
Author: Recski A.

On kernel-less clique-acyclic orientations of minimally imperfect graphs
pp. 209-219(11)
Author: Sakuma T.