{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:53:11Z","timestamp":1725558791500},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642140303"},{"type":"electronic","value":"9783642140310"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14031-0_3","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T09:50:06Z","timestamp":1277718606000},"page":"3-12","source":"Crossref","is-referenced-by-count":8,"title":["Boxicity and Poset Dimension"],"prefix":"10.1007","author":[{"given":"Abhijin","family":"Adiga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diptendu","family":"Bhowmick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L. Sunil","family":"Chandran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"1536","DOI":"10.1016\/j.disc.2010.01.020","volume":"310","author":"D. Bhowmick","year":"2010","unstructured":"Bhowmick, D., Chandran, L.S.: Boxicity and cubicity of asteroidal triple free graphs. Disc. Math.\u00a0310, 1536\u20131543 (2010)","journal-title":"Disc. Math."},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"2488","DOI":"10.1016\/j.disc.2008.06.003","volume":"309","author":"L.S. Chandran","year":"2009","unstructured":"Chandran, L.S., Das, A., Shah, C.D.: Cubicity, boxicity, and vertex cover. Disc. Math.\u00a0309, 2488\u20132496 (2009)","journal-title":"Disc. Math."},{"key":"3_CR3","unstructured":"Chandran, L.S., Francis, M.C., Mathew, R.: Chordal bipartite graphs with high boxicity. In: Japan conference on computation geometry and graphs, Kanazawa (2009)"},{"issue":"2","key":"3_CR4","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/j.jctb.2007.08.002","volume":"98","author":"L.S. Chandran","year":"2008","unstructured":"Chandran, L.S., Francis, M.C., Sivadasan, N.: Boxicity and maximum degree. J. Combin. Theory Ser. B\u00a098(2), 443\u2013445 (2008)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"5","key":"3_CR5","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1016\/j.jctb.2006.12.004","volume":"97","author":"L.S. Chandran","year":"2007","unstructured":"Chandran, L.S., Sivadasan, N.: Boxicity and treewidth. J. Combin. Theory Ser. B\u00a097(5), 733\u2013744 (2007)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"23","key":"3_CR6","doi-asserted-by":"publisher","first-page":"5795","DOI":"10.1016\/j.disc.2007.10.011","volume":"308","author":"L.S. Chandran","year":"2008","unstructured":"Chandran, L.S., Sivadasan, N.: The cubicity of hypercube graphs. Disc. Math.\u00a0308(23), 5795\u20135800 (2008)","journal-title":"Disc. Math."},{"key":"3_CR7","volume-title":"Introduction to algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms. MIT press, Cambridge (2001)"},{"key":"3_CR8","unstructured":"Cozzens, M.B.: Higher and multi-dimensional analogues of interval graphs, Ph.D thesis, Department of Mathematics, Rutgers University, New Brunswick, NJ (1981)"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0166-218X(91)90038-X","volume":"30","author":"M.B. Cozzens","year":"1991","unstructured":"Cozzens, M.B., Halsey, M.D.: The relationship between the threshold dimension of split graphs and various dimensional parameters. Disc. Appl. Math.\u00a030, 125\u2013135 (1991)","journal-title":"Disc. Appl. Math."},{"issue":"3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"600","DOI":"10.2307\/2371374","volume":"6","author":"B. Dushnik","year":"1941","unstructured":"Dushnik, B., Miller, E.W.: Partially ordered sets. Amer. J. Math\u00a06(3), 600\u2013610 (1941)","journal-title":"Amer. J. Math"},{"key":"3_CR11","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1002\/rsa.3240020302","volume":"2","author":"P. Erd\u0151s","year":"1991","unstructured":"Erd\u0151s, P., Kierstead, H., Trotter, W.T.: The dimension of random ordered sets. Random structures and algorithms\u00a02, 253\u2013275 (1991)","journal-title":"Random structures and algorithms"},{"issue":"5","key":"3_CR12","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.1016\/j.ejc.2008.10.003","volume":"30","author":"L. Esperet","year":"2009","unstructured":"Esperet, L.: Boxicity of graphs with bounded degree. European J. Combin.\u00a030(5), 1277\u20131280 (2009)","journal-title":"European J. Combin."},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/0022-2496(70)90062-3","volume":"7","author":"P.C. Fishburn","year":"1983","unstructured":"Fishburn, P.C.: Intransitive indifference with unequal indifference intervals. J. Math. Psych.\u00a07, 144\u2013149 (1983)","journal-title":"J. Math. Psych."},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF00403406","volume":"3","author":"Z. F\u00fcredi","year":"1986","unstructured":"F\u00fcredi, Z., Kahn, J.: On the dimensions of ordered sets of bounded degree. Order\u00a03, 15\u201320 (1986)","journal-title":"Order"},{"key":"3_CR15","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":"3_CR16","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/j.endm.2007.07.084","volume":"29","author":"R. Hegde","year":"2007","unstructured":"Hegde, R., Jain, K.: The hardness of approximating poset dimension. Electronic Notes on Discrete Mathematics\u00a029, 435\u2013443 (2007)","journal-title":"Electronic Notes on Discrete Mathematics"},{"key":"3_CR17","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 NPcompleteness. Disc. Appl. Math.\u00a052, 233\u2013252 (1994)","journal-title":"Disc. Appl. Math."},{"key":"3_CR18","doi-asserted-by":"crossref","first-page":"160","DOI":"10.4153\/CJM-1971-016-5","volume":"23","author":"A. Pnueli","year":"1971","unstructured":"Pnueli, A., Lempel, A., Even, S.: Transitive orientation of graphs and identification of permutation graphs. Canad. J. Math\u00a023, 160\u2013175 (1971)","journal-title":"Canad. J. Math"},{"key":"3_CR19","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":"3_CR20","unstructured":"Scheinerman, E.R.: Intersection classes and multiple intersection parameters, Ph.D. thesis, Princeton University (1984)"},{"key":"3_CR21","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. J. Combin. Theory Ser. B\u00a040, 9\u201320 (1986)","journal-title":"J. Combin. Theory Ser. B"},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0012-365X(74)90113-7","volume":"8","author":"W.T. Trotter","year":"1974","unstructured":"Trotter, W.T.: Dimension of the crown S $^{K}_{n}$ . Disc. Math.\u00a08, 85\u2013103 (1974)","journal-title":"Disc. Math."},{"key":"3_CR23","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 Johns Hopkins University Press, Baltimore (1992)"},{"key":"3_CR24","unstructured":"Trotter, W.T.: Graphs and partially ordered sets: recent results and new directions. In: Surveys in graph theory, San Fransisco, CA (1995), Congr. Numer. 116 (1996)"},{"key":"3_CR25","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/2041106","volume":"60","author":"W.T. Trotter","year":"1976","unstructured":"Trotter, W.T., Moore, J.I., Sumner, D.P.: The dimension of a comparability graph. Proc. Amer Math Soc.\u00a060, 35\u201338 (1976)","journal-title":"Proc. Amer Math Soc."},{"issue":"3","key":"3_CR26","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 J. Alg. Disc. Math.\u00a03(3), 351\u2013358 (1982)","journal-title":"SIAM J. Alg. Disc. Math."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14031-0_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T19:37:53Z","timestamp":1685648273000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14031-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642140303","9783642140310"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14031-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}