{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:39:13Z","timestamp":1787503153287,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319087825","type":"print"},{"value":"9783319087832","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08783-2_26","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T10:04:30Z","timestamp":1404554670000},"page":"300-311","source":"Crossref","is-referenced-by-count":2,"title":["Fixed Parameter Tractable Algorithms in Combinatorial Topology"],"prefix":"10.1007","author":[{"given":"Benjamin A.","family":"Burton","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"William","family":"Pettersson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"1","key":"26_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/BF01934985","volume":"25","author":"S. Arnborg","year":"1985","unstructured":"Arnborg, S.: Efficient algorithms for combinatorial problems on graphs with bounded decomposability\u2014a survey. BIT\u00a025(1), 2\u201323 (1985)","journal-title":"BIT"},{"issue":"2","key":"26_CR2","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms\u00a012(2), 308\u2013340 (1991)","journal-title":"J. Algorithms"},{"issue":"2","key":"26_CR3","first-page":"185","volume":"30","author":"D. Berend","year":"2010","unstructured":"Berend, D., Tassa, T.: Improved bounds on Bell numbers and on moments of sums of random variables. Probab. Math. Statist.\u00a030(2), 185\u2013205 (2010)","journal-title":"Probab. Math. Statist."},{"issue":"6","key":"26_CR4","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput.\u00a025(6), 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"26_CR5","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1006\/jagm.1996.0049","volume":"21","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L., Kloks, T.: Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Algorithms\u00a021(2), 358\u2013402 (1996)","journal-title":"J. Algorithms"},{"issue":"8","key":"26_CR6","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.1142\/S0218216504003627","volume":"13","author":"B.A. Burton","year":"2004","unstructured":"Burton, B.A.: Face pairing graphs and 3-manifold enumeration. J. Knot Theory Ramifications\u00a013(8), 1057\u20131101 (2004)","journal-title":"J. Knot Theory Ramifications"},{"issue":"3","key":"26_CR7","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s00454-007-1307-x","volume":"38","author":"B.A. Burton","year":"2007","unstructured":"Burton, B.A.: Enumeration of non-orientable 3-manifolds using face-pairing graphs and union-find. Discrete & Computational Geometry\u00a038(3), 527\u2013571 (2007)","journal-title":"Discrete & Computational Geometry"},{"key":"26_CR8","unstructured":"Burton, B.A.: The cusped hyperbolic census is complete (preprint, 2014), \n                    \n                      http:\/\/arxiv.org\/abs\/1405.2695"},{"key":"26_CR9","unstructured":"Burton, B.A., Budney, R., Pettersson, W.: Regina: Software for 3-manifold topology and normal surface theory (1999-2013), \n                    \n                      http:\/\/regina.sourceforge.net"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Burton, B.A., Lewiner, T., Paix\u00e3o, J., Spreer, J.: Parameterized complexity of discrete Morse theory. In: SCG 2013: Proceedings of the 29th Annual Symposium on Computational Geometry, pp. 127\u2013136. ACM (2013)","DOI":"10.1145\/2462356.2462391"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Burton, B.A., Spreer, J.: The complexity of detecting taut angle structures on triangulations. In: SODA 2013: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 168\u2013183. SIAM (July 2012)","DOI":"10.1137\/1.9781611973105.13"},{"key":"26_CR12","unstructured":"Callahan, P.J., Hildebrand, M.V., Weeks, J.R.: A census of cusped hyperbolic 3-manifolds. Math. Comp. 68(225), 321\u2013332 (1999), with microfiche supplement"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discrete Appl. Math. 108(1-2), 23\u201352 (2001), International Workshop on Graph-Theoretic Concepts in Computer Science, Smolenice Castle (1998)","DOI":"10.1016\/S0166-218X(00)00221-3"},{"issue":"1","key":"26_CR14","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inform. and Comput.\u00a085(1), 12\u201375 (1990)","journal-title":"Inform. and Comput."},{"key":"26_CR15","unstructured":"van Dijk, T., van den Heuvel, J.P., Slob, W.: Computing treewidth with LibTW (2006)"},{"key":"26_CR16","series-title":"Monographs in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized complexity. Monographs in Computer Science. Springer, New York (1999)"},{"issue":"3","key":"26_CR17","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s00222-006-0001-6","volume":"166","author":"N.M. Dunfield","year":"2006","unstructured":"Dunfield, N.M., Thurston, W.P.: Finite covers of random 3-manifolds. Invent. Math.\u00a0166(3), 457\u2013521 (2006)","journal-title":"Invent. Math."},{"key":"26_CR18","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-1-4613-9647-5_7","volume-title":"Computers and Mathematics","author":"M. Hildebrand","year":"1989","unstructured":"Hildebrand, M., Weeks, J.: A computer generated census of cusped hyperbolic 3-manifolds. In: Computers and Mathematics, Cambridge, MA, pp. 53\u201359. Springer, New York (1989)"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Jaco, W., Letscher, D., Rubinstein, J.H.: Algorithms for essential surfaces in 3-manifolds. In: Topology and geometry: commemorating SISTAG. Contemp. Math., vol.\u00a0314, pp. 107\u2013124. Amer. Math. Soc., Providence (2002)","DOI":"10.1090\/conm\/314\/05426"},{"issue":"1","key":"26_CR20","doi-asserted-by":"crossref","first-page":"61","DOI":"10.4310\/jdg\/1090503053","volume":"65","author":"W. Jaco","year":"2003","unstructured":"Jaco, W., Rubinstein, J.H.: 0-efficient triangulations of 3-manifolds. J. Differential Geom.\u00a065(1), 61\u2013168 (2003)","journal-title":"J. Differential Geom."},{"key":"26_CR21","series-title":"Lecture Notes in Computer Science","volume-title":"Treewidth","year":"1994","unstructured":"Kloks, T. (ed.): Treewidth. LNCS, vol.\u00a0842. Springer, Heidelberg (1994)"},{"issue":"2","key":"26_CR22","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1080\/10586458.2001.10504444","volume":"10","author":"B.. Martelli","year":"2001","unstructured":"Martelli, B., Petronio, C.: Three-manifolds having complexity at most 9. Experimental Mathematics\u00a010(2), 207\u2013236 (2001)","journal-title":"Experimental Mathematics"},{"key":"26_CR23","series-title":"Algorithms and Computation in Mathematics","volume-title":"Algorithmic topology and classification of 3-manifolds","author":"S. Matveev","year":"2007","unstructured":"Matveev, S.: Algorithmic topology and classification of 3-manifolds, 2nd edn. Algorithms and Computation in Mathematics, vol.\u00a09. Springer, Berlin (2007)","edition":"2"},{"issue":"2","key":"26_CR24","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1080\/10586458.1998.10504365","volume":"7","author":"S.V. Matveev","year":"1998","unstructured":"Matveev, S.V.: Computer recognition of three-manifolds. Experiment. Math.\u00a07(2), 153\u2013161 (1998)","journal-title":"Experiment. Math."},{"issue":"2","key":"26_CR25","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1006\/jagm.1997.0898","volume":"26","author":"B.D. McKay","year":"1998","unstructured":"McKay, B.D.: Isomorph-free exhaustive generation. J. Algorithms\u00a026(2), 306\u2013324 (1998)","journal-title":"J. Algorithms"},{"key":"26_CR26","doi-asserted-by":"crossref","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms 7(3), 309\u2013322 (1986)","DOI":"10.1016\/0196-6774(86)90023-4"},{"key":"26_CR27","unstructured":"Thistlethwaite, M.: Cusped hyperbolic manifolds with 8 tetrahedra (October 2010), \n                    \n                      http:\/\/www.math.utk.edu\/~morwen\/8tet\/"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08783-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T02:59:07Z","timestamp":1558925947000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08783-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319087825","9783319087832"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08783-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}