{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:44:36Z","timestamp":1725763476323},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642450297"},{"type":"electronic","value":"9783642450303"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45030-3_35","type":"book-chapter","created":{"date-parts":[[2013,12,12]],"date-time":"2013-12-12T02:32:52Z","timestamp":1386815572000},"page":"372-382","source":"Crossref","is-referenced-by-count":4,"title":["Myhill-Nerode Methods for Hypergraphs"],"prefix":"10.1007","author":[{"given":"Ren\u00e9","family":"van Bevern","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael R.","family":"Fellows","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Serge","family":"Gaspers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frances A.","family":"Rosamond","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Abrahamson, K.R., Fellows, M.R.: Finite automata, bounded treewidth, and well-quasiordering. In: Graph Structure Theory. Contemporary Mathematics, vol.\u00a0147, pp. 539\u2013564. American Mathematical Society (1991)","DOI":"10.1090\/conm\/147\/01199"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"van Bevern, R., Fellows, M.R., Gaspers, S., Rosamond, F.A.: Myhill-nerode methods for hypergraphs (2013), arxiv:1211.1299v3 (cs.DM)","DOI":"10.1007\/978-3-642-45030-3_35"},{"issue":"6","key":"35_CR3","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":"4","key":"35_CR4","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.jcss.2008.10.003","volume":"75","author":"H.L. Bodlaender","year":"2009","unstructured":"Bodlaender, H.L., Fellows, M.R., Thilikos, D.M.: Derivation of algorithms for cutwidth and related graph layout parameters. J. Comput. Syst. Sci.\u00a075(4), 231\u2013244 (2009)","journal-title":"J. Comput. Syst. Sci."},{"key":"35_CR5","unstructured":"Cahoon, J., Sahni, S.: Exact algorithms for special cases of the board permutation problem. In: Proceedings of the 21st Annual Allerton Conference on Communication, Control, and Computing, pp. 246\u2013255 (1983)"},{"key":"35_CR6","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14279-6","volume-title":"Graph Theory","author":"R. Diestel","year":"2010","unstructured":"Diestel, R.: Graph Theory, 4th edn. Graduate Texts in Mathematics, vol.\u00a0173. Springer, New York (2010)","edition":"4"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Fellows, M.R., Langston, M.A.: An analogue of the Myhill-Nerode Theorem and its use in computing finite-basis characterizations (extended abstract). In: Proc. 30th FOCS, pp. 520\u2013525. IEEE Computer Society (1989)","DOI":"10.1109\/SFCS.1989.63528"},{"issue":"1","key":"35_CR9","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1137\/0405010","volume":"5","author":"M.R. Fellows","year":"1992","unstructured":"Fellows, M.R., Langston, M.A.: On well-partial-order theory and its application to combinatorial problems of VLSI design. SIAM J. Discrete Math.\u00a05(1), 117\u2013126 (1992)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"35_CR10","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1016\/S0022-0000(05)80079-0","volume":"49","author":"M.R. Fellows","year":"1994","unstructured":"Fellows, M.R., Langston, M.A.: On search, decision, and the efficiency of polynomial-time algorithms. J. Comput. Syst. Sci.\u00a049(3), 769\u2013779 (1994)","journal-title":"J. Comput. Syst. Sci."},{"key":"35_CR11","unstructured":"Gavril, F.: Some NP-complete problems on graphs. In: Proc. 1977 Conf. on Inf. Sc. and Syst., pp. 91\u201395. Johns Hopkins Univ. (1977)"},{"key":"35_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11604686_1","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"G. Gottlob","year":"2005","unstructured":"Gottlob, G., Grohe, M., Musliu, N., Samer, M., Scarcello, F.: Hypertree decompositions: Structure, algorithms, and applications. In: Kratsch, D. (ed.) WG 2005. LNCS, vol.\u00a03787, pp. 1\u201315. Springer, Heidelberg (2005)"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Mikl\u00f3s, Z., Schwentick, T.: Generalized hypertree decompositions: NP-hardness and tractable variants. J. ACM\u00a056(6) (2009)","DOI":"10.1145\/1568318.1568320"},{"issue":"2","key":"35_CR14","first-page":"302","volume":"61","author":"P.G. Kolaitis","year":"2000","unstructured":"Kolaitis, P.G., Vardi, M.Y.: Conjunctive-query containment and constraint satisfaction. J. Comput. Sci.\u00a061(2), 302\u2013332 (2000)","journal-title":"J. Comput. Sci."},{"issue":"2","key":"35_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1721837.1721845","volume":"6","author":"D. Marx","year":"2010","unstructured":"Marx, D.: Approximating fractional hypertree width. ACM Transactions on Algorithms\u00a06(2), 1\u201329 (2010)","journal-title":"ACM Transactions on Algorithms"},{"issue":"1","key":"35_CR16","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF02090388","volume":"24","author":"Z. Miller","year":"1991","unstructured":"Miller, Z., Sudborough, I.H.: A polynomial algorithm for recognizing bounded cutwidth in hypergraphs. Mathematical Systems Theory\u00a024(1), 11\u201340 (1991)","journal-title":"Mathematical Systems Theory"},{"key":"35_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/978-3-642-35261-4_50","volume-title":"Algorithms and Computation","author":"H. Nagamochi","year":"2012","unstructured":"Nagamochi, H.: Linear layouts in submodular systems. In: Chao, K.-M., Hsu, T.-s., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol.\u00a07676, pp. 475\u2013484. Springer, Heidelberg (2012)"},{"issue":"2","key":"35_CR18","first-page":"103","volume":"76","author":"M. Samer","year":"2010","unstructured":"Samer, M., Szeider, S.: Constraint satisfaction with bounded treewidth revisited. J. Comput. Sci.\u00a076(2), 103\u2013114 (2010)","journal-title":"J. Comput. Sci."},{"issue":"1","key":"35_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jalgor.2004.12.001","volume":"56","author":"D.M. Thilikos","year":"2005","unstructured":"Thilikos, D.M., Serna, M.J., Bodlaender, H.L.: Cutwidth\u00a0I: A linear time fixed parameter algorithm. J. Algorithms\u00a056(1), 1\u201324 (2005)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45030-3_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,4]],"date-time":"2019-08-04T20:27:49Z","timestamp":1564950469000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45030-3_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450297","9783642450303"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45030-3_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}