{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T22:17:07Z","timestamp":1675117027622},"reference-count":25,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3577,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2003,10]]},"DOI":"10.1016\/s0925-7721(03)00015-4","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:54:49Z","timestamp":1052783689000},"page":"143-171","source":"Crossref","is-referenced-by-count":9,"title":["On finding an empty staircase polygon of largest area (width) in a planar point-set"],"prefix":"10.1016","volume":"26","author":[{"given":"Subhas C.","family":"Nandy","sequence":"first","affiliation":[]},{"given":"Bhargab B.","family":"Bhattacharya","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(03)00015-4_BIB001","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF01840359","article-title":"Geometric applications of a matrix-searching algorithm","volume":"2","author":"Aggarwal","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/S0925-7721(03)00015-4_BIB002","series-title":"Proc. 3rd Annual ACM Symposium on Computational Geometry","first-page":"278","article-title":"Fast algorithm for computing the largest empty rectangle","author":"Aggarwal","year":"1987"},{"key":"10.1016\/S0925-7721(03)00015-4_BIB003","series-title":"Layout Design and Verification, Advances in CAD for VLSI, Vol. 4","first-page":"295","article-title":"Computational geometric algorithms","author":"Asano","year":"1986"},{"key":"10.1016\/S0925-7721(03)00015-4_BIB004","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1137\/0214011","article-title":"Finding extremal polygons","volume":"14","author":"Boyce","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0925-7721(03)00015-4_BIB005","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0020-0190(96)00070-1","article-title":"Widest empty L-shaped corridor","volume":"58","author":"Cheng","year":"1996","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0925-7721(03)00015-4_BIB006","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1137\/0215022","article-title":"Computing the largest empty rectangle","volume":"15","author":"Chazelle","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0925-7721(03)00015-4_BIB007","series-title":"Proc. ACM\/IEEE Int. Conf. on Computer-Aided Design (ICCAD)","first-page":"358","article-title":"Buffer block planning for interconnect-driven floorplanning","author":"Cong","year":"1999"},{"key":"10.1016\/S0925-7721(03)00015-4_BIB008","series-title":"Proc. Asia South Pacific Design Automation Conference","first-page":"97","article-title":"Interconnect delay estimation models for synthesis and design planning","author":"Cong","year":"1999"},{"key":"10.1016\/S0925-7721(03)00015-4_BIB009","series-title":"Proc. Int. Symp. on Physical Design","first-page":"192","article-title":"Closed form solution to simultaneous buffer insertion\/sizing and wire sizing","author":"Chu","year":"1997"},{"key":"10.1016\/S0925-7721(03)00015-4_BIB010","series-title":"Proc. 9th Int. Conf. on VLSI Design","first-page":"43","article-title":"Channel routing in Manhattan-diagonal model","author":"Das","year":"1996"},{"key":"10.1016\/S0925-7721(03)00015-4_BIB011","series-title":"Proc. 11th Int. Conf. on VLSI Design","first-page":"65","article-title":"Routing through a staircase in Manhattan-diagonal model","author":"Das","year":"1998"},{"issue":"2","key":"10.1016\/S0925-7721(03)00015-4_BIB012","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1145\/544536.544537","article-title":"Monotone bipartitioning problem in a planar point set with applications to VLSI","volume":"7","author":"Dasgupta","year":"2002","journal-title":"ACM Trans. Design Automation of Electronic Systems (TODAES)"},{"key":"10.1016\/S0925-7721(03)00015-4_BIB013","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1109\/3468.983405","article-title":"Searching networks with unrestricted arc costs","volume":"31","author":"Dasgupta","year":"2001","journal-title":"IEEE Trans. Systems Man Cybernat. Part A"},{"key":"10.1016\/S0925-7721(03)00015-4_BIB014","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0925-7721(03)00015-4_BIB015","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0925-7721(95)00022-2","article-title":"On a class of O(n2) problems in computational geometry","volume":"5","author":"Gajentaan","year":"1995","journal-title":"Computational Geometry"},{"key":"10.1016\/S0925-7721(03)00015-4_BIB016","series-title":"Proc. Int. Conf. on Computer-Aided Design (ICCAD)","first-page":"184","article-title":"Channel routing order for building-block layout with rectilinear modules","author":"Guruswamy","year":"1988"},{"key":"10.1016\/S0925-7721(03)00015-4_BIB017","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1109\/TCAD.1983.1270047","article-title":"Order of channels for safe routing and optimal compaction of routing area","volume":"CAD-2","author":"Kajitani","year":"1983","journal-title":"IEEE Trans. Computer-Aided Design"},{"key":"10.1016\/S0925-7721(03)00015-4_BIB018","series-title":"Proc. Int. Conf. on VLSI Design","first-page":"59","article-title":"Partitioning VLSI floorplans by staircase channels for global routing","author":"Majumder","year":"1998"},{"key":"10.1016\/S0925-7721(03)00015-4_BIB019","series-title":"Proc. Int. Symp. on Circuits and Systems (ISCAS), Vol. 5","first-page":"395","article-title":"Area(Number)-balanced hierarchy of staircase channels with minimum crossing nets","author":"Majumder","year":"2001"},{"key":"10.1016\/S0925-7721(03)00015-4_BIB020","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0166-218X(84)90124-0","article-title":"On the maximum empty rectangle problem","volume":"8","author":"Naamad","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0925-7721(03)00015-4_BIB021","series-title":"Proc. 10th. International Conference on Foundation of Software Technology and Theoretical Computer Science","first-page":"255","article-title":"Efficient algorithms for identifying all maximal isothetic empty rectangles in VLSI layout design","volume":"472","author":"Nandy","year":"1990"},{"key":"10.1016\/S0925-7721(03)00015-4_BIB022","series-title":"Computational Morphology","first-page":"137","article-title":"Orthoconvexity and its generalizations","author":"Rawlins","year":"1988"},{"key":"10.1016\/S0925-7721(03)00015-4_BIB023","series-title":"Algorithms for VLSI Physical Design Automation","author":"Sherwani","year":"1999"},{"key":"10.1016\/S0925-7721(03)00015-4_BIB024","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1109\/43.920700","article-title":"Routability-driven repeater block planning for interconnect-centric floorplanning","volume":"20","author":"Sarkar","year":"2001","journal-title":"IEEE Trans. Computer-Aided Design"},{"key":"10.1016\/S0925-7721(03)00015-4_BIB025","series-title":"Proc Int. Conf. on Computer Design (ICCD)","first-page":"524","article-title":"The cycle structure of nonslicible floorplans and a unified algorithm for feasible routing order","author":"Sur-Kolay","year":"1991"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772103000154?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772103000154?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T16:52:01Z","timestamp":1553187121000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772103000154"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["S0925772103000154"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(03)00015-4","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}