{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:33:58Z","timestamp":1759638838196,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642112652"},{"type":"electronic","value":"9783642112669"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11266-9_64","type":"book-chapter","created":{"date-parts":[[2009,12,7]],"date-time":"2009-12-07T14:04:58Z","timestamp":1260194698000},"page":"767-778","source":"Crossref","is-referenced-by-count":1,"title":["Vertex Ranking with Capacity"],"prefix":"10.1007","author":[{"given":"Ruben","family":"van der Zwaan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"64_CR1","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/BF01934264","volume":"34","author":"B. Aspvall","year":"1994","unstructured":"Aspvall, B., Heggernes, P.: Finding Minimum Height Elimination Trees for Interval Graphs in Polynomial Time. BIT\u00a034, 484\u2013509 (1994)","journal-title":"BIT"},{"key":"64_CR2","first-page":"1","volume":"11","author":"H.L. Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: A Tourist Quide through Treewidth. Acta Cybernetica\u00a011, 1\u201323 (1993)","journal-title":"Acta Cybernetica"},{"key":"64_CR3","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"SOFSEM 2005: Theory and Practice of Computer Science","author":"H.L. Bodlaender","year":"2005","unstructured":"Bodlaender, H.L.: Discovering Treewidth. In: Vojt\u00e1\u0161, P., Bielikov\u00e1, M., Charron-Bost, B., S\u00fdkora, O. (eds.) SOFSEM 2005. LNCS, vol.\u00a03381, pp. 1\u201316. Springer, Heidelberg (2005)"},{"key":"64_CR4","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1137\/S0895480195282550","volume":"11","author":"H.L. Bodlaender","year":"1998","unstructured":"Bodlaender, H.L., Deogun, J.S., Jansen, K., Kloks, T., Kratsch, D., M\u00fcller, H., Tuza, Z.: Rankings of Graphs. SIAM Journal on Discrete Mathematics\u00a011, 168\u2013181 (1998)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"64_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/978-3-540-70575-8_46","volume-title":"Automata, Languages and Programming","author":"H.L. Bodlaender","year":"2008","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels (Extended abstract). In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 563\u2013574. Springer, Heidelberg (2008)"},{"key":"64_CR6","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1006\/jagm.1995.1009","volume":"18","author":"H.L. Bodlaender","year":"1995","unstructured":"Bodlaender, H.L., Gilbert, J.R., Hafsteinsson, H., Kloks, T.: Approximating Treewidth, Pathwidth, Frontsize, and Minimum Elimination Tree Height. Journal of Algorithms\u00a018, 238\u2013255 (1995)","journal-title":"Journal of Algorithms"},{"key":"64_CR7","first-page":"194","volume-title":"Handbook of Theoretical Computer Science","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: Graph Rewriting: An Algebraic and Logic Approach. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, pp. 194\u2013242. Elsevier, Amsterdam (1990)"},{"key":"64_CR8","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0166-218X(99)00179-1","volume":"98","author":"J.S. Deogun","year":"1993","unstructured":"Deogun, J.S., Kloks, T., Kratsch, D., M\u00fcller, H.: On Vertex Ranking for Permutations and Other Graphs. Discrete Applied Mathematics\u00a098, 39\u201363 (1993)","journal-title":"Discrete Applied Mathematics"},{"key":"64_CR9","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0166-218X(99)00179-1","volume":"98","author":"J.S. Deogun","year":"1999","unstructured":"Deogun, J.S., Kloks, T., Kratsch, D., M\u00fcller, H.: On the Vertex Ranking Problem for Trapezoid, Circular-Arc and Other Graphs. Discrete Applied Mathematics\u00a098, 39\u201363 (1999)","journal-title":"Discrete Applied Mathematics"},{"issue":"13","key":"64_CR10","doi-asserted-by":"publisher","first-page":"2493","DOI":"10.1016\/j.dam.2008.03.007","volume":"156","author":"D. Dereniowski","year":"2008","unstructured":"Dereniowski, D.: Edge Ranking and Searching in Partial Orders. Discrete Applied Mathematics\u00a0156(13), 2493\u20132500 (2008)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"64_CR11","doi-asserted-by":"crossref","first-page":"273","DOI":"10.3233\/FUN-2006-69302","volume":"69","author":"D. Dereniowski","year":"2006","unstructured":"Dereniowski, D., Kubale, M.: Efficient Parallel Query Processing by Graph Ranking. Fundamenta Informaticae\u00a069(3), 273\u2013285 (2006)","journal-title":"Fundamenta Informaticae"},{"key":"64_CR12","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.ipl.2005.12.006","volume":"98","author":"D. Dereniowski","year":"2006","unstructured":"Dereniowski, D., Nadolski, A.: Vertex Rankings of Chordal Graphs and Weighted Trees. Information Processing Letters\u00a098, 96\u2013100 (2006)","journal-title":"Information Processing Letters"},{"key":"64_CR13","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1090\/conm\/065\/891251","volume":"65","author":"H. Friedman","year":"1987","unstructured":"Friedman, H., Robertson, N., Seymour, P.D.: The Metamathematics of the Graph Minor Theorem. Contemporary Mathematics\u00a065, 229\u2013261 (1987)","journal-title":"Contemporary Mathematics"},{"issue":"5","key":"64_CR14","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0020-0190(01)00262-9","volume":"82","author":"S. Hsieh","year":"2002","unstructured":"Hsieh, S.: On Vertex Ranking of a Starlike Graph. Information Processing Letters\u00a082(5), 131\u2013135 (2002)","journal-title":"Information Processing Letters"},{"issue":"11","key":"64_CR15","doi-asserted-by":"publisher","first-page":"1288","DOI":"10.1016\/j.ic.2008.08.001","volume":"206","author":"R.-W. Hung","year":"2008","unstructured":"Hung, R.-W.: Optimal Vertex Ranking of Block Graphs. Information and Computation\u00a0206(11), 1288\u20131302 (2008)","journal-title":"Information and Computation"},{"issue":"12","key":"64_CR16","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0020-0190(88)90194-9","volume":"28","author":"A.V. Iyer","year":"1988","unstructured":"Iyer, A.V., Ratliff, H.D., Vijayan, G.: Optimal Node Ranking of Trees. Information Processing Letters\u00a028(12), 225\u2013229 (1988)","journal-title":"Information Processing Letters"},{"issue":"5","key":"64_CR17","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0020-0190(88)90194-9","volume":"28","author":"A.V. Iyer","year":"1988","unstructured":"Iyer, A.V., Ratliff, H.D., Vijayan, G.: Parallel Assembly of Modular Products an Analysis. Information Processing Letters\u00a028(5), 225\u2013229 (1988)","journal-title":"Information Processing Letters"},{"key":"64_CR18","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/S0304-3975(99)00240-6","volume":"240","author":"M.A. Kashem","year":"2000","unstructured":"Kashem, M.A., Zhou, X., Nishizeki, T.: Algorithms for Generalized Vertex-Rankings of Partial k-Trees. Theoretical Computer Science\u00a0240, 407\u2013427 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"1-3","key":"64_CR19","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0012-365X(93)E0216-Q","volume":"142","author":"M. Katchalski","year":"1995","unstructured":"Katchalski, M., McCuaig, W., Seager, S.: Ordered Colourings. Discrete Mathematics\u00a0142(1-3), 141\u2013154 (1995)","journal-title":"Discrete Mathematics"},{"key":"64_CR20","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0020-0190(98)00162-8","volume":"68","author":"T. Kloks","year":"1998","unstructured":"Kloks, T., M\u00fcller, H., Wong, C.K.: Vertex Ranking of Asteroid Triple-Free Graphs. Information Processing Letters\u00a068, 201\u2013206 (1998)","journal-title":"Information Processing Letters"},{"issue":"1","key":"64_CR21","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1137\/0611010","volume":"11","author":"J.W.H. Liu","year":"1990","unstructured":"Liu, J.W.H.: The Role of Elimination Trees in Sparse Factorization. SIAM Journal on Matrix Analysis and Applications\u00a011(1), 134\u2013172 (1990)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"2","key":"64_CR22","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0166-218X(89)90025-5","volume":"23","author":"D.C. Llewellyn","year":"1989","unstructured":"Llewellyn, D.C., Tovey, C., Trick, M.: Local Optimization on Graphs. Discrete Appl. Math.\u00a023(2), 157\u2013178 (1989)","journal-title":"Discrete Appl. Math."},{"key":"64_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-48340-3_36","volume-title":"Mathematical Foundations of Computer Science 1999","author":"K. Makino","year":"1999","unstructured":"Makino, K., Uno, Y., Ibaraki, T.: Minimum Edge Ranking Spanning Trees. In: Kuty\u0142owski, M., Wierzbicki, T., Pacholski, L. (eds.) MFCS 1999. LNCS, vol.\u00a01672, pp. 398\u2013409. Springer, Heidelberg (1999)"},{"issue":"2","key":"64_CR24","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0020-0190(89)90161-0","volume":"33","author":"A.A. Sch\u00e4ffer","year":"1989","unstructured":"Sch\u00e4ffer, A.A.: Optimal Node Ranking of Trees in Linear Time. Information Processing Letters\u00a033(2), 91\u201396 (1989)","journal-title":"Information Processing Letters"},{"key":"64_CR25","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1007\/BF01189071","volume":"13","author":"P. Torre de la","year":"1995","unstructured":"de la Torre, P., Greenlaw, R., Sch\u00e4ffer, A.A.: Optimal Edge Ranking of Trees in Polynomial Time. Algorithmica\u00a013, 592\u2013618 (1995)","journal-title":"Algorithmica"},{"issue":"6","key":"64_CR26","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0020-0190(95)00172-7","volume":"56","author":"X. Zhou","year":"1995","unstructured":"Zhou, X., Nagai, N., Nishizeki, T.: Generalized Vertex-Rankings of Trees. Information Processing Letters\u00a056(6), 321\u2013328 (1995)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2010: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11266-9_64","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T17:27:24Z","timestamp":1739467644000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11266-9_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642112652","9783642112669"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11266-9_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}