{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T04:07:07Z","timestamp":1784002027867,"version":"3.55.0"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"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":["Acta Informatica"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s00236-026-00537-y","type":"journal-article","created":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T04:34:54Z","timestamp":1781238894000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Open packing in interval graphs"],"prefix":"10.1007","volume":"63","author":[{"given":"M.","family":"Shalu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"V. K.","family":"Kirubakaran","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,12]]},"reference":[{"key":"537_CR1","doi-asserted-by":"crossref","unstructured":"Ramos, I., Santos, V.\u00a0F., Szwarcfiter, J.\u00a0L.: Complexity aspects of the computation of the rank of a graph. Discrete Math. Theor. Comput. Sci. 16 (2014)","DOI":"10.46298\/dmtcs.2075"},{"key":"537_CR2","first-page":"3","volume":"29","author":"MA Henning","year":"1999","unstructured":"Henning, M.A., Slater, P.J.: Open packing in graphs. J. Comb. Math. Comb. Comput. 29, 3\u201316 (1999)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"537_CR3","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs, 1st edn. CRC Press, Boca Raton (1998)","edition":"1"},{"key":"537_CR4","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2016","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Springer, London (2016)"},{"key":"537_CR5","volume-title":"Total Domination in Graphs","author":"MA Henning","year":"2015","unstructured":"Henning, M.A., Yeo, A.: Total Domination in Graphs. Springer, New York (2015)"},{"key":"537_CR6","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0020-0190(88)90091-9","volume":"27","author":"G Ramalingam","year":"1988","unstructured":"Ramalingam, G., Rangan, C.P.: A unified approach to domination problems on interval graphs. Inf. Process. Lett. 27, 271\u2013274 (1988)","journal-title":"Inf. Process. Lett."},{"key":"537_CR7","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0012-365X(97)00228-8","volume":"186","author":"MA Henning","year":"1998","unstructured":"Henning, M.A.: Packing in trees. Discret. Math. 186, 145\u2013155 (1998)","journal-title":"Discret. Math."},{"key":"537_CR8","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1016\/j.disc.2013.01.022","volume":"313","author":"MA Henning","year":"2013","unstructured":"Henning, M.A., Rautenbach, D., Sch\u00e4fer, P.M.: Open packing, total domination, and the $${\\rm p}_{3}$$-radon number. Discret. Math. 313, 992\u2013998 (2013)","journal-title":"Discret. Math."},{"key":"537_CR9","doi-asserted-by":"publisher","first-page":"35","DOI":"10.7151\/dmgt.1257","volume":"25","author":"DF Rall","year":"2005","unstructured":"Rall, D.F.: Total domination in categorical products of graphs. Discuss. Math. Gr. Theory 25, 35\u201344 (2005)","journal-title":"Discuss. Math. Gr. Theory"},{"key":"537_CR10","unstructured":"Shalu, M.\u00a0A., Kirubakaran, V.\u00a0K.: Total domination number and its lower bound in some subclasses of bipartite graphs. Manusript-UnderReview (2023)"},{"key":"537_CR11","doi-asserted-by":"crossref","unstructured":"Shalu, M.\u00a0A., Vijayakumar, S., Sandhya, T.\u00a0P., Gaur, D., Narayanaswamy, N.: (eds) A lower bound of the cd-chromatic number and its complexity. (eds Gaur, D. & Narayanaswamy, N.) Algorithms and Discrete Applied Mathematics, 344\u2013355 (Springer, Berlin, 2017)","DOI":"10.1007\/978-3-319-53007-9_30"},{"key":"537_CR12","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Pearson, London (2018)"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-026-00537-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-026-00537-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-026-00537-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T03:46:45Z","timestamp":1784000805000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-026-00537-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["537"],"URL":"https:\/\/doi.org\/10.1007\/s00236-026-00537-y","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-4537462\/v1","asserted-by":"object"}]},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"6 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"19"}}