M. R. Garey and D. S. Johnson, Computers and Intractability. Freeman, San Francisco,, 1978. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Improving Broadcast Operations in Ad Hoc Networks Using.. - Spohn.. (2004) (Correct)
No context found.
M. R. Garey and D. S. Johnson, Computers and Intractability. Freeman, San Francisco,, 1978.
Improving Route Discovery in On-Demand Routing Protocols Using.. - Spohn, al. (2005) (Correct)
No context found.
M. R. Garey, D. S. Johnson, Computers and Intractability, Freeman, San Francisco,, 1978.
Improving the Efficiency and Reliability of the Route Discovery .. - Spohn, al. (2008) (Correct)
No context found.
M. R. Garey and D. S. Johnson, Computers and Intractability. Freeman, San Francisco,, 1978.
Using Dominating Sets To Improve The Performance Of Mobile Ad Hoc.. - Spohn (2005) (Correct)
No context found.
M. R. Garey and D. S. Johnson. Computers and Intractability. Freeman, San Francisco, 1978.
Distance Patterns in Structural Similarity - Kämpke (2006) (Correct)
No context found.
Michael R. Garey and David S. Johnson. Computers and Intractability. Freeman, San Francisco, 1981.
The Barycenter Heuristic and the Reorderable Matrix - Mäkinen, al. (2005) (Correct)
No context found.
Garey, M.R. & Johnson, D.S. (1979) Computers and Intractability. A Guide to the Theory of NPCompleteness. W.H.Freeman, San Francisco, CA.
Gateway Placement for Latency and Energy Efficient Data.. - Jennifer Wong Roozbeh (2004) (Correct)
No context found.
M. Garey and D. Johnson, Computers and Intractability. W.H. Freeman, 1979.
Feasible Functions - Yuri Gurevich Eb (1993) (Correct)
No context found.
Michael R. Garey and David S. Johnson, "Computers and Intractability ", W. H. Freeman and Company, New York, 1979.
The Size of Power Automata - Sutner Computer Science (1994) (2 citations) (Correct)
No context found.
M. R. Garey and D. S. Johnson. Computers and Intractability. Freeman, 1979.
A Scalable Parallel Graph Coloring Algorithm for.. - Boman, Bozdag.. (2005) (Correct)
No context found.
M. R. Garey and D. S. Johnson. Computers and Intractability. Freeman, 1979.
The Barycenter Heuristic and the Reorderable Matrix - Mäkinen, Siirtola (2005) (Correct)
No context found.
Garey, M.R. & Johnson, D.S. (1979) Computers and Intractability. A Guide to the Theory of NPCompleteness. W.H.Freeman, San Francisco, CA.
Probabilistic Modeling of Dependencies During Switching.. - Radu Marculescu Diana (1998) (1 citation) (Correct)
No context found.
M. Garey, and D. Johnson, `Computers and Intractability', New York: Freeman, 1979.
An Integrated Logical and Physical Design Flow for Deep.. - Salek, Lou, Pedram (1999) (1 citation) (Correct)
No context found.
Michael R. Garey and David S. Johnson, "Computers and Intractability", Bell Telephone Lab. Inc., 1979.
Confronting Hardness Using a Hybrid Approach - Vassilevska, Williams, Woo (2005) (Correct)
No context found.
M. R. Garey and D. S. Johnson. Computers and Intractability. Freeman, 1979.
Tree Edit Distance With Gaps - Helene Touzet Lifl (2003) (Correct)
No context found.
M. Garey, D. Johnson, "Computers and Intractability", Ed. Freeman
Gateway Placement for Latency and Energy Efficient Data.. - Jennifer Wong Roozbeh (2004) (Correct)
No context found.
M. Garey and D. Johnson, Computers and Intractability. W.H. Freeman, 1979.
Application Level Relay for High-Bandwidth Data Transport - Liu, Gu, Zhang, Gong.. (2004) (Correct)
No context found.
M. R. Garey and D. S. Johnson, Computers and Intractability, San Francisco, CA: Freeman, 1979.
Algorithmic Aspects of Tree Amalgamation - Böcker, al. (2000) (Correct)
No context found.
M. R. Garey and D. S. Johnson, "Computers and Intractability," W. H. Freeman, San Francisco, 1979. 14. T.Jiang P. E. Kearney, and M. Li,Orchestrating quartets: approximation and data correction, in "Proc. 39th IEEE Symposium on the Foundations of Computer Science," pp. 416--425, 1998.
BDD Representation for Incompletely Specified.. - Tsutomu Sasao And (2005) (Correct)
No context found.
M. R. Garey and D. S. Johnson, Computers and Intractability, Freeman, San Francisco, 1979.
Automatic Bias Learning: An Inquiry into the Inductive Basis of.. - Bensusan (1999) (1 citation) (Correct)
No context found.
Garey, M. R., & Johnson, D. S. #1979#. Computers and Intractability.W.H.Freeman, New York, NY, USA.
On the Complexity of Cell Flipping in Permutation.. - Golumbic, Kaplan, Verbin (2005) (Correct)
No context found.
M. R. Garey and D. S. Johnson. Computers and Intractability. W. H. Freeman, San Francisco, 1979.
Cell Flipping in Permutation Diagrams - Golumbic, Kaplan, Verbin (2003) (Correct)
No context found.
M. R. Garey and D. S. Johnson. Computers and Intractability. W. H. Freeman, San Francisco, 1979.
Nested Dissection: A survey and comparison of various - Nested Dissection Algorithms (1992) (Correct)
No context found.
M. R. Garey and D.S. Johnson. Computers and Intractability. Freeman, New York, NY, 1979.
Satisfiability Planning with Constraints on the Number of.. - Büttner, Rintanen (Correct)
No context found.
Garey, M. R., and Johnson, D. S. 1979. Computers and Intractability.
Switching Activity Estimation Based on Conditional.. - Marculescu, Marculescu.. (1995) (Correct)
No context found.
M. Garey, and D. Johnson, `Computers and Intractability', New York: Freeman, 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