{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:29:25Z","timestamp":1742948965664,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030115081"},{"type":"electronic","value":"9783030115098"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-11509-8_2","type":"book-chapter","created":{"date-parts":[[2019,1,18]],"date-time":"2019-01-18T14:54:48Z","timestamp":1547823288000},"page":"16-28","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Induced Star Partition of Graphs"],"prefix":"10.1007","author":[{"given":"M. A.","family":"Shalu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Vijayakumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. P.","family":"Sandhya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,19]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1002\/jgt.22062","volume":"85","author":"R van Bevern","year":"2017","unstructured":"van Bevern, R., et al.: Partitioning perfect graphs into stars. J. Graph Theory 85, 297\u2013335 (2017)","journal-title":"J. Graph Theory"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BFb0028791","volume-title":"Fundamentals of Computation Theory","author":"A Brandst\u00e4dt","year":"1985","unstructured":"Brandst\u00e4dt, A., Kratsch, D.: On the restriction of some NP-complete graph problems to permutation graphs. In: Budach, L. (ed.) FCT 1985. LNCS, vol. 199, pp. 53\u201362. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/BFb0028791"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0020-0190(75)90011-3","volume":"4","author":"EJ Cockayne","year":"1975","unstructured":"Cockayne, E.J., Goodman, S., Hedetniemi, S.T.: A linear algorithm for the domination number of a tree. Inf. Process. Lett. 4, 41\u201344 (1975)","journal-title":"Inf. Process. Lett."},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0166-218X(84)90088-X","volume":"9","author":"DG Corneil","year":"1984","unstructured":"Corneil, D.G., Perl, Y.: Clustering and domination in perfect graphs. Discret. Appl. Math. 9, 27\u201339 (1984)","journal-title":"Discret. Appl. Math."},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.disopt.2015.07.002","volume":"18","author":"A \u0106usti\u0107","year":"2015","unstructured":"\u0106usti\u0107, A., Klinz, B., Woeginger, G.J.: Geometric versions of the three-dimensional assignment problem under general norms. Discret. Optim. 18, 38\u201355 (2015)","journal-title":"Discret. Optim."},{"issue":"4","key":"2_CR6","doi-asserted-by":"publisher","first-page":"1166","DOI":"10.1137\/S0097539792229507","volume":"26","author":"D Dor","year":"1997","unstructured":"Dor, D., Tarsi, M.: Graph decomposition is NP-complete: a complete proof of Holyer\u2019s conjecture. SIAM J. Comput. 26(4), 1166\u20131187 (1997)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"2_CR7","first-page":"203","volume":"16","author":"O Duginov","year":"2014","unstructured":"Duginov, O.: Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs. Discret. Math. Theor. Comput. Sci. 16(3), 203\u2013214 (2014)","journal-title":"Discret. Math. Theor. Comput. Sci."},{"key":"2_CR8","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, J.M.: Domination in permutation graphs. J. Algorithms 6, 309\u2013321 (1985)","journal-title":"J. Algorithms"},{"key":"2_CR9","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)"},{"key":"2_CR10","unstructured":"Kann, V.: On the approximability of NP-complete optimization problems. Ph.D. thesis, Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockholm (1992)"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0012-365X(96)00121-5","volume":"173","author":"AK Kelmans","year":"1997","unstructured":"Kelmans, A.K.: Optimal packing of induced stars in a graph. Discret. Math. 173, 97\u2013127 (1997)","journal-title":"Discret. Math."},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Kirkpatrick, D.G., Hell, P.: On the completeness of a generalized matching problem. In: Lipton, R., Burkhard, W., Savitch, W., Friedman, E., Aho, A. (eds.) (STOC 1978) 10th ACM Symposium on Theory of Computing, pp. 240\u2013245 (1978)","DOI":"10.1145\/800133.804353"},{"key":"2_CR13","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.: On the NP-completeness of the k-colorability problem for triangle-free graphs. Discret. Math. 162, 313\u2013317 (1996)","journal-title":"Discret. Math."},{"key":"2_CR14","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.: The path partition problem and related problems in bipartite graphs. Oper. Res. Lett. 35, 677\u2013684 (2007)","journal-title":"Oper. Res. Lett."},{"key":"2_CR15","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.: The NP-completeness of Steiner Tree and Dominating Set for chordal bipartite graphs. Theoret. Comput. Sci. 53, 257\u2013265 (1987)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR16","unstructured":"Pantel, S.: Graph packing problems. M.Sc. Thesis, Simon Fraser University (1998)"},{"key":"2_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04565-7","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/978-3-662-04565-7"},{"key":"2_CR18","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2000","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice-Hall, Upper Saddle River (2000)","edition":"2"},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0012-365X(02)00791-4","volume":"263","author":"J Yuan","year":"2003","unstructured":"Yuan, J., Wang, Q.: Note: partitioning the vertices of a graph into induced matchings. Discret. Math. 263, 323\u2013329 (2003)","journal-title":"Discret. Math."},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"103","DOI":"10.4086\/toc.2007.v003a006","volume":"3","author":"D Zuckerman","year":"2007","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of Max Clique and Chromatic Number. Theory Comput. 3, 103\u2013128 (2007)","journal-title":"Theory Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-11509-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:20:50Z","timestamp":1710264050000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-11509-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030115081","9783030115098"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-11509-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"19 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kharagpur","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 February 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 February 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cse.iitkgp.ac.in\/conf\/CALDAM\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"86","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}