{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:45:24Z","timestamp":1759063524632},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642102165"},{"type":"electronic","value":"9783642102172"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10217-2_27","type":"book-chapter","created":{"date-parts":[[2009,11,9]],"date-time":"2009-11-09T10:52:03Z","timestamp":1257763923000},"page":"266-277","source":"Crossref","is-referenced-by-count":7,"title":["Better Polynomial Algorithms on Graphs of\u00a0Bounded Rank-Width"],"prefix":"10.1007","author":[{"given":"Robert","family":"Ganian","sequence":"first","affiliation":[]},{"given":"Petr","family":"Hlin\u011bn\u00fd","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","first-page":"191","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"I. Averbouch","year":"2006","unstructured":"Averbouch, I., Godlin, B., Makowsky, J.A., Rotics, U.: Computing graph polynomials on graphs of bounded clique-width. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol.\u00a04271, pp. 191\u2013204. Springer, Heidelberg (2006)"},{"key":"27_CR2","unstructured":"Bui-Xuan, B.-M., Telle, J.A., Vatshelle, M.: H-join and algorithms on graphs of bounded rankwidth. Technical Report 378, Dept. of Informatics, University of Bergen, Norway (2008), http:\/\/www.ii.uib.no\/publikasjoner\/texrap\/pdf\/2008-378.pdf"},{"issue":"4","key":"27_CR3","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1137\/S0097539701385351","volume":"34","author":"D.G. Corneil","year":"2005","unstructured":"Corneil, D.G., Rotics, U.: On the relationship between cliquewidth and treewidth. SIAM J. Comput.\u00a034(4), 825\u2013847 (2005)","journal-title":"SIAM J. Comput."},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-540-74839-7_7","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"B. Courcelle","year":"2007","unstructured":"Courcelle, B., Kant\u00e9, M.M.: Graph Operations Characterizing Rank-Width and Balanced Graph Expressions. In: Brandst\u00e4dt, A., Kratsch, D., M\u00fcller, H. (eds.) WG 2007. LNCS, vol.\u00a04769, pp. 66\u201375. Springer, Heidelberg (2007)"},{"issue":"2","key":"27_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst.\u00a033(2), 125\u2013150 (2000)","journal-title":"Theory Comput. Syst."},{"key":"27_CR6","series-title":"Monographs in Computer Science","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. Monographs in Computer Science. Springer, New York (1999)"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/3-540-45477-2_12","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"W. Espelage","year":"2001","unstructured":"Espelage, W., Gurski, F., Wanke, E.: How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time. In: Brandst\u00e4dt, A., Van Bang Le (eds.) WG 2001. LNCS, vol.\u00a02204, pp. 117\u2013128. Springer, Heidelberg (2001)"},{"key":"27_CR8","first-page":"354","volume-title":"Proceedings of the 38th annual ACM Symposium on Theory of Computing","author":"M.R. Fellows","year":"2006","unstructured":"Fellows, M.R., Rosamond, F.A., Rotics, U., Szeider, S.: Clique-width minimization is NP-hard. In: Proceedings of the 38th annual ACM Symposium on Theory of Computing, pp. 354\u2013362. ACM Press, New York (2006)"},{"key":"27_CR9","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1137\/1.9781611973068.90","volume-title":"roceedings of the 19th Annual ACM\u2013SIAM Symposium on Discrete Algorithms","author":"F. Fomin","year":"2009","unstructured":"Fomin, F., Golovach, P., Lokshtanov, D., Saurabh, S.: Clique-width: On the Price of Generality. In: roceedings of the 19th Annual ACM\u2013SIAM Symposium on Discrete Algorithms, pp. 825\u2013834. ACM Press, New York (2009)"},{"key":"27_CR10","unstructured":"Ganian, R.: Automata formalization for graphs of bounded rank-width. Master thesis. Faculty of Informatics of the Masaryk University, Brno, Czech republic (2008)"},{"key":"27_CR11","unstructured":"Ganian, R., Hlin\u011bn\u00fd, P.: Automata approach to graphs of bounded rank-width. In: Proceedings of IWOCA 2008, pp. 4\u201315 (2008)"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Ganian, R., Hlin\u011bn\u00fd, P.: On Parse Trees and Myhill\u2013Nerode\u2013type Tools for handling Graphs of Bounded Rank-width, p. 28 (2009) (manuscript)","DOI":"10.1016\/j.dam.2009.10.018"},{"issue":"1-3","key":"27_CR13","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1016\/S0304-3975(02)00725-9","volume":"299","author":"M.U. Gerber","year":"2003","unstructured":"Gerber, M.U., Kobler, D.: Algorithms for vertex-partitioning problems on graphs with fixed clique-width. Theoret. Comput. Sci.\u00a0299(1-3), 719\u2013734 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"932","DOI":"10.1137\/050645208","volume":"20","author":"O. Gimenez","year":"2006","unstructured":"Gimenez, O., Hlin\u011bn\u00fd, P., Noy, M.: Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. SIAM J.\u00a0Discrete Math.\u00a020, 932\u2013946 (2006)","journal-title":"SIAM J.\u00a0Discrete Math."},{"key":"27_CR15","first-page":"75","volume-title":"Recent Progress in Combinatorics","author":"J. Goldman","year":"1969","unstructured":"Goldman, J., Rota, G.-C.: The number of subspaces of a vector space. In: Tutte, W.T. (ed.) Recent Progress in Combinatorics, pp. 75\u201383. Academic Press, London (1969)"},{"issue":"3","key":"27_CR16","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.jctb.2005.08.005","volume":"96","author":"P. Hlin\u011bn\u00fd","year":"2006","unstructured":"Hlin\u011bn\u00fd, P.: Branch-width, parse trees, and monadic second-order logic for matroids. J. Combin. Theory Ser. B\u00a096(3), 325\u2013351 (2006)","journal-title":"J. Combin. Theory Ser. B"},{"key":"27_CR17","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1137\/070685920","volume":"38","author":"P. Hlin\u011bn\u00fd","year":"2008","unstructured":"Hlin\u011bn\u00fd, P., Oum, S.: Finding Branch-decomposition and Rank-decomposition. SIAM J. Comput.\u00a038, 1012\u20131032 (2008)","journal-title":"SIAM J. Comput."},{"key":"27_CR18","unstructured":"Kant\u00e9, M.: The rank-width of directed graphs. arXiv:0709.1433v3 (2008)"},{"issue":"2-3","key":"27_CR19","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(02)00198-1","volume":"126","author":"D. Kobler","year":"2003","unstructured":"Kobler, D., Rotics, U.: Edge dominating set and colorings on graphs with fixed clique-width. Discrete Appl. Math.\u00a0126(2-3), 197\u2013221 (2003)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"27_CR20","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.jctb.2005.10.006","volume":"96","author":"S. Oum","year":"2006","unstructured":"Oum, S., Seymour, P.: Approximating clique-width and branch-width. J.\u00a0Combin. Theory Ser. B\u00a096(4), 514\u2013528 (2006)","journal-title":"J.\u00a0Combin. Theory Ser. B"},{"key":"27_CR21","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.tcs.2007.03.043","volume":"377","author":"M. Rao","year":"2007","unstructured":"Rao, M.: MSOL partitioning problems on graphs of bounded treewidth and clique-width. Theoretical Computer Science\u00a0377, 260\u2013267 (2007)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10217-2_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:52:17Z","timestamp":1606168337000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10217-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642102165","9783642102172"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10217-2_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}