{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T06:48:07Z","timestamp":1775371687081,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,1,23]],"date-time":"2017-01-23T00:00:00Z","timestamp":1485129600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s10878-017-0112-6","type":"journal-article","created":{"date-parts":[[2017,1,23]],"date-time":"2017-01-23T06:54:34Z","timestamp":1485154474000},"page":"572-590","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Algorithmic aspects of b-disjunctive domination in graphs"],"prefix":"10.1007","volume":"36","author":[{"given":"B. S.","family":"Panda","sequence":"first","affiliation":[]},{"given":"Arti","family":"Pandey","sequence":"additional","affiliation":[]},{"given":"S.","family":"Paul","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,23]]},"reference":[{"key":"112_CR1","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P Alimonti","year":"2000","unstructured":"Alimonti P, Kann V (2000) Some APX-completeness results for cubic graphs. Theor Comput Sci 237:123\u2013134","journal-title":"Theor Comput Sci"},{"key":"112_CR2","doi-asserted-by":"crossref","unstructured":"Ambalath AM, Balasundaram R, Rao C, Koppula V, Misra N, Philip G, Ramanujan MS (2010) On the kernelization complexity of colorful motifs. In: IPEC, Lecture Notes in Computer Science, 6478:14\u201325","DOI":"10.1007\/978-3-642-17493-3_4"},{"key":"112_CR3","doi-asserted-by":"crossref","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 (1999) Complexity and approximation. Springer, Berlin"},{"issue":"1","key":"112_CR4","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0020-0190(84)90126-1","volume":"19","author":"AA Bertossi","year":"1984","unstructured":"Bertossi AA (1984) Dominating sets for split and bipartite graphs. Inf Process Lett 19(1):37\u201340","journal-title":"Inf Process Lett"},{"issue":"6","key":"112_CR5","doi-asserted-by":"crossref","first-page":"1671","DOI":"10.1137\/S0097539792238431","volume":"27","author":"MS Chang","year":"1998","unstructured":"Chang MS (1998) Efficient algorithms for the domination problems on interval and circular-arc graphs. SIAM J Comput 27(6):1671\u20131694","journal-title":"SIAM J Comput"},{"key":"112_CR6","doi-asserted-by":"crossref","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 (2008) Approximation hardness of dominating set problems in bounded degree graphs. Inf Comput 206:1264\u20131275","journal-title":"Inf Comput"},{"key":"112_CR7","doi-asserted-by":"crossref","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 (2009) Domination with exponential decay. Discrete Math 309:5877\u20135883","journal-title":"Discrete Math"},{"key":"112_CR8","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"DR Fulkerson","year":"1965","unstructured":"Fulkerson DR, Gross OA (1965) Incidence matrices and interval graphs. Pac J Math 15:835\u2013855","journal-title":"Pac J Math"},{"issue":"4","key":"112_CR9","doi-asserted-by":"crossref","first-page":"547","DOI":"10.2989\/16073606.2014.894688","volume":"37","author":"W Goddard","year":"2014","unstructured":"Goddard W, Henning MA, McPillan CA (2014) The disjunctive domination number of a graph. Quaest Math 37(4):547\u2013561","journal-title":"Quaest Math"},{"key":"112_CR10","volume-title":"Fundamentals of domination in graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (1998a) Fundamentals of domination in graphs. Marcel Dekker Inc., New York"},{"key":"112_CR11","volume-title":"Domination in graphs, advanced topics","author":"TW Haynes","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (1998b) Domination in graphs, advanced topics. Marcel Dekker Inc., New York"},{"key":"112_CR12","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.dam.2014.10.036","volume":"184","author":"MA Henning","year":"2015","unstructured":"Henning MA, Marcon SA (2015a) Domination versus disjunctive domination in trees. Discrete Appl Math 184:171\u2013177","journal-title":"Discrete Appl Math"},{"key":"112_CR13","doi-asserted-by":"crossref","first-page":"531","DOI":"10.2989\/16073606.2015.1096860","volume":"39","author":"MA Henning","year":"2015","unstructured":"Henning MA, Marcon SA (2015b) A constructive characterization of trees with equal total domination and disjunctive domination numbers. Quaest Math 39:531\u2013543","journal-title":"Quaest Math"},{"key":"112_CR14","doi-asserted-by":"crossref","first-page":"1090","DOI":"10.1007\/s10878-014-9811-4","volume":"31","author":"MA Henning","year":"2014","unstructured":"Henning MA, Naicker V (2014) Disjunctive total domination in graphs. J Comb Optim 31:1090\u20131110","journal-title":"J Comb Optim"},{"key":"112_CR15","first-page":"255","volume":"17","author":"MA Henning","year":"2015","unstructured":"Henning MA, Naicker V (2015) Graphs with large disjunctive total domination number. Discrete Appl Math 17:255\u2013282","journal-title":"Discrete Appl Math"},{"key":"112_CR16","doi-asserted-by":"crossref","first-page":"153","DOI":"10.7151\/dmgt.1854","volume":"36","author":"MA Henning","year":"2016","unstructured":"Henning MA, Naicker V (2016) Bounds on the disjunctive total domination number of a tree. Discuss Math Graph Theory 36:153\u2013171","journal-title":"Discuss Math Graph Theory"},{"key":"112_CR17","unstructured":"Jacobson MS, Peters K (1989) Complexity questions for \n                        $$n$$\n                        \n                            \n                                n\n                            \n                        \n                    -domination and related parameters. In: Eighteenth Manitoba conference on numerical mathematics and computing (Winnipeg, MB, 1988) Congr. Numer. 68, 722"},{"key":"112_CR18","unstructured":"Jamison RE, Laskar R (1984) Elimination orderings of chordal graphs. In: Combinatorics and applications (Calcutta, 1982), ISI, Calcutta, pp 192\u2013200"},{"issue":"3","key":"112_CR19","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0020-0190(03)00298-9","volume":"87","author":"BS Panda","year":"2003","unstructured":"Panda BS, Das SK (2003) A linear time recognition algorithm for proper interval graphs. Inf Process Lett 87(3):153\u2013161","journal-title":"Inf Process Lett"},{"key":"112_CR20","doi-asserted-by":"crossref","unstructured":"Panda BS, Pandey A, Paul S (2015) Algorithmic aspects of disjunctive domination in graphs. In: COCOON, Lecture Notes in Computer Science 9198:325\u2013336","DOI":"10.1007\/978-3-319-21398-9_26"},{"key":"112_CR21","doi-asserted-by":"crossref","unstructured":"Pandey A, Panda BS (2016) \n                        $$b$$\n                        \n                            \n                                b\n                            \n                        \n                    -Disjunctive total domination in graphs: algorithm and hardness results. In: CALDAM, Lecture Notes in Computer Science 9602:277\u2013288","DOI":"10.1007\/978-3-319-29221-2_24"},{"key":"112_CR22","first-page":"526","volume":"28","author":"S Rajgopalan","year":"1999","unstructured":"Rajgopalan S, Vazirani VV (1999) Primal-dual RNC approximation algorithms for set cover and covering integer programs. SIAM J Comput 28:526\u2013541","journal-title":"SIAM J Comput"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0112-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0112-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0112-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,6,21]],"date-time":"2018-06-21T12:28:20Z","timestamp":1529584100000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0112-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,23]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["112"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0112-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,23]]}}}