{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T02:53:44Z","timestamp":1725677624579},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642296994"},{"type":"electronic","value":"9783642297007"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29700-7_30","type":"book-chapter","created":{"date-parts":[[2012,4,28]],"date-time":"2012-04-28T12:25:56Z","timestamp":1335615956000},"page":"327-338","source":"Crossref","is-referenced-by-count":0,"title":["In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs"],"prefix":"10.1007","author":[{"given":"Minati","family":"De","sequence":"first","affiliation":[]},{"given":"Subhas C.","family":"Nandy","sequence":"additional","affiliation":[]},{"given":"Sasanka","family":"Roy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","unstructured":"Breu, H.: Algorithmic Aspects of Constrained Unit Disk Graphs, Ph.D. Thesis, University of British Columbia, Canada, Tech. Report No. TR-96-15 (1996)"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Bronnimann, H., Chan, T.M., Chen, E.Y.: Towards in-place geometric algorithms and data structures. In: Symp. on Computational Geometry, pp. 239\u2013246 (2004)","DOI":"10.1145\/997817.997854"},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02238188","volume":"36","author":"B.M. Chazelle","year":"1986","unstructured":"Chazelle, B.M., Lee, D.T.: On a circle placement problem. Computing\u00a036, 1\u201316 (1986)","journal-title":"Computing"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1016\/j.comgeo.2010.04.005","volume":"43","author":"T.M. Chan","year":"2010","unstructured":"Chan, T.M., Chen, E.Y.: Optimal in-place and cache-oblivious algorithms for 3-d convex hulls and 2-d segment intersection. Comput. Geom.\u00a043, 636\u2013646 (2010)","journal-title":"Comput. Geom."},{"key":"30_CR5","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 graph. Discrete Mathematics\u00a086, 165\u2013177 (1990)","journal-title":"Discrete Mathematics"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press (1980)","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/0196-6774(83)90012-3","volume":"4","author":"H. Imai","year":"1983","unstructured":"Imai, H., Asano, T.: Finding the connected components and maximum clique of an intersection graph of rectangles in the plane. Journal of Algorithms\u00a04, 310\u2013323 (1983)","journal-title":"Journal of Algorithms"},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/0196-6774(82)90021-9","volume":"3","author":"D.T. Lee","year":"1982","unstructured":"Lee, D.T., Preparata, F.P.: An improved algorithm for the rectangle enclosure problem. Journal of Algorithms\u00a03, 218\u2013224 (1982)","journal-title":"Journal of Algorithms"},{"key":"30_CR9","unstructured":"Lee, D.T.: Maximum clique problem of rectangle graphs. In: Preparata, F.P. (ed.) Advances in Computing Research, pp. 91\u2013107. JAI Press (1983)"},{"issue":"8","key":"30_CR10","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0898-1221(95)00029-X","volume":"29","author":"S.C. Nandy","year":"1995","unstructured":"Nandy, S.C., Bhattacharya, B.B.: A unified algorithm for finding maximum and minimum point enclosing rectangles and cuboids. Computers and Mathematics with Applications\u00a029(8), 45\u201361 (1995)","journal-title":"Computers and Mathematics with Applications"},{"key":"30_CR11","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry - an Introduction. Springer (1990)"},{"key":"30_CR12","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C.H. Papadimitriou","year":"1997","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Prentice Hall of India Pvt. Ltd., New Delhi (1997)"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29700-7_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:14:06Z","timestamp":1620126846000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29700-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642296994","9783642297007"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29700-7_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}