Takeshi Tokuyama

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