{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T20:27:18Z","timestamp":1794342438241,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540390985","type":"print"},{"value":"9783540391012","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11847250_3","type":"book-chapter","created":{"date-parts":[[2006,9,13]],"date-time":"2006-09-13T11:43:02Z","timestamp":1158147782000},"page":"25-37","source":"Crossref","is-referenced-by-count":2,"title":["The Parameterized Complexity of Maximality and Minimality Problems"],"prefix":"10.1007","author":[{"given":"Yijia","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J\u00f6rg","family":"Flum","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/3-540-36136-7_40","volume-title":"Algorithms and Computation","author":"V. Arvind","year":"2002","unstructured":"Arvind, V., Raman, V.: Approximation Algorithms for Some Parameterized Counting Problems. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol.\u00a02518, pp. 453\u2013464. Springer, Heidelberg (2002)"},{"key":"3_CR2","volume-title":"Studies in Logic and Mathematical Foundations","author":"C.C. Chang","year":"1990","unstructured":"Chang, C.C., Keisler, H.J.: Model Theory. In: Studies in Logic and Mathematical Foundations, vol.\u00a073. North-Holland, Amsterdam (1990)"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Chen, Y., Flum, J., Grohe, M.: Bounded nondeterminism and alternation in parameterized complexity theory. In: Proceedings of the 18th IEEE Conference on Computational Complexity CCC 2003, pp. 13\u201329 (2003)","DOI":"10.1109\/CCC.2003.1214407"},{"key":"3_CR4","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":"3_CR5","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R., Regan, K.: Descriptive complexity and the W-hierarchy. In: Proof Complexity and Feasible Arithmetic. AMS-DIMACS Series, vol.\u00a039, pp. 119\u2013134 (1998)","DOI":"10.1090\/dimacs\/039\/07"},{"issue":"6","key":"3_CR6","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1137\/S0097539793250299","volume":"24","author":"T. Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems. SIAM Journal on Computing\u00a024(6), 1278\u20131304 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR7","unstructured":"Fernau, H.: Parameterized algorithms: A graph-theoretic approach. Habilitationsschrift, Universit\u00e4t T\u00fcbingen, T\u00fcbingen, Germany (2005)"},{"issue":"1","key":"3_CR8","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1137\/S0097539799360768","volume":"31","author":"J. Flum","year":"2001","unstructured":"Flum, J., Grohe, M.: Fixed-parameter tractability, definability, and model checking. SIAM Journal on Computing\u00a031(1), 113\u2013145 (2001)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"3_CR9","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1137\/S0097539703427203","volume":"33","author":"J. Flum","year":"2005","unstructured":"Flum, J., Grohe, M.: The parameterized complexity of counting problems. SIAM Journal on Computing\u00a033(4), 892\u2013922 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Flum, J., Grohe, M.: Model-checking problems as a basis for parameterized intractability. Logical Methods in Computer Science\u00a01(1) (2004)","DOI":"10.2168\/LMCS-1(1:2)2005"},{"key":"3_CR11","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.jcss.2005.06.003","volume":"72","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M., Weyer, M.: Bounded fixed-parameter tractability and \n                  \n                    \n                  \n                  $\\mbox{log}^{2}n$\n                 nondeterministic bits. Journal of Computer and System Sciences\u00a072, 34\u201371 (2006)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"3_CR13","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1016\/S0304-3975(01)00414-5","volume":"289","author":"S. Khot","year":"2002","unstructured":"Khot, S., Raman, V.: Parameterized complexity of finding subgraphs with hereditary properties. Theoretical Computer Science\u00a0289(2), 997\u20131008 (2002)","journal-title":"Theoretical Computer Science"},{"key":"3_CR14","unstructured":"Ritter, C.: Fagin-Definierbarkeit. Diplomarbeit, Universit\u00e4t Freiburg (2005)"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11847250_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:18:45Z","timestamp":1619493525000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11847250_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540390985","9783540391012"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11847250_3","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11847250","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}