Cutting-Plane Methods without Nested Constraint Sets. - Donald M. Topkis (Oper. Res., 1970)

Letter to the Editor - A Note on Cutting-Plane Methods Without Nested Constraint Sets. - Donald M. Topkis (Oper. Res., 1970)

Rates of Stability in Nonlinear Programming. - Michael H. Stern; Donald M. Topkis (Oper. Res., 1976)

Minimizing a Submodular Function on a Lattice. - Donald M. Topkis (Oper. Res., 1978)

Activity selection games and the minimum-cut problem. - Donald M. Topkis (Networks, 1983)

Adjacency on polymatroids. - Donald M. Topkis (Math. Program., 1984)

The Partial Order of a Polymatroid Extreme Point. - Robert E. Bixby; William H. Cunningham; Donald M. Topkis (Math. Oper. Res., 1985)

Concurrent Broadcast for Information Dissemination. - Donald M. Topkis (IEEE Trans. Software Eng., 1985)

A K-Shortest Path Algorithm for Adaptive Routing in Communication Networks. - Donald M. Topkis (ICC, 1986)

A k shortest path algorithm for adaptive routing in communications networks. - Donald M. Topkis (IEEE Trans. Commun., 1988)

Acyclic k-connected subgraphs for distributed alternate routing in communications networks. - Moshe Segal; Donald M. Topkis (Discret. Appl. Math., 1989)

Performance analysis of information dissemination by flooding. - Donald M. Topkis (IEEE J. Sel. Areas Commun., 1989)

All-to-All Broadcast by Flooding in Communications Networks. - Donald M. Topkis (IEEE Trans. Computers, 1989)

Paths on polymatroids. - Donald M. Topkis (Math. Program., 1992)

Repeated uncoordinated information dissemination by flooding. - Donald M. Topkis (Networks, 1995)