dblp.uni-trier.de

Takeshi Tokuyama

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

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

Coauthor Index

1Alok Aggarwal [11] [12] [13] [15] [23] [39]
2Tatsuya Akutsu [35] [40]
3Hiromi Aonuma [1]
4Boris Aronov [85] [91]
5Yuichi Asahiro [28] [53]
6Takao Asano [51]
7Tetsuo Asano [3] [4] [6] [10] [14] [19] [20] [29] [36] [44] [52] [54] [57] [58] [63] [72] [74] [77] [81] [82] [84] [85] [91] [94] [99] [101]
8Danny Z. Chen [29] [57] [86]
9Jinhee Chun [75] [79] [86] [93] [100]
10Katsuki Fujisawa [50]
11Takeshi Fukuda [27] [30] [31] [32] [33] [37] [42] [46] [60] [69]
12Leonidas J. Guibas [4] [14]
13Magnús M. Halldórsson [26] [45] [96] [98]
14Yukinobu Hamuro [50]
15Tomio Hirata [16]
16Hiroshi Imai [1] [51]
17Keiko Imai [1]
18Kazuo Iwama [28] [53]
19Kazuo Iwano [8] [24] [26] [45]
20Jesper Jansson [83]
21Naoki Katoh [8] [19] [24] [26] [29] [36] [44] [45] [48] [49] [50] [57] [58] [59] [61] [67] [70] [72] [74] [77] [81] [82] [84] [85] [86] [91] [101]
22Hiroshi Kawazoe [47] [71]
23Christian Knauer [98]
24Atsushi Koike [66]
25D. T. Lee [51]
26Jirí Matousek [16] [94] [99]
27Tomomi Matsui [52] [54]
28Hirofumi Matsuzawa [42]
29Kurt Mehlhorn [85] [91]
30Yasuhiko Morimoto [27] [30] [31] [32] [33] [37] [42] [46] [60] [69]
31Shinichi Morishita [27] [30] [31] [32] [33] [37] [46] [60]
32Ryoichi Nagatomi [95] [97]
33Jun Nakano [5] [7] [21] [22]
34Shin-Ichi Nakano [51] [56] [66]
35Takao Nishizeki [56] [66]
36Kazumiti Numata [2] [9]
37Koji Obokata [72] [74] [77]
38Kenichiro Ohta [76] [88]
39Yuji Okada [100]
40Kunihiko Sadakane [64] [65] [73] [75] [76] [79] [87] [88] [93]
41Ashkan Sami [95] [97]
42Baruch Schieber [11] [15]
43Tetsuo Shibuya [47] [71]
44Akiyoshi Shioura [76] [88] [90] [92]
45Andreas Spillner [98]
46Norito Sugawara [64]
47Akiko Suzuki [89]
48Makoto Takahashi [95] [97]
49Nadia Takki-Chebihi [65] [73] [80] [87]
50Hisao Tamaki [25] [28] [35] [36] [38] [40] [41] [43] [44] [48] [53] [67] [81] [82] [84] [101]
51Xuehou Tan [16]
52Shu Tezuka [17]
53Shuhei Watanabe [56] [66]
54Katsutoshi Yada [50]
55Kunikazu Yoda [37] [42]

Colors in the list of coauthors

DBLP: [Home | Search: Author, Title | Conferences | Journals]
Michael Ley (ley@uni-trier.de) Thu Dec 27 04:59:51 2007