Publications
A Phenomenon in the Theory of Sorting.
Journal of Computer and System Sciences. 6(2), 103-115.
(1972). Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems.
Journal of the Association for Computing Machinery. 19(2), 248-264.
(1972). An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs.
SIAM Journal on Computing. 2(4), 225-231.
(1973).
(1974).
(1974).
(1975).
Near-optimal Solutions to a 2-dimensional Placement Problem.
SIAM Journal on Computing. 4(3), 271-286.
(1975).
(1975). Probabilistic Behavior of a Naive Coloring Algorithm on Random Graphs.
Bulletin of the Operations Research Society of America. 23,
(1975). Two Special Cases of the Assignment Problem.
Discrete Mathematics (Netherlands). 13(2), 129-142.
(1975). On the Optimality of Huffman Trees.
SIAM Journal on Applied Mathematics. 31(2), 368-378.
(1976). Probabilistic Analysis of Partitioning Algorithms for the Traveling-salesman Problem in the Plane.
Mathematics of Operations Research. 2(3), 209-224.
(1977). A Characterization of the Minimum Cycle Mean in a Digraph.
Discrete Mathematics (Netherlands). 23(3), 309-311.
(1978). A Patching Algorithm for the Nonsymmetric Traveling-salesman Problem.
SIAM Journal on Computing. 8(4), 561-573.
(1979). Probabilistic Analysis of Graph-theoretic Algorithms.
Proceedings of the Computer Science and Statistics 12th Annual Symposium on the Interface.
(1979). Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems.
Proceedings of the Computer Science and Statistics 12th Annual Symposium on the Interface. 174-176.
(1979). Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems.
Proceedings of the 20th Annual IEEE Symposium of Foundations of Computer Science. 218-223.
(1979).
(1979).
(1980).
On Linear Characterizations of Combinatorial Optimization Problems.
Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science. 1-9.
(1980). The Complexity of Testing Whether a Graph is a Superconcentrator.
13(4-5), 164-167.
(1981). Maximum Matchings in Sparse Random Graphs.
Proceedings of the 22nd IEEE Annual Symposium on Foundations of Computer Science. 364-375.
(1981). Parametric Shortest Path Algorithms with an Application to Cyclic Staffing.
Discrete Applied Mathematics (Netherlands). 3(1), 37-45.
(1981). Dynamic Programming Meets the Principle of Inclusion and Exclusion.
Operations Research Letters. 1(2), 49-51.
(1982). An efficient approximation scheme for the one-dimensional bin-packing problem.
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science. 312-320.
(1982).