Author of the publication

The Complexity of Coloring Circular Arcs and Chords.

, , , and . SIAM J. Algebraic Discret. Methods, 1 (2): 216-227 (1980)

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.

 

Other publications of authors with the same name

Bounds on Scheduling with Limited Resources., and . SOSP, page 104-111. ACM, (1973)Operating System Review 7(4).Fundamental Discrepancies between Average-Case Analyses under Discrete and Continuous Distributions: A Bin Packing Case Study, , , , , , , and . STOC, page 230-240. ACM, (1991)Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling, and . STOC, page 241-248. ACM, (1991)Resource Constrained Scheduling as Generalized Bin Packing., , , and . J. Comb. Theory, Ser. A, 21 (3): 257-298 (1976)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)Some Simplified NP-Complete Problems, , and . STOC, page 47-63. ACM, (1974)Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms., , , , and . SIAM J. Comput., 3 (4): 299-325 (1974)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)The Rectilinear Steiner Tree Problem is NP Complete., and . SIAM Journal of Applied Mathematics, (1977)Scheduling File Transfers in a Distributed Network., , , and . PODC, page 254-266. ACM, (1983)