Donald M. Topkis

According to our database, Donald M. Topkis authored at least 15 papers between 1970 and 1995.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

1995

Repeated uncoordinated information dissemination by flooding.

Donald M. Topkis

Networks, 1995

1992

Paths on polymatroids.

Donald M. Topkis

Math. Program., 1992

1989

All-to-All Broadcast by Flooding in Communications Networks.

Donald M. Topkis

IEEE Trans. Computers, 1989

Performance analysis of information dissemination by flooding.

Donald M. Topkis

IEEE J. Sel. Areas Commun., 1989

Acyclic k-connected subgraphs for distributed alternate routing in communications networks.

Moshe Segal, Donald M. Topkis

Discret. Appl. Math., 1989

1988

A k shortest path algorithm for adaptive routing in communications networks.

Donald M. Topkis

IEEE Trans. Commun., 1988

1986

A K-Shortest Path Algorithm for Adaptive Routing in Communication Networks.

Donald M. Topkis

Proceedings of the IEEE International Conference on Communications: Integrating the World Through Communications, 1986

1985

Concurrent Broadcast for Information Dissemination.

Donald M. Topkis

IEEE Trans. Software Eng., 1985

The Partial Order of a Polymatroid Extreme Point.

Robert E. Bixby, William H. Cunningham, Donald M. Topkis

Math. Oper. Res., 1985

1984

Adjacency on polymatroids.

Donald M. Topkis

Math. Program., 1984

1983

Activity selection games and the minimum-cut problem.

Donald M. Topkis

Networks, 1983

1978

Minimizing a Submodular Function on a Lattice.

Donald M. Topkis

Oper. Res., 1978

1976

Rates of Stability in Nonlinear Programming.

Michael H. Stern, Donald M. Topkis

Oper. Res., 1976

1970

Letter to the Editor - A Note on Cutting-Plane Methods Without Nested Constraint Sets.

Donald M. Topkis

Oper. Res., 1970

Cutting-Plane Methods without Nested Constraint Sets.

Donald M. Topkis

Oper. Res., 1970