Some simplified NP-complete problems
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Optimizing the system of virtual paths
IEEE/ACM Transactions on Networking (TON)
The vertex-disjoint menger problem in planar graphs
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Finding Steiner forests in planar graphs
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Multicommodity flow, well-linked terminals, and routing problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Complexity of Single-Layer Routing
IEEE Transactions on Computers
A nearly linear time algorithm for the half integral disjoint paths packing
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Disjoint paths in symmetric digraphs
Discrete Applied Mathematics
A nearly linear time algorithm for the half integral parity disjoint paths packing problem
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Induced disjoint paths problem in a planar digraph
Discrete Applied Mathematics
On Shortest Disjoint Paths in Planar Graphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
A very practical algorithm for the two-paths problem in 3-connected planar graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
The induced disjoint paths problem
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
A shorter proof of the graph minor algorithm: the unique linkage theorem
Proceedings of the forty-second ACM symposium on Theory of computing
Journal of Computer and System Sciences
Cross-contamination avoidance for droplet routing in digital microfluidic biochips
Proceedings of the Conference on Design, Automation and Test in Europe
Tight bounds for linkages in planar graphs
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
A linear time algorithm for the induced disjoint paths problem in planar graphs
Journal of Computer and System Sciences
Slightly superexponential parameterized problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The disjoint paths problem in quadratic time
Journal of Combinatorial Theory Series B
The complexity of minimum convex coloring
Discrete Applied Mathematics
On shortest disjoint paths in planar graphs
Discrete Optimization
Multiflows in symmetric digraphs
Discrete Applied Mathematics
Induced disjoint paths in AT-Free graphs
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Induced disjoint paths in claw-free graphs
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
| Hi-index | 0.02 |
A simple method of converting statements in mathematical logic to equivalent interconnection problems is demonstrated. This shows that if there exists a practical method for solving interconnection problems, then there exists a practical proof procedure for statements in mathematical logic. (In the terminology of Cook [1] and Karp [4], the interconnection problem is NP-complete.) Since such a procedure has been sought for without success for almost 100 years, we should not expect the interconnection problem to be any easier. This holds equally true for finding a method which will route a given percentage of wires.