{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:33:35Z","timestamp":1725514415598},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540725039"},{"type":"electronic","value":"9783540725046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72504-6_23","type":"book-chapter","created":{"date-parts":[[2007,7,22]],"date-time":"2007-07-22T11:36:39Z","timestamp":1185104199000},"page":"256-261","source":"Crossref","is-referenced-by-count":1,"title":["On Exact Complexity of Subgraph Homeomorphism"],"prefix":"10.1007","author":[{"given":"Andrzej","family":"Lingas","sequence":"first","affiliation":[]},{"given":"Martin","family":"Wahlen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"23_CR1","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0020-0190(93)90033-6","volume":"47","author":"E.T. Bax","year":"1993","unstructured":"Bax, E.T.: Inclusion and exclusion algorithm for the Hamiltonian path problem. Information Processing Letters\u00a047(4), 203\u2013207 (1993)","journal-title":"Information Processing Letters"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A., Husfeldt, T.: Inclusion-exclusion algorithms for set partitions. In: Proc. 47th IEEE Symposium on Foundations of Computer Science, Berkeley, pp. 575\u2013582 (2006)","DOI":"10.1109\/FOCS.2006.41"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A., et al.: Fourier meets M\u00f6bius: Fast Subset Convolution. arXiv, to appear in Proc. STOC\u201907 (2006)","DOI":"10.1145\/1250790.1250801"},{"key":"23_CR4","unstructured":"Czumaj, A., Lingas, A.: Finding a heaviest triangle is not harder than matrix multiplication. In: Proc. of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA \u201907) (2007)"},{"key":"23_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parametrized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parametrized Complexity. Springer, New York (1999)"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Grandoni, F., Kratch, D.: Measure and conquer: A Simple 20.228n Independent Set Algorithm. In: Proceedings SODA (2006)","DOI":"10.1145\/1109557.1109560"},{"key":"23_CR7","volume-title":"Computers and Intractability. A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"2003","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-completeness. W.H. Freeman, New York (2003)"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0304-3975(96)00046-1","volume":"164","author":"A. Gupta","year":"1996","unstructured":"Gupta, A., Nishimura, N.: The complexity of subgraph isomorphism for classes of partial k-trees. Theoretical Computer Science\u00a0164, 287\u2013298 (1996)","journal-title":"Theoretical Computer Science"},{"key":"23_CR9","first-page":"196","volume":"10","author":"M. Held","year":"1962","unstructured":"Held, M., Karp, R.: A dynamic programming approach to sequencing problems. Journal of SIAM\u00a010, 196\u2013210 (1962)","journal-title":"Journal of SIAM"},{"issue":"2","key":"23_CR10","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0167-6377(82)90044-X","volume":"1","author":"R.M. Karp","year":"1982","unstructured":"Karp, R.M.: Dynamic programming meets the principle of inclusion and exclusion. Operations Research Letters\u00a01(2), 49\u201351 (1982)","journal-title":"Operations Research Letters"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Koivisto, M.: An O *(2 n ) algorithm for graph coloring and other partitioning problems via inclusion exclusion. In: Proc. 47th IEEE Symposium on Foundations of Computer Science, Berkeley, pp. 582\u2013590 (2006)","DOI":"10.1109\/FOCS.2006.11"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0012-365X(92)90687-B","volume":"108","author":"J. Matou\u0161ek","year":"1992","unstructured":"Matou\u0161ek, J., Thomas, R.: On the complexity of finding iso- and other morphisms for partial k-trees. Discrete Mathematics\u00a0108, 343\u2013364 (1992)","journal-title":"Discrete Mathematics"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N. Robertson","year":"1995","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XIII. The disjoint paths problem. J. Combinatorial Theory, Ser. B\u00a063, 65\u2013110 (1995)","journal-title":"J. Combinatorial Theory, Ser. B"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72504-6_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T09:38:08Z","timestamp":1619516288000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72504-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540725039","9783540725046"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72504-6_23","relation":{},"subject":[]}}