| |
 |      |
                                            |
Note: Links lead to the DBLP on the Web. Takeshi Tokuyama 58 Hiroshi Kawazoe , Tetsuo Shibuya , Takeshi Tokuyama: Optimal Online Algorithms for an Electronic Commerce Money Distribution System. Algorithmica 33 (3): 287-299 (2002) 57 Naoki Katoh , Takeshi Tokuyama: K-Levels of Concave Surfaces. Discrete & Computational Geometry 27 (4): 567-584 (2002) 56 Kunihiko Sadakane , Nadia Takki-Chebihi , Takeshi Tokuyama: Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence. ICALP 2001 : 166-177 55 Kunihiko Sadakane , Norito Sugawara , Takeshi Tokuyama: Quantum Algorithms for Intersection and Proximity Problems. ISAAC 2001 : 148-159 54 Tetsuo Asano , Takeshi Tokuyama: How to Color a Checkerboard with a Given Distribution - Matrix Rounding Achieving Low 2×2-Discrepancy. ISAAC 2001 : 636-648 53 Takeshi Tokuyama: Minimax parametric optimization problems and multi-dimensional parametric searching. STOC 2001 : 75-83 52 Naoki Katoh , Takeshi Tokuyama: Notes on computing peaks in k-levels and parametric spanning trees. Symposium on Computational Geometry 2001 : 241-248 51 Tetsuo Asano , Naoki Katoh , Takeshi Tokuyama: A unified scheme for detecting fundamental curves in binary edge images. Computational Geometry 18 (2): 73-93 (2001) 50 Tetsuo Asano , Danny Z. Chen , Naoki Katoh , Takeshi Tokuyama: Efficient Algorithms for Optimization-Based Image Segmentation. International Journal of Computational Geometry and Applications 11 (2): 145-166 (2001) 49 Takeshi Fukuda , Yasuhiko Morimoto , Shinichi Morishita , Takeshi Tokuyama: Data Mining with optimized two-dimensional association rules. TODS 26 (2): 179-213 (2001) 48 Shin-Ichi Nakano , Takao Nishizeki , Takeshi Tokuyama, Shuhei Watanabe : Labeling Points with Rectangles of Various Shapes. Graph Drawing 2000 : 91-102 47 Takeshi Tokuyama: Efficient Algorithms for the Minimum Diameter Bridge Problem. JCDCG 2000 : 362-369 46 Tetsuo Asano , Tomomi Matsui , Takeshi Tokuyama: On the Complexities of the Optimal Rounding Problems of Sequences and Matrices. SWAT 2000 : 476-489 45 Yuichi Asahiro , Kazuo Iwama , Hisao Tamaki , Takeshi Tokuyama: Greedily Finding a Dense Subgraph. J. Algorithms 34 (2): 203-221 (2000) 44 Tetsuo Asano , Tomomi Matsui , Takeshi Tokuyama: Optimal Roundings of Sequences and Matrices. Nordic Journal of Computing 7 (3): 241- (2000) 43 Takao Asano , Hiroshi Imai , D. T. Lee , Shin-Ichi Nakano , Takeshi Tokuyama: Computing and Combinatorics, 5th Annual International Conference, COCOON '99, Tokyo, Japan, July 26-28, 1999, Proceedings. Springer 1999 42 Katsuki Fujisawa , Yukinobu Hamuro , Naoki Katoh , Takeshi Tokuyama, Katsutoshi Yada : Approximation of Optimal Two-Dimensional Association Rules for Categorical Attributes Using Semidefinite Programming. Discovery Science 1999 : 148-159 41 Naoki Katoh , Takeshi Tokuyama: Lovász's Lemma for the Three-Dimensional K-Level of Concave Surfaces and its Applications. FOCS 1999 : 389-398 40 Naoki Katoh , Hisao Tamaki , Takeshi Tokuyama: Parametric Polymatroid Optimization and Its Geometric Applications. SODA 1999 : 517-526 39 Hiroshi Kawazoe , Tetsuo Shibuya , Takeshi Tokuyama: Optimal On-line Algorithms for an Electronic Commerce Money Distribution System. SODA 1999 : 527-536 38 Takeshi Fukuda , Yasuhiko Morimoto , Shinichi Morishita , Takeshi Tokuyama: Mining Optimized Association Rules for Numeric Attributes. JCSS 58 (1): 1-12 (1999) 37 Magnús M. Halldórsson , Kazuo Iwano , Naoki Katoh , Takeshi Tokuyama: Finding Subsets Maximizing Minimum Structures. SIAM Journal on Discrete Mathematics 12 (3): 342-359 (1999) 36 Tetsuo Asano , Naoki Katoh , Hisao Tamaki , Takeshi Tokuyama: Convertibility among Grid Filling Curves. ISAAC 1998 : 307-316 35 Hisao Tamaki , Takeshi Tokuyama: Algorithms for the Maxium Subarray Problem Based on Matrix Multiplication. SODA 1998 : 446-452 34 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 33 Hisao Tamaki , Takeshi Tokuyama: A Characterization of Planar Graphs by Pseudo-Line Arrangements. ISAAC 1997 : 133-142 32 Kunikazu Yoda , Takeshi Fukuda , Yasuhiko Morimoto , Shinichi Morishita , Takeshi Tokuyama: Computing Optimized Rectilinear Regions for Association Rules. KDD 1997 : 96-103 31 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 30 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 29 Takeshi Tokuyama: Orthogonal Queries in Segments. Algorithmica 18 (2): 229-245 (1997) 28 Takeshi Fukuda , Yasuhiko Morimoto , Shinichi Morishita , Takeshi Tokuyama: Interval Finding and Its Application to Data Mining. ISAAC 1996 : 55-64 27 Takeshi Fukuda , Yasuhiko Morimoto , Shinichi Morishita , Takeshi Tokuyama: Mining Optimized Association Rules for Numeric Attributes. PODS 1996 : 182-191 26 Takeshi Fukuda , Yasuhiko Morimoto , Shinichi Morishita , Takeshi Tokuyama: Data Mining Using Two-Dimensional Optimized Accociation Rules: Scheme, Algorithms, and Visualization. SIGMOD Conference 1996 : 13-23 25 Takeshi Fukuda , Yasuhiko Morimoto , Shinichi Morishita , Takeshi Tokuyama: SONAR: System for Optimized Numeric AssociationRules. SIGMOD Conference 1996 : 553 24 Tetsuo Asano , Danny Z. Chen , Naoki Katoh , Takeshi Tokuyama: Polynomial-Time Solutions to Image Segmentation. SODA 1996 : 104-113 23 Yuichi Asahiro , Kazuo Iwama , Hisao Tamaki , Takeshi Tokuyama: Greedily Finding a Dense Subgraph. SWAT 1996 : 136-148 22 Takeshi Fukuda , Yasuhiko Morimoto , Shinichi Morishita , Takeshi Tokuyama: Constructing Efficient Decision Trees by Using Optimized Numeric Association Rules. VLDB 1996 : 146-155 21 Magnús M. Halldórsson , Kazuo Iwano , Naoki Katoh , Takeshi Tokuyama: Finding Subsets Maximizing Minimum Structures. SODA 1995 : 150-159 20 Hisao Tamaki , Takeshi Tokuyama: How to Cut Pseudo-Parabolas into Segments. Symposium on Computational Geometry 1995 : 230-237 19 Alok Aggarwal , Takeshi Tokuyama: An Improved Algorithm for the Traveler's Problem. J. Algorithms 19 (2): 318-330 (1995) 18 Takeshi Tokuyama, Jun Nakano : Efficient Algorithms for the Hitchcock Transportation Problem. SIAM J. Comput. 24 (3): 563-578 (1995) 17 Tetsuo Asano , Naoki Katoh , Takeshi Tokuyama: A Unified Scheme for Detecting Fundamental Curves in Binary Edge Images. ESA 1994 : 215-226 16 Takeshi Tokuyama: Orthogonal Queries in Segments and Triangles. ISAAC 1994 : 505-513 15 Tetsuo Asano , Leonidas J. Guibas , Takeshi Tokuyama: Walking on an arrangement topologically. International Journal of Computational Geometry and Applications 4 (2): 123-151 (1994) 14 Shu Tezuka , Takeshi Tokuyama: A Note on Polynomial Arithmetic Analogue of Halton Sequences. TOMACS 4 (3): 279-284 (1994) 13 Alok Aggerwal , Takeshi Tokuyama: Consecutive Interval Query and Dynamic Programming on Intervals. ISAAC 1993 : 466-475 12 Alok Aggerwal , Takeshi Tokuyama: An Improved Algorithm for the Traveler's Problem. ISAAC 1993 : 476-485 11 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 10 Tetsuo Asano , Takeshi Tokuyama: Algorithms for Projecting Points To Give the Most Uniform Distribution with Applications to Hashing. Algorithmica 9 (6): 572-590 (1993) 9 Kazumiti Numata , Takeshi Tokuyama: Splitting a Configuration in a Simplex. Algorithmica 9 (6): 649-668 (1993) 8 Naoki Katoh , Takeshi Tokuyama, Kazuo Iwano : On Minimum and Maximum Spanning Trees of Linearly Moving Points. FOCS 1992 : 396-405 7 Takeshi Tokuyama, Jun Nakano : Efficient Algorithms for the Hitchcock Transportation Problem. SODA 1992 : 175-184 6 Tetsuo Asano , Takeshi Tokuyama: Circuit Partitioning Algorithms: Graph Model versus Geometry Model. ISA 1991 : 94-103 5 Takeshi Tokuyama, Jun Nakano : Geometric Algorithms for a Minimum Cost Assignment Problem. Symposium on Computational Geometry 1991 : 262-271 4 Tetsuo Asano , Leonidas J. Guibas , Takeshi Tokuyama: Walking on an Arrangement Topologically. Symposium on Computational Geometry 1991 : 297-306 3 Tetsuo Asano , Takeshi Tokuyama: Algorithms for Projecting Points to Give the Most Uniform Distribution with Applications to Hashing. SIGAL International Symposium on Algorithms 1990 : 300-309 2 Kazumiti Numata , Takeshi Tokuyama: Splitting a Configuration in a Simplex. SIGAL International Symposium on Algorithms 1990 : 429-438 1 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  DiSC'02 © 2003 Association for Computing Machinery |
