{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:07:25Z","timestamp":1743001645581,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319123394"},{"type":"electronic","value":"9783319123400"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12340-0_10","type":"book-chapter","created":{"date-parts":[[2014,10,20]],"date-time":"2014-10-20T04:27:23Z","timestamp":1413779243000},"page":"117-128","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Structural Parameterizations for Boxicity"],"prefix":"10.1007","author":[{"given":"Henning","family":"Bruhn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Morgan","family":"Chopin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felix","family":"Joos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oliver","family":"Schaudt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,21]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-33293-7_14","volume-title":"Parameterized and Exact Computation","author":"A Adiga","year":"2012","unstructured":"Adiga, A., Babu, J., Chandran, L.S.: Polynomial time and parameterized approximation algorithms for boxicity. In: Thilikos, D.M., Woeginger, G.J. (eds.) IPEC 2012. LNCS, vol. 7535, pp. 135\u2013146. Springer, Heidelberg (2012)"},{"issue":"16","key":"10_CR2","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.1016\/j.dam.2010.06.017","volume":"158","author":"A Adiga","year":"2010","unstructured":"Adiga, A., Bhowmick, D., Chandran, L.S.: The hardness of approximating the boxicity, cubicity and threshold dimension of a graph. Discrete Appl. Math. 158(16), 1719\u20131726 (2010)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"10_CR3","doi-asserted-by":"publisher","first-page":"1687","DOI":"10.1137\/100786290","volume":"25","author":"A Adiga","year":"2011","unstructured":"Adiga, A., Bhowmick, D., Chandran, L.S.: Boxicity and poset dimension. SIAM J. Discrete Math. 25(4), 1687\u20131698 (2011)","journal-title":"SIAM J. Discrete Math."},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-642-17517-6_33","volume-title":"Algorithms and Computation","author":"A Adiga","year":"2010","unstructured":"Adiga, A., Chitnis, R., Saurabh, S.: Parameterized algorithms for boxicity. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010, Part I. LNCS, vol. 6506, pp. 366\u2013377. Springer, Heidelberg (2010)"},{"key":"10_CR5","doi-asserted-by":"crossref","first-page":"181","DOI":"10.7146\/math.scand.a-10607","volume":"8","author":"E Asplund","year":"1960","unstructured":"Asplund, E., Gr\u00fcnbaum, B.: On a coloring problem. Math. Scand. 8, 181\u2013188 (1960)","journal-title":"Math. Scand."},{"key":"10_CR6","first-page":"333","volume":"1","author":"A Bielecki","year":"1948","unstructured":"Bielecki, A.: Problem 56. Colloq. Math. 1, 333 (1948)","journal-title":"Colloq. Math."},{"issue":"6","key":"10_CR7","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Bruhn, H., Chopin, M., Joos, F., Schaudt, O.: Structural parameterizations for boxicity. CoRR (2014). abs\/1402.4992","DOI":"10.1007\/978-3-319-12340-0_10"},{"issue":"4","key":"10_CR9","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(96)00050-6","volume":"58","author":"L Cai","year":"1996","unstructured":"Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Inf. Process. Lett. 58(4), 171\u2013176 (1996)","journal-title":"Inf. Process. Lett."},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Chalermsook, P., Laekhanukit, B., Nanongkai, D.: Graph products revisited: tight approximation hardness of induced matching, poset dimension and more. In: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), pp. 1557\u20131576 (2013)","DOI":"10.1137\/1.9781611973105.112"},{"issue":"5","key":"10_CR11","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1016\/j.jctb.2006.12.004","volume":"97","author":"LS Chandran","year":"2007","unstructured":"Chandran, L.S., Sivadasan, N.: Boxicity and treewidth. J. Comb. Theor. Ser. B 97(5), 733\u2013744 (2007)","journal-title":"J. Comb. Theor. Ser. B"},{"issue":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs I. Recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990)","journal-title":"Inf. Comput."},{"key":"10_CR13","unstructured":"Cozzens, M.: Higher and multi-dimensional analogues of interval graphs. Ph.D. thesis, Department of Mathematics, Rutgers University, New Brunswick, NJ (1981)"},{"key":"10_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14279-6","volume-title":"Graph Theory","author":"R Diestel","year":"2010","unstructured":"Diestel, R.: Graph Theory, 4th edn. Springer, Heidelberg (2010)","edition":"4"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-642-32589-2_32","volume-title":"Mathematical Foundations of Computer Science 2012","author":"M Doucha","year":"2012","unstructured":"Doucha, M., Kratochv\u00edl, J.: Cluster vertex deletion: a parameterization between vertex cover and clique-width. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 348\u2013359. Springer, Heidelberg (2012)"},{"key":"10_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Springer, London (2013)"},{"issue":"1","key":"10_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00453-011-9545-y","volume":"64","author":"MR Fellows","year":"2012","unstructured":"Fellows, M.R., Hermelin, D., Rosamond, F.A.: Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications. Algorithmica 64(1), 3\u201318 (2012)","journal-title":"Algorithmica"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-642-28050-4_21","volume-title":"Parameterized and Exact Computation","author":"R Ganian","year":"2012","unstructured":"Ganian, R.: Twin-cover: beyond vertex cover in parameterized algorithmics. In: Marx, D., Rossmanith, P. (eds.) IPEC 2011. LNCS, vol. 7112, pp. 259\u2013271. Springer, Heidelberg (2012)"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Kostochka, A.: Coloring intersection graphs of geometric figures with a given clique number. In: Pach, J. (ed.) Towards a Theory of Geometric Graphs of Contemp. Math., vol. 342, pp. 127\u2013138. Amer. Math. Soc. (2004)","DOI":"10.1090\/conm\/342\/06137"},{"issue":"3","key":"10_CR20","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0166-218X(94)90143-0","volume":"52","author":"J Kratochv\u00edl","year":"1994","unstructured":"Kratochv\u00edl, J.: A special planar satisfiability problem and a consequence of its NP-completeness. Discrete Appl. Math. 52(3), 233\u2013252 (1994)","journal-title":"Discrete Appl. Math."},{"key":"10_CR21","first-page":"301","volume-title":"Recent Progress in Combinatorics","author":"FS Roberts","year":"1969","unstructured":"Roberts, F.S.: On the boxicity and cubicity of a graph. In: Tutte, W.T. (ed.) Recent Progress in Combinatorics, pp. 301\u2013310. Academic Press, New York (1969)"},{"key":"10_CR22","unstructured":"Scheinerman, E.: Intersection classes and multiple intersection parameters. Ph.D. thesis, Princeton University (1984)"},{"key":"10_CR23","volume-title":"Efficient Graph Representations: Fields Institute monographs","author":"J Spinrad","year":"2003","unstructured":"Spinrad, J.: Efficient Graph Representations: Fields Institute monographs. American Mathematical Society, USA (2003)"},{"issue":"1","key":"10_CR24","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. Comb. Theor. Ser. B 40(1), 9\u201320 (1986)","journal-title":"J. Comb. Theor. Ser. B"},{"issue":"3","key":"10_CR25","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. Algebraic Discrete Methods 3(3), 351\u2013358 (1982)","journal-title":"SIAM J. Algebraic Discrete Methods"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12340-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T23:38:39Z","timestamp":1676417919000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12340-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319123394","9783319123400"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12340-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"21 October 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}