DiSC - Author Index

Takeshi Tokuyama

Online DBLP entries are available for Takeshi Tokuyama and the following references. (The DiSC DBLP references below have been taken from the Novemember 1998 DBLP.)

Tetsuo Asano , Naoki Katoh , Hisao Tamaki , Takeshi Tokuyama: Convertibility among Grid Filling Curves. ISAAC 1998 : 307-316

Yasuhiko Morimoto , Takeshi Fukuda , Hirofumi Matsuzawa , Takeshi Tokuyama, Kunikazu Yoda : Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases. VLDB 1998 : 380-391

Hisao Tamaki , Takeshi Tokuyama: A Characterization of Planar Graphs by Pseudo-Line Arrangements. ISAAC 1997 : 133-142

Kunikazu Yoda , Takeshi Fukuda , Yasuhiko Morimoto , Shinichi Morishita , Takeshi Tokuyama: Computing Optimized Rectilinear Regions for Association Rules. KDD 1997 : 96-103

Tetsuo Asano , Naoki Katoh , Hisao Tamaki , Takeshi Tokuyama: Covering Points in the Plane by k -Tours: Towards a Polynomial Time Approximation Scheme for General k . STOC 1997 : 275-283

Tatsuya Akutsu , Hisao Tamaki , Takeshi Tokuyama: Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets. Symposium on Computational Geometry 1997 : 314-323

Takeshi Tokuyama: Orthogonal Queries in Segments. Algorithmica 18 (2): 229-245 (1997)

Takeshi Fukuda , Yasuhiko Morimoto , Shinichi Morishita , Takeshi Tokuyama: Interval Finding and Its Application to Data Mining. ISAAC 1996 : 55-64

Takeshi Fukuda , Yasuhiko Morimoto , Shinichi Morishita , Takeshi Tokuyama: Mining Optimized Association Rules for Numeric Attributes. PODS 1996 : 182-191

Takeshi Fukuda , Yasuhiko Morimoto , Shinichi Morishita , Takeshi Tokuyama: Data Mining Using Two-Dimensional Optimized Accociation Rules: Scheme, Algorithms, and Visualization. SIGMOD Conf. 1996 : 13-23

Takeshi Fukuda , Yasuhiko Morimoto , Shinichi Morishita , Takeshi Tokuyama: SONAR: System for Optimized Numeric AssociationRules. SIGMOD Conf. 1996 : 553

Tetsuo Asano , Danny Z. Chen , Naoki Katoh , Takeshi Tokuyama: Polynomial-Time Solutions to Image Segmentation. SODA 1996 : 104-113

Yuichi Asahiro , Kazuo Iwama , Hisao Tamaki , Takeshi Tokuyama: Greedily Finding a Dense Subgraph. SWAT 1996 : 136-148

Takeshi Fukuda , Yasuhiko Morimoto , Shinichi Morishita , Takeshi Tokuyama: Constructing Efficient Decision Trees by Using Optimized Numeric Association Rules. VLDB 1996 : 146-155

Hisao Tamaki , Takeshi Tokuyama: How to Cut Pseudo-Parabolas into Segments. Symposium on Computational Geometry 1995 : 230-237

Alok Aggarwal , Takeshi Tokuyama: An Improved Algorithm for the Traveler's Problem. J. Algorithms 19 (2): 318-330 (1995)

Takeshi Tokuyama, Jun Nakano : Efficient Algorithms for the Hitchcock Transportation Problem. SIAM J. Comput. 24 (3): 563-578 (1995)

Tetsuo Asano , Naoki Katoh , Takeshi Tokuyama: A Unified Scheme for Detecting Fundamental Curves in Binary Edge Images. ESA 1994 : 215-226

Shu Tezuka , Takeshi Tokuyama: A Note on Polynomial Arithmetic Analogue of Halton Sequences. TOMACS 4 (3): 279-284 (1994)

Alok Aggerwal , Takeshi Tokuyama: Consecutive Interval Query and Dynamic Programming on Intervals. ISAAC 1993 : 466-475

Alok Aggerwal , Takeshi Tokuyama: An Improved Algorithm for the Traveler's Problem. ISAAC 1993 : 476-485

Alok Aggarwal , Baruch Schieber , Takeshi Tokuyama: Finding a Minimum Weight K-Link Path in Graphs with Monge Property and Applications. Symposium on Computational Geometry 1993 : 189-197

Tetsuo Asano , Takeshi Tokuyama: Algorithms for Projecting Points To Give the Most Uniform Distribution with Applications to Hashing. Algorithmica 9 (6): 572-590 (1993)

Kazumiti Numata , Takeshi Tokuyama: Splitting a Configuration in a Simplex. Algorithmica 9 (6): 649-668 (1993)

Naoki Katoh , Takeshi Tokuyama, Kazuo Iwano : On Minimum and Maximum Spanning Trees of Linearly Moving Points. FOCS 1992 : 396-405

Takeshi Tokuyama, Jun Nakano : Geometric Algorithms for a Minimum Cost Assignment Problem. Symposium on Computational Geometry 1991 : 262-271

Tetsuo Asano , Leonidas J. Guibas , Takeshi Tokuyama: Walking on an Arrangement Topologically. Symposium on Computational Geometry 1991 : 297-306

Hiromi Aonuma , Hiroshi Imai , Keiko Imai , Takeshi Tokuyama: Maximin Location of Convex Objects in a Polygon and Related Dynamic Voronoi Diagrams. Symposium on Computational Geometry 1990 : 225-234

DBLP: Copyright ©1999 by Michael Ley (ley@uni-trier.de).