{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:41:39Z","timestamp":1725522099075},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540922476"},{"type":"electronic","value":"9783540922483"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-92248-3_21","type":"book-chapter","created":{"date-parts":[[2008,12,4]],"date-time":"2008-12-04T13:36:17Z","timestamp":1228397777000},"page":"230-239","source":"Crossref","is-referenced-by-count":2,"title":["The Rank-Width of the Square Grid"],"prefix":"10.1007","author":[{"given":"V\u00edt","family":"Jel\u00ednek","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Hlin\u011bn\u00fd, P., Oum, S., Seese, D., Gottlob, G.: Width parameters beyond tree-width and their applications. Computer Journal (advance access) (2007)","DOI":"10.1093\/comjnl\/bxm052"},{"key":"21_CR2","unstructured":"Oum, S.: Graphs of Bounded Rank-Width. PhD thesis, Princeton University (2005)"},{"key":"21_CR3","unstructured":"Oum, S.: Introduction to rank-width. In: Third workshop on graph classes, optimization, and width parameters, Eugene (2007), \n                    \n                      http:\/\/math.kaist.ac.kr\/~sangil\/pdf\/2007eugene.pdf"},{"key":"21_CR4","unstructured":"Oum, S.: Recognizing rank-width. In: Oberwolfach Workshop \u201cGraph Theory\u201d, \n                    \n                      http:\/\/math.kaist.ac.kr\/~sangil\/pdf\/oberwolfach2005.pdf"},{"issue":"3","key":"21_CR5","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1002\/jgt.20280","volume":"57","author":"S. Oum","year":"2007","unstructured":"Oum, S.: Rank-width is less than or equal to branch-width. Journal of Graph Theory\u00a057(3), 239\u2013244 (2007)","journal-title":"Journal of Graph Theory"},{"issue":"4","key":"21_CR6","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. Journal of Combinatorial Theory, Series B\u00a096(4), 514\u2013528 (2006)","journal-title":"Journal of Combinatorial Theory, Series B"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92248-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T08:15:18Z","timestamp":1551687318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92248-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540922476","9783540922483"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92248-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}