树宽 (Chinese Wikipedia)

Analysis of information sources in references of the Wikipedia article "树宽" in Chinese language version.

refsWebsite

Global rank Chinese rank

20doi.org

2^nd place

23^rd place

11ams.org

451^st place

935^th place

8web.archive.org

1^st place

8semanticscholar.org

11^th place

332^nd place

6psu.edu

207^th place

628^th place

5arxiv.org

69^th place

254^th place

2uni-hamburg.de

3,809^th place

9,054^th place

2books.google.com

3^rd place

8^th place

2erikdemaine.org

low place

1utdallas.edu

low place

1aaai.org

9,352^nd place

low place

1sciencedirect.com

149^th place

292^nd place

aaai.org

Best-First Search for Treewidth. www.aaai.org. [2022-11-27]. （原始内容存档于2022-01-22）.

ams.org

Arnborg, Proskurowski & Corneil (1990); Satyanarayana & Tung (1990). Arnborg, Stefan; Proskurowski, Andrzej; Corneil, Derek G., Forbidden minors characterization of partial 3-trees, Discrete Mathematics, 1990, 80 (1): 1–19, MR 1045920, doi:10.1016/0012-365X(90)90292-P  . Satyanarayana, A.; Tung, L., A characterization of partial 3-trees, Networks, 1990, 20 (3): 299–322, MR 1050503, doi:10.1002/net.3230200304 .
Ramachandramurthi (1997). Ramachandramurthi, Siddharthan, The structure and number of obstructions to treewidth, SIAM Journal on Discrete Mathematics, 1997, 10 (1): 146–157, MR 1430552, doi:10.1137/S0895480195280010 .
Lagergren (1993). Lagergren, Jens, An upper bound on the size of an obstruction, Graph structure theory (Seattle, WA, 1991), Contemporary Mathematics 147, Providence, RI: American Mathematical Society: 601–621, 1993, ISBN 9780821851609, MR 1224734, doi:10.1090/conm/147/01202 .
Chekuri & Chuzhoy (2016) Chekuri, Chandra; Chuzhoy, Julia, Polynomial bounds for the grid-minor theorem, Journal of the ACM, 2016, 63 (5): A40:1–65, MR 3593966, S2CID 209860422, arXiv:1305.6577 , doi:10.1145/2820609 .
Diestel (2004). Diestel, Reinhard, A short proof of Halin's grid theorem, Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, 2004, 74: 237–242, MR 2112834, S2CID 124603912, doi:10.1007/BF02941538 .
Eppstein (2000). Eppstein, D., Diameter and treewidth in minor-closed graph families, Algorithmica, 2000, 27 (3–4): 275–291, MR 1759751, S2CID 3172160, arXiv:math/9907126 , doi:10.1007/s004530010020 .
Eppstein (2000); Demaine & Hajiaghayi (2004a). Eppstein, D., Diameter and treewidth in minor-closed graph families, Algorithmica, 2000, 27 (3–4): 275–291, MR 1759751, S2CID 3172160, arXiv:math/9907126 , doi:10.1007/s004530010020 . Demaine, Erik D.; Hajiaghayi, MohammadTaghi, Diameter and treewidth in minor-closed graph families, revisited, Algorithmica, 2004a, 40 (3): 211–215, MR 2080518, S2CID 390856, doi:10.1007/s00453-004-1106-1 .
Demaine & Hajiaghayi (2004b). Demaine, Erik D.; Hajiaghayi, MohammadTaghi, Equivalence of local treewidth and linear local treewidth and its algorithmic applications, Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, New York: ACM: 840–849, 2004b, MR 2290974 .
Demaine et al. (2004); Demaine & Hajiaghayi (2008). Demaine, Erik D.; Fomin, Fedor V.; Hajiaghayi, MohammadTaghi; Thilikos, Dimitrios M., Bidimensional parameters and local treewidth, SIAM Journal on Discrete Mathematics, 2004, 18 (3): 501–511, CiteSeerX 10.1.1.107.6195 , MR 2134412, S2CID 7803025, doi:10.1137/S0895480103433410 . Demaine, Erik D.; Hajiaghayi, MohammadTaghi, Linearity of grid minors in treewidth with applications through bidimensionality (PDF), Combinatorica, 2008, 28 (1): 19–36 [2024-01-30], S2CID 16520181, doi:10.1007/s00493-008-2140-4, （原始内容存档 (PDF)于2020-10-11） .
Frick & Grohe (2001). Frick, Markus; Grohe, Martin, Deciding first-order properties of locally tree-decomposable structures, Journal of the ACM, 2001, 48 (6): 1184–1206, MR 2143836, S2CID 999472, arXiv:cs/0004007 , doi:10.1145/504794.504798 .
Grigoriev & Bodlaender (2007). Grigoriev, Alexander; Bodlaender, Hans L., Algorithms for graphs embeddable with few crossings per edge, Algorithmica, 2007, 49 (1): 1–11, CiteSeerX 10.1.1.65.5071 , MR 2344391, S2CID 8174422, doi:10.1007/s00453-007-0010-x .

arxiv.org

Gogate, Vibhav; Dechter, Rina. A Complete Anytime Algorithm for Treewidth. 2012-07-11. arXiv:1207.4109  [cs.DS].
Chekuri & Chuzhoy (2016) Chekuri, Chandra; Chuzhoy, Julia, Polynomial bounds for the grid-minor theorem, Journal of the ACM, 2016, 63 (5): A40:1–65, MR 3593966, S2CID 209860422, arXiv:1305.6577 , doi:10.1145/2820609 .
Eppstein (2000). Eppstein, D., Diameter and treewidth in minor-closed graph families, Algorithmica, 2000, 27 (3–4): 275–291, MR 1759751, S2CID 3172160, arXiv:math/9907126 , doi:10.1007/s004530010020 .
Eppstein (2000); Demaine & Hajiaghayi (2004a). Eppstein, D., Diameter and treewidth in minor-closed graph families, Algorithmica, 2000, 27 (3–4): 275–291, MR 1759751, S2CID 3172160, arXiv:math/9907126 , doi:10.1007/s004530010020 . Demaine, Erik D.; Hajiaghayi, MohammadTaghi, Diameter and treewidth in minor-closed graph families, revisited, Algorithmica, 2004a, 40 (3): 211–215, MR 2080518, S2CID 390856, doi:10.1007/s00453-004-1106-1 .
Frick & Grohe (2001). Frick, Markus; Grohe, Martin, Deciding first-order properties of locally tree-decomposable structures, Journal of the ACM, 2001, 48 (6): 1184–1206, MR 2143836, S2CID 999472, arXiv:cs/0004007 , doi:10.1145/504794.504798 .

books.google.com

Kao (2008). Kao, Ming-Yang (编), Treewidth of graphs, Encyclopedia of Algorithms, Springer: 969, 2008, ISBN 9780387307701, Another long-standing open problem is whether there is a polynomial-time algorithm to compute the treewidth of planar graphs.
Bertelè & Brioschi (1972). Bertelè, Umberto; Brioschi, Francesco, Nonserial Dynamic Programming, Academic Press: 37–38, 1972 [2024-01-30], ISBN 978-0-12-093450-8, （原始内容存档于2024-01-30） .

doi.org

Seymour & Thomas (1993). Seymour, Paul D.; Thomas, Robin, Graph searching and a min-max theorem for tree-width, Journal of Combinatorial Theory, Series B, 1993, 58 (1): 22–33, doi:10.1006/jctb.1993.1027  .
Bodlaender (1998). Bodlaender, Hans L., A partial k-arboretum of graphs with bounded treewidth, Theoretical Computer Science, 1998, 209 (1–2): 1–45, doi:10.1016/S0304-3975(97)00228-4  .
Thorup (1998). Thorup, Mikkel, All structured programs have small tree width and good register allocation, Information and Computation, 1998, 142 (2): 159–181, doi:10.1006/inco.1997.2697  .
Robertson & Seymour (1986). Robertson, Neil; Seymour, Paul D., Graph minors V: Excluding a planar graph, Journal of Combinatorial Theory, Series B, 1986, 41 (1): 92–114, doi:10.1016/0095-8956(86)90030-4  .
Bodlaender (1988). Bodlaender, Hans L., Dynamic programming on graphs with bounded treewidth, Proc. 15th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science 317, Springer-Verlag: 105–118, 1988, CiteSeerX 10.1.1.18.8503 , ISBN 978-3-540-19488-0, doi:10.1007/3-540-19488-6_110 .
Arnborg, Proskurowski & Corneil (1990); Satyanarayana & Tung (1990). Arnborg, Stefan; Proskurowski, Andrzej; Corneil, Derek G., Forbidden minors characterization of partial 3-trees, Discrete Mathematics, 1990, 80 (1): 1–19, MR 1045920, doi:10.1016/0012-365X(90)90292-P  . Satyanarayana, A.; Tung, L., A characterization of partial 3-trees, Networks, 1990, 20 (3): 299–322, MR 1050503, doi:10.1002/net.3230200304 .
Ramachandramurthi (1997). Ramachandramurthi, Siddharthan, The structure and number of obstructions to treewidth, SIAM Journal on Discrete Mathematics, 1997, 10 (1): 146–157, MR 1430552, doi:10.1137/S0895480195280010 .
Lagergren (1993). Lagergren, Jens, An upper bound on the size of an obstruction, Graph structure theory (Seattle, WA, 1991), Contemporary Mathematics 147, Providence, RI: American Mathematical Society: 601–621, 1993, ISBN 9780821851609, MR 1224734, doi:10.1090/conm/147/01202 .
Arnborg, Corneil & Proskurowski (1987). Arnborg, S.; Corneil, D.; Proskurowski, A., Complexity of finding embeddings in a $k$ -tree, SIAM Journal on Matrix Analysis and Applications, 1987, 8 (2): 277–284, doi:10.1137/0608024 .
Bodlaender (1996). Bodlaender, Hans L., A linear time algorithm for finding tree-decompositions of small treewidth, SIAM Journal on Computing, 1996, 25 (6): 1305–1317, CiteSeerX 10.1.1.19.7484 , doi:10.1137/S0097539793251219 .
Arnborg & Proskurowski (1989); Bern, Lawler & Wong (1987); Bodlaender (1988). Arnborg, S.; Proskurowski, A., Linear time algorithms for NP-hard problems restricted to partial $k$ -trees, Discrete Applied Mathematics, 1989, 23 (1): 11–24, doi:10.1016/0166-218X(89)90031-0  . Bern, M. W.; Lawler, E. L.; Wong, A. L., Linear-time computation of optimal subgraphs of decomposable graphs, Journal of Algorithms, 1987, 8 (2): 216–235, doi:10.1016/0196-6774(87)90039-3 . Bodlaender, Hans L., Dynamic programming on graphs with bounded treewidth, Proc. 15th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science 317, Springer-Verlag: 105–118, 1988, CiteSeerX 10.1.1.18.8503 , ISBN 978-3-540-19488-0, doi:10.1007/3-540-19488-6_110 .
Courcelle (1990); Courcelle (1992) Courcelle, B., The monadic second-order logic of graphs I: Recognizable sets of finite graphs, Information and Computation, 1990, 85: 12–75, CiteSeerX 10.1.1.158.5595 , doi:10.1016/0890-5401(90)90043-h . Courcelle, B., The monadic second-order logic of graphs III: Treewidth, forbidden minors and complexity issues., Informatique Théorique, 1992, (26): 257–286 .
Chekuri & Chuzhoy (2016) Chekuri, Chandra; Chuzhoy, Julia, Polynomial bounds for the grid-minor theorem, Journal of the ACM, 2016, 63 (5): A40:1–65, MR 3593966, S2CID 209860422, arXiv:1305.6577 , doi:10.1145/2820609 .
Demaine & Hajiaghayi (2008). Demaine, Erik D.; Hajiaghayi, MohammadTaghi, Linearity of grid minors in treewidth with applications through bidimensionality (PDF), Combinatorica, 2008, 28 (1): 19–36 [2024-01-30], S2CID 16520181, doi:10.1007/s00493-008-2140-4, （原始内容存档 (PDF)于2020-10-11） .
Diestel (2004). Diestel, Reinhard, A short proof of Halin's grid theorem, Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, 2004, 74: 237–242, MR 2112834, S2CID 124603912, doi:10.1007/BF02941538 .
Eppstein (2000). Eppstein, D., Diameter and treewidth in minor-closed graph families, Algorithmica, 2000, 27 (3–4): 275–291, MR 1759751, S2CID 3172160, arXiv:math/9907126 , doi:10.1007/s004530010020 .
Eppstein (2000); Demaine & Hajiaghayi (2004a). Eppstein, D., Diameter and treewidth in minor-closed graph families, Algorithmica, 2000, 27 (3–4): 275–291, MR 1759751, S2CID 3172160, arXiv:math/9907126 , doi:10.1007/s004530010020 . Demaine, Erik D.; Hajiaghayi, MohammadTaghi, Diameter and treewidth in minor-closed graph families, revisited, Algorithmica, 2004a, 40 (3): 211–215, MR 2080518, S2CID 390856, doi:10.1007/s00453-004-1106-1 .
Demaine et al. (2004); Demaine & Hajiaghayi (2008). Demaine, Erik D.; Fomin, Fedor V.; Hajiaghayi, MohammadTaghi; Thilikos, Dimitrios M., Bidimensional parameters and local treewidth, SIAM Journal on Discrete Mathematics, 2004, 18 (3): 501–511, CiteSeerX 10.1.1.107.6195 , MR 2134412, S2CID 7803025, doi:10.1137/S0895480103433410 . Demaine, Erik D.; Hajiaghayi, MohammadTaghi, Linearity of grid minors in treewidth with applications through bidimensionality (PDF), Combinatorica, 2008, 28 (1): 19–36 [2024-01-30], S2CID 16520181, doi:10.1007/s00493-008-2140-4, （原始内容存档 (PDF)于2020-10-11） .
Frick & Grohe (2001). Frick, Markus; Grohe, Martin, Deciding first-order properties of locally tree-decomposable structures, Journal of the ACM, 2001, 48 (6): 1184–1206, MR 2143836, S2CID 999472, arXiv:cs/0004007 , doi:10.1145/504794.504798 .
Grigoriev & Bodlaender (2007). Grigoriev, Alexander; Bodlaender, Hans L., Algorithms for graphs embeddable with few crossings per edge, Algorithmica, 2007, 49 (1): 1–11, CiteSeerX 10.1.1.65.5071 , MR 2344391, S2CID 8174422, doi:10.1007/s00453-007-0010-x .

erikdemaine.org

Demaine & Hajiaghayi (2008). Demaine, Erik D.; Hajiaghayi, MohammadTaghi, Linearity of grid minors in treewidth with applications through bidimensionality (PDF), Combinatorica, 2008, 28 (1): 19–36 [2024-01-30], S2CID 16520181, doi:10.1007/s00493-008-2140-4, （原始内容存档 (PDF)于2020-10-11） .
Demaine et al. (2004); Demaine & Hajiaghayi (2008). Demaine, Erik D.; Fomin, Fedor V.; Hajiaghayi, MohammadTaghi; Thilikos, Dimitrios M., Bidimensional parameters and local treewidth, SIAM Journal on Discrete Mathematics, 2004, 18 (3): 501–511, CiteSeerX 10.1.1.107.6195 , MR 2134412, S2CID 7803025, doi:10.1137/S0895480103433410 . Demaine, Erik D.; Hajiaghayi, MohammadTaghi, Linearity of grid minors in treewidth with applications through bidimensionality (PDF), Combinatorica, 2008, 28 (1): 19–36 [2024-01-30], S2CID 16520181, doi:10.1007/s00493-008-2140-4, （原始内容存档 (PDF)于2020-10-11） .

psu.edu

citeseerx.ist.psu.edu

Bodlaender (1988). Bodlaender, Hans L., Dynamic programming on graphs with bounded treewidth, Proc. 15th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science 317, Springer-Verlag: 105–118, 1988, CiteSeerX 10.1.1.18.8503 , ISBN 978-3-540-19488-0, doi:10.1007/3-540-19488-6_110 .
Bodlaender (1996). Bodlaender, Hans L., A linear time algorithm for finding tree-decompositions of small treewidth, SIAM Journal on Computing, 1996, 25 (6): 1305–1317, CiteSeerX 10.1.1.19.7484 , doi:10.1137/S0097539793251219 .
Arnborg & Proskurowski (1989); Bern, Lawler & Wong (1987); Bodlaender (1988). Arnborg, S.; Proskurowski, A., Linear time algorithms for NP-hard problems restricted to partial $k$ -trees, Discrete Applied Mathematics, 1989, 23 (1): 11–24, doi:10.1016/0166-218X(89)90031-0  . Bern, M. W.; Lawler, E. L.; Wong, A. L., Linear-time computation of optimal subgraphs of decomposable graphs, Journal of Algorithms, 1987, 8 (2): 216–235, doi:10.1016/0196-6774(87)90039-3 . Bodlaender, Hans L., Dynamic programming on graphs with bounded treewidth, Proc. 15th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science 317, Springer-Verlag: 105–118, 1988, CiteSeerX 10.1.1.18.8503 , ISBN 978-3-540-19488-0, doi:10.1007/3-540-19488-6_110 .
Courcelle (1990); Courcelle (1992) Courcelle, B., The monadic second-order logic of graphs I: Recognizable sets of finite graphs, Information and Computation, 1990, 85: 12–75, CiteSeerX 10.1.1.158.5595 , doi:10.1016/0890-5401(90)90043-h . Courcelle, B., The monadic second-order logic of graphs III: Treewidth, forbidden minors and complexity issues., Informatique Théorique, 1992, (26): 257–286 .
Demaine et al. (2004); Demaine & Hajiaghayi (2008). Demaine, Erik D.; Fomin, Fedor V.; Hajiaghayi, MohammadTaghi; Thilikos, Dimitrios M., Bidimensional parameters and local treewidth, SIAM Journal on Discrete Mathematics, 2004, 18 (3): 501–511, CiteSeerX 10.1.1.107.6195 , MR 2134412, S2CID 7803025, doi:10.1137/S0895480103433410 . Demaine, Erik D.; Hajiaghayi, MohammadTaghi, Linearity of grid minors in treewidth with applications through bidimensionality (PDF), Combinatorica, 2008, 28 (1): 19–36 [2024-01-30], S2CID 16520181, doi:10.1007/s00493-008-2140-4, （原始内容存档 (PDF)于2020-10-11） .
Grigoriev & Bodlaender (2007). Grigoriev, Alexander; Bodlaender, Hans L., Algorithms for graphs embeddable with few crossings per edge, Algorithmica, 2007, 49 (1): 1–11, CiteSeerX 10.1.1.65.5071 , MR 2344391, S2CID 8174422, doi:10.1007/s00453-007-0010-x .

sciencedirect.com

Robertson, Seymour. Graph minors. V. Excluding a planar graph. [1] （页面存档备份，存于互联网档案馆）

semanticscholar.org

api.semanticscholar.org

Chekuri & Chuzhoy (2016) Chekuri, Chandra; Chuzhoy, Julia, Polynomial bounds for the grid-minor theorem, Journal of the ACM, 2016, 63 (5): A40:1–65, MR 3593966, S2CID 209860422, arXiv:1305.6577 , doi:10.1145/2820609 .
Demaine & Hajiaghayi (2008). Demaine, Erik D.; Hajiaghayi, MohammadTaghi, Linearity of grid minors in treewidth with applications through bidimensionality (PDF), Combinatorica, 2008, 28 (1): 19–36 [2024-01-30], S2CID 16520181, doi:10.1007/s00493-008-2140-4, （原始内容存档 (PDF)于2020-10-11） .
Diestel (2004). Diestel, Reinhard, A short proof of Halin's grid theorem, Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, 2004, 74: 237–242, MR 2112834, S2CID 124603912, doi:10.1007/BF02941538 .
Eppstein (2000). Eppstein, D., Diameter and treewidth in minor-closed graph families, Algorithmica, 2000, 27 (3–4): 275–291, MR 1759751, S2CID 3172160, arXiv:math/9907126 , doi:10.1007/s004530010020 .
Eppstein (2000); Demaine & Hajiaghayi (2004a). Eppstein, D., Diameter and treewidth in minor-closed graph families, Algorithmica, 2000, 27 (3–4): 275–291, MR 1759751, S2CID 3172160, arXiv:math/9907126 , doi:10.1007/s004530010020 . Demaine, Erik D.; Hajiaghayi, MohammadTaghi, Diameter and treewidth in minor-closed graph families, revisited, Algorithmica, 2004a, 40 (3): 211–215, MR 2080518, S2CID 390856, doi:10.1007/s00453-004-1106-1 .
Demaine et al. (2004); Demaine & Hajiaghayi (2008). Demaine, Erik D.; Fomin, Fedor V.; Hajiaghayi, MohammadTaghi; Thilikos, Dimitrios M., Bidimensional parameters and local treewidth, SIAM Journal on Discrete Mathematics, 2004, 18 (3): 501–511, CiteSeerX 10.1.1.107.6195 , MR 2134412, S2CID 7803025, doi:10.1137/S0895480103433410 . Demaine, Erik D.; Hajiaghayi, MohammadTaghi, Linearity of grid minors in treewidth with applications through bidimensionality (PDF), Combinatorica, 2008, 28 (1): 19–36 [2024-01-30], S2CID 16520181, doi:10.1007/s00493-008-2140-4, （原始内容存档 (PDF)于2020-10-11） .
Frick & Grohe (2001). Frick, Markus; Grohe, Martin, Deciding first-order properties of locally tree-decomposable structures, Journal of the ACM, 2001, 48 (6): 1184–1206, MR 2143836, S2CID 999472, arXiv:cs/0004007 , doi:10.1145/504794.504798 .
Grigoriev & Bodlaender (2007). Grigoriev, Alexander; Bodlaender, Hans L., Algorithms for graphs embeddable with few crossings per edge, Algorithmica, 2007, 49 (1): 1–11, CiteSeerX 10.1.1.65.5071 , MR 2344391, S2CID 8174422, doi:10.1007/s00453-007-0010-x .

uni-hamburg.de

math.uni-hamburg.de

Diestel (2005) Diestel, Reinhard, Graph Theory 3rd, Springer, 2005 [2024-01-30], ISBN 978-3-540-26182-7, （原始内容存档于2011-07-28） .
Diestel (2005) section 12.3 Diestel, Reinhard, Graph Theory 3rd, Springer, 2005 [2024-01-30], ISBN 978-3-540-26182-7, （原始内容存档于2011-07-28） .

utdallas.edu

personal.utdallas.edu

Vibhav Gogate. personal.utdallas.edu. [2022-11-27]. （原始内容存档于2022-11-27）.

web.archive.org

Diestel (2005) Diestel, Reinhard, Graph Theory 3rd, Springer, 2005 [2024-01-30], ISBN 978-3-540-26182-7, （原始内容存档于2011-07-28） .
Diestel (2005) section 12.3 Diestel, Reinhard, Graph Theory 3rd, Springer, 2005 [2024-01-30], ISBN 978-3-540-26182-7, （原始内容存档于2011-07-28） .
Vibhav Gogate. personal.utdallas.edu. [2022-11-27]. （原始内容存档于2022-11-27）.
Best-First Search for Treewidth. www.aaai.org. [2022-11-27]. （原始内容存档于2022-01-22）.
Bertelè & Brioschi (1972). Bertelè, Umberto; Brioschi, Francesco, Nonserial Dynamic Programming, Academic Press: 37–38, 1972 [2024-01-30], ISBN 978-0-12-093450-8, （原始内容存档于2024-01-30） .
Robertson, Seymour. Graph minors. V. Excluding a planar graph. [1] （页面存档备份，存于互联网档案馆）
Demaine & Hajiaghayi (2008). Demaine, Erik D.; Hajiaghayi, MohammadTaghi, Linearity of grid minors in treewidth with applications through bidimensionality (PDF), Combinatorica, 2008, 28 (1): 19–36 [2024-01-30], S2CID 16520181, doi:10.1007/s00493-008-2140-4, （原始内容存档 (PDF)于2020-10-11） .
Demaine et al. (2004); Demaine & Hajiaghayi (2008). Demaine, Erik D.; Fomin, Fedor V.; Hajiaghayi, MohammadTaghi; Thilikos, Dimitrios M., Bidimensional parameters and local treewidth, SIAM Journal on Discrete Mathematics, 2004, 18 (3): 501–511, CiteSeerX 10.1.1.107.6195 , MR 2134412, S2CID 7803025, doi:10.1137/S0895480103433410 . Demaine, Erik D.; Hajiaghayi, MohammadTaghi, Linearity of grid minors in treewidth with applications through bidimensionality (PDF), Combinatorica, 2008, 28 (1): 19–36 [2024-01-30], S2CID 16520181, doi:10.1007/s00493-008-2140-4, （原始内容存档 (PDF)于2020-10-11） .