 | 2009 |
|---|
| 9 |       | Naoki Katoh,
Shin-ichi Tanigawa:
A proof of the molecular conjecture.
Symposium on Computational Geometry 2009: 296-305 |
| 2008 |
|---|
| 8 | | Yongding Zhu,
Jinhui Xu,
Yang Yang,
Naoki Katoh,
Shin-ichi Tanigawa:
Geometric Spanner of Objects under L1 Distance.
COCOON 2008: 395-404 |
| 7 | | Naoki Katoh,
Shin-ichi Tanigawa:
Fast enumeration algorithms for non-crossing geometric graphs.
Symposium on Computational Geometry 2008: 328-337 |
| 6 | | David Avis,
Naoki Katoh,
Makoto Ohsaki,
Ileana Streinu,
Shin-ichi Tanigawa:
Enumerating Constrained Non-crossing Minimally Rigid Frameworks.
Discrete & Computational Geometry 40(1): 31-46 (2008) |
| 2007 |
|---|
| 5 | | Naoki Katoh,
Shin-ichi Tanigawa:
Enumerating Constrained Non-crossing Geometric Spanning Trees.
COCOON 2007: 243-253 |
| 2006 |
|---|
| 4 | | Shin-ichi Tanigawa,
Naoki Katoh:
Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge Lengths.
AAIM 2006: 161-172 |
| 3 | | David Avis,
Naoki Katoh,
Makoto Ohsaki,
Ileana Streinu,
Shin-ichi Tanigawa:
Enumerating Non-crossing Minimally Rigid Frameworks.
COCOON 2006: 205-215 |
| 2 | | Shin-ichi Tanigawa,
Naoki Katoh:
Finding a Triangular Mesh with a Constant Number of Different Edge Lengths.
IEICE Transactions 89-D(8): 2364-2371 (2006) |
| 2005 |
|---|
| 1 | | Shin-ichi Tanigawa,
Naoki Katoh:
Finding a triangular mesh with a constant number of different edge lengths.
CCCG 2005: 274-277 |
