Michael Randolph Garey is a computer science researcher, and co-author (with David S. Johnson) of Computers and Intractability: A Guide to the Theory… (More)

Semantic Scholar uses AI to extract papers important to this topic.

Review

2015

Review

2015

- Lane A. Hemaspaandra
- SIGACT News
- 2015

The 2000s are upon us, and your Complexity Theory Column celebrates their start with Madhu Sudan writing on list decoding. Up… (More)

Is this relevant?

2007

2007

- David S. Johnson
- ACM Trans. Algorithms
- 2007

This is the 26th edition of a column that covers new developments in the theory of NP-completeness. The presentation is modeled… (More)

Is this relevant?

2006

2006

- David S. Johnson
- ACM Trans. Algorithms
- 2006

This is the 25th edition of a column that covers new developments in the theory of NP-completeness. The presentation is modeled… (More)

Is this relevant?

2005

2005

- David S. Johnson
- ACM Trans. Algorithms
- 2005

This is the 24th edition of a column that covers new developments in the theory of NP-completeness. The presentation is modeled… (More)

Is this relevant?

2004

2004

We have already introduced many fuzzy concepts to scheduling problem and discussed so called fuzzy scheduling problems. In this… (More)

Is this relevant?

2003

2003

- Edward G. Coffman
- J. ACM
- 2003

The journal, as many have always called it, will have the semicentenary of its professional existence just four years before my… (More)

Is this relevant?

2002

1995

1995

- Prabir Bhattacharya, Yan-Kung Yan
- IEEE Trans. Systems, Man, and Cybernetics
- 1995

[4] T. Catarci, “Assignment heuristic for edge crossing minimization,” Tech. Report of the Dipartimento di Infonnatica e… (More)

Is this relevant?

1987

Highly Cited

1982