Please use this identifier to cite or link to this item:
http://hdl.handle.net/10263/4770Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Nandy, Subhas C | - |
| dc.contributor.author | Bhattacharya, Bhargab B | - |
| dc.date.accessioned | 2012-11-12T05:55:08Z | - |
| dc.date.available | 2012-11-12T05:55:08Z | - |
| dc.date.issued | 2003-10 | - |
| dc.identifier.citation | Computational Geometry,v.26, no. 2, p. 143–171 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10263/4770 | - |
| dc.language.iso | en | en_US |
| dc.subject | Geometric graph theory | en_US |
| dc.subject | Permutation graphs | en_US |
| dc.subject | Algorithms | en_US |
| dc.subject | Complexity | en_US |
| dc.title | On finding an empty stair case polygon of largest area (width) in a planar point-set | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | Mathematics and Statistics | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| On finding an empty staircase polygon of largest area (width).pdf | 1.63 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.