{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T21:10:57Z","timestamp":1764364257216},"reference-count":40,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T00:00:00Z","timestamp":1485907200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1016\/j.jcta.2016.10.001","type":"journal-article","created":{"date-parts":[[2016,10,24]],"date-time":"2016-10-24T13:00:17Z","timestamp":1477314017000},"page":"264-294","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/http\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["Courcelle's theorem for triangulations"],"prefix":"10.1016","volume":"146","author":[{"given":"Benjamin A.","family":"Burton","sequence":"first","affiliation":[]},{"given":"Rodney G.","family":"Downey","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jcta.2016.10.001_br0010","article-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1975"},{"issue":"2","key":"10.1016\/j.jcta.2016.10.001_br0020","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","article-title":"Easy problems for tree-decomposable graphs","volume":"12","author":"Arnborg","year":"1991","journal-title":"J. Algorithms"},{"issue":"6","key":"10.1016\/j.jcta.2016.10.001_br0030","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1137\/S0097539793251219","article-title":"A linear-time algorithm for finding tree-decompositions of small treewidth","volume":"25","author":"Bodlaender","year":"1996","journal-title":"SIAM J. Comput."},{"issue":"5","key":"10.1016\/j.jcta.2016.10.001_br0040","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1142\/S0218216507005439","article-title":"Structures of small closed non-orientable 3-manifold triangulations","volume":"16","author":"Burton","year":"2007","journal-title":"J. Knot Theory Ramifications"},{"key":"10.1016\/j.jcta.2016.10.001_br0050","series-title":"Geometry and Topology down Under","article-title":"Computational topology with Regina: algorithms, heuristics and implementations","volume":"vol. 597","author":"Burton","year":"2013"},{"key":"10.1016\/j.jcta.2016.10.001_br0060","series-title":"SCG'13: Proceedings of the 29th Annual Symposium on Computational Geometry","first-page":"127","article-title":"Parameterized complexity of discrete Morse theory","author":"Burton","year":"2013"},{"key":"10.1016\/j.jcta.2016.10.001_br0070","series-title":"COCOON 2014: Computing and Combinatorics: 20th Annual International Conference","first-page":"300","article-title":"Fixed parameter tractable algorithms in combinatorial topology","volume":"vol. 8591","author":"Burton","year":"2014"},{"key":"10.1016\/j.jcta.2016.10.001_br0080","series-title":"SODA'13: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"168","article-title":"The complexity of detecting taut angle structures on triangulations","author":"Burton","year":"2013"},{"key":"10.1016\/j.jcta.2016.10.001_br0090","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/j.ic.2005.05.001","article-title":"Tight lower bounds for certain parameterized NP-hard problems","volume":"201","author":"Chen","year":"2005","journal-title":"Inform. and Comput."},{"issue":"1\u20132","key":"10.1016\/j.jcta.2016.10.001_br0100","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0166-218X(00)00221-3","article-title":"On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic","volume":"108","author":"Courcelle","year":"2001","journal-title":"Discrete Appl. Math."},{"issue":"1\u20132","key":"10.1016\/j.jcta.2016.10.001_br0110","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0304-3975(93)90064-Z","article-title":"Monadic second-order evaluations on tree-decomposable graphs","volume":"109","author":"Courcelle","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.jcta.2016.10.001_br0120","series-title":"Graph-Grammars and Their Application to Computer Science","first-page":"133","article-title":"On context-free sets of graphs and their monadic second-order theory","volume":"vol. 291","author":"Courcelle","year":"1987"},{"key":"10.1016\/j.jcta.2016.10.001_br0130","series-title":"Handbook of Theoretical Computer Science, vol. B","first-page":"193","article-title":"Graph rewriting: an algebraic and logic approach","author":"Courcelle","year":"1990"},{"key":"10.1016\/j.jcta.2016.10.001_br0140","article-title":"Graph Structure and Monadic Second Order Logic","volume":"vol. 138","author":"Courcelle","year":"2012"},{"key":"10.1016\/j.jcta.2016.10.001_br0150","series-title":"Advances in Discrete and Computational Geometry","first-page":"109","article-title":"Computational topology","volume":"vol. 223","author":"Dey","year":"1999"},{"key":"10.1016\/j.jcta.2016.10.001_br0160","series-title":"Proceedings 7th Annual Structure in Complexity","first-page":"36","article-title":"Fixed-parameter intractability","author":"Downey","year":"1992"},{"issue":"4","key":"10.1016\/j.jcta.2016.10.001_br0170","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1137\/S0097539792228228","article-title":"Fixed-parameter tractability and completeness I: basic results","volume":"24","author":"Downey","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jcta.2016.10.001_br0180","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","article-title":"Parameterized Complexity","author":"Downey","year":"1999"},{"key":"10.1016\/j.jcta.2016.10.001_br0190","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-5559-1","article-title":"Fundamentals of Parameterized Complexity","author":"Downey","year":"2013"},{"issue":"3","key":"10.1016\/j.jcta.2016.10.001_br0200","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/s00222-006-0001-6","article-title":"Finite covers of random 3-manifolds","volume":"166","author":"Dunfield","year":"2006","journal-title":"Invent. Math."},{"key":"10.1016\/j.jcta.2016.10.001_br0210","article-title":"Parameterized Complexity Theory","author":"Flum","year":"2006"},{"key":"10.1016\/j.jcta.2016.10.001_br0220","article-title":"A user's guide to discrete Morse theory","volume":"48","author":"Forman","year":"2002","journal-title":"S\u00e9m. Lothar. Combin."},{"issue":"10","key":"10.1016\/j.jcta.2016.10.001_br0230","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1007\/s00371-012-0726-8","article-title":"Efficient computation of 3D Morse\u2013Smale complexes and persistent homology using discrete Morse theory","volume":"28","author":"G\u00fcnther","year":"2012","journal-title":"Vis. Comput."},{"key":"10.1016\/j.jcta.2016.10.001_br0240","series-title":"Proceedings of the 46th ACM Symposium on Theory of Computing","first-page":"89","article-title":"Deciding first-order properties of nowhere dense graphs","author":"Grohe","year":"2014"},{"issue":"4","key":"10.1016\/j.jcta.2016.10.001_br0250","doi-asserted-by":"crossref","first-page":"2073","DOI":"10.2140\/gt.2011.15.2073","article-title":"Veering triangulations admit strict angle structures","volume":"15","author":"Hodgson","year":"2011","journal-title":"Geom. Topol."},{"issue":"4","key":"10.1016\/j.jcta.2016.10.001_br0260","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1006\/jcss.2001.1774","article-title":"Which problems have strongly exponential complexity","volume":"63","author":"Impagliazzo","year":"2001","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"10.1016\/j.jcta.2016.10.001_br0270","doi-asserted-by":"crossref","first-page":"61","DOI":"10.4310\/jdg\/1090503053","article-title":"0-Efficient triangulations of 3-manifolds","volume":"65","author":"Jaco","year":"2003","journal-title":"J. Differential Geom."},{"issue":"220","key":"10.1016\/j.jcta.2016.10.001_br0280","article-title":"Seifert fibered spaces in 3-manifolds","volume":"21","author":"Jaco","year":"1979","journal-title":"Mem. Amer. Math. Soc."},{"issue":"1","key":"10.1016\/j.jcta.2016.10.001_br0290","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1137\/S0895480104445885","article-title":"Computing optimal Morse matchings","volume":"20","author":"Joswig","year":"2006","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"10.1016\/j.jcta.2016.10.001_br0300","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1016\/j.disopt.2011.06.001","article-title":"Courcelle's Theorem-A game theoretic approach","volume":"8","author":"Kneis","year":"2011","journal-title":"Discrete Optim."},{"key":"10.1016\/j.jcta.2016.10.001_br0310","doi-asserted-by":"crossref","first-page":"369","DOI":"10.2140\/gt.2000.4.369","article-title":"Taut ideal triangulations of 3-manifolds","volume":"4","author":"Lackenby","year":"2000","journal-title":"Geom. Topol."},{"issue":"5","key":"10.1016\/j.jcta.2016.10.001_br0320","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1109\/TVCG.2004.18","article-title":"Applications of Forman's discrete Morse theory to topology visualization and mesh compression","volume":"10","author":"Lewiner","year":"2004","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"issue":"2","key":"10.1016\/j.jcta.2016.10.001_br0330","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/j.dam.2004.01.016","article-title":"Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width","volume":"145","author":"Makowsky","year":"2005","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"10.1016\/j.jcta.2016.10.001_br0340","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1016\/S0022-0000(03)00080-1","article-title":"The parameterized complexity of knot polynomials","volume":"67","author":"Makowsky","year":"2003","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.jcta.2016.10.001_br0350","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1215\/ijm\/1258130983","article-title":"A new decomposition theorem for 3-manifolds","volume":"46","author":"Martelli","year":"2002","journal-title":"Illinois J. Math."},{"key":"10.1016\/j.jcta.2016.10.001_br0360","article-title":"Algorithmic Topology and Classification of 3-Manifolds","volume":"vol. 9","author":"Matveev","year":"2003"},{"key":"10.1016\/j.jcta.2016.10.001_br0370","article-title":"Sparsity: Graphs, Structures, and Algorithms","volume":"vol. 28","author":"Ne\u015fet\u0157il","year":"2012"},{"issue":"3","key":"10.1016\/j.jcta.2016.10.001_br0380","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","article-title":"Graph minors. II. Algorithmic aspects of tree-width","volume":"7","author":"Robertson","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/j.jcta.2016.10.001_br0390","article-title":"The Geometry and Topology of 3-Manifolds","author":"Thurston","year":"1978"},{"issue":"4","key":"10.1016\/j.jcta.2016.10.001_br0400","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1016\/0040-9383(92)90015-A","article-title":"State sum invariants of 3-manifolds and quantum 6j-symbols","volume":"31","author":"Turaev","year":"1992","journal-title":"Topology"}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0097316516301005?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0097316516301005?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,12]],"date-time":"2021-05-12T15:39:25Z","timestamp":1620833965000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0097316516301005"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2]]},"references-count":40,"alternative-id":["S0097316516301005"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.jcta.2016.10.001","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[2017,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Courcelle's theorem for triangulations","name":"articletitle","label":"Article Title"},{"value":"Journal of Combinatorial Theory, Series A","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.jcta.2016.10.001","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}