{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:12:06Z","timestamp":1725455526212},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540620488"},{"type":"electronic","value":"9783540496335"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0009493","type":"book-chapter","created":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T14:32:17Z","timestamp":1129818737000},"page":"174-182","source":"Crossref","is-referenced-by-count":4,"title":["Vertex ranking of asteroidal triple-free graphs"],"prefix":"10.1007","author":[{"given":"Ton","family":"Kloks","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haiko","family":"M\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. K.","family":"Wong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,10,11]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/BF01934264","volume":"34","author":"B. Aspvall","year":"1994","unstructured":"Aspvall, B. and P. Heggernes, Finding minimum height elimination trees for interval graphs in polynomial time, BIT vol. 34, 1994, pp. 484\u2013509.","journal-title":"BIT"},{"key":"18_CR2","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/3-540-56939-1_66","volume":"700","author":"H. Bodlaender","year":"1993","unstructured":"Bodlaender, H., T. Kloks and D. Kratsch, Treewidth and pathwidth of permutation graphs, Proceedings of the 20th International Colloquium on Automata, Languages and Programming, Springer-Verlag, Lecture Notes in Computer Science vol. 700, 1993, pp. 114\u2013125.","journal-title":"Springer-Verlag, Lecture Notes in Computer Science"},{"key":"18_CR3","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/3-540-59071-4_56","volume":"903","author":"H. Bodlaender","year":"1995","unstructured":"Bodlaender, H., J. S. Deogun, K. Jansen, T. Kloks, D. Kratsch, H. M\u00fcller and Z. Tuza, Rankings of graphs, Proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science WG'94, Springer-Verlag, Lecture Notes in Computer Science vol. 903, 1995, pp. 292\u2013304.","journal-title":"Springer-Verlag, Lecture Notes in Computer Science"},{"key":"18_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-55121-2_1","volume":"570","author":"H. L. Bodlaender","year":"1992","unstructured":"Bodlaender, H. L., J. R. Gilbert, H. Hafsteinsson and T. Kloks, Approximating treewidth, pathwidth and minimum elimination tree height, Proc. 17th International Workshop on Graph-Theoretic Concepts in Computer Science WG'94, Springer-Verlag, Lecture Notes in Computer Science vol. 570, 1992, pp. 1\u201312.","journal-title":"Springer-Verlag, Lecture Notes in Computer Science"},{"unstructured":"Brandst\u00e4dt, A., Special graph classes \u2014 a survey, Schriftenreihe des Fachbereichs Mathematik, SM-DU-199, Universit\u00e4t Duisburg Gesamthochschule, 1991.","key":"18_CR5"},{"key":"18_CR6","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/3-540-57899-4_54","volume":"790","author":"D. G. Corneil","year":"1994","unstructured":"Corneil, D. G., S. Olariu, and L., Stewart, Asteroidal triple-free graphs, Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science WG'93, Springer-Verlag, Lecture Notes in Computer Science vol. 790, 1994, pp. 211\u2013224.","journal-title":"Springer-Verlag, Lecture Notes in Computer Science"},{"key":"18_CR7","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/3-540-60084-1_82","volume":"944","author":"D. G. Corneil","year":"1995","unstructured":"Corneil, D. G., S. Olariu and L. Stewart, Linear time algorithms to compute dominating pairs in asteroidal triple-free graphs, Proceedings of the 22nd International Colloquium on Automata, Languages and Programming, Springer-Verlag, Lecture Notes in Computer Science vol. 944, 1995, pp. 292\u2013302.","journal-title":"Springer-Verlag, Lecture Notes in Computer Science"},{"key":"18_CR8","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1007\/3-540-57785-8_187","volume":"775","author":"J. S. Deogun","year":"1994","unstructured":"Deogun, J. S., T. Kloks, D. Kratsch and H. M\u00fcller, On vertex ranking for permutation and other graphs, 11th Annual Symposium on Theoretical Aspects of Computer Science, Springer-Verlag, Lecture Notes in Computer Science vol. 775, 1994, pp. 747\u2013758.","journal-title":"Springer-Verlag, Lecture Notes in Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Duchet, P., Classical perfect graphs, in: Topics on Perfect Graphs, C. Berge and V. Chv\u00e1tal, (eds.), Annals of Discrete Mathematics 21, 1984, pp. 67\u201396.","key":"18_CR9","DOI":"10.1016\/S0304-0208(08)72924-4"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1145\/356044.356047","volume":"9","author":"I. S. Duff","year":"1983","unstructured":"Duff, I. S. and J. K. Reid, The multifrontal solution of indefinite sparse symmetric linear equations. ACM Transactions on Mathematical Software 9 (1983), 302\u2013325.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"18_CR11","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M. C. Golumbic","year":"1980","unstructured":"Golumbic, M. C., Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980."},{"key":"18_CR12","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., W. McCuaig and S. Seager, Ordered colourings, Discrete Mathematics 142, (1995), pp. 141\u2013154.","journal-title":"Discrete Mathematics"},{"doi-asserted-by":"crossref","unstructured":"Kloks, T., Treewidth \u2014 Computations and Approximations, Springer-Verlag, Lecture Notes in Computer Science vol. 842, 1994.","key":"18_CR13","DOI":"10.1007\/BFb0045375"},{"key":"18_CR14","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1007\/3-540-57785-8_188","volume":"775","author":"T. Kloks","year":"1994","unstructured":"Kloks, T. and D. Kratsch, Finding all minimal separators of a graph, Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science, Springer-Verlag, Lecture Notes in Computer Science vol. 775, 1994, pp. 759\u2013768.","journal-title":"Springer-Verlag, Lecture Notes in Computer Science"},{"unstructured":"Kloks, T., D. Kratsch and H. M\u00fcller, Measuring the vulnerability for classes of intersection graphs, to appear in Discrete Applied Mathematics.","key":"18_CR15"},{"key":"18_CR16","volume-title":"Computing Science Notes 93\/46","author":"T. Kloks","year":"1994","unstructured":"Kloks, T., D. Kratsch and J. Spinrad, Treewidth and pathwidth of cocomparability graphs of bounded dimension, Computing Science Notes 93\/46, Eindhoven University of Technology, Eindhoven, The Netherlands (1994)."},{"doi-asserted-by":"crossref","unstructured":"Leiserson, C. E., Area efficient graph layouts for VLSI, Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science, 1980, pp. 270\u2013281.","key":"18_CR17","DOI":"10.1109\/SFCS.1980.13"},{"key":"18_CR18","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4064\/fm-51-1-45-64","volume":"51","author":"C. G. Lekkerkerker","year":"1962","unstructured":"Lekkerkerker, C. G., and J. Ch. Boland, Representation of a finite graph by a set of intervals on the real line, Fundamenta Mathematicae 51, (1962), pp. 45\u201364.","journal-title":"Fundamenta Mathematicae"},{"key":"18_CR19","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 of Matrix Analysis and Applications 11 (1990), 134\u2013172.","journal-title":"SIAM Journal of Matrix Analysis and Applications"},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0020-0190(89)90161-0","volume":"33","author":"A. A. Sch\u00e4ffer","year":"1989\/1990","unstructured":"Sch\u00e4ffer, A. A., Optimal node ranking of trees in linear time, Information Processing Letters 33, (1989\/1990), pp. 91\u201396.","journal-title":"Information Processing Letters"},{"key":"18_CR21","series-title":"Memorandum No.1132","volume-title":"3rd Twente Workshop on Graphs and Combinatorial Optimization","author":"P. Scheffler","year":"1993","unstructured":"Scheffler, P., Node ranking and Searching on Graphs (Abstract), in: U. Faigle and C. Hoede, (eds.), 3rd Twente Workshop on Graphs and Combinatorial Optimization, Memorandum No.1132, Faculty of Applied Mathematics, University of Twente, The Netherlands, 1993."},{"key":"18_CR22","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0020-0190(92)90017-P","volume":"43","author":"A. Sen","year":"1992","unstructured":"Sen, A., H. Deng and S. Guha, On a graph partition problem with application to VLSI layout. Information Processing Letters 43 (1992), 87\u201394.","journal-title":"Information Processing Letters"},{"unstructured":"de la Torre, P., R. Greenlaw and A. A. Sch\u00e4ffer, Optimal ranking of trees in polynomial time, Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, Austin, Texas, 1993, pp. 138\u2013144.","key":"18_CR23"},{"key":"18_CR24","doi-asserted-by":"crossref","DOI":"10.56021\/9780801844256","volume-title":"Combinatorics and Partially Ordered Sets: Dimension Theory","author":"W. T. Trotter","year":"1992","unstructured":"Trotter, W. T., Combinatorics and Partially Ordered Sets: Dimension Theory, The John Hopkins University Press, Baltimore, Maryland, 1992."},{"key":"18_CR25","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1137\/0603036","volume":"3","author":"M. Yannakakis","year":"1982","unstructured":"Yannakakis, M., The complexity of the partial order dimension problem, SIAM J. Alg. Discrete Methods 3, (1982), pp. 351\u2013358.","journal-title":"SIAM J. Alg. Discrete Methods"},{"unstructured":"Zhou, X., M. A. Kashem and T. Nishizeki, Generalized edge-rankings of trees, to appear in Proceedings of the 22th International Workshop on Graph-Theoretic Concepts in Computer Science WG'96, Springer-Verlag, Lecture Notes in Computer Science.","key":"18_CR26"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0009493","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T04:39:24Z","timestamp":1683261564000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0009493"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540620488","9783540496335"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/bfb0009493","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}