The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Takeshi Tokuyama: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, Takeshi Tokuyama
    Data Mining Using Two-Dimensional Optimized Accociation Rules: Scheme, Algorithms, and Visualization. [Citation Graph (17, 18)][DBLP]
    SIGMOD Conference, 1996, pp:13-23 [Conf]
  2. Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, Takeshi Tokuyama
    Mining Optimized Association Rules for Numeric Attributes. [Citation Graph (12, 12)][DBLP]
    PODS, 1996, pp:182-191 [Conf]
  3. Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, Takeshi Tokuyama
    Constructing Efficient Decision Trees by Using Optimized Numeric Association Rules. [Citation Graph (7, 13)][DBLP]
    VLDB, 1996, pp:146-155 [Conf]
  4. Tetsuo Asano, Danny Z. Chen, Naoki Katoh, Takeshi Tokuyama
    Polynomial-Time Solutions to Image Segmentation. [Citation Graph (3, 0)][DBLP]
    SODA, 1996, pp:104-113 [Conf]
  5. Yasuhiko Morimoto, Takeshi Fukuda, Hirofumi Matsuzawa, Takeshi Tokuyama, Kunikazu Yoda
    Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases. [Citation Graph (3, 11)][DBLP]
    VLDB, 1998, pp:380-391 [Conf]
  6. Kunikazu Yoda, Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, Takeshi Tokuyama
    Computing Optimized Rectilinear Regions for Association Rules. [Citation Graph (2, 0)][DBLP]
    KDD, 1997, pp:96-103 [Conf]
  7. Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, Takeshi Tokuyama
    SONAR: System for Optimized Numeric AssociationRules. [Citation Graph (2, 2)][DBLP]
    SIGMOD Conference, 1996, pp:553- [Conf]
  8. Akiyoshi Shioura, Takeshi Tokuyama
    Efficiently Pricing European-Asian Options - Ultimate Implementation and Analysis of the AMO Algorithm. [Citation Graph (0, 0)][DBLP]
    AAIM, 2005, pp:291-300 [Conf]
  9. Ashkan Sami, Ryoichi Nagatomi, Makoto Takahashi, Takeshi Tokuyama
    OSDM: Optimized Shape Distribution Method. [Citation Graph (0, 0)][DBLP]
    ADMA, 2006, pp:1057-1064 [Conf]
  10. Magnús M. Halldórsson, Takeshi Tokuyama
    Minimizing Interference of a Wireless Ad-Hoc Network in a Plane. [Citation Graph (0, 0)][DBLP]
    ALGOSENSORS, 2006, pp:71-82 [Conf]
  11. Ashkan Sami, Ryoichi Nagatomi, Makoto Takahashi, Takeshi Tokuyama
    SDI: Shape Distribution Indicator and Its Application to Find Interrelationships Between Physical Activity Tests and Other Medical Measures. [Citation Graph (0, 0)][DBLP]
    Australian Conference on Artificial Intelligence, 2006, pp:383-392 [Conf]
  12. Tetsuo Asano, Takeshi Tokuyama
    Topological Walk Revisited. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:1-6 [Conf]
  13. Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
    The Structure and Number of Global Roundings of a Graph. [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:130-138 [Conf]
  14. Danny Z. Chen, Jinhee Chun, Naoki Katoh, Takeshi Tokuyama
    Efficient Algorithms for Approximating a Multi-dimensional Voxel Terrain by a Unimodal Terrain. [Citation Graph (0, 0)][DBLP]
    COCOON, 2004, pp:238-248 [Conf]
  15. Tetsuo Asano, Leonidas J. Guibas, Takeshi Tokuyama
    Walking on an Arrangement Topologically. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:297-306 [Conf]
  16. Tatsuya Akutsu, Hisao Tamaki, Takeshi Tokuyama
    Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:314-323 [Conf]
  17. Hiromi Aonuma, Hiroshi Imai, Keiko Imai, Takeshi Tokuyama
    Maximin Location of Convex Objects in a Polygon and Related Dynamic Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:225-234 [Conf]
  18. Alok Aggarwal, Baruch Schieber, Takeshi Tokuyama
    Finding a Minimum Weight K-Link Path in Graphs with Monge Property and Applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:189-197 [Conf]
  19. Naoki Katoh, Takeshi Tokuyama
    Notes on computing peaks in k-levels and parametric spanning trees. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:241-248 [Conf]
  20. Hisao Tamaki, Takeshi Tokuyama
    How to Cut Pseudo-Parabolas into Segments. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:230-237 [Conf]
  21. Takeshi Tokuyama, Jun Nakano
    Geometric Algorithms for a Minimum Cost Assignment Problem. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:262-271 [Conf]
  22. Katsuki Fujisawa, Yukinobu Hamuro, Naoki Katoh, Takeshi Tokuyama, Katsutoshi Yada
    Approximation of Optimal Two-Dimensional Association Rules for Categorical Attributes Using Semidefinite Programming. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 1999, pp:148-159 [Conf]
  23. Tetsuo Asano, Naoki Katoh, Takeshi Tokuyama
    A Unified Scheme for Detecting Fundamental Curves in Binary Edge Images. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:215-226 [Conf]
  24. Kenichiro Ohta, Kunihiko Sadakane, Akiyoshi Shioura, Takeshi Tokuyama
    A Fast, Accurate and Simple Method for Pricing European-Asian and Saving-Asian Options. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:772-784 [Conf]
  25. Naoki Katoh, Takeshi Tokuyama
    Lovász's Lemma for the Three-Dimensional K-Level of Concave Surfaces and its Applications. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:389-398 [Conf]
  26. Naoki Katoh, Takeshi Tokuyama, Kazuo Iwano
    On Minimum and Maximum Spanning Trees of Linearly Moving Points [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:396-405 [Conf]
  27. Shin-Ichi Nakano, Takao Nishizeki, Takeshi Tokuyama, Shuhei Watanabe
    Labeling Points with Rectangles of Various Shapes. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2000, pp:91-102 [Conf]
  28. Kunihiko Sadakane, Nadia Takki-Chebihi, Takeshi Tokuyama
    Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:166-177 [Conf]
  29. Tetsuo Asano, Takeshi Tokuyama
    Circuit Partitioning Algorithms: Graph Model versus Geometry Model. [Citation Graph (0, 0)][DBLP]
    ISA, 1991, pp:94-103 [Conf]
  30. Tetsuo Asano, Takeshi Tokuyama
    How to Color a Checkerboard with a Given Distribution - Matrix Rounding Achieving Low 2×2-Discrepancy. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:636-648 [Conf]
  31. Alok Aggarwal, Takeshi Tokuyama
    Consecutive Interval Query and Dynamic Programming on Intervals. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:466-475 [Conf]
  32. Alok Aggarwal, Takeshi Tokuyama
    An Improved Algorithm for the Traveler's Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:476-485 [Conf]
  33. Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama
    Polyline Fitting of Planar Points Under Min-sum Criteria. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:77-88 [Conf]
  34. Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
    Convertibility among Grid Filling Curves. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:307-316 [Conf]
  35. Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama
    Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:6-15 [Conf]
  36. Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, Takeshi Tokuyama
    Interval Finding and Its Application to Data Mining. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1996, pp:55-64 [Conf]
  37. Kunihiko Sadakane, Norito Sugawara, Takeshi Tokuyama
    Quantum Algorithms for Intersection and Proximity Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:148-159 [Conf]
  38. Akiko Suzuki, Takeshi Tokuyama
    Dense Subgraph Problems with Output-Density Conditions. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:266-276 [Conf]
  39. Nadia Takki-Chebihi, Takeshi Tokuyama
    Enumerating Global Roundings of an Outerplanar Graph. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:425-433 [Conf]
  40. Hisao Tamaki, Takeshi Tokuyama
    A Characterization of Planar Graphs by Pseudo-Line Arrangements. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1997, pp:133-142 [Conf]
  41. Takeshi Tokuyama
    Orthogonal Queries in Segments and Triangles. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:505-513 [Conf]
  42. Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama
    Efficient Algorithms for Constructing a Pyramid from a Terrain. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:108-117 [Conf]
  43. Takeshi Tokuyama
    Efficient Algorithms for the Minimum Diameter Bridge Problem. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2000, pp:362-369 [Conf]
  44. Tetsuo Asano, Takeshi Tokuyama
    Algorithms for Projecting Points to Give the Most Uniform Distribution with Applications to Hashing. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:300-309 [Conf]
  45. Kazumiti Numata, Takeshi Tokuyama
    Splitting a Configuration in a Simplex. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:429-438 [Conf]
  46. Tetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama
    Matrix rounding under the Lp-discrepancy measure and its application to digital halftoning. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:896-904 [Conf]
  47. Magnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama
    Finding Subsets Maximizing Minimum Structures. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:150-159 [Conf]
  48. Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
    Parametric Polymatroid Optimization and Its Geometric Applications. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:517-526 [Conf]
  49. Hiroshi Kawazoe, Tetsuo Shibuya, Takeshi Tokuyama
    Optimal On-line Algorithms for an Electronic Commerce Money Distribution System. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:527-536 [Conf]
  50. Hisao Tamaki, Takeshi Tokuyama
    Algorithms for the Maxium Subarray Problem Based on Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:446-452 [Conf]
  51. Takeshi Tokuyama, Jun Nakano
    Efficient Algorithms for the Hitchcock Transportation Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:175-184 [Conf]
  52. 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. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:275-283 [Conf]
  53. Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama
    The distance trisector curve. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:336-343 [Conf]
  54. Takeshi Tokuyama
    Minimax parametric optimization problems and multi-dimensional parametric searching. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:75-83 [Conf]
  55. Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama
    Greedily Finding a Dense Subgraph. [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:136-148 [Conf]
  56. Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
    On Geometric Structure of Global Roundings for Graphs and Range Spaces. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:455-467 [Conf]
  57. Tetsuo Asano, Tomomi Matsui, Takeshi Tokuyama
    On the Complexities of the Optimal Rounding Problems of Sequences and Matrices. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:476-489 [Conf]
  58. Tetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama
    Combinatorial and Geometric Problems Related to Digital Halftoning. [Citation Graph (0, 0)][DBLP]
    Theoretical Foundations of Computer Vision, 2002, pp:58-71 [Conf]
  59. Kunihiko Sadakane, Nadia Takki-Chebihi, Takeshi Tokuyama
    Discrepancy-Based Digital Halftoning: Automatic Evaluation and Optimization. [Citation Graph (0, 0)][DBLP]
    Theoretical Foundations of Computer Vision, 2002, pp:301-319 [Conf]
  60. Tetsuo Asano, Takeshi Tokuyama
    Algorithms for Projecting Points To Give the Most Uniform Distribution with Applications to Hashing. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:9, n:6, pp:572-590 [Journal]
  61. Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama
    Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:44, n:2, pp:103-115 [Journal]
  62. Hiroshi Kawazoe, Tetsuo Shibuya, Takeshi Tokuyama
    Optimal Online Algorithms for an Electronic Commerce Money Distribution System. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:33, n:3, pp:287-299 [Journal]
  63. Kazumiti Numata, Takeshi Tokuyama
    Splitting a Configuration in a Simplex. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:9, n:6, pp:649-668 [Journal]
  64. Kenichiro Ohta, Kunihiko Sadakane, Akiyoshi Shioura, Takeshi Tokuyama
    A Fast, Accurate, and Simple Method for Pricing European-Asian and Saving-Asian Options. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:42, n:2, pp:141-158 [Journal]
  65. Takeshi Tokuyama
    Orthogonal Queries in Segments. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:18, n:2, pp:229-245 [Journal]
  66. Tetsuo Asano, Naoki Katoh, Takeshi Tokuyama
    A unified scheme for detecting fundamental curves in binary edge images. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2001, v:18, n:2, pp:73-93 [Journal]
  67. Tomio Hirata, Jirí Matousek, Xuehou Tan, Takeshi Tokuyama
    Complexity of Projected Images of Convex Subdivisions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1994, v:4, n:, pp:293-308 [Journal]
  68. Takeshi Tokuyama
    Efficient algorithms for the minimum diameter bridge problem. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:24, n:1, pp:11-18 [Journal]
  69. Naoki Katoh, Takeshi Tokuyama
    Notes on computing peaks in k-levels and parametric spanning trees [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  70. Alok Aggarwal, Takeshi Tokuyama
    Consecutive Interval Query and Dynamic Programming on Intervals. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:85, n:1, pp:1-24 [Journal]
  71. Alok Aggarwal, Baruch Schieber, Takeshi Tokuyama
    Finding a Minimum-Weight k-Link Path Graphs with the Concae Monge Property and Applications. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:12, n:, pp:263-280 [Journal]
  72. Tatsuya Akutsu, Hisao Tamaki, Takeshi Tokuyama
    Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:20, n:3, pp:307-331 [Journal]
  73. Naoki Katoh, Takeshi Tokuyama
    K-Levels of Concave Surfaces. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:27, n:4, pp:567-584 [Journal]
  74. Naoki Katoh, Takeshi Tokuyama, Kazuo Iwano
    On Minimum and Maximum Spanning Trees of Linearly Moving Points. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:13, n:, pp:161-176 [Journal]
  75. Hisao Tamaki, Takeshi Tokuyama
    How to Cut Pseudoparabolas into Segments. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:2, pp:265-290 [Journal]
  76. Jesper Jansson, Takeshi Tokuyama
    Semi-Balanced Colorings of Graphs: Generalized 2-Colorings Based on a Relaxed Discrepancy Condition. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:2, pp:205-222 [Journal]
  77. Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama
    Polyline Fitting of Planar Points under Min-sum Criteria. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2006, v:16, n:2-3, pp:97-116 [Journal]
  78. Tetsuo Asano, Danny Z. Chen, Naoki Katoh, Takeshi Tokuyama
    Efficient Algorithms for Optimization-Based Image Segmentation. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2001, v:11, n:2, pp:145-166 [Journal]
  79. Tetsuo Asano, Leonidas J. Guibas, Takeshi Tokuyama
    Walking on an arrangement topologically. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1994, v:4, n:2, pp:123-151 [Journal]
  80. Atsushi Koike, Shin-Ichi Nakano, Takao Nishizeki, Takeshi Tokuyama, Shuhei Watanabe
    Labeling Points with Rectangles of Various Shapes. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2002, v:12, n:6, pp:511-528 [Journal]
  81. Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
    Parametric Polymatroid Optimization and Its Geometric Applications. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2002, v:12, n:5, pp:429-0 [Journal]
  82. Takeshi Tokuyama
    Guest Editor's Foreword. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2002, v:12, n:4, pp:267-268 [Journal]
  83. Akiyoshi Shioura, Takeshi Tokuyama
    Efficiently pricing European-Asian options - ultimate implementation and analysis of the AMO algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:100, n:6, pp:213-219 [Journal]
  84. Alok Aggarwal, Takeshi Tokuyama
    An Improved Algorithm for the Traveler's Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:19, n:2, pp:318-330 [Journal]
  85. Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama
    Greedily Finding a Dense Subgraph. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:34, n:2, pp:203-221 [Journal]
  86. Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, Takeshi Tokuyama
    Mining Optimized Association Rules for Numeric Attributes. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:58, n:1, pp:1-12 [Journal]
  87. Tetsuo Asano, Tomomi Matsui, Takeshi Tokuyama
    Optimal Roundings of Sequences and Matrices. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2000, v:7, n:3, pp:241-0 [Journal]
  88. Takeshi Tokuyama, Jun Nakano
    Geometric Algorithms for the Minimum Cost Assignment Problem. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:6, n:4, pp:393-406 [Journal]
  89. Tetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama
    Matrix Rounding under the Lp-Discrepancy Measure and Its Application to Digital Halftoning. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:6, pp:1423-1435 [Journal]
  90. Takeshi Tokuyama, Jun Nakano
    Efficient Algorithms for the Hitchcock Transportation Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:3, pp:563-578 [Journal]
  91. Magnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama
    Finding Subsets Maximizing Minimum Structures. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:3, pp:342-359 [Journal]
  92. Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
    The structure and number of global roundings of a graph. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:325, n:3, pp:425-437 [Journal]
  93. Kunihiko Sadakane, Nadia Takki-Chebihi, Takeshi Tokuyama
    Combinatorics and algorithms for low-discrepancy roundings of a real sequence. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:331, n:1, pp:23-36 [Journal]
  94. Yasuhiko Morimoto, Takeshi Fukuda, Takeshi Tokuyama
    Algorithms for Finding Attribute Value Group for Binary Segmentation of Categorical Databases. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Knowl. Data Eng., 2002, v:14, n:6, pp:1269-1279 [Journal]
  95. Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, Takeshi Tokuyama
    Data Mining with optimized two-dimensional association rules. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Database Syst., 2001, v:26, n:2, pp:179-213 [Journal]
  96. Shu Tezuka, Takeshi Tokuyama
    A Note on Polynomial Arithmetic Analogue of Halton Sequences. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Model. Comput. Simul., 1994, v:4, n:3, pp:279-284 [Journal]
  97. Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama
    Zone diagrams: existence, uniqueness and algorithmic challenge. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:756-765 [Conf]
  98. Magnús M. Halldórsson, Christian Knauer, Andreas Spillner, Takeshi Tokuyama
    Fixed-Parameter Tractability for Non-Crossing Spanning Trees. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:410-421 [Conf]
  99. Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
    Voronoi Diagram with Respect to Criteria on Vision Information. [Citation Graph (0, 0)][DBLP]
    ISVD, 2007, pp:25-32 [Conf]
  100. Jinhee Chun, Yuji Okada, Takeshi Tokuyama
    Distance Trisector of Segments and Zone Diagram of Segments in a Plane. [Citation Graph (0, 0)][DBLP]
    ISVD, 2007, pp:66-73 [Conf]

  101. Application of Algorithm Theory to Data Mining. [Citation Graph (, )][DBLP]


  102. Optimal Insertion of a Segment Highway in a City Metric. [Citation Graph (, )][DBLP]


  103. Effect of Corner Information in Simultaneous Placement of K Rectangles and Tableaux. [Citation Graph (, )][DBLP]


  104. Directional Geometric Routing on Mobile Ad Hoc Networks. [Citation Graph (, )][DBLP]


  105. Consistent digital rays. [Citation Graph (, )][DBLP]


  106. Distance k-sectors exist. [Citation Graph (, )][DBLP]


  107. Zone diagrams in Euclidean spaces and in other normed spaces. [Citation Graph (, )][DBLP]


  108. Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes. [Citation Graph (, )][DBLP]


  109. All Farthest Neighbors in the Presence of Highways and Obstacles. [Citation Graph (, )][DBLP]


  110. Angular Voronoi Diagram with Applications. [Citation Graph (, )][DBLP]


  111. Foreword. [Citation Graph (, )][DBLP]


  112. Distance k-sectors exist. [Citation Graph (, )][DBLP]


  113. Zone Diagrams in Euclidean Spaces and in Other Normed Spaces [Citation Graph (, )][DBLP]


  114. Distance k-Sectors Exist [Citation Graph (, )][DBLP]


  115. Bounding the number of k-faces in arrangements of hyperplanes. [Citation Graph (, )][DBLP]


  116. Consistent Digital Rays. [Citation Graph (, )][DBLP]


Search in 0.044secs, Finished in 0.050secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002