{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T15:55:43Z","timestamp":1762271743893},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401039"},{"type":"electronic","value":"9783642401046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40104-6_29","type":"book-chapter","created":{"date-parts":[[2013,7,11]],"date-time":"2013-07-11T01:36:30Z","timestamp":1373506590000},"page":"328-340","source":"Crossref","is-referenced-by-count":12,"title":["Approximation Algorithms for B 1-EPG Graphs"],"prefix":"10.1007","author":[{"given":"Dror","family":"Epstein","sequence":"first","affiliation":[]},{"given":"Martin Charles","family":"Golumbic","sequence":"additional","affiliation":[]},{"given":"Gila","family":"Morgenstern","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.disc.2011.10.005","volume":"312","author":"A. Asinowski","year":"2012","unstructured":"Asinowski, A., Ries, B.: Some properties of edge intersection graphs of single bend paths on a\u00a0grid. Discrete Mathematics\u00a0312, 427\u2013440 (2012)","journal-title":"Discrete Mathematics"},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"3174","DOI":"10.1016\/j.dam.2009.06.015","volume":"157","author":"A. Asinowski","year":"2009","unstructured":"Asinowski, A., Suk, A.: Edge intersection graphs of systems of grid paths with bounded number of bends. Discrete Applied Mathematics\u00a0157, 3174\u20133180 (2009)","journal-title":"Discrete Applied Mathematics"},{"key":"29_CR3","first-page":"1","volume":"12","author":"T. Biedl","year":"2010","unstructured":"Biedl, T., Stern, M.: On edge intersection graphs of k-bend paths in grids. Discrete Mathematics & Theoretical Computer Science (DMTCS)\u00a012, 1\u201312 (2010)","journal-title":"Discrete Mathematics & Theoretical Computer Science (DMTCS)"},{"key":"29_CR4","unstructured":"Cameron, K., Chaplick, S., Hoang, C.T.: Recognizing Edge Intersection Graphs of \n                  \n                    \n                  \n                  $\\llcorner$\n                -Shaped Grid Paths. In: LAGOS 2013 (to appear, 2013)"},{"key":"29_CR5","unstructured":"Cohen, E., Golumbic, M.C., Ries, B.: Characterizations of cographs as intersection graphs of paths on a\u00a0grid (submitted)"},{"key":"29_CR6","volume-title":"Computers and Intractability: a\u00a0Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: a\u00a0Guide to the Theory of NP-completeness. Freeman, San Francisco (1979)"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1137\/0601025","volume":"1","author":"M.R. Garey","year":"1980","unstructured":"Garey, M.R., Johnson, D.S., Miller, G.L., Papadimitriou, C.: The complexity of coloring circular arcs and chords. SIAM. J. on Algebraic and Discrete Methods\u00a01, 216\u2013227 (1980)","journal-title":"SIAM. J. on Algebraic and Discrete Methods"},{"key":"#cr-split#-29_CR8.1","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"#cr-split#-29_CR8.2","unstructured":"Annals of Discrete Mathematics, 2nd edn., vol. 57. Elsevier, Amsterdam (2004)"},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1002\/net.20305","volume":"54","author":"M.C. Golumbic","year":"2009","unstructured":"Golumbic, M.C., Lipshteyn, M., Stern, M.: Edge intersection graphs of single bend paths on a\u00a0grid. Networks\u00a054, 130\u2013138 (2009)","journal-title":"Networks"},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0020-0190(93)90246-6","volume":"45","author":"M.M. Halld\u00f3rsson","year":"1993","unstructured":"Halld\u00f3rsson, M.M.: A\u00a0still better performance guarantee for approximate graph coloring. Information Processing Letters\u00a045, 19\u201323 (1993)","journal-title":"Information Processing Letters"},{"key":"29_CR11","unstructured":"Heldt, D., Knauer, K., Ueckerdt, T.: Edge-intersection graphs of grid paths: the bend-number, Arxiv preprint arXiv:1009.2861, arxiv.org (September 2010)"},{"key":"29_CR12","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.\u00a07256, pp. 458\u2013469. Springer, Heidelberg (2012)"},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/j.dam.2008.08.027","volume":"157","author":"A. Kako","year":"2009","unstructured":"Kako, A., Ono, T., Hirata, T., Halld\u00f3rsson, M.M.: Approximation algorithms for the weighted independent set problem in sparse graphs. Discrete Applied Mathematics\u00a0157, 617\u2013626 (2009)","journal-title":"Discrete Applied Mathematics"},{"key":"29_CR14","first-page":"85","volume":"31","author":"J. Kratochv\u00edl","year":"1990","unstructured":"Kratochv\u00edl, J., Ne\u0161et\u0159il, J.: Independent set and clique problems in intersection-defined classes of graphs. Commentationes Mathematicae Universitatis Carolinae\u00a031, 85\u201393 (1990)","journal-title":"Commentationes Mathematicae Universitatis Carolinae"},{"key":"29_CR15","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0166-218X(93)E0161-Q","volume":"59","author":"J.P. Spinrad","year":"1995","unstructured":"Spinrad, J.P., Sritharan, R.: Algorithms for weakly triangulated graphs. Discrete Appl. Math.\u00a059, 181\u2013191 (1995)","journal-title":"Discrete Appl. Math."},{"key":"29_CR16","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"30","author":"L.G. Valiant","year":"1981","unstructured":"Valiant, L.G.: Universality considerations in VLSI circuits. IEEE Trans. Comput.\u00a030, 135\u2013140 (1981)","journal-title":"IEEE Trans. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40104-6_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T14:21:37Z","timestamp":1557930097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40104-6_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401039","9783642401046"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40104-6_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}