{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:31:44Z","timestamp":1725543104782},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540369257"},{"type":"electronic","value":"9783540369264"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11809678_42","type":"book-chapter","created":{"date-parts":[[2006,8,15]],"date-time":"2006-08-15T13:41:33Z","timestamp":1155649293000},"page":"398-407","source":"Crossref","is-referenced-by-count":3,"title":["Geometric Representation of Graphs in Low Dimension"],"prefix":"10.1007","author":[{"given":"L. Sunil","family":"Chandran","sequence":"first","affiliation":[]},{"given":"Naveen","family":"Sivadasan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"42_CR1","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":"42_CR2","doi-asserted-by":"crossref","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":"42_CR3","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0012-365X(93)90354-V","volume":"114","author":"S. Bellantoni","year":"1993","unstructured":"Bellantoni, S., Hartman, I.B.-A., Przytycka, T., Whitesides, S.: Grid intersection graphs and boxicity. Discrete mathematics\u00a0114, 41\u201349 (1993)","journal-title":"Discrete mathematics"},{"key":"42_CR4","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":"42_CR5","first-page":"1","volume":"11","author":"H.L. Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernetica\u00a011, 1\u201321 (1993)","journal-title":"Acta Cybernetica"},{"key":"42_CR6","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"B. Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random Graphs, 2nd edn. Cambridge University Press, Cambridge (2001)","edition":"2"},{"key":"42_CR7","unstructured":"Chandran, L.S., Sivadasan, N.: Geometric representation of graphs in low dimension, \n                      \n                        http:\/\/arxiv.org\/abs\/cs.DM\/0605013"},{"key":"42_CR8","unstructured":"Chandran, L.S., Sivadasan, N.: Treewidth and boxicity (submitted), available at: \n                      \n                        http:\/\/arxiv.org\/abs\/math.CO\/0505544"},{"key":"42_CR9","unstructured":"Chang, Y.W., West, D.B.: Rectangle number for hyper cubes and complete multipartite graphs. In: 29th SE conf. Comb., Graph Th. and Comp., Congr. Numer., vol.\u00a0132, pp. 19\u201328 (1998)"},{"key":"42_CR10","unstructured":"Chang, Y.W., West, D.B.: Interval number and boxicity of digraphs. In: Proceedings of the 8th International Graph Theory Conf. (1998)"},{"key":"42_CR11","unstructured":"Cozzens, M.B.: Higher and multidimensional analogues of interval graphs. Ph. D thesis, Rutgers University, New Brunswick, NJ (1981)"},{"key":"42_CR12","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0166-218X(83)90077-X","volume":"6","author":"M.B. Cozzens","year":"1983","unstructured":"Cozzens, M.B., Roberts, F.S.: Computing the boxicity of a graph by covering its complement by cointerval graphs. Discrete Applied Mathematics\u00a06, 217\u2013228 (1983)","journal-title":"Discrete Applied Mathematics"},{"key":"42_CR13","doi-asserted-by":"crossref","unstructured":"Erlebach, T., Jansen, K., Seidel, E.: Polynomial-time approximation schemes for geometric intersection graphs. SIAM Journal of Computing (to appear)","DOI":"10.1137\/S0097539702402676"},{"key":"42_CR14","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0012-365X(79)90149-3","volume":"25","author":"R.B. Feinberg","year":"1979","unstructured":"Feinberg, R.B.: The circular dimension of a graph. Discrete mathematics\u00a025, 27\u201331 (1979)","journal-title":"Discrete mathematics"},{"key":"42_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth: Computations And Approximations","author":"T. Kloks","year":"1994","unstructured":"Kloks, T.: Treewidth: Computations And Approximations. LNCS, vol.\u00a0842. Springer, Heidelberg (1994)"},{"key":"42_CR16","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0166-218X(94)90143-0","volume":"52","author":"J. Kratochvil","year":"1994","unstructured":"Kratochvil, J.: A special planar satisfiability problem and a consequence of its NP\u2013completeness. Discrete Applied Mathematics\u00a052, 233\u2013252 (1994)","journal-title":"Discrete Applied Mathematics"},{"key":"42_CR17","first-page":"301","volume-title":"ch.\u00a0On the boxicity and Cubicity of a graph","author":"F.S. Roberts","year":"1969","unstructured":"Roberts, F.S.: Recent Progresses in Combinatorics. In: ch.\u00a0On the boxicity and Cubicity of a graph, pp. 301\u2013310. Academic Press, New York (1969)"},{"key":"42_CR18","unstructured":"Scheinerman, E.R.: Intersectin classes and multiple intersection parameters. Ph. D thesis, Princeton University (1984)"},{"key":"42_CR19","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0012-365X(90)90290-X","volume":"29","author":"J.B. Shearer","year":"1980","unstructured":"Shearer, J.B.: A note on circular dimension. Discrete mathematics\u00a029, 103 (1980)","journal-title":"Discrete mathematics"},{"key":"42_CR20","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0095-8956(86)90061-4","volume":"40","author":"C. Thomassen","year":"1986","unstructured":"Thomassen, C.: Interval representations of planar graphs. Journal of combinatorial theory, Ser B\u00a040, 9\u201320 (1986)","journal-title":"Journal of combinatorial theory, Ser B"},{"key":"42_CR21","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0012-365X(87)90247-0","volume":"64","author":"W.T. Trotter","year":"1987","unstructured":"Trotter, W.T., West, J.D.B.: Poset boxicity of graphs. Discrete Mathematics\u00a064, 105\u2013107 (1987)","journal-title":"Discrete Mathematics"},{"key":"42_CR22","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":"42_CR23","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"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11809678_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:26:40Z","timestamp":1619508400000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11809678_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540369257","9783540369264"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11809678_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}