{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:24:50Z","timestamp":1743009890698,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662535356"},{"type":"electronic","value":"9783662535363"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-53536-3_11","type":"book-chapter","created":{"date-parts":[[2016,9,27]],"date-time":"2016-09-27T12:39:25Z","timestamp":1474979965000},"page":"121-132","source":"Crossref","is-referenced-by-count":1,"title":["Induced Separation Dimension"],"prefix":"10.1007","author":[{"given":"Emile","family":"Ziedan","sequence":"first","affiliation":[]},{"given":"Deepak","family":"Rajendraprasad","sequence":"additional","affiliation":[]},{"given":"Rogers","family":"Mathew","sequence":"additional","affiliation":[]},{"given":"Martin Charles","family":"Golumbic","sequence":"additional","affiliation":[]},{"given":"J\u00e9r\u00e9mie","family":"Dusart","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,28]]},"reference":[{"issue":"1","key":"11_CR1","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1137\/140973013","volume":"29","author":"N Alon","year":"2015","unstructured":"Alon, N., Basavaraju, M., Chandran, L.S., Mathew, R., Rajendraprasad, D.: Separation dimension of bounded degree graphs. SIAM J. Discrete Math. 29(1), 59\u201364 (2015)","journal-title":"SIAM J. Discrete Math."},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/978-3-319-12340-0_7","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M Basavaraju","year":"2014","unstructured":"Basavaraju, M., Chandran, L.S., Golumbic, M.C., Mathew, R., Rajendraprasad, D.: Boxicity and separation dimension. In: Kratsch, D., Todinca, I. (eds.) WG 2014. LNCS, vol. 8747, pp. 81\u201392. Springer, Heidelberg (2014)"},{"key":"11_CR3","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s00453-015-0050-6","volume":"75","author":"M Basavaraju","year":"2015","unstructured":"Basavaraju, M., Chandran, L.S., Golumbic, M.C., Mathew, R., Rajendraprasad, D.: Separation dimension of graphs and hypergraphs. Algorithmica 75, 187\u2013204 (2015)","journal-title":"Algorithmica"},{"key":"11_CR4","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719796","volume-title":"Graph Classes: A Survey","author":"A Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM, Philadelphia (1999)"},{"issue":"3","key":"11_CR5","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1002\/jgt.21734","volume":"75","author":"H Broersma","year":"2014","unstructured":"Broersma, H., Patel, V., Pyatkin, A.: On toughness and Hamiltonicity of $$2K_2$$ -free graphs. J. Graph Theor. 75(3), 244\u2013255 (2014)","journal-title":"J. Graph Theor."},{"issue":"2","key":"11_CR6","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0012-365X(90)90144-7","volume":"81","author":"FRK Chung","year":"1990","unstructured":"Chung, F.R.K., Gy\u00e1rf\u00e1s, A., Tuza, Z., Trotter, W.T.: The maximum number of edges in $$2K_2$$ -free graphs of bounded degree. Discrete Math. 81(2), 129\u2013135 (1990)","journal-title":"Discrete Math."},{"key":"11_CR7","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0167-5060(08)70731-3","volume":"1","author":"V Chv\u00e1tal","year":"1977","unstructured":"Chv\u00e1tal, V., Hammer, P.L.: Aggregation of inequalities in integer programming. Ann. Discret. Math. 1, 145\u2013162 (1977)","journal-title":"Ann. Discret. Math."},{"issue":"1","key":"11_CR8","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/jgt.21795","volume":"78","author":"DG Corneil","year":"2015","unstructured":"Corneil, D.G., Stacho, J.: Vertex ordering characterizations of graphs of bounded asteroidal number. J. Graph Theor. 78(1), 61\u201379 (2015)","journal-title":"J. Graph Theor."},{"key":"11_CR9","first-page":"109","volume":"64","author":"N Eaton","year":"2012","unstructured":"Eaton, N., Faubert, G.: Caterpillar tolerance representations. Bull. Inst. Comb. Appl. 64, 109\u2013117 (2012)","journal-title":"Bull. Inst. Comb. Appl."},{"issue":"2","key":"11_CR10","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0095-8956(92)90023-Q","volume":"56","author":"PC Fishburn","year":"1992","unstructured":"Fishburn, P.C., Trotter, W.T.: Dimensions of hypergraphs. J. Comb. Theor. Ser. B 56(2), 278\u2013295 (1992)","journal-title":"J. Comb. Theor. Ser. B"},{"issue":"5","key":"11_CR11","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0020-0190(00)00025-9","volume":"73","author":"F Gavril","year":"2000","unstructured":"Gavril, F.: Maximum weight independent sets and cliques in intersection graphs of filaments. Inf. Process. Lett. 73(5), 181\u2013188 (2000)","journal-title":"Inf. Process. Lett."},{"key":"11_CR12","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Elsevier, Amsterdam (2004)"},{"key":"11_CR13","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511542985","volume-title":"Tolerance Graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic, M.C., Trenk, A.N.: Tolerance Graphs. Cambridge University Press, Cambridge (2004)"},{"key":"11_CR14","unstructured":"Habib, M., Paul, C., Telle, J.A.: A linear-time algorithm for recognition of catval graphs. In: Eurocomb 2003: European Conference on Combinatorics, Graphs Theory and Applications (2003)"},{"key":"11_CR15","unstructured":"Lov\u00e1sz, L.: Coverings and colorings of hypergraphs. In Proceedings of the 4th Southeastern Conference on Combinatorics, Graph Theory, and Computing, pp. 3\u201312. Utilitas Mathematica Publishing, Winnipeg (1973)"},{"issue":"1","key":"11_CR16","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.dam.2004.07.006","volume":"146","author":"VV Lozin","year":"2005","unstructured":"Lozin, V.V., Mosca, R.: Independent sets in extensions of $$2K_2$$ -free graphs. Discrete Appl. Math. 146(1), 74\u201380 (2005)","journal-title":"Discrete Appl. Math."},{"key":"11_CR17","doi-asserted-by":"crossref","first-page":"161","DOI":"10.4064\/cm-3-2-161-162","volume":"3","author":"J Mycielski","year":"1955","unstructured":"Mycielski, J.: Sur le coloriage des graphes. Colloq. Math. 3, 161\u2013162 (1955)","journal-title":"Colloq. Math."},{"key":"11_CR18","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)"},{"issue":"2","key":"11_CR19","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/j.dam.2004.01.012","volume":"145","author":"JA Telle","year":"2005","unstructured":"Telle, J.A.: Tree-decompositions of small pathwidth. Discrete Appl. Math. 145(2), 210\u2013218 (2005)","journal-title":"Discrete Appl. Math."}],"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-662-53536-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T22:01:39Z","timestamp":1568412099000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53536-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662535356","9783662535363"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53536-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}