M.R. Garey and D. S. Johnson. "Crossing number is NP-complete". SIAM Journal on Algebraic and Discrete Methods, 4:312-316, 1983. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents Next 50
On Eggleton And Guy's Conjectured Upper Bound For The.. - Faria, de Figueiredo (2000) (1 citation) (Correct)
Which Crossing Number is It, Anyway? - Courant (Correct)
The Splitting Number and Skewness of - Theta Cm Candido (Correct)
On a Matching Problem in the Plane - Dumitrescu, Steiger (2000) (2 citations) (Correct)
Two-Layer Planarization in Graph Drawing - Mutzel, Weiskircher (1998) (4 citations) (Correct)
Which Crossing Number is It Anyway? - Pach, Toth (Correct)
On Conway's Thrackle Conjecture - Lovász, Pach, Szegedy (1997) (5 citations) (Correct)
Inserting an Edge Into a Planar Graph - Gutwenger, Mutzel, Weiskircher (2000) (1 citation) (Correct)
New Bounds on Crossing Numbers - Pach, Tóth (1999) (5 citations) (Correct)
Mathematical Programming Formulation of Rectilinear Crossing.. - Dean (2002) (Correct)
Crossing Minimization for Symmetries - Buchheim, Hong (2002) (Correct)
Crossing Reduction by Windows Optimization - Eschbach, Günther, Drechsler.. (2002) (1 citation) (Correct)
Recombination Operators for Evolutionary Graph Drawing - Kobler, Tettamanzi (1998) (1 citation) (Correct)
On the Parameterized Complexity of Layered Graph Drawing - Dujmovic, Fellows.. (2001) (6 citations) (Correct)
A Fixed-Parameter Approach to Two-Layer Planarization - Dujmovic, Fellows.. (2001) (Correct)
New Bounds on Crossing Numbers - Pach, Toth (1999) (5 citations) (Correct)
2-Layer Straightline Crossing Minimization: Performance of.. - Jünger, Mutzel (1997) (Correct)
TimGA - A Genetic Algorithm for Drawing Undirected Graphs - Eloranta, Mäkinen (1996) (2 citations) (Correct)
A Satisfiability Formulation of Problems on Level Graphs - Randerath, Speckenmeyer.. (2001) (2 citations) (Correct)
The Rectilinear Crossing Number of K_10 is 62 - Brodsky, Durocher, Gethner (2000) (Correct)
New Bounds On The Barycenter Heuristic For Bipartite Graph.. - Li, Stallmann (2001) (2 citations) (Correct)
Crossing Number Bounds for the Mesh of Trees - Cimikowski (1 citation) (Correct)
Drawing Database Schemas - Di Battista, Didimo, Patrignani.. (Correct)
A Neural Network Algorithm for a Graph Layout Problem - Cimikowski, Shope (1996) (3 citations) (Correct)
Crossing Number Bounds for the Twisted Cube - Cimikowski (2001) (Correct)
Crossing-Critical Graphs and Path-Width - Hlineny (2001) (1 citation) (Correct)
The Rectilinear Crossing Number of K_10 is 62 - Brodsky, Durocher, Gethner (2001) (Correct)
Graph Visualization and Navigation in Information.. - Herman.. (2000) (57 citations) (Correct)
Drawings of Graphs on Surfaces with Few Crossings - Shahrokhi, Szekely, Sykora, .. (1996) (2 citations) (Correct)
The Crossing Number of a Graph on a Compact 2-Manifold - Shahrokhi, al. (1996) (Correct)
TimGA - A Genetic Algorithm for Drawing Undirected Graphs - Eloranta, Mäkinen (1996) (2 citations) (Correct)
Planarizing Graphs - A Survey and Annotated Bibliography - Liebers (2001) (6 citations) (Correct)
Crossing-Number Critical Graphs have Bounded Path-width - Hlineny (2000) (Correct)
Graph Drawing - Tamassia (1997) (10 citations) (Correct)
Contextual Visualization of Actor Status in Social Networks - Brandes, Wagner (1999) (1 citation) (Correct)
Scalable Privacy Preserving Collaborative Filtering - On Large Scale (Correct)
Visualizing Multivariate Network on the Surface of a Sphere - Yingxin Wu Masahiro (Correct)
Crossing Minimization Problems of Drawing Bipartite Graphs .. - Zheng, Le Song, Eades (2005) (Correct)
Using Sifting for k-Layer Straightline Crossing.. - Matuszewski, Schönfeld.. (1999) (2 citations) (Correct)
On the crossing number of Cm - Gelasio Salazar Department (Correct)
A Numerical Optimization Approach - To General Graph (1998) (Correct)
Contextual Visualization of Actor Status in Social Networks - Brandes, Wagner (1 citation) (Correct)
A Fixed-Parameter Approach to Two-Layer Planarization - Dujmovic, Fellows.. (2004) (Correct)
Decidability of String Graphs - Marcus Schaefer Depaul (1 citation) (Correct)
Crossing Numbers and Cutwidths - Djidjev, Vrt'o (2003) (Correct)
Crossing Number is Hard for Cubic Graphs - Petr Hlineny Department (Correct)
Decidability of String Graphs - Schaefer, Stefankovic (2003) (1 citation) (Correct)
Towardth rectilinear crossing number of K_n: new.. - Brodsky, Durocher.. (2003) (Correct)
Recognizing String Graphs in NP - Schaefer, Sedgwick, Stefankovic (2002) (Correct)
An Algorithm For Drawing A Hierarchical Graph - Eades, al. (1995) (3 citations) (Correct)
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