{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:22:55Z","timestamp":1759638175673,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319751719"},{"type":"electronic","value":"9783319751726"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-75172-6_13","type":"book-chapter","created":{"date-parts":[[2018,1,30]],"date-time":"2018-01-30T11:23:02Z","timestamp":1517311382000},"page":"144-155","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Note on Online Colouring Problems in Overlap Graphs and Their Complements"],"prefix":"10.1007","author":[{"given":"Marc","family":"Demange","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Olsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,31]]},"reference":[{"issue":"1\u20133","key":"13_CR1","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0166-218X(99)00245-0","volume":"103","author":"M Avriel","year":"2000","unstructured":"Avriel, M., Penn, M., Shpirer, N.: Container ship stowage problem: complexity and connection to the coloring of circle graphs. Discret. Appl. Math. 103(1\u20133), 271\u2013279 (2000)","journal-title":"Discret. Appl. Math."},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.endm.2007.07.072","volume":"29","author":"J \u010cern\u00fd","year":"2007","unstructured":"\u010cern\u00fd, J.: Coloring circle graphs. Electron. Notes Discret. Math. 29, 457\u2013461 (2007)","journal-title":"Electron. Notes Discret. Math."},{"issue":"2","key":"13_CR3","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/j.jda.2006.05.001","volume":"5","author":"S Cornelsen","year":"2007","unstructured":"Cornelsen, S., Di Stefano, G.: Track assignment. J. Discret. Algorithms 5(2), 250\u2013261 (2007)","journal-title":"J. Discret. Algorithms"},{"issue":"7\u20138","key":"13_CR4","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.1016\/j.dam.2012.01.002","volume":"160","author":"M Demange","year":"2012","unstructured":"Demange, M., Di Stefano, G., Leroy-Beaulieu, B.: On the online track assignment problem. Discret. Appl. Math. 160(7\u20138), 1072\u20131093 (2012)","journal-title":"Discret. Appl. Math."},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s10878-005-4103-7","volume":"10","author":"T Ekim","year":"2005","unstructured":"Ekim, T., de Werra, D.: On split-coloring problems. J. Combin. Optim. 10, 211\u2013225 (2005)","journal-title":"J. Combin. Optim."},{"issue":"3","key":"13_CR6","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1002\/net.3230030305","volume":"3","author":"F Gavril","year":"1973","unstructured":"Gavril, F.: Algorithms for a maximum clique and a maximum independent set of a circle graph. Networks 3(3), 261\u2013273 (1973)","journal-title":"Networks"},{"key":"13_CR7","volume-title":"Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, vol. 57)","author":"MC Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, vol. 57). North-Holland Publishing Co., Amsterdam (2004)"},{"issue":"4","key":"13_CR8","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1002\/net.3230120410","volume":"12","author":"UI Gupta","year":"1982","unstructured":"Gupta, U.I., Lee, D.T., Leung, J.Y.-T.: Efficient algorithms for interval graphs and circular-arc graphs. Networks 12(4), 459\u2013467 (1982)","journal-title":"Networks"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0890-5401(02)00028-7","volume":"180","author":"K Jansen","year":"2003","unstructured":"Jansen, K.: The mutual exclusion scheduling problem for permutation and comparability graphs. Inf. Comput. 180, 71\u201381 (2003)","journal-title":"Inf. Comput."},{"issue":"14","key":"13_CR10","doi-asserted-by":"publisher","first-page":"1983","DOI":"10.1016\/j.dam.2006.03.003","volume":"154","author":"JM Keil","year":"2006","unstructured":"Keil, J.M., Stewart, L.: Approximating the minimum clique cover and other hard problems in subtree filament graphs. Discret. Appl. Math. 154(14), 1983\u20131995 (2006)","journal-title":"Discret. Appl. Math."},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1007\/978-3-540-92182-0_78","volume-title":"Algorithms and Computation","author":"FG K\u00f6nig","year":"2008","unstructured":"K\u00f6nig, F.G., L\u00fcbbecke, M.E.: Sorting with complete networks of stacks. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 895\u2013906. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92182-0_78"},{"key":"13_CR12","first-page":"39","volume":"3","author":"L Lesniak","year":"1977","unstructured":"Lesniak, L., Straight, H.J.: The cochromatic number of a graph. Ars Combin. 3, 39\u201346 (1977)","journal-title":"Ars Combin."},{"issue":"6","key":"13_CR13","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0020-0190(00)00109-5","volume":"75","author":"SD Nikolopoulos","year":"2000","unstructured":"Nikolopoulos, S.D., Papadopoulos, C.: On the performance of the first-fit coloring algorithm on permutation graphs. Inf. Process. Lett. 75(6), 265\u2013273 (2000)","journal-title":"Inf. Process. Lett."},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-319-24264-4_25","volume-title":"Computational Logistics","author":"M Olsen","year":"2015","unstructured":"Olsen, M., Gross, A.: Probabilistic analysis of online stacking algorithms. In: Corman, F., Vo\u00df, S., Negenborn, R.R. (eds.) ICCL 2015. LNCS, vol. 9335, pp. 358\u2013369. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24264-4_25"},{"key":"13_CR15","unstructured":"Shahrokhi, F.: A new upper bound for the clique cover number with applications. arXiv preprint arXiv:1502.06168 (2015)"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BFb0035832","volume-title":"STACS 88","author":"W Unger","year":"1988","unstructured":"Unger, W.: On the k-colouring of circle-graphs. In: Cori, R., Wirsing, M. (eds.) STACS 1988. LNCS, vol. 294, pp. 61\u201372. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/BFb0035832"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-75172-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:40:06Z","timestamp":1710344406000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-75172-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319751719","9783319751726"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-75172-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"31 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dhaka","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bangladesh","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 March 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 March 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cse.buet.ac.bd\/walcom2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}