{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T06:02:54Z","timestamp":1751868174058,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ccc.2004.1313823","type":"proceedings-article","created":{"date-parts":[[2004,11,13]],"date-time":"2004-11-13T00:14:14Z","timestamp":1100304854000},"page":"139-149","source":"Crossref","is-referenced-by-count":4,"title":["Parameterized complexity of constraint satisfaction problems"],"prefix":"10.1109","author":[{"given":"D.","family":"Marx","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1137\/0211025"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804350"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799349948"},{"key":"12","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0045375","volume":"842","author":"kloks","year":"1994","journal-title":"Treewidth Volume 842 of Lecture Notes in Computer Science"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/174644.174650"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523189"},{"key":"1","first-page":"261","article-title":"Parameterized complexity: Exponential speed-up for planar graph problems","volume":"2076","author":"alber","year":"2001","journal-title":"ICALP 2001 Volume 2076 of Lecture Notes in Comput Sci"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/321850.321852"},{"key":"7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","author":"downey","year":"1999","journal-title":"Parameterized Complexity"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1087"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181990"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00228-4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794266766"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-35.1.85"}],"event":{"name":"Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004.","location":"Amherst, MA, USA"},"container-title":["Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9188\/29139\/01313823.pdf?arnumber=1313823","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T11:52:46Z","timestamp":1497613966000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1313823\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/ccc.2004.1313823","relation":{},"subject":[]}}