{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T02:00:17Z","timestamp":1725847217096},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319286839"},{"type":"electronic","value":"9783319286846"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-28684-6_14","type":"book-chapter","created":{"date-parts":[[2016,1,12]],"date-time":"2016-01-12T10:32:03Z","timestamp":1452594723000},"page":"158-169","source":"Crossref","is-referenced-by-count":2,"title":["On Independent Set on B1-EPG Graphs"],"prefix":"10.1007","author":[{"given":"M.","family":"Bougeret","sequence":"first","affiliation":[]},{"given":"S.","family":"Bessy","sequence":"additional","affiliation":[]},{"given":"D.","family":"Gon\u00e7alves","sequence":"additional","affiliation":[]},{"given":"C.","family":"Paul","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,13]]},"reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"BS Baker","year":"1994","unstructured":"Baker, B.S.: Approximation algorithms for np-complete problems on planar graphs. J. ACM 41(1), 153\u2013180 (1994)","journal-title":"J. ACM"},{"issue":"1","key":"14_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539703437843","volume":"36","author":"R Bar-Yehuda","year":"2006","unstructured":"Bar-Yehuda, R., Halld\u00f3rsson, M.M., Naor, J.S., Shachnai, H., Shapira, I.: Scheduling split intervals. SIAM J. Comput. 36(1), 1\u201315 (2006)","journal-title":"SIAM J. Comput."},{"key":"14_CR3","unstructured":"Bougeret, M., Bessy, S., Gon\u00e7alves, D., Paul, C.: On independent set on b1-epg graphs (2015). CoRR \n                    arXiv:1510.00598"},{"key":"14_CR4","unstructured":"Cameron, K., Chaplick, S., Ho\u00e0ng, C.T.: Edge intersection graphs of l-shaped paths in grids (2012). CoRR \n                    arxiv:1204.5702"},{"issue":"2","key":"14_CR5","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s00454-012-9417-5","volume":"48","author":"TM Chan","year":"2012","unstructured":"Chan, T.M., Har-Peled, S.: Approximation algorithms for maximum independent set of pseudo-disks. Discrete Comput. Geom. 48(2), 373\u2013392 (2012)","journal-title":"Discrete Comput. Geom."},{"key":"14_CR6","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\n          \n                    \n                      \n                    \n                    $$_\\text{1 }$$\n                    \n                      \n                        \n                          \n                            \n                            1\n                          \n                          \n                        \n                      \n                    \n                  -EPG graphs. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 328\u2013340. Springer, Heidelberg (2013)"},{"key":"14_CR7","first-page":"1","volume":"71","author":"MC Francis","year":"2013","unstructured":"Francis, M.C., Gon\u00e7alves, D., Ochem, P.: The maximum clique problem in multiple interval graphs. Algorithmica 71, 1\u201325 (2013)","journal-title":"Algorithmica"},{"issue":"3","key":"14_CR8","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1002\/net.20305","volume":"54","author":"MC Golumbic","year":"2009","unstructured":"Golumbic, M.C., Lipshteyn, M., Stern, M.: Edge intersection graphs of single bend paths on a grid. Netw. 54(3), 130\u2013138 (2009)","journal-title":"Netw."},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/978-3-642-29344-3_39","volume-title":"LATIN 2012: Theoretical Informatics","author":"D Heldt","year":"2012","unstructured":"Heldt, D., Knauer, K., Ueckerdt, T.: On the bend-number of planar and outerplanar graphs. In: Fern\u00e1ndez-Baca, D. (ed.) LATIN 2012. LNCS, vol. 7256, pp. 458\u2013469. Springer, Heidelberg (2012)"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.dam.2013.10.035","volume":"167","author":"D Heldt","year":"2014","unstructured":"Heldt, D., Knauer, K., Ueckerdt, T.: Edge-intersection graphs of grid paths: the bend-number. Discrete Appl. Math. 167, 144\u2013162 (2014)","journal-title":"Discrete Appl. Math."},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"4253","DOI":"10.1016\/j.tcs.2010.09.001","volume":"411","author":"M Jiang","year":"2010","unstructured":"Jiang, M.: On the parameterized complexity of some optim ization problems related to multiple-interval graphs. Theor. Comput. Sci. 411, 4253\u20134262 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"14_CR12","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/s00453-012-9671-1","volume":"68","author":"F Kammer","year":"2014","unstructured":"Kammer, F., Tholey, T.: Approximation algorithms for intersection graphs. Algorithmica 68(2), 312\u2013336 (2014)","journal-title":"Algorithmica"},{"key":"14_CR13","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"2003","unstructured":"Papadimitriou, C.H.: Computational Complexity. John Wiley and Sons Ltd., Chichester (2003)"},{"key":"14_CR14","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer Science & Business Media, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-28684-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T09:40:25Z","timestamp":1559382025000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-28684-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319286839","9783319286846"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-28684-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}