DSpace Repository
On finding an empty staircase plolygon of largest area (width) in a planer point set
- DSpace Home
- →
- Scientific Contributions of ISI
- →
- Mathematics and Statistics
- →
- View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
| 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 |
