{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,16]],"date-time":"2025-04-16T13:07:33Z","timestamp":1744808853583},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540797227"},{"type":"electronic","value":"9783540797234"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79723-4_5","type":"book-chapter","created":{"date-parts":[[2008,5,6]],"date-time":"2008-05-06T06:22:17Z","timestamp":1210054937000},"page":"30-42","source":"Crossref","is-referenced-by-count":4,"title":["Fixed Structure Complexity"],"prefix":"10.1007","author":[{"given":"Yonatan","family":"Aumann","sequence":"first","affiliation":[]},{"given":"Yair","family":"Dombb","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1002\/malq.19970430204","volume":"43","author":"M. Cesati","year":"1997","unstructured":"Cesati, M., Di Ianni, M.: Computational models for parameterized complexity. Mathematical Logic Quarterly\u00a043, 179\u2013202 (1997)","journal-title":"Mathematical Logic Quarterly"},{"key":"5_CR2","unstructured":"Cesati, M.: Compendium of parameterized problems (2006), http:\/\/bravo.ce.uniroma2.it\/home\/cesati\/research\/compendium\/compendium.pdf"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/3-540-44674-5_26","volume-title":"Implementation and Application of Automata","author":"T. Wareham","year":"2001","unstructured":"Wareham, T.: The parameterized complexity of intersection and composition operations on sets of finite-state automata. In: Yu, S., P\u0103un, A. (eds.) CIAA 2000. LNCS, vol.\u00a02088, pp. 302\u2013310. Springer, Heidelberg (2001)"},{"key":"5_CR4","unstructured":"Fernau, H., Hagerup, T., Nishimura, N., Ragde, P., Reinhardt, K.: On the parameterized complexity of a generalized rush hour puzzle. In: Proceedings of Canadian Conference on Computational Geometry, CCCG, pp. 6\u20139 (2003)"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On the complexity of database queries. In: Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 12\u201314 (1997)","DOI":"10.1145\/263661.263664"},{"key":"5_CR6","unstructured":"Downey, R.G., Fellows, M.R., Taylor, U.: On the parameteric complexity of relational database queries and a sharper characterization of w[1]. In: Combinatorics, Complexity and Logic, Proceedings of DMTCS 1996 (1996)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Vardi, M.: The complexity of relational query languages. In: Proceedings of the 14th ACM Symposium on Theory of Computing, pp. 137\u2013146 (1982)","DOI":"10.1145\/800070.802186"},{"key":"5_CR8","doi-asserted-by":"crossref","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. Springer, Heidelberg (1999)"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Grohe, M., Schwentick, T., Segoufin, L.: When is the evaluation of conjunctive queries tractable? In: Proceedings of 33rd annual ACM Symposium on Theory of Computing, pp. 657\u2013666 (2001)","DOI":"10.1145\/380752.380867"},{"key":"5_CR10","volume-title":"Elements of the Theory of Computation","author":"H.R. Lewis","year":"1981","unstructured":"Lewis, H.R., Papadimitriou, C.H.: Elements of the Theory of Computation. Prentice Hall, Englewood Cliffs (1981)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Berger, R.: The undecidability of the domino problem. Mem. AMS\u00a066 (1966)","DOI":"10.1090\/memo\/0066"},{"key":"5_CR12","volume-title":"Product Graphs: Structure and Recognition","author":"W. Imrich","year":"2000","unstructured":"Imrich, W., Klavzer, S.: Product Graphs: Structure and Recognition. Wiley, Chichester (2000)"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79723-4_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:30:03Z","timestamp":1619508603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79723-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540797227","9783540797234"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79723-4_5","relation":{},"subject":[]}}