{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:47:55Z","timestamp":1725493675256},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405344"},{"type":"electronic","value":"9783540450719"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45071-8_7","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T04:04:43Z","timestamp":1193457883000},"page":"50-56","source":"Crossref","is-referenced-by-count":0,"title":["Subexponential-Time Algorithms for Maximum Independent Set and Related Problems on Box Graphs"],"prefix":"10.1007","author":[{"given":"Andrzej","family":"Lingas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Wahlen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"issue":"3\u20134","key":"7_CR1","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0925-7721(98)00028-5","volume":"11","author":"P.K. Agarwal","year":"1998","unstructured":"P.K. Agarwal, M. van Kreveld and S. Suri, Label Placement by Maximum Independent Set in Rectangles, Computational Geometry: Theory and Applications, 11(3\u20134), pp. 209\u2013218, 1998.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"7_CR2","first-page":"296","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"M. Bern","year":"1996","unstructured":"M. Bern and D. Eppstein. Approximation Algorithms for Geometric Problems. In D. S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems, chapter 8, pages 296\u2013339. PWS Publishing Company, Boston, MA, 1996."},{"issue":"2","key":"7_CR3","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/BF01994876","volume":"32","author":"R. Boppana","year":"1992","unstructured":"R. Boppana and M. M. Halld\u00f3rsson. Approximating maximum independent sets by excluding subgraphs. BIT 32(2): 180\u2013196, 1992.","journal-title":"BIT"},{"key":"7_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, New York, NY, 1979."},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, R. Paturi and F. Zane. Which Problems Have Strongly Exponential Complexity? Proceedings 1998 Annual IEEE Symposium on Foundations of Computer Science, pp 653\u2013663, 1998.","DOI":"10.1109\/SFCS.1998.743516"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"G. Miller. Finding small simple cycle separators for 2-connected planar graphs. Proc. 16th Ann. ACM Symp. on Theory of Computing (1984) pp. 376\u2013382.","DOI":"10.1145\/800057.808703"},{"key":"7_CR7","unstructured":"W.D. Smith and N.C. Wormald. Geometric separator theorems. In proc. ACM STOC\u201998."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45071-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T11:03:56Z","timestamp":1551006236000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45071-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405344","9783540450719"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-45071-8_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}