{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:27:53Z","timestamp":1725809273516},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319126906"},{"type":"electronic","value":"9783319126913"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12691-3_20","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T21:11:32Z","timestamp":1415999492000},"page":"258-267","source":"Crossref","is-referenced-by-count":5,"title":["A Dichotomy for Upper Domination in Monogenic Classes"],"prefix":"10.1007","author":[{"given":"Hassan","family":"AbouEisha","sequence":"first","affiliation":[]},{"given":"Shahid","family":"Hussain","sequence":"additional","affiliation":[]},{"given":"Vadim","family":"Lozin","sequence":"additional","affiliation":[]},{"given":"J\u00e9r\u00f4me","family":"Monnot","sequence":"additional","affiliation":[]},{"given":"Bernard","family":"Ries","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"issue":"4","key":"20_CR1","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s00224-005-1199-1","volume":"39","author":"A Brandst\u00e4dt","year":"2006","unstructured":"Brandst\u00e4dt, A., Engelfriet, J., Le, H.-O., Lozin, V.V.: Clique-width for 4-vertex forbidden subgraphs. Theory Comput. Syst. 39(4), 561\u2013590 (2006)","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"20_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0166-218X(90)90065-K","volume":"27","author":"GA Cheston","year":"1990","unstructured":"Cheston, G.A., Fricke, G., Hedetniemi, S.T., Jacobs, D.P.: On the computational complexity of upper fractional domination. Discrete Appl. Math. 27(3), 195\u2013207 (1990)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"20_CR3","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0012-365X(81)90268-5","volume":"33","author":"EJ Cockayne","year":"1981","unstructured":"Cockayne, E.J., Favaron, O., Payan, C., Thomason, A.G.: Contributions to the theory of domination, independence and irredundance in graphs. Discrete Math. 33(3), 249\u2013258 (1981)","journal-title":"Discrete Math."},{"issue":"2","key":"20_CR4","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33(2), 125\u2013150 (2000)","journal-title":"Theory Comput. Syst."},{"key":"20_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H Freeman, New York (1979)"},{"issue":"3","key":"20_CR6","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.J.: Some simplified NP-Complete graph problems. Theor. Comput. Sci. 1(3), 237\u2013267 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/B978-0-12-386870-1.50030-7","volume-title":"Discrete Algorithms and Complexity","author":"EO Hare","year":"1987","unstructured":"Hare, E.O., Hedetniemi, S.T., Laskar, R.C., Peters, K., Wimer, T.: Linear-time computability of combinatorial problems on generalized-series-parallel graphs. In: Johnson, D.S., et al. (eds.) Discrete Algorithms and Complexity, pp. 437\u2013457. Academic Press, New York (1987)"},{"issue":"1\u20133","key":"20_CR8","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0012-365X(90)90349-M","volume":"86","author":"MS Jacobson","year":"1990","unstructured":"Jacobson, M.S., Peters, K.: Chordal graphs and upper irredundance, upper domination and independence. Discrete Math. 86(1\u20133), 59\u201369 (1990)","journal-title":"Discrete Math."},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.tcs.2012.02.036","volume":"438","author":"M Kami\u0144ski","year":"2012","unstructured":"Kami\u0144ski, M.: MAX-CUT and containment relations in graphs. Theor. Comput. Sci. 438, 89\u201395 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"20_CR10","first-page":"90","volume":"2","author":"DV Korobitsyn","year":"1990","unstructured":"Korobitsyn, D.V.: On the complexity of determining the domination number in monogenic classes of graphs. Diskretnaya Matematika 2(3), 90\u201396 (1990)","journal-title":"Diskretnaya Matematika"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/3-540-45477-2_23","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"D Kr\u00e1l\u2019","year":"2001","unstructured":"Kr\u00e1l\u2019, D., Kratochv\u00edl, J., Tuza, Z., Woeginger, G.J.: Complexity of Coloring Graphs without Forbidden Induced Subgraphs. In: Brandst\u00e4dt, A., Le, V.B. (eds.) WG 2001. LNCS, vol. 2204, pp. 254\u2013262. Springer, Heidelberg (2001)"},{"issue":"1","key":"20_CR12","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.dam.2004.07.006","volume":"146","author":"VV Lozin","year":"2005","unstructured":"Lozin, V.V., Mosca, R.: Independent sets in extensions of \n                      \n                        \n                      \n                      $$2K_2$$\n                    -free graphs. Discrete Appl. Math. 146(1), 74\u201380 (2005)","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12691-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T18:33:16Z","timestamp":1559068396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-12691-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319126906","9783319126913"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12691-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}