{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:46:00Z","timestamp":1725497160035},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540748380"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74839-7_15","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T14:55:58Z","timestamp":1196952958000},"page":"151-153","source":"Crossref","is-referenced-by-count":2,"title":["Approximation Algorithms for Geometric Intersection Graphs"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Jansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0925-7721(98)00028-5","volume":"11","author":"P.K. Agarwal","year":"1998","unstructured":"Agarwal, P.K., van Kreveld, M., Suri, S.: Label placement by maximum independent set in rectangles. Computational Geometry\u00a011, 209\u2013218 (1998)","journal-title":"Computational Geometry"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1006\/jcss.1998.1605","volume":"58","author":"S. Arora","year":"1999","unstructured":"Arora, S., Karger, D., Karpinski, M.: Polynomial time approximation schemes for dense instances of NP-hard problems. Journal of Computer and System Science\u00a058, 193\u2013210 (1999)","journal-title":"Journal of Computer and System Science"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B. Baker","year":"1994","unstructured":"Baker, B.: Approximation algorithms for NP-complete problems on planar graphs. Journal of the ACM\u00a041, 153\u2013180 (1994)","journal-title":"Journal of the ACM"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"B.N. Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Mathematics\u00a086, 165\u2013177 (1990)","journal-title":"Discrete Mathematics"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/j.tcs.2007.02.013","volume":"377","author":"J. Diaz","year":"2007","unstructured":"Diaz, J., Kaminski, M.: Max-CUT and MAX-BISECTION are NP-hard on unit disk graphs. Theoretical Computer Science\u00a0377, 271\u2013276 (2007)","journal-title":"Theoretical Computer Science"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1137\/S0097539702402676","volume":"34","author":"T. Erlebach","year":"2005","unstructured":"Erlebach, T., Jansen, K., Seidel, E.: Polynomial-time approximation schemes for geometric graphs. SIAM Journal on Computing\u00a034, 1302\u20131323 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.J.: Some simplified NP-complete graph problems. Theoretical Computer Science\u00a01, 237\u2013267 (1976)","journal-title":"Theoretical Computer Science"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1137\/0204019","volume":"4","author":"F. Hadlock","year":"1975","unstructured":"Hadlock, F.: Finding a maximum cut of a planar graph in polynomial time. SIAM Journal on Computing\u00a04, 221\u2013225 (1975)","journal-title":"SIAM Journal on Computing"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"W.K. Hale","year":"1980","unstructured":"Hale, W.K.: Frequency assignment: theory and applications. Proceedings of the IEEE\u00a068, 1497\u20131514 (1980)","journal-title":"Proceedings of the IEEE"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0012-365X(00)00204-1","volume":"229","author":"P. Hlineny","year":"2001","unstructured":"Hlineny, P., Kratochvil, J.: Representing graphs by disks and balls. Discrete Mathematics\u00a0229, 101\u2013124 (2001)","journal-title":"Discrete Mathematics"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1006\/jagm.1997.0903","volume":"26","author":"H.B. Hunt III","year":"1998","unstructured":"Hunt III, H.B., Marathe, M.V., Radhakrishnan, V., Ravi, S.S., Rosenkrantz, D.J., Stearns, R.E.: NC-approximation schemes for NP-and PSPACE-hard problems for geometric graphs. Journal of Algorithms\u00a026, 238\u2013274 (1998)","journal-title":"Journal of Algorithms"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1137\/S009753970139567X","volume":"35","author":"K. Jansen","year":"2005","unstructured":"Jansen, K., Karpinski, M., Lingas, A., Seidel, E.: Polynomial time approximation schemes for max-bisection on planar and geometric graphs. SIAM Journal on Computing\u00a035, 110\u2013119 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"15_CR13","first-page":"141","volume":"88","author":"P. Koebe","year":"1936","unstructured":"Koebe, P.: Kontaktprobleme der konformen Abbildung, Berichte\u00fcber die Verhandlungen der S\u00e4chsischen Akademie der Wissenschaften. Leipzig, Math.-Phys. Klasse\u00a088, 141\u2013164 (1936)","journal-title":"Leipzig, Math.-Phys. Klasse"},{"key":"15_CR14","unstructured":"Jerrum, M.: private communication (2000)"},{"key":"15_CR15","unstructured":"Malesinska, E.: Graph-theoretical models for frequency assignment problems, PhD thesis, Technische Universit\u00e4t Berlin (1997)"},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/net.3230250205","volume":"25","author":"M.V. Marathe","year":"1995","unstructured":"Marathe, M.V., Breu, H., Hunt III, H.B., Ravi, S.S., Rosenkrantz, D.J.: Simple heuristics for unit disk graphs. Networks\u00a025, 59\u201368 (1995)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74839-7_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:42:31Z","timestamp":1619520151000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74839-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540748380"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74839-7_15","relation":{},"subject":[]}}