{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:13:38Z","timestamp":1743153218099,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030950170"},{"type":"electronic","value":"9783030950187"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-95018-7_8","type":"book-chapter","created":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T00:05:04Z","timestamp":1642982704000},"page":"91-102","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Conflict-Free Spanning Tree: Algorithms and\u00a0Complexity"],"prefix":"10.1007","author":[{"given":"Bruno Jos\u00e9 S.","family":"Barros","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luiz Satoru","family":"Ochi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rian Gabriel S.","family":"Pinheiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"U\u00e9verton S.","family":"Souza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,24]]},"reference":[{"issue":"4","key":"8_CR1","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/s10732-018-9372-2","volume":"24","author":"R Capua","year":"2018","unstructured":"Capua, R., Frota, Y., Ochi, L.S., Vidal, T.: A study on exponential-size neighborhoods for the bin packing problem with conflicts. J. Heuristics 24(4), 667\u2013695 (2018). https:\/\/doi.org\/10.1007\/s10732-018-9372-2","journal-title":"J. Heuristics"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-642-04428-1_36","volume-title":"Algorithmic Decision Theory","author":"A Darmann","year":"2009","unstructured":"Darmann, A., Pferschy, U., Schauer, J.: Determining a minimum spanning tree with disjunctive constraints. In: Rossi, F., Tsoukias, A. (eds.) ADT 2009. LNCS (LNAI), vol. 5783, pp. 414\u2013423. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04428-1_36"},{"issue":"16","key":"8_CR3","doi-asserted-by":"publisher","first-page":"1726","DOI":"10.1016\/j.dam.2010.12.016","volume":"159","author":"A Darmann","year":"2011","unstructured":"Darmann, A., Pferschy, U., Schauer, J., Woeginger, G.J.: Paths, trees and matchings under disjunctive constraints. Discret. Appl. Math. 159(16), 1726\u20131735 (2011)","journal-title":"Discret. Appl. Math."},{"issue":"7","key":"8_CR4","first-page":"167","volume":"109","author":"S Dhanalakshmi","year":"2016","unstructured":"Dhanalakshmi, S., Sadagopan, N., Manogna, V.: On 2K2-free graphs. Int. J. Pure Appl. Math. 109(7), 167\u2013173 (2016)","journal-title":"Int. J. Pure Appl. Math."},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10878-021-00740-2","volume":"42","author":"L Viana","year":"2021","unstructured":"Viana, L., Camp\u00ealo, M., Sau, I., Silva, A.: A unifying model for locally constrained spanning tree problems. J. Comb. Optim. 42(1), 125\u2013150 (2021). https:\/\/doi.org\/10.1007\/s10878-021-00740-2","journal-title":"J. Comb. Optim."},{"key":"8_CR6","unstructured":"Filho, I.T.F.A.: Characterizing Boolean satisfiability variants. Ph.D. thesis, Massachusetts Institute of Technology (2019)"},{"issue":"3","key":"8_CR7","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0305-0548(02)00195-8","volume":"31","author":"M Gendreau","year":"2004","unstructured":"Gendreau, M., Laporte, G., Semet, F.: Heuristics and lower bounds for the bin packing problem with conflicts. Comput. Oper. Res. 31(3), 347\u2013358 (2004)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/MAHC.1985.10011","volume":"7","author":"R Graham","year":"1985","unstructured":"Graham, R., Hell, P.: On the history of the minimum spanning tree problem. Ann. Hist. Comput. 7(1), 43\u201357 (1985)","journal-title":"Ann. Hist. Comput."},{"issue":"1","key":"8_CR9","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc. 7(1), 48\u201350 (1956)","journal-title":"Proc. Am. Math. Soc."},{"issue":"01","key":"8_CR10","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1142\/S0219720008003308","volume":"6","author":"J Ma\u0148uch","year":"2008","unstructured":"Ma\u0148uch, J., Gaur, D.R.: Fitting protein chains to cubic lattice is NP-complete. J. Bioinform. Comput. Biol. 6(01), 93\u2013106 (2008)","journal-title":"J. Bioinform. Comput. Biol."},{"issue":"2","key":"8_CR11","doi-asserted-by":"publisher","first-page":"233","DOI":"10.7155\/jgaa.00186","volume":"13","author":"U Pferschy","year":"2009","unstructured":"Pferschy, U., Schauer, J.: The knapsack problem with conflict graphs. J. Graph Algorithms Appl. 13(2), 233\u2013249 (2009)","journal-title":"J. Graph Algorithms Appl."},{"key":"8_CR12","doi-asserted-by":"publisher","unstructured":"Pilz, A.: Planar 3-SAT with a clause\/variable cycle. Discrete Math. Theor. Comput. Sci. 21(3), 18:1\u201318:20 (2019). https:\/\/doi.org\/10.23638\/DMTCS-21-3-18","DOI":"10.23638\/DMTCS-21-3-18"},{"issue":"6","key":"8_CR13","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36(6), 1389\u20131401 (1957)","journal-title":"Bell Syst. Tech. J."},{"key":"8_CR14","unstructured":"Tippenhauer, S.: On planar 3-SAT and its variants. Master\u2019s thesis, Fachbereich Mathematik und Informatik der Freien Universitat Berlin (2016)"},{"issue":"2","key":"8_CR15","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s00224-020-10005-w","volume":"65","author":"D Tsur","year":"2021","unstructured":"Tsur, D.: Faster parameterized algorithm for cluster vertex deletion. Theory Comput. Syst. 65(2), 323\u2013343 (2021)","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"8_CR16","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.disopt.2010.08.001","volume":"8","author":"R Zhang","year":"2011","unstructured":"Zhang, R., Kabadi, S.N., Punnen, A.P.: The minimum spanning tree problem with conflict constraints and its variations. Discrete Optim. 8(2), 191\u2013205 (2011)","journal-title":"Discrete Optim."}],"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-95018-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T00:05:48Z","timestamp":1642982748000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95018-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030950170","9783030950187"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95018-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"24 January 2022","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":"Puducherry","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 February 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 February 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.acsdm.org\/caldam\/2022\/","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":"Springer OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"80","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":"25","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":"0","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":"31% - 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":"6","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)"}},{"value":"Conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}