{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:56Z","timestamp":1740122456253,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,3,22]],"date-time":"2024-03-22T00:00:00Z","timestamp":1711065600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,22]],"date-time":"2024-03-22T00:00:00Z","timestamp":1711065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001409","name":"Department of Science and Technology, Government of India","doi-asserted-by":"crossref","award":["DST-SERB MATRICS: MTR\/2022\/000870"],"award-info":[{"award-number":["DST-SERB MATRICS: MTR\/2022\/000870"]}],"id":[{"id":"10.13039\/501100001409","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s10878-024-01112-2","type":"journal-article","created":{"date-parts":[[2024,3,22]],"date-time":"2024-03-22T17:02:31Z","timestamp":1711126951000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Star covers and star partitions of double-split graphs"],"prefix":"10.1007","volume":"47","author":[{"given":"Joyashree","family":"Mondal","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2769-3658","authenticated-orcid":false,"given":"S.","family":"Vijayakumar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,22]]},"reference":[{"key":"1112_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/100818121","volume":"26","author":"B Alexeev","year":"2012","unstructured":"Alexeev B, Fradkin A, Kim I (2012) Forbidden induced subgraphs of double-split graphs. SIAM J Discrete Math 26:1\u201314","journal-title":"SIAM J Discrete Math"},{"key":"1112_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.disopt.2019.01.002","volume":"33","author":"G Andreatta","year":"2019","unstructured":"Andreatta G, De Francesco C, De Giovanni L, Serafini P (2019) Star partitions on graphs. Discrete Optim 33:1\u201318","journal-title":"Discrete Optim"},{"key":"1112_CR3","unstructured":"Bang-Jensen J, Huang J, MacGillivray G, Yeo A (1999) Domination in convex bipartite and convex-round graphs. Technical Report, University of Southern Denmark"},{"key":"1112_CR4","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1137\/070683933","volume":"39","author":"A Bj\u00f6rklund","year":"2009","unstructured":"Bj\u00f6rklund A, Husfeldt T, Koivisto M (2009) Set partitioning via inclusion\u2013exclusion. SIAM J Comput 39:543\u2013563","journal-title":"SIAM J Comput"},{"key":"1112_CR5","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt A, Kratsch D (1985) On the restriction of some NP-complete graph problems to permutation graphs. In: Budach L (ed) Proceedings of the FCT\u201985 conference, lecture notes in computer science, vol 199, pp 53-62","DOI":"10.1007\/BFb0028791"},{"issue":"1","key":"1112_CR6","doi-asserted-by":"publisher","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M Chudnovsky","year":"2006","unstructured":"Chudnovsky M, Robertson N, Seymour P, Thomas R (2006) The strong perfect graph theorem. Ann Math 164(1):51\u2013229","journal-title":"Ann Math"},{"key":"1112_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0020-0190(75)90011-3","volume":"4","author":"EJ Cockayne","year":"1975","unstructured":"Cockayne EJ, Goodman S, Hedetniemi ST (1975) A linear algorithm for the domination number of a tree. Inform Process Lett 4:41\u201344","journal-title":"Inform Process Lett"},{"key":"1112_CR8","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms. MIT Press, Cambridge"},{"key":"1112_CR9","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0020-0190(90)90147-P","volume":"36","author":"P Damaschke","year":"1990","unstructured":"Damaschke P, M\u00fcller H, Kratch D (1990) Domination in convex and chordal bipartite graphs. Inf Process Lett 36:231\u2013236","journal-title":"Inf Process Lett"},{"issue":"4","key":"1112_CR10","doi-asserted-by":"publisher","first-page":"1166","DOI":"10.1137\/S0097539792229507","volume":"26","author":"D Dor","year":"1997","unstructured":"Dor D, Tarsi M (1997) Graph decomposition is NP-complete: a complete proof of Holyer\u2019s conjecture. SIAM J Comput 26(4):1166\u20131187","journal-title":"SIAM J Comput"},{"key":"1112_CR11","series-title":"Undegraduate texts in computer science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of parameterized complexity","author":"RG Downey","year":"2013","unstructured":"Downey RG, Fellows MR (2013) Fundamentals of parameterized complexity. Undegraduate texts in computer science. Springer, Berlin"},{"issue":"3","key":"1112_CR12","first-page":"203","volume":"16","author":"O Duginov","year":"2014","unstructured":"Duginov O (2014) Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs. Discrete Math Theor Comput Sci 16(3):203\u2013214","journal-title":"Discrete Math Theor Comput Sci"},{"key":"1112_CR13","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(85)90001-X","volume":"6","author":"M Farber","year":"1985","unstructured":"Farber M, Keil JM (1985) Domination in permutation graphs. J Algorithms 6:309\u2013321","journal-title":"J Algorithms"},{"key":"1112_CR14","volume-title":"Computers and intractability; a guide to the theory of NP-completeness","author":"MR Garey","year":"1990","unstructured":"Garey MR, Johnson DS (1990) Computers and intractability; a guide to the theory of NP-completeness. W. H. Freeman & Co., New York"},{"key":"1112_CR15","volume-title":"Algorithmic graph theory and perfect graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic MC (2004) Algorithmic graph theory and perfect graphs, vol 57, 2nd edn. Elsevier, Amsterdam","edition":"2"},{"key":"1112_CR16","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0012-365X(96)00121-5","volume":"173","author":"AK Kelmans","year":"1997","unstructured":"Kelmans AK (1997) Optimal packing of stars in a graph. Discrete Math 173:97\u2013127","journal-title":"Discrete Math"},{"key":"1112_CR17","doi-asserted-by":"crossref","unstructured":"Kirkpatrick DG, Hell P (1978) On the completeness of a generalized matching problem. In: Lipton R, Burkhard W, Savitch W, Friedman E, Aho A (eds) (STOC\u201978) 10th ACM symposium on theory of computing, pp 240\u2013245","DOI":"10.1145\/800133.804353"},{"key":"1112_CR18","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.tcs.2013.11.020","volume":"516","author":"F Maffray","year":"2014","unstructured":"Maffray F (2014) Fast recognition of doubled graphs. Theor Comput Sci 516:96\u2013100","journal-title":"Theor Comput Sci"},{"key":"1112_CR19","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/S0012-365X(97)89267-9","volume":"162","author":"F Maffray","year":"1996","unstructured":"Maffray F, Preissmann M (1996) On the NP-completeness of the k-colorability problem for triangle-free graphs. Discrete Math 162:313\u2013317","journal-title":"Discrete Math"},{"key":"1112_CR20","doi-asserted-by":"crossref","unstructured":"Mondal J, Vijayakumar S (2023) Star covers and star partitions of certain cographs and split graphs, Manuscript","DOI":"10.1007\/s10878-024-01112-2"},{"key":"1112_CR21","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1016\/j.orl.2006.12.004","volume":"35","author":"J Monnot","year":"2007","unstructured":"Monnot J, Toulouse S (2007) The path partition problem and related problems in bipartite graphs. Oper Res Lett 35:677\u2013684","journal-title":"Oper Res Lett"},{"key":"1112_CR22","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0304-3975(87)90067-3","volume":"53","author":"H M\u00fcller","year":"1987","unstructured":"M\u00fcller H, Brandst\u00e4dt A (1987) The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs. Theor Comput Sci 53:257\u2013265","journal-title":"Theor Comput Sci"},{"key":"1112_CR23","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s00453-007-9148-9","volume":"52","author":"V Raman","year":"2008","unstructured":"Raman V, Saurabh S (2008) Short cycles make W-hard problems hard: FPT algorithms for W-hard problems in graphs with no short cycles. Algorithmica 52:203\u2013225","journal-title":"Algorithmica"},{"key":"1112_CR24","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.dam.2021.04.015","volume":"319","author":"MA Shalu","year":"2022","unstructured":"Shalu MA, Vijayakumar S, Sandhya TP, Mondal J (2022) Star partition of graphs. Discrete Appl Math 319:81\u201391","journal-title":"Discrete Appl Math"},{"key":"1112_CR25","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1002\/jgt.22062","volume":"85","author":"R van Bevern","year":"2017","unstructured":"van Bevern R, Bredereck R, Bulteau L, Chen J, Froese V, Niedermeier R, Woeginger GJ (2017) Partitioning perfect graphs into stars. J Graph Theory 85:297\u2013335","journal-title":"J Graph Theory"},{"key":"1112_CR26","volume-title":"Approximation algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani VV (2001) Approximation algorithms. Springer, Berlin"},{"key":"1112_CR27","volume-title":"Introduction to graph theory","author":"DB West","year":"2000","unstructured":"West DB (2000) Introduction to graph theory, 2nd edn. Prentice-Hall, USA","edition":"2"},{"key":"1112_CR28","doi-asserted-by":"publisher","first-page":"103","DOI":"10.4086\/toc.2007.v003a006","volume":"3","author":"D Zuckerman","year":"2007","unstructured":"Zuckerman D (2007) Linear degree extractors and the inapproximability of Max Clique and Chromatic Number. Theory Comput 3:103\u2013128","journal-title":"Theory Comput"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01112-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01112-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01112-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T19:04:52Z","timestamp":1713985492000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01112-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,22]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["1112"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01112-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2024,3,22]]},"assertion":[{"value":"7 February 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"17"}}