{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:05:18Z","timestamp":1742911518888,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030678982"},{"type":"electronic","value":"9783030678999"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-3-030-67899-9_36","type":"book-chapter","created":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T00:05:55Z","timestamp":1611792355000},"page":"452-470","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Template-Driven Rainbow Coloring of Proper Interval Graphs"],"prefix":"10.1007","author":[{"given":"L. Sunil","family":"Chandran","sequence":"first","affiliation":[]},{"given":"Sajal K.","family":"Das","sequence":"additional","affiliation":[]},{"given":"Pavol","family":"Hell","sequence":"additional","affiliation":[]},{"given":"Sajith","family":"Padinhatteeri","sequence":"additional","affiliation":[]},{"given":"Raji R.","family":"Pillai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,28]]},"reference":[{"key":"36_CR1","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.ejc.2019.02.008","volume":"79","author":"J Balogh","year":"2017","unstructured":"Balogh, J., Molla, T.: Long rainbow cycles and hamiltonian cycles using many colors in properly edge-colored complete graphs. Eur. J. Combin. 79, 140\u2013151 (2017)","journal-title":"Eur. J. Combin."},{"key":"36_CR2","doi-asserted-by":"publisher","first-page":"1314","DOI":"10.1006\/jpdc.2002.1860","volume":"62","author":"AA Bertossi","year":"2002","unstructured":"Bertossi, A.A., Pinotti, M.C.: Mappings for conflict-free access of paths in bidimensional arrays, circular lists, and complete trees. J. Parallel Distrib. Comput. 62, 1314\u20131333 (2002)","journal-title":"J. Parallel Distrib. Comput."},{"key":"36_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/978-3-319-77404-6_46","volume-title":"LATIN 2018: Theoretical Informatics","author":"LS Chandran","year":"2018","unstructured":"Chandran, L.S., Das, A., Issac, D., van Leeuwen, E.J.: Algorithms and bounds for very strong rainbow coloring. In: Bender, M.A., Farach-Colton, M., Mosteiro, M.A. (eds.) LATIN 2018. LNCS, vol. 10807, pp. 625\u2013639. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77404-6_46"},{"key":"36_CR4","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.amc.2017.09.005","volume":"317","author":"H Chen","year":"2018","unstructured":"Chen, H.: Long rainbow paths and rainbow cycles in edge colored graphs - a survey. Appl. Math. Comput. 317, 187\u2013192 (2018)","journal-title":"Appl. Math. Comput."},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0020-0190(95)00046-F","volume":"55","author":"DG Corneil","year":"1995","unstructured":"Corneil, D.G., Kim, H., Natarajan, S., Olariu, S., Sprague, A.P.: A simple linear time recognition of unit interval graphs. Inf. Process. Lett. 55, 99\u2013104 (1995)","journal-title":"Inf. Process. Lett."},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"1431","DOI":"10.1016\/j.jpdc.2006.06.004","volume":"66","author":"SK Das","year":"2006","unstructured":"Das, S.K., Finocchii, I., Petreschi, R.: Conflict-free star-access in parallel memory systems. J. Parallel Distrib. Comput. 66, 1431\u20131441 (2006)","journal-title":"J. Parallel Distrib. Comput."},{"key":"36_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0045066","volume-title":"Computing and Combinatorics","author":"SK Das","year":"1997","unstructured":"Das, S.K., Pinotti, M.C.: Conflict-free access to templates of trees and hypercubes in parallel memory systems. In: Jiang, T., Lee, D.T. (eds.) COCOON 1997. LNCS, vol. 1276, pp. 1\u201310. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0045066"},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"998","DOI":"10.1006\/jpdc.2000.1638","volume":"60","author":"SK Das","year":"2000","unstructured":"Das, S.K., Pinotti, M.C.: Optimal mappings of $$q$$-ary and binomial trees into parallel memory modules for fast and conflict-free access to path and subtree templates. J. Parallel Distrib. Comput. 60, 998\u20131027 (2000)","journal-title":"J. Parallel Distrib. Comput."},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1137\/S0097539792269095","volume":"25","author":"XT Deng","year":"1996","unstructured":"Deng, X.T., Hell, P., Huang, J.: Linear-time representation algorithms for proper circular arc graphs and proper interval graphs. SIAM. J. Comput. 25, 390\u2013403 (1996)","journal-title":"SIAM. J. Comput."},{"key":"36_CR10","series-title":"Annals of Discrete Mathematics","first-page":"57","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics, p. 57. Elsevier, Amsterdam (2004)"},{"doi-asserted-by":"crossref","unstructured":"Gy\u00e1rf\u00e1s, A., S\u00e1rk\u00e4zy, G.N.: Induced colorful trees and paths in large chromatic graphs. Electron. J. Combin. 23, P4.46 (2016)","key":"36_CR11","DOI":"10.37236\/6239"},{"key":"36_CR12","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1017\/S0963548311000605","volume":"21","author":"AV Kostochka","year":"2012","unstructured":"Kostochka, A.V., Yancey, M.: Large rainbow matchings in edge-colored graphs. Combin. Probab. Comput. 21, 255\u2013263 (2012)","journal-title":"Combin. Probab. Comput."},{"key":"36_CR13","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/j.disc.2006.11.059","volume":"308","author":"F Kramer","year":"2008","unstructured":"Kramer, F., Kramer, H.: A survey on the distance-coloring of graphs. Discrete Math. 308, 422\u2013426 (2008)","journal-title":"Discrete Math."},{"key":"36_CR14","doi-asserted-by":"publisher","first-page":"N26","DOI":"10.37236\/475","volume":"17","author":"TD LeSaulnier","year":"2010","unstructured":"LeSaulnier, T.D., Stocker, C.J., Wenger, P.S., West, D.B.: Rainbow matching in edge-colored graphs. Electron. J. Combin. 17, N26 (2010)","journal-title":"Electron. J. Combin."},{"key":"36_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-012-1243-2","volume":"29","author":"X Li","year":"2013","unstructured":"Li, X., Shi, Y., Sun, Y.: Rainbow connections of graphs: a survey. Graph. Combin. 29, 1\u201338 (2013)","journal-title":"Graph. Combin."},{"key":"36_CR16","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0898-1221(93)90308-I","volume":"25","author":"PJ Looges","year":"1993","unstructured":"Looges, P.J., Olariu, S.: Optimal greedy algorithms for indifference graphs. Comput. Math. Appl. 25, 15\u201325 (1993)","journal-title":"Comput. Math. Appl."},{"key":"36_CR17","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0020-0190(03)00298-9","volume":"87","author":"BS Panda","year":"2003","unstructured":"Panda, B.S., Das, S.K.: A linear time recognition algorithm for proper interval graphs. Inf. Process. Lett. 87, 153\u2013161 (2003)","journal-title":"Inf. Process. Lett."},{"doi-asserted-by":"crossref","unstructured":"Scott, A., Seymour, P.: Induced subgraphs of graphs with large chromatic number IX: rainbow paths. Electron. J. Combin. 24, 2.53 (2017)","key":"36_CR18","DOI":"10.37236\/6768"},{"key":"36_CR19","first-page":"2","volume":"2","author":"D de Werra","year":"1985","unstructured":"de Werra, D.: Some uses of hypergraph in timetabling. Asia-Pac. J. Oper. Res. 2, 2\u201312 (1985)","journal-title":"Asia-Pac. J. Oper. Res."}],"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-67899-9_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,29]],"date-time":"2023-10-29T15:55:52Z","timestamp":1698594952000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-67899-9_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030678982","9783030678999"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67899-9_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"28 January 2021","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":"Rupnagar","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 February 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitrpr.ac.in\/caldam2021\/index.html","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 and OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"82","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":"39","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":"48% - 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":"2,8","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":"2,21","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)"}}]}}