-
2
-
-
0028255806
-
Approximation algorithms for NP-complete problems on planar graphs
-
B. S. Baker. Approximation algorithms for NP-complete problems on planar graphs. J. Assoc. Comput. Mach. 41:153-180, 1994.
-
(1994)
J. Assoc. Comput. Mach.
, vol.41
, pp. 153-180
-
-
Baker, B.S.1
-
3
-
-
38249035911
-
Linear-time computation of optimal subgraphs of decomposable graphs
-
M. W. Bern, E. L. Lawler, and A. L. Wong. Linear-time computation of optimal subgraphs of decomposable graphs. J. Algorithms 8:216-235, 1987.
-
(1987)
J. Algorithms
, vol.8
, pp. 216-235
-
-
Bern, M.W.1
Lawler, E.L.2
Wong, A.L.3
-
5
-
-
0027242831
-
A linear time algorithm for finding tree-decompositions of small treewidth
-
H. L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. Proc. 25th ACM Symp. Theory of Computing, pp. 226-234, 1993.
-
(1993)
Proc. 25th ACM Symp. Theory of Computing
, pp. 226-234
-
-
Bodlaender, H.L.1
-
6
-
-
21844489583
-
NC algorithms for partitioning sparse graphs into induced forests with an application
-
Proc. 6th Internat. Symp. Algorithms and Computation, Springer-Verlag, Berlin, December
-
Z.-Z. Chen. NC algorithms for partitioning sparse graphs into induced forests with an application. Proc. 6th Internat. Symp. Algorithms and Computation, pp. 428-437. Lecture Notes in Computer Science 1004, Springer-Verlag, Berlin, December 1995.
-
(1995)
Lecture Notes in Computer Science 1004
, pp. 428-437
-
-
Chen, Z.-Z.1
-
7
-
-
85088769530
-
Practical approximation schemes for maximum induced-subgraph
-
Proc. 23rd Internat. Coll. Automata, Languages and Programming, Springer-Verlag, Berlin
-
Z.-Z. Chen. Practical approximation schemes for maximum induced-subgraph. Proc. 23rd Internat. Coll. Automata, Languages and Programming, pp. 268-279. Lecture Notes in Computer Science 1099, Springer-Verlag, Berlin, 1996.
-
(1996)
Lecture Notes in Computer Science 1099
, pp. 268-279
-
-
Chen, Z.-Z.1
-
8
-
-
21844483819
-
NC algorithms for partitioning planar graphs into induced forests and approximat-ing NP-hard problems
-
Proc. 21st Internat. Workshop Graph-Theoretic Concepts in Computer Science, Springer-Verlag, Berlin, June
-
Z.-Z. Chen and X. He. NC algorithms for partitioning planar graphs into induced forests and approximat-ing NP-hard problems. Proc. 21st Internat. Workshop Graph-Theoretic Concepts in Computer Science, pp. 275-289. Lecture Notes in Computer Science 1017, Springer-Verlag, Berlin, June 1995.
-
(1995)
Lecture Notes in Computer Science 1017
, pp. 275-289
-
-
Chen, Z.-Z.1
He, X.2
-
9
-
-
0019753841
-
Applications of the Lipton and Tarjan's planar separator theorem
-
N. Chiba, T. Nishizeki, and N. Saito. Applications of the Lipton and Tarjan's planar separator theorem. J. Inform. Process. 4:203-207, 1981.
-
(1981)
J. Inform. Process.
, vol.4
, pp. 203-207
-
-
Chiba, N.1
Nishizeki, T.2
Saito, N.3
-
10
-
-
0040753945
-
Parallel approximation schemes for problems on planar graphs
-
J. Díaz, M. J. Sema, and J. Tóran. Parallel approximation schemes for problems on planar graphs. Acta Inform. 33(4):387-408, 1996.
-
(1996)
Acta Inform.
, vol.33
, Issue.4
, pp. 387-408
-
-
Díaz, J.1
Sema, M.J.2
Tóran, J.3
-
11
-
-
84987589812
-
Connectivity, graph minors, and subgraph multiplicity
-
D. Eppstein. Connectivity, graph minors, and subgraph multiplicity. J. Graph Theory 17:409-416, 1993.
-
(1993)
J. Graph Theory
, vol.17
, pp. 409-416
-
-
Eppstein, D.1
-
12
-
-
85137859893
-
Subgraph isomorphism in planar graphs and related problems
-
cs.DS/9911003
-
D. Eppstein. Subgraph isomorphism in planar graphs and related problems. J. Graph Algorithms Appl. 3(3):1-27, 1999, cs.DS/9911003.
-
(1999)
J. Graph Algorithms Appl.
, vol.3
, Issue.3
, pp. 1-27
-
-
Eppstein, D.1
-
13
-
-
84947923146
-
A unified approach to approximation schemes for NP- and PSPACE-hard problems for geometric graphs
-
Proc. 2nd Europ. Symp. Algorithms, Springer-Verlag, Berlin, September
-
H. B. Hunt, III, M. V. Marathe, V. Radhakrishnan, S. S. Ravi, D. J. Rosenkrantz, and R. E. Stearns. A unified approach to approximation schemes for NP- and PSPACE-hard problems for geometric graphs. Proc. 2nd Europ. Symp. Algorithms, pp. 424-435. Lecture Notes in Computer Science 855, Springer-Verlag, Berlin, September 1994.
-
(1994)
Lecture Notes in Computer Science 855
, pp. 424-435
-
-
Hunt III, H.B.1
Marathe, M.V.2
Radhakrishnan, V.3
Ravi, S.S.4
Rosenkrantz, D.J.5
Stearns, R.E.6
-
15
-
-
0001029324
-
Applications of a planar separator theorem
-
R. J. Lipton and R. E. Tarjan. Applications of a planar separator theorem. SIAM J. Comput. 9:615-627, 1980.
-
(1980)
SIAM J. Comput.
, vol.9
, pp. 615-627
-
-
Lipton, R.J.1
Tarjan, R.E.2
-
17
-
-
0040031286
-
A survey of linkless embeddings
-
Contemporary Mathematics 147, American Mathematical Society, Providence, RI
-
N. Robertson, P. D. Seymour, and R. Thomas. A survey of linkless embeddings. Graph Structure Theory: Proc. Joint Summer Conf. Graph Minors, pp. 125-136. Contemporary Mathematics 147, American Mathematical Society, Providence, RI, 1991.
-
(1991)
Graph Structure Theory: Proc. Joint Summer Conf. Graph Minors
, pp. 125-136
-
-
Robertson, N.1
Seymour, P.D.2
Thomas, R.3
-
19
-
-
0020164101
-
Linear-time computability of combinatorial problems on series-parallel graphs
-
K. Takamizawa, T. Nishizeki, and N. Saito. Linear-time computability of combinatorial problems on series-parallel graphs. J. Assoc. Comput. Mach. 29:623-641, 1982.
-
(1982)
J. Assoc. Comput. Mach.
, vol.29
, pp. 623-641
-
-
Takamizawa, K.1
Nishizeki, T.2
Saito, N.3
-
20
-
-
9644284118
-
Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems
-
D. M. Thilikos and H. L. Bodlaender. Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems. Inform. Process. Lett. 61:227-232, 1997.
-
(1997)
Inform. Process. Lett.
, vol.61
, pp. 227-232
-
-
Thilikos, D.M.1
Bodlaender, H.L.2
-
21
-
-
0037847057
-
Knots and braids: Some algorithmic questions
-
Contemporary Mathematics 147, American Mathematical Society, Providence, RI
-
D. J. A. Welsh. Knots and braids: some algorithmic questions. Graph Structure Theory: Proc. Joint Summer Conf. Graph Minors, pp. 109-124. Contemporary Mathematics 147, American Mathematical Society, Providence, RI, 1991.
-
(1991)
Graph Structure Theory: Proc. Joint Summer Conf. Graph Minors
, pp. 109-124
-
-
Welsh, D.J.A.1
|