{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:10:40Z","timestamp":1743055840711,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319213972"},{"type":"electronic","value":"9783319213989"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21398-9_26","type":"book-chapter","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T15:12:41Z","timestamp":1435072361000},"page":"325-336","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Algorithmic Aspects of Disjunctive Domination in Graphs"],"prefix":"10.1007","author":[{"given":"B. S.","family":"Panda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arti","family":"Pandey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Paul","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"issue":"1\u20132","key":"26_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P Alimonti","year":"2000","unstructured":"Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theoret. Comput. Sci. 237(1\u20132), 123\u2013134 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-642-17493-3_4","volume-title":"Parameterized and Exact Computation","author":"AM Ambalath","year":"2010","unstructured":"Ambalath, A.M., Balasundaram, R., Rao H., C., Koppula, V., Misra, N., Philip, G., Ramanujan, M.S.: On the kernelization complexity of colorful motifs. In: Raman, V., Saurabh, S. (eds.) IPEC 2010. LNCS, vol. 6478, pp. 14\u201325. Springer, Heidelberg (2010)"},{"key":"26_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and approximation","author":"G Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and approximation. Springer, Berlin (1999)"},{"issue":"1","key":"26_CR4","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0020-0190(84)90126-1","volume":"19","author":"AA Bertossi","year":"1984","unstructured":"Bertossi, A.A.: Dominating sets for split and bipartite graphs. Inf. Process. Lett. 19(1), 37\u201340 (1984)","journal-title":"Inf. Process. Lett."},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"1264","DOI":"10.1016\/j.ic.2008.07.003","volume":"206","author":"M Chleb\u00edk","year":"2008","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: Approximation hardness of dominating set problems in bounded degree graphs. Inform. and Comput. 206, 1264\u20131275 (2008)","journal-title":"Inform. and Comput."},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"5877","DOI":"10.1016\/j.disc.2008.06.040","volume":"309","author":"P Dankelmann","year":"2009","unstructured":"Dankelmann, P., Day, D., Erwin, D., Mukwembi, S., Swart, H.: Domination with exponential decay. Discrete Math. 309, 5877\u20135883 (2009)","journal-title":"Discrete Math."},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"DR Fulkerson","year":"1965","unstructured":"Fulkerson, D.R., Gross, O.A.: Incidence matrices and interval graphs. Pacific J. Math. 15, 835\u2013855 (1965)","journal-title":"Pacific J. Math."},{"issue":"4","key":"26_CR8","doi-asserted-by":"publisher","first-page":"547","DOI":"10.2989\/16073606.2014.894688","volume":"37","author":"W Goddard","year":"2014","unstructured":"Goddard, W., Henning, M.A., McPillan, C.A.: The disjunctive domination number of a graph. Quaestiones Math. 37(4), 547\u2013561 (2014)","journal-title":"Quaestiones Math."},{"key":"26_CR9","volume-title":"Fundamentals of domination in graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of domination in graphs. Marcel Dekker Inc., New York (1998)"},{"key":"26_CR10","volume-title":"Domination in Graphs, Advanced Topics","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in Graphs, Advanced Topics. Marcel Dekker Inc., New York (1998)"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Henning, M.A., Marcon, S.A.: Domination versus disjunctive domination in trees. Discrete Appl. Math. (2014)","DOI":"10.1016\/j.dam.2014.10.036"},{"issue":"3","key":"26_CR12","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1007\/s10878-014-9811-4","volume":"31","author":"Michael A. Henning","year":"2014","unstructured":"Henning, M.A., Naicker, V.: Disjunctive total domination in graphs. J. Comb. Optim. (2014). doi:10.1007\/s10878-014-9811-4","journal-title":"Journal of Combinatorial Optimization"},{"key":"26_CR13","unstructured":"Jacobson, M.S., Peters, K.: Complexity questions for $$n$$-domination and related parameters. In: Eighteenth Manitoba Conference on Numerical Mathematics and Computing, Winnipeg, MB (1988), Congr. Numer. 68, 722 (1989)"},{"key":"26_CR14","unstructured":"Jamison, R.E., Laskar, R.: Elimination orderings of chordal graphs. In: Combinatorics and applications. ISI, Calcutta, pp. 192\u2013200 (1982, 1984)"},{"issue":"3","key":"26_CR15","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0020-0190(03)00298-9","volume":"87","author":"BS Panda","year":"2003","unstructured":"Panda, B.S., Das, S.K.: A linear time recognition algorithm for proper interval graphs. Inform. Process. Lett. 87(3), 153\u2013161 (2003)","journal-title":"Inform. Process. Lett."},{"key":"26_CR16","first-page":"526","volume":"28","author":"S Rajgopalan","year":"1999","unstructured":"Rajgopalan, S., Vazirani, V.V.: Primal-dual RNC approximation algorithms for set cover and covering integer programs. SIAM J. Comput. 28, 526\u2013541 (1999)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21398-9_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T02:26:16Z","timestamp":1676946376000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21398-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213972","9783319213989"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21398-9_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}