Donald M. Topkis

15 papers Journal 14Unranked 1
YearRankTypeTitle / Venue / Authors
1995 J jnl
Repeated uncoordinated information dissemination by flooding.
Networks
Donald M. Topkis
1992 J jnl
Paths on polymatroids.
Math. Program.
Donald M. Topkis
1989 J jnl
Acyclic k-connected subgraphs for distributed alternate routing in communications networks.
Discret. Appl. Math.
Moshe Segal, Donald M. Topkis
1989 J jnl
All-to-All Broadcast by Flooding in Communications Networks.
IEEE Trans. Computers
Donald M. Topkis
1989 J jnl
Performance analysis of information dissemination by flooding.
IEEE J. Sel. Areas Commun.
Donald M. Topkis
1988 J jnl
A k shortest path algorithm for adaptive routing in communications networks.
IEEE Trans. Commun.
Donald M. Topkis
1986 — conf
A K-Shortest Path Algorithm for Adaptive Routing in Communication Networks.
ICC
Donald M. Topkis
1985 J jnl
Concurrent Broadcast for Information Dissemination.
IEEE Trans. Software Eng.
Donald M. Topkis
1985 J jnl
The Partial Order of a Polymatroid Extreme Point.
Math. Oper. Res.
Robert E. Bixby, William H. Cunningham, Donald M. Topkis
1984 J jnl
Adjacency on polymatroids.
Math. Program.
Donald M. Topkis
1983 J jnl
Activity selection games and the minimum-cut problem.
Networks
Donald M. Topkis
1978 J jnl
Minimizing a Submodular Function on a Lattice.
Oper. Res.
Donald M. Topkis
1976 J jnl
Rates of Stability in Nonlinear Programming.
Oper. Res.
Michael H. Stern, Donald M. Topkis
1970 J jnl
Cutting-Plane Methods without Nested Constraint Sets.
Oper. Res.
Donald M. Topkis
1970 J jnl
Letter to the Editor - A Note on Cutting-Plane Methods Without Nested Constraint Sets.
Oper. Res.
Donald M. Topkis