{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:47:57Z","timestamp":1725493677174},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405344"},{"type":"electronic","value":"9783540450719"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45071-8_55","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T08:04:43Z","timestamp":1193472283000},"page":"548-558","source":"Crossref","is-referenced-by-count":9,"title":["Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Szeider","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"55_CR1","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/0097-3165(86)90060-9","volume":"43","author":"R. Aharoni","year":"1986","unstructured":"R. Aharoni and N. Linial. Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas. J. Combin. Theory Ser. A, 43:196\u2013204, 1986.","journal-title":"J. Combin. Theory Ser. A"},{"key":"55_CR2","doi-asserted-by":"crossref","unstructured":"M. Alekhnovich and A. A. Razborov. Satisfiability, branch-width and Tseitin tautologies. In Proceedings of the 43rd IEEE FOCS, pages 593\u2013603, 2002.","DOI":"10.1109\/SFCS.2002.1181983"},{"issue":"1\u20132","key":"55_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0166-218X(00)00221-3","volume":"108","author":"B. Courcelle","year":"2001","unstructured":"B. Courcelle, J. A. Makowsky, and U. Rotics. On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discr. Appl. Math., 108(1\u20132):23\u201352, 2001.","journal-title":"Discr. Appl. Math."},{"key":"55_CR4","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1023\/A:1018924526592","volume":"23","author":"G. Davydov","year":"1998","unstructured":"G. Davydov, I. Davydova, and H. Kleine B\u00fcning. An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF. Ann. Math. Artif. Intell., 23:229\u2013245, 1998.","journal-title":"Ann. Math. Artif. Intell."},{"key":"55_CR5","volume-title":"Graph Theory","author":"R. Diestel","year":"2000","unstructured":"R. Diestel. Graph Theory. Springer Verlag, New York, 2nd edition, 2000.","edition":"2nd edition"},{"key":"55_CR6","doi-asserted-by":"crossref","unstructured":"R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer Verlag, 1999.","DOI":"10.1007\/978-1-4612-0515-9"},{"issue":"1","key":"55_CR7","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/S0304-3975(01)00337-1","volume":"289","author":"H. Fleischner","year":"2002","unstructured":"H. Fleischner, O. Kullmann, and S. Szeider. Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. Theoret. Comput. Sci., 289(1):503\u2013516, 2002.","journal-title":"Theoret. Comput. Sci."},{"key":"55_CR8","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0166-218X(01)00358-4","volume":"125","author":"J. Franco","year":"2003","unstructured":"J. Franco and A. Van Gelder. A perspective on certain polynomial time solvable classes of satisfiability. Discr. Appl. Math., 125:177\u2013214, 2003.","journal-title":"Discr. Appl. Math."},{"issue":"1\u20132","key":"55_CR9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0004-3702(02)00182-0","volume":"138","author":"G. Gottlob","year":"2002","unstructured":"G. Gottlob, F. Scarcello, and M. Sideri. Fixed-parameter complexity in AI and nonmonotonic reasoning. Artificial Intelligence, 138(1\u20132):55\u201386, 2002.","journal-title":"Artificial Intelligence"},{"key":"55_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/10703163_12","volume-title":"Proc. CSL\u201998","author":"H. K. B\u00fcning","year":"1999","unstructured":"H. Kleine B\u00fcning. An upper bound for minimal resolution refutations. In Proc. CSL\u201998, volume 1584 of LNCS, pages 171\u2013178. Springer Verlag, 1999."},{"issue":"1\u20133","key":"55_CR11","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0166-218X(00)00245-6","volume":"107","author":"H. K. B\u00fcning","year":"2000","unstructured":"H. Kleine B\u00fcning. On subclasses of minimal unsatisfiable formulas. Discr. Appl. Math., 107(1\u20133):83\u201398, 2000.","journal-title":"Discr. Appl. Math."},{"key":"55_CR12","unstructured":"O. Kullmann. Lean clause-sets: Generalizations of minimally unsatisfiable clausesets. To appear in Discr. Appl. Math."},{"key":"55_CR13","doi-asserted-by":"crossref","unstructured":"O. Kullmann. An application of matroid theory to the SAT problem. In Fifteenth Annual IEEE Conference on Computational Complexity, pages 116\u2013124, 2000.","DOI":"10.1109\/CCC.2000.856741"},{"key":"55_CR14","volume-title":"Matching Theory","author":"L. Lov\u00e1sz","year":"1986","unstructured":"L. Lov\u00e1sz and M. D. Plummer. Matching Theory. North-Holland Publishing Co., Amsterdam, 1986."},{"key":"55_CR15","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0166-218X(85)90050-2","volume":"10","author":"B. Monien","year":"1985","unstructured":"B. Monien and E. Speckenmeyer. Solving satisfiability in less than 2n steps. Discr. Appl. Math., 10:287\u2013295, 1985.","journal-title":"Discr. Appl. Math."},{"issue":"1","key":"55_CR16","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/0022-0000(88)90042-6","volume":"37","author":"C. H. Papadimitriou","year":"1988","unstructured":"C. H. Papadimitriou and D. Wolfe. The complexity of facets resolved. J. Comput. System Sci., 37(1):2\u201313, 1988.","journal-title":"J. Comput. System Sci."},{"key":"55_CR17","doi-asserted-by":"crossref","unstructured":"S. Szeider. Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable. Technical Report TR03-002, Revision 1, Electronic Colloquium on Computational Complexity (ECCC), 2003.","DOI":"10.1007\/3-540-45071-8_55"},{"issue":"1","key":"55_CR18","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0166-218X(84)90081-7","volume":"8","author":"C. A. Tovey","year":"1984","unstructured":"C. A. Tovey. A simplified NP-complete satisfiability problem. Discr. Appl. Math., 8(1):85\u201389, 1984.","journal-title":"Discr. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45071-8_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T02:09:10Z","timestamp":1556935750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45071-8_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405344","9783540450719"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45071-8_55","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}