M. R. Garey, D. S. Johnson, and L. Stockmeyer. Some simplified NP-complete graph problems. Theor. Comp. Sc., 1:237--267, 1976. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
On Exact Algorithms for Treewidth - Hans Bodlaender Fedor (2006) (Correct)
No context found.
M. R. Garey, D. S. Johnson, and L. Stockmeyer. Some simplified NP-complete graph problems. Theor. Comp. Sc., 1:237--267, 1976.
Expressive Negotiation over Donations to Charities - Vincent Conitzer Forbes (2004) (Correct)
No context found.
M. R. Garey, D. S. Johnson, and L. Stockmeyer. Some simplified NP-complete graph problems. Theoretical Computer Science, 1:237--267, 1976.
Partitioning and Dynamic Load Balancing for the.. - Teresco, Devine.. (Correct)
No context found.
Garey, M., Johnson, D., and Stockmeyer, L.: Some simplified NP-complete graph problems. Theoretical Computer Science, 1(3):237--267, (1976)
On the Parameterized Complexity - Of Exact Satisfiability (Correct)
No context found.
M. Garey, D. Johnson, and L. Stockmeyer. Some simplified np-complete graph problems. Theoretical Computer Science, 1:237--267, 1976.
Multi Target Partitioning of Sets Based on Local Information - Goebels, Büning.. (2005) (Correct)
No context found.
M. R. Garey, D.S. Johnson and L. Stockmeyer, Some simplified NP-complete graph problems, Theoret. Comput. Sci., 1, 237-267, 1976
Graph Minimum Linear Arrangement by Multilevel Weighted.. - Safro, Ron, Brandt (2006) (Correct)
No context found.
M.R. Garey, D.S. Johnson, L. Stockmeyer, Some simplified NP-complete graph problems, Theoret. Comput. Sci. 1 (1976) 237--267.
Fine-Grain Conjunction Scheduling for Symbolic - Reachability Analysis Hoonsang (2002) (Correct)
No context found.
M. R. Garey, D. S. Johnson, and L. Stockmeyer. Some simplified NP-complete graph problems. Theoretical Computer Science, pages 237--267, 1987.
Complexity and Approximation of Fixing - Numerical Attributes In (Correct)
No context found.
Garey, M., Johnson, D. and Stockmeyer, L. Some Simplified NP-Complete Graph Problems. Theoretical Computer Science, 1976, 1(3):237-267.
Complexity and Approximation of Fixing - Numerical Attributes In (Correct)
No context found.
Garey, M., Johnson, D. and Stockmeyer, L. Some Simplified NP-Complete Graph Problems. Theoretical Computer Science, 1976, 1(3):237-267.
Complexity and Approximation of Fixing - Numerical Attributes In (Correct)
No context found.
Garey, M., Johnson, D. and Stockmeyer, L. Some Simplified NP-Complete Graph Problems. Theoretical Computer Science, 1976, 1(3):237-267.
Maximum Exact Satisfiability: NP-completeness Proofs and.. - Madsen, Rossmanith (2004) (Correct)
No context found.
M. Garey, D. Johnson, and L. Stockmeyer. Some simplified NP-complete graph problems. Theoretical Comput. Sci., 1:237--267, 1976.
Fixing Numerical Attributes Under Integrity - Constraints Leopoldo Bertossi (Correct)
No context found.
Garey, M., Johnson, D. and Stockmeyer, L. Some Simplified NP-Complete Graph Problems. Theoretical Computer Science, 1976, 1(3):237-267.
Crossing Minimization Problems of Drawing Bipartite Graphs .. - Zheng, Le Song, Eades (2005) (Correct)
No context found.
M. R. Garey, D. S. Johnson and L. J. Stockmeyer. (1976), Some simplified NP-complete graph problems, Journal of Theoretical Computer Science, 1, 237--267.
Fixing Numerical Attributes under Integrity Constraints - Bertossi, Bravo.. (2004) (Correct)
No context found.
Garey, M., Johnson, D. and Stockmeyer, L. Some Simplified NP-Complete Graph Problems. Theoretical Computer Science, 1976, 1(3):237-267.
Improved Approximation Algorithms for Maximum Cut and.. - Goemans, Williamson (1995) (389 citations) (Correct)
No context found.
M. Garey, D. Johnson, and L. Stockmeyer. Some simplified NP-complete graph problems. Theoretical Computer Science, 1:237--267, 1976.
Evaluation of Parallel Domain Decomposition Algorithms - Jesus Antonio Izaguirre (Correct)
No context found.
M. Garey, D. Johnson, and L. Stockmeyer. Some simplified NP-complete graph problems. Theoretical Computer Science, 1:237--267, 1976.
On Max Cut in Cubic Graphs - Tiziana Calamoneri Irene (Correct)
No context found.
Garey, M.R. -- Johnson, D.S. -- Stockmayer, L.: Some Simplified NP-Complete Graph Problems, Theor. Comput. Sci., 1, pp 237--267, 1976.
Experiments on Graph Clustering Algorithms - Brandes, Gaertler, Wagner (2003) (1 citation) (Correct)
No context found.
Garey, M.R., Johnson, D.S., Stockmeyer, L.J.: Some simplified NP-complete graph problems. Theoretical Computer Science 1 (1976) 237--267
Min-Max Multiway Cut - Svitkina, Tardos (Correct)
No context found.
M. R. Garey, D. S. Johnson, and L. Stockmeyer. Some Simplified NP-Complete Graph Problems. Theoretical Computer Science, (1):237--267, 1976.
Exploiting the Cache Capacity of a Single-Chip Multi-Core.. - Michaud (Correct)
No context found.
M. Garey, D. Johnson, and L. Stockmeyer. Some simplified NP-complete graph problems. Theoretical Computer Science, 1:237--267, 1976.
A Parallel Approximation Algorithm for the Max Cut .. - Calamoneri.. (1999) (Correct)
No context found.
Garey, M.R. -- Johnson, D.S. -- Stockmayer, L.: Some Simplified NP Complete Graph Problems, Theor. Comput. Sci., 1, pp. 237-267, 1976.
A Formulation of Boundary Mesh Segmentation - Shamir (2004) (2 citations) (Correct)
No context found.
M. Garey, D. Johnson, and L. Stockmeyer, "Some simplified np-complete graph problems," Theoretical Computer Science, vol. 1, pp. 237--267, 1976.
Exploiting the Cache Capacity of a Single-Chip Multi-Core.. - Michaud (Correct)
No context found.
M. Garey, D. Johnson, and L. Stockmeyer. Some simplified NP-complete graph problems. Theoretical Computer Science, 1:237--267, 1976.
On Linear Layouts of Graphs - Dujmovic, Wood (2004) (Correct)
No context found.
M. R. GAREY, D. S. JOHNSON, AND L. STOCKMEYER, Some simplified NP-complete graph problems. Theoret. Comput. Sci., 1:237--267, 1976.
Free Bits, PCPs and Non-Approximability--- - Towards Tight Results (Correct)
No context found.
M. Garey, D. Johnson and L. Stockmeyer. Some simplified NP-complete graph problems. Theoretical Computer Science 1, pp. 237--267, 1976.
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