Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Geometric and Dynamic Sensing: Observation of Pose and Motion.. - Jia (1997) (Correct)
No context found.
Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979.
Available at URL ftp://ftp.cs.dartmouth.edu/TR/TR99-345.ps.Z - Mobile-Agent Planning In (Correct)
No context found.
Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, NY, 1979.
Enhancing the Internet Routing Architecture - Garcia-Luna-Aceves And Bradley (Correct)
No context found.
Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NPCompleteness. W.H. Freeman & Co., 1979. 12
Stability Behavior of Fuzzy - Clustering Methods For (Correct)
No context found.
Michael R. Garey and David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, 1979
An Approach for Automated Surgery Scheduling Karl-Heinz.. - Rwth Aachen University (Correct)
No context found.
Michael R. Garey and David S. Johnson. Computers and intractability: A Guide to the theory of NP-completeness. A Series of Books in the Mathematical Sciences. Freeman and Co., San Francisco, California, USA, 1979.
Note on Design Criteria for Rainbow-Type Multivariates - Jintai Ding Bo-Yin (2006) (Correct)
No context found.
Michael R. Garey and David S. Johnson. Computers and Intractability --- A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979. ISBN 0-71671044 -7 or 0-7167-1045-5.
Journal of Machine Learning Research 7 (2006) 55--83.. - Michael Schmitt.. (Correct)
No context found.
Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco, CA, 1979.
Matrix Deco oco Pro - Isco Fo The (Correct)
No context found.
Michael R. Garey and David S. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness", Freeman, New York, 1979.
Matrix Transformation - Is Complete For (Correct)
No context found.
Michael R. Garey and David S. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness", Freeman, New York, 1979.
On Hidden Groups in Communication Networks - Baumes, Goldberg.. (2005) (Correct)
No context found.
Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, Ney York, 1979.
Direct Routing: Algorithms and Complexity - Busch, Magdon-Ismail.. (2004) (Correct)
No context found.
Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, Ney York, 1979.
Using Combinatorial Optimization Methods for - Quantification Scheduling Chauhan (Correct)
No context found.
Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., 1979.
A BIST Pattern Generator Design for Near-Perfect Fault Coverage - Chatterjee, Pradhan (2003) (8 citations) (Correct)
No context found.
M. Gary and D. Johnson, Computers and Intractability: A Guide to the Theory of NP Completeness. Freeman, 1979.
Subsumption and Indexing in Constraint Query Languages with - Linear Arithmetic.. (Correct)
No context found.
Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
Template-Based Real-Time Dwell Scheduling with Energy - Constraint Chi-Sheng Shih (Correct)
No context found.
Michael R. Garey and David S. Johnson. Computers and intractability: a guide to the theory of NPcompleteness. W. H. Freeman, 1979.
A Better Logic and Decision Procedure for Predicate.. - Rakamaric, Bingham, Hu (2006) (Correct)
No context found.
Michael R. Garey and David S. Johnson. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA, 1990.
Predicting the Semantic Orientation of Adjectives - Vasileios Hatzivassiloglou And (1997) (5 citations) (Correct)
No context found.
Michael R. Garey and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco, California.
Learning Attack Strategies from Intrusion Alerts - Ning, Xu (2003) (3 citations) (Correct)
No context found.
M. R. Gary and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NPCompleteness. Freeman and Company, 1979.
Learning Attack Strategies from Intrusion Alerts - Ning, Xu (2003) (3 citations) (Correct)
No context found.
M. R. Gary and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979.
Non-Sequential Tool Interaction Strategies for Sea-of-Gates Layout .. - Adams (1994) (Correct)
No context found.
Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
Identifying Conflicts in Overconstrained Temporal Problems - Mark Liffiton Michael (Correct)
No context found.
Michael R. Garey and David S. Johnson. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., 1990.
Routing Algorithms for Ring Networks - Wang (2003) (Correct)
No context found.
Michael R. Garey and David S. Johnson. Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman: New York, 1979.
Composition of modules' stock using Simulated Annealing - Catherine Da Cunha (2005) (Correct)
No context found.
Michael Garey and David Johnson, Computers and Intractability: A guide to the theory of NPcompleteness, W. H. Freeman and Company, San Francisco, 1979.
Nominal Logic Programming - Cheney (2004) (Correct)
No context found.
Michael R. Garey and David S. Johnson. Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, 1979.
Generally Applicable Heuristics for Global Optimisation: An.. - Telfar (1994) (3 citations) (Correct)
No context found.
Michael R. Garey and David S. Johnson. Computers and Intractability:A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC