( en | de | ru )

 

Disambiguation of "Garey, M. R."

Author of the publication

copydeleteadd this publication to your clipboard
The Transitive Reduction of a Directed Graph.

, , and . SIAM J. Comput., 1 (2): 131-137 (1972)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

M R Buchmeiser

Jonas M R Lindert

R M W Dixon

Ester M R Ruprecht

Fridolin M R Walther

 

Other publications of authors with the same name

Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences), and . W. H. Freeman, First Edition edition, (1979)The Transitive Reduction of a Directed Graph., , and . SIAM J. Comput., 1 (2): 131-137 (1972)The Complexity of Checkers on an N * N Board - Preliminary Report, , , , and . FOCS, page 55-64. IEEE Computer Society, (1978)The Complexity of Searching a Graph (Preliminary Version), , , , and . FOCS, page 376-385. IEEE Computer Society, (1981)Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings., , , , , , and . SIAM J. Discret. Math., 13 (3): 384-402 (2000)Scheduling File Transfers in a Distributed Network., , , and . PODC, page 254-266. ACM, (1983)The Complexity of Collapsing Reachability Graphs., , , and . Automatic Verification Methods for Finite State Systems, volume 407 of Lecture Notes in Computer Science, page 264-274. Springer, (1989)Some Simplified NP-Complete Problems, , and . STOC, page 47-63. ACM, (1974)Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling, and . STOC, page 241-248. ACM, (1991)Fundamental Discrepancies between Average-Case Analyses under Discrete and Continuous Distributions: A Bin Packing Case Study, , , , , , , and . STOC, page 230-240. ACM, (1991)