{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:30:25Z","timestamp":1725535825098},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020285"},{"type":"electronic","value":"9783642020292"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02029-2_15","type":"book-chapter","created":{"date-parts":[[2009,7,27]],"date-time":"2009-07-27T14:12:39Z","timestamp":1248703959000},"page":"148-157","source":"Crossref","is-referenced-by-count":0,"title":["On the Cubicity of AT-Free Graphs and Circular-Arc Graphs"],"prefix":"10.1007","author":[{"given":"L. Sunil","family":"Chandran","sequence":"first","affiliation":[]},{"given":"Mathew C.","family":"Francis","sequence":"additional","affiliation":[]},{"given":"Naveen","family":"Sivadasan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","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":"15_CR2","first-page":"301","volume-title":"Recent Progresses in Combinatorics","author":"F.S. Roberts","year":"1969","unstructured":"Roberts, F.S.: On the boxicity and cubicity of a graph. In: Recent Progresses in Combinatorics, pp. 301\u2013310. Academic Press, New York (1969)"},{"key":"15_CR3","doi-asserted-by":"publisher","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 Journal on Algebraic Discrete Methods\u00a03, 351\u2013358 (1982)","journal-title":"SIAM Journal on Algebraic Discrete Methods"},{"issue":"6","key":"15_CR4","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1137\/S0097539702402676","volume":"34","author":"T. Erlebach","year":"2005","unstructured":"Erlebach, T., Jansen, K., Seidel, E.: Polynomial-time approximation schemes for geometric intersection graphs. SIAM Journal on Computing\u00a034(6), 1302\u20131323 (2005)","journal-title":"SIAM Journal on Computing"},{"unstructured":"Afshani, P., Chan, T.: Approximation algorithms for maximum cliques in 3d unit-disk graphs. In: Proc. 17th Canadian Conference on Computational Geometry (CCCG), pp. 6\u20139 (2005)","key":"15_CR5"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/11604686_31","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"E.J. Leeuwen van","year":"2005","unstructured":"van Leeuwen, E.J.: Approximation algorithms for unit disk graphs. In: Kratsch, D. (ed.) WG 2005. LNCS, vol.\u00a03787, pp. 351\u2013361. Springer, Heidelberg (2005)"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0925-7721(98)00028-5","volume":"11","author":"P.K. Agarwal","year":"1998","unstructured":"Agarwal, P.K., van Kreveld, M., Suri, S.: Label placement by maximum independent set in rectangles. Comput. Geom. Theory Appl.\u00a011, 209\u2013218 (1998)","journal-title":"Comput. Geom. Theory Appl."},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1006\/jagm.2001.1188","volume":"41","author":"P. Berman","year":"2001","unstructured":"Berman, P., DasGupta, B., Muthukrishnan, S., Ramaswami, S.: Efficient approximation algorithms for tiling and packing problems with rectangles. J. Algorithms\u00a041, 443\u2013470 (2001)","journal-title":"J. Algorithms"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0166-218X(02)00246-9","volume":"127","author":"T. Michael","year":"2003","unstructured":"Michael, T., Quint, T.: Sphere of influence graphs and the l\n                \u2009\u221e\u2009-metric. Discrete Applied Mathematics\u00a0127, 447\u2013460 (2003)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"15_CR10","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0095-8956(83)90057-6","volume":"35","author":"P.C. Fishburn","year":"1983","unstructured":"Fishburn, P.C.: On the sphericity and cubicity of graphs. Journal of Combinatorial Theory, Series B\u00a035(3), 309\u2013318 (1983)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"2","key":"15_CR11","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0095-8956(86)90081-X","volume":"40","author":"H. Maehara","year":"1986","unstructured":"Maehara, H.: Sphericity exceeds cubicity for almost all complete bipartite graphs. Journal of Combinatorial Theory, Series B\u00a040(2), 231\u2013235 (1986)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"8","key":"15_CR12","doi-asserted-by":"publisher","first-page":"1309","DOI":"10.1016\/j.dam.2006.01.004","volume":"154","author":"T. Michael","year":"2006","unstructured":"Michael, T., Quint, T.: Sphericity, cubicity, and edge clique covers of graphs. Discrete Applied Mathematics\u00a0154(8), 1309\u20131313 (2006)","journal-title":"Discrete Applied Mathematics"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.ipl.2005.01.001","volume":"94","author":"L.S. Chandran","year":"2005","unstructured":"Chandran, L.S., Mannino, C., Orialo, G.: On the cubicity of certain graphs. Information Processing Letters\u00a094, 113\u2013118 (2005)","journal-title":"Information Processing Letters"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.endm.2007.07.054","volume":"29","author":"L.S. Chandran","year":"2007","unstructured":"Chandran, L.S., Francis, M.C., Sivadasan, N.: On the cubicity of interval graphs. Electronic Notes in Discrete Mathematics\u00a029, 315\u2013319 (2007)","journal-title":"Electronic Notes in Discrete Mathematics"},{"doi-asserted-by":"crossref","unstructured":"Unger, W.: The complexity of the approximation of the bandwidth problem. In: Proceedings of the 39th IEEE Annual Symposium on Foundations of Computer Science, pp. 82\u201391 (November 1998)","key":"15_CR15","DOI":"10.1109\/SFCS.1998.743431"},{"key":"15_CR16","first-page":"90","volume-title":"Prceedings of the Thirtieth Annual ACM Symposium on Theory of Computing","author":"U. Feige","year":"1998","unstructured":"Feige, U.: Approximating the bandwidth via volume respecting embeddings. In: Prceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pp. 90\u201399. ACM Press, New York (1998)"},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1137\/0215041","volume":"15","author":"J. Turner","year":"1986","unstructured":"Turner, J.: On the probable performance of heuristics for bandwidth minimization. SIAM journal on computing\u00a015, 561\u2013580 (1986)","journal-title":"SIAM journal on computing"},{"issue":"4","key":"15_CR18","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1137\/S0895480199359624","volume":"15","author":"D. Kratsch","year":"2002","unstructured":"Kratsch, D., Stewart, L.: Approximating bandwidth by mixing layouts of interval graphs. SIAM Journal on Discrete Mathematics\u00a015(4), 435\u2013449 (2002)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-40064-8_23","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"T. Kloks","year":"2000","unstructured":"Kloks, T., Kratsch, D., Borgne, Y.L., M\u00fcller, H.: Bandwidth of split and circular permutation graphs. In: Brandes, U., Wagner, D. (eds.) WG 2000. LNCS, vol.\u00a01928, pp. 243\u2013254. Springer, Heidelberg (2000)"},{"issue":"1","key":"15_CR20","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1006\/jagm.1998.0997","volume":"32","author":"T. Kloks","year":"1999","unstructured":"Kloks, T., Kratsch, D., M\u00fcller, H.: Approximating the bandwidth of asteroidal triple-free graphs. Journal of algorithms\u00a032(1), 41\u201357 (1999)","journal-title":"Journal of algorithms"},{"issue":"3","key":"15_CR21","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1137\/0406032","volume":"6","author":"D. Kratsch","year":"1993","unstructured":"Kratsch, D., Stewart, L.: Domination on cocomparability graphs. SIAM Journal on Discrete Mathematics\u00a06(3), 400\u2013417 (1993)","journal-title":"SIAM Journal on Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Graph Theory, Computational Intelligence and Thought"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02029-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T07:33:02Z","timestamp":1552116782000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02029-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020285","9783642020292"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02029-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}