Please use this identifier to cite or link to this item:
http://hdl.handle.net/10263/4947Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Nandy, Subhas C | - |
| dc.contributor.author | Bhattacharya, Bhargab B | - |
| dc.date.accessioned | 2012-11-20T09:48:42Z | - |
| dc.date.available | 2012-11-20T09:48:42Z | - |
| dc.date.issued | 2003 | - |
| dc.identifier.citation | Computational Geometry, v 26, p 143-171 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10263/4947 | - |
| 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 staircase plolygon of largest area (width) in a planer point set | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | Mathematics and Statistics | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 149-OFAES-CGTS-V26-P-143-171.pdf | 7.09 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.