{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:57:02Z","timestamp":1725566222081},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230717"},{"type":"electronic","value":"9783540286394"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28639-4_2","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T20:25:35Z","timestamp":1285014335000},"page":"13-24","source":"Crossref","is-referenced-by-count":3,"title":["Online Problems, Pathwidth, and Persistence"],"prefix":"10.1007","author":[{"given":"Rodney G.","family":"Downey","sequence":"first","affiliation":[]},{"given":"Catherine","family":"McCartin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1006\/jagm.1996.0854","volume":"24","author":"H.L. Bodlaender","year":"1997","unstructured":"Bodlaender, H.L., Engelfreit, J.: Domino Treewidth. J. Alg.\u00a024, 94\u2013127 (1997)","journal-title":"J. Alg."},{"key":"2_CR2","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1051\/ita\/1988220404871","volume":"22","author":"M. Chrobak","year":"1988","unstructured":"Chrobak, M., Slusarek, M.: On some packing problems related to dynamic storage allocation. RAIRO Inform. Theor. Appl.\u00a022, 487\u2013499 (1988)","journal-title":"RAIRO Inform. Theor. Appl."},{"key":"2_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"2_CR4","unstructured":"de Fluiter, B.: Algorithms for Graphs of Small Treewidth (1997) ISBN 90-393-1528-0"},{"key":"2_CR5","unstructured":"Fouhy, J.: Computational Experiments on Graph Width Metrics. M.Sc. thesis, Victoria University, Wellington (2003)"},{"issue":"2","key":"2_CR6","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/jgt.3190120212","volume":"12","author":"A. Gyarfas","year":"1988","unstructured":"Gyarfas, A., Lehel, J.: On-line and First Fit Coloring of Graphs. J. Graph Theory\u00a012(2), 217\u2013227 (1988)","journal-title":"J. Graph Theory"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Irani, S.: Coloring inductive graphs on-line. In: Proceedings of the 31st Annual Symposium on Foundations of Computer Science, vol.\u00a02, pp. 470\u2013479 (1990)","DOI":"10.1109\/FSCS.1990.89568"},{"key":"2_CR8","first-page":"1233","volume-title":"Recursive and On-Line Graph Coloring In Handbook of Recursive Mathematics","author":"H.A. Kierstead","year":"1998","unstructured":"Kierstead, H.A.: Recursive and On-Line Graph Coloring In Handbook of Recursive Mathematics, vol.\u00a02, pp. 1233\u20131269. Elsevier, Amsterdam (1998)"},{"issue":"4","key":"2_CR9","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1137\/0401048","volume":"1","author":"H.A. Kierstead","year":"1988","unstructured":"Kierstead, H.A.: The Linearity of First Fit Coloring of Interval Graphs. SIAM J. on Discrete Math.\u00a01(4), 526\u2013530 (1988)","journal-title":"SIAM J. on Discrete Math."},{"key":"#cr-split#-2_CR10.1","doi-asserted-by":"crossref","unstructured":"Kierstead, H.A., Qin, J.: Coloring interval graphs with First-Fit. In: Aigner, M., Wille, R. (eds.) Discrete Math., vol.??144, pp. 47???57 (1995);","DOI":"10.1016\/0012-365X(94)00285-Q"},{"key":"#cr-split#-2_CR10.2","unstructured":"Special issue: Combinatorics of Ordered Sets, papers from the 4th Oberwolfach Conf., 1991 (1991)"},{"key":"2_CR11","first-page":"143","volume":"33","author":"H.A. Kierstead","year":"1981","unstructured":"Kierstead, H.A., Trotter, W.A.: An Extremal Problem in Recursive Combinatorics. Congressus Numeratium\u00a033, 143\u2013153 (1981)","journal-title":"Congressus Numeratium"},{"issue":"6","key":"2_CR12","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0020-0190(92)90234-M","volume":"42","author":"N.G. Kinnersley","year":"1992","unstructured":"Kinnersley, N.G.: The Vertex Separation Number of a Graph equals its Path-Width. Information processing Letters\u00a042(6), 345\u2013350 (1992)","journal-title":"Information processing Letters"},{"issue":"3","key":"2_CR13","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1137\/S0097539793255709","volume":"25","author":"L.M. Kirousis","year":"1996","unstructured":"Kirousis, L.M., Thilikos, D.M.: The Linkage of a Graph. SIAM Journal on Computing\u00a025(3), 626\u2013647 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"2_CR14","unstructured":"Lovasz, L., Saks, M.E., Trotter, W.A.: An On-Line Graph Coloring Algorithm with Sublinear Performance Ratio. Bellcore Tech Memorandum, No.TM-ARH-013-014"},{"key":"2_CR15","unstructured":"McCartin, C.M.: Contributions to Parameterized Complexity Ph.D. Thesis, Victoria University, Wellington (2003)"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Seymour: Graph minors II. Algorithmic aspects of tree-width. Journal of Algorithms\u00a07, 309\u2013322 (1986)","journal-title":"Journal of Algorithms"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized Efficiency of List Update and Paging Rules. Comunication of the ACM\u00a028, 202\u2013208 (1985)","journal-title":"Comunication of the ACM"},{"key":"2_CR18","unstructured":"Szegedy, M.: private communication, reported in [8]"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28639-4_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:29:57Z","timestamp":1620012597000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28639-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230717","9783540286394"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28639-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}