{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T10:34:48Z","timestamp":1725878088993},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319517407"},{"type":"electronic","value":"9783319517414"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-51741-4_12","type":"book-chapter","created":{"date-parts":[[2017,1,6]],"date-time":"2017-01-06T03:06:46Z","timestamp":1483672006000},"page":"142-154","source":"Crossref","is-referenced-by-count":0,"title":["A Refined Analysis of Online Path Coloring in Trees"],"prefix":"10.1007","author":[{"given":"Astha","family":"Chauhan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N. S.","family":"Narayanaswamy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,7]]},"reference":[{"issue":"1\u20132","key":"12_CR1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/S0304-3975(99)00025-0","volume":"221","author":"Y Bartal","year":"1999","unstructured":"Bartal, Y., Leonardi, S.: On-line routing in all-optical networks. Theor. Comput. Sci. 221(1\u20132), 19\u201339 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR2","first-page":"2001","volume":"255","author":"T Erlebach","year":"2000","unstructured":"Erlebach, T., Jansen, K., Elvezia, C.: The complexity of path coloring and call scheduling. Theoret. Comput. Sci. 255, 2001 (2000)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"12_CR3","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/0201013","volume":"1","author":"F Gavril","year":"1972","unstructured":"Gavril, F.: Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM J. Comput. 1(2), 180\u2013187 (1972)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"12_CR4","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","volume":"16","author":"F Gavril","year":"1974","unstructured":"Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Comb. Theor. Ser. B 16(1), 47\u201356 (1974)","journal-title":"J. Comb. Theor. Ser. B"},{"issue":"3","key":"12_CR5","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0012-365X(78)90003-1","volume":"23","author":"F Gavril","year":"1978","unstructured":"Gavril, F.: A recognition algorithm for the intersection graphs of paths in trees. Discrete Math. 23(3), 211\u2013227 (1978)","journal-title":"Discrete Math."},{"issue":"2","key":"12_CR6","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0012-365X(85)90043-3","volume":"55","author":"MC Golumbic","year":"1985","unstructured":"Golumbic, M.C., Jamison, R.E.: Edge and vertex intersection of paths in a tree. Discrete Math. 55(2), 151\u2013159 (1985)","journal-title":"Discrete Math."},{"issue":"1","key":"12_CR7","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/0095-8956(85)90088-7","volume":"38","author":"MC Golumbic","year":"1985","unstructured":"Golumbic, M.C., Jamison, R.E.: The edge intersection graphs of paths in a tree. J. Comb. Theo. Ser. B 38(1), 8\u201322 (1985)","journal-title":"J. Comb. Theo. Ser. B"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/3-540-61680-2_75","volume-title":"Algorithms \u2014 ESA \u201996","author":"C Kaklamanis","year":"1996","unstructured":"Kaklamanis, C., Persiano, P.: Efficient wavelength routing on directed fiber trees. In: Diaz, J., Serna, M. (eds.) ESA 1996. LNCS, vol. 1136, pp. 460\u2013470. Springer, Heidelberg (1996). doi: 10.1007\/3-540-61680-2_75"},{"issue":"143\u2013153","key":"12_CR9","first-page":"98","volume":"33","author":"HA Kierstead","year":"1981","unstructured":"Kierstead, H.A., Trotter, W.T.: An extremal problem in recursive combinatorics. Congressus Numerantium 33(143\u2013153), 98 (1981)","journal-title":"Congressus Numerantium"},{"key":"12_CR10","unstructured":"Kumar, V., Schwabe, E.J.: Improved access to optical bandwidth in trees. In Proceedings of SODA 1997, pp. 437\u2013444 (1997)"},{"key":"12_CR11","unstructured":"Mihail, M., Kaklamanis, C., Rao, S.: Efficient access to optical bandwidth. In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science, FOCS 1995, p. 548. IEEE Computer Society, Washington, DC (1995)"},{"issue":"1","key":"12_CR12","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s11083-008-9076-6","volume":"25","author":"NS Narayanaswamy","year":"2008","unstructured":"Narayanaswamy, N.S., Subhash, R.: Babu. A note on first-fit coloring of interval graphs. Order 25(1), 49\u201353 (2008)","journal-title":"Order"},{"key":"12_CR13","unstructured":"Pemmaraju, S.V., Raman, R., Varadarajan, K.R.: Buffer minimization using max-coloring. In: Ian Munro, J. (ed.) SODA, pp. 562\u2013571. SIAM (2004)"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Raghavan, P., Upfal, E.: Efficient routing in all-optical networks. In: Proceedings of the Twenty-sixth Annual ACM Symposium on Theory of Computing, STOC 1994, pp. 134\u2013143. ACM, New York (1994)","DOI":"10.1145\/195058.195119"},{"issue":"6","key":"12_CR15","doi-asserted-by":"crossref","first-page":"1906","DOI":"10.1093\/ietisy\/e89-d.6.1906","volume":"89\u2013D","author":"H Takai","year":"2006","unstructured":"Takai, H., Kanatani, T., Matsubayashi, A.: Path coloring on binary caterpillars. IEICE Trans. 89\u2013D(6), 1906\u20131913 (2006)","journal-title":"IEICE Trans."},{"issue":"2","key":"12_CR16","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0012-365X(85)90051-2","volume":"55","author":"RE Tarjan","year":"1985","unstructured":"Tarjan, R.E.: Decomposition by clique separators. Discrete Math. 55(2), 221\u2013232 (1985)","journal-title":"Discrete Math."},{"key":"12_CR17","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, NJ (2000)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-51741-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T03:27:49Z","timestamp":1498361269000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-51741-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319517407","9783319517414"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-51741-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}