{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T20:44:34Z","timestamp":1725914674820},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319687049"},{"type":"electronic","value":"9783319687056"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-68705-6_11","type":"book-chapter","created":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T06:06:22Z","timestamp":1509516382000},"page":"140-152","source":"Crossref","is-referenced-by-count":1,"title":["Computing Maximum Cliques in $$B_2$$ -EPG Graphs"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Bousquet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Heinrich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,2]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Alc\u00f3n, L., Bonomo, F., Dur\u00e1n, G., Gutierrez, M., Mazzoleni, M.P., Ries, B., Valencia-Pabon, M.: On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid. Discrete Appl. Math. (2016)","DOI":"10.1016\/j.endm.2015.07.042"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Asinowski, A., Ries, B.: Some properties of edge intersection graphs of single-bend paths on a grid. Discrete Math. 312(2), 427\u2013440 (2012)","DOI":"10.1016\/j.disc.2011.10.005"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Flavia, B., Mazzoleni, M.P., Maya, S.: Clique coloring -EPG graphs. Discrete Math. 340(5), 1008\u20131011 (2017)","DOI":"10.1016\/j.disc.2017.01.019"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-319-28684-6_14","volume-title":"Approximation and Online Algorithms","author":"M Bougeret","year":"2015","unstructured":"Bougeret, M., Bessy, S., Gon\u00e7alves, D., Paul, C.: On independent set on B1-EPG graphs. In: Sanit\u00e0, L., Skutella, M. (eds.) WAOA 2015. LNCS, vol. 9499, pp. 158\u2013169. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-28684-6_14"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Bousquet, N., Heinrich, M.: Computing maximum cliques in b_2-epg graphs. arXiv preprint arXiv:1706.06685 (2017)","DOI":"10.1007\/978-3-319-68705-6_11"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Cameron, K., Chaplick, S., Ho\u00e1ng, C.T.: Edge intersection graphs of -shaped paths in grids. Discrete Appl. Math. 210, 185\u2013194 (2016). LAGOS 2013: Seventh Latin-American Algorithms, Graphs, and Optimization Symposium, Playa del Carmen, M\u00e9xico (2013)","DOI":"10.1016\/j.dam.2015.01.039"},{"key":"11_CR7","unstructured":"Cohen, E., Golumbic, M.C., Ries, B.: Characterizations of cographs as intersection graphs of paths on a grid. Discrete Appl. Math. 178, 46\u201357 (2014)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-642-40104-6_29","volume-title":"Algorithms and Data Structures","author":"D Epstein","year":"2013","unstructured":"Epstein, D., Golumbic, M.C., Morgenstern, G.: Approximation algorithms for $$B_1$$ -EPG graphs. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 328\u2013340. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40104-6_29"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Francis, M.C., Gon\u00e7alves, D., Ochem, P.: The maximum clique problem in multiple interval graphs. Algorithmica 71(4), 812\u2013836 (2015)","DOI":"10.1007\/s00453-013-9828-6"},{"key":"11_CR10","unstructured":"Francis, M.C., Lahiri, A.: VPG and EPG bend-numbers of Halin graphs. Discrete Appl. Math. 215, 95\u2013105 (2016)"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C., Lipshteyn, M., Stern, M.: Edge intersection graphs of single bend paths on a grid. Networks 54(3), 130\u2013138 (2009)","DOI":"10.1002\/net.20305"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Gy\u00e1rf\u00e1s, A., Lehel, J.: Covering and coloring problems for relatives of intervals. Discrete Math. 55(2), 167\u2013180 (1985)","DOI":"10.1016\/0012-365X(85)90045-7"},{"key":"11_CR13","unstructured":"Heldt, D., Knauer, K., Ueckerdt, T.: Edge-intersection graphs of grid paths: the bend-number. Discrete Appl. Math. 167, 144\u2013162 (2014)"},{"key":"11_CR14","unstructured":"Heldt, D., Knauer, K., Ueckerdt, T.: On the bend-number of planar and outerplanar graphs. Discrete Appl. Math. 179, 109\u2013119 (2014)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-662-53536-3_18","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M Pergel","year":"2016","unstructured":"Pergel, M., Rz\u0105\u017cewski, P.: On edge intersection graphs of paths with 2 bends. In: Heggernes, P. (ed.) WG 2016. LNCS, vol. 9941, pp. 207\u2013219. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53536-3_18"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Trotter, W.T., Harary, F.: On double and multiple interval graphs. J. Graph Theory 3(3), 205\u2013211 (1979)","DOI":"10.1002\/jgt.3190030302"}],"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-319-68705-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T12:11:30Z","timestamp":1570277490000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68705-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319687049","9783319687056"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68705-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}