Takeshi Tokuyama

Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno: Base Location Problems for Base-Monotone Regions. WALCOM 2013: 53-64

Subir Kumar Ghosh, Takeshi Tokuyama (Eds.): WALCOM: Algorithms and Computation, 7th International Workshop, WALCOM 2013, Kharagpur, India, February 14-16, 2013. Proceedings. Lecture Notes in Computer Science 7748, Springer 2013, isbn 978-3-642-36064-0

Jinil Kim, Peter Eades, Rudolf Fleischer, Seok-Hee Hong, Costas S. Iliopoulos, Kunsoo Park, Simon J. Puglisi, Takeshi Tokuyama: Order Preserving Matching. CoRR abs/1302.4064 (2013)

Jinhee Chun, Natsuda Kaothanthong, Ryosei Kasai, Matias Korman, Martin Nöllenburg, Takeshi Tokuyama: Algorithms for computing the maximum weight region decomposable into elementary shapes. Computer Vision and Image Understanding 116(7): 803-814 (2012)

Jinhee Chun, Akiyoshi Shioura, Truong Minh Tien, Takeshi Tokuyama: A Unified View to Greedy Geometric Routing Algorithms in Ad Hoc Networks. ALGOSENSORS 2012: 54-65

Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama, Antoine Vigneron: A Generalization of the Convex Kakeya Problem. LATIN 2012: 1-12

Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama, Antoine Vigneron: A Generalization of the Convex Kakeya Problem. CoRR abs/1209.2171 (2012)

Meng Li, Yota Otachi, Takeshi Tokuyama: Efficient Algorithms for Network Localization Using Cores of Underlying Graphs. ALGOSENSORS 2011: 101-114

Cam-Tu Nguyen, Ha Vu Le, Takeshi Tokuyama: Cascade of Multi-level Multi-instance Classifiers for Image Annotation. KDIR 2011: 14-23

Takeshi Tokuyama: Foreword. Algorithmica 56(1): 1-2 (2010)

Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama: Distance k-sectors exist. Comput. Geom. 43(9): 713-720 (2010)

Shinya Anzai, Jinhee Chun, Ryosei Kasai, Matias Korman, Takeshi Tokuyama: Effect of Corner Information in Simultaneous Placement of k Rectangles and Tableaux. Discrete Math., Alg. and Appl. 2(4): 527-538 (2010)

Takeshi Tokuyama: Foreword. Int. J. Comput. Geometry Appl. 20(1): 1-2 (2010)

Cam-Tu Nguyen, Natsuda Kaothanthong, Xuan Hieu Phan, Takeshi Tokuyama: A feature-word-topic model for image annotation. CIKM 2010: 1481-1484

Shinya Anzai, Jinhee Chun, Ryosei Kasai, Matias Korman, Takeshi Tokuyama: Effect of Corner Information in Simultaneous Placement of K Rectangles and Tableaux. COCOON 2010: 235-243

Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama: Distance k-sectors exist. Symposium on Computational Geometry 2010: 210-215

Akitoshi Kawamura, Jirí Matousek, Takeshi Tokuyama: Zone diagrams in Euclidean spaces and in other normed spaces. Symposium on Computational Geometry 2010: 216-221

Jinhee Chun, Matias Korman, Martin Nöllenburg, Takeshi Tokuyama: Consistent Digital Rays. Discrete & Computational Geometry 42(3): 359-378 (2009)

Kazushige Sato, Takeshi Tokuyama: Directional Geometric Routing on Mobile Ad Hoc Networks. COCOON 2009: 527-537

Jinhee Chun, Ryosei Kasai, Matias Korman, Takeshi Tokuyama: Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes. ISAAC 2009: 1166-1174

Sang Won Bae, Matias Korman, Takeshi Tokuyama: All Farthest Neighbors in the Presence of Highways and Obstacles. WALCOM 2009: 71-82

Akitoshi Kawamura, Jirí Matousek, Takeshi Tokuyama: Zone Diagrams in Euclidean Spaces and in Other Normed Spaces. CoRR abs/0912.3016 (2009)

Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama: Distance k-Sectors Exist. CoRR abs/0912.4164 (2009)

Akiko Suzuki, Takeshi Tokuyama: Dense subgraph problems with output-density conditions. ACM Transactions on Algorithms 4(4) (2008)

Magnús M. Halldórsson, Takeshi Tokuyama: Minimizing interference of a wireless ad-hoc network in a plane. Theor. Comput. Sci. 402(1): 29-42 (2008)

Matias Korman, Takeshi Tokuyama: Optimal Insertion of a Segment Highway in a City Metric. COCOON 2008: 611-620

Jinhee Chun, Matias Korman, Martin Nöllenburg, Takeshi Tokuyama: Consistent digital rays. Symposium on Computational Geometry 2008: 355-364

Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama: Zone Diagrams: Existence, Uniqueness, and Algorithmic Challenge. SIAM J. Comput. 37(4): 1182-1198 (2007)

Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama: Voronoi Diagram with Respect to Criteria on Vision Information. ISVD 2007: 25-32

Jinhee Chun, Yuji Okada, Takeshi Tokuyama: Distance Trisector of Segments and Zone Diagram of Segments in a Plane. ISVD 2007: 66-73

Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama: Zone diagrams: existence, uniqueness and algorithmic challenge. SODA 2007: 756-765

Magnús M. Halldórsson, Christian Knauer, Andreas Spillner, Takeshi Tokuyama: Fixed-Parameter Tractability for Non-Crossing Spanning Trees. WADS 2007: 410-421

Takeshi Tokuyama (Ed.): Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings. Lecture Notes in Computer Science 4835, Springer 2007, isbn 978-3-540-77118-0

Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama: Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve. Algorithmica 44(2): 103-115 (2006)

Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama: Efficient Algorithms for Constructing a Pyramid from a Terrain. IEICE Transactions 89-D(2): 783-788 (2006)

Boris 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)

Akiyoshi Shioura, Takeshi Tokuyama: Efficiently pricing European-Asian options - ultimate implementation and analysis of the AMO algorithm. Inf. Process. Lett. 100(6): 213-219 (2006)

Ashkan Sami, Ryoichi Nagatomi, Makoto Takahashi, Takeshi Tokuyama: OSDM: Optimized Shape Distribution Method. ADMA 2006: 1057-1064

Magnús M. Halldórsson, Takeshi Tokuyama: Minimizing Interference of a Wireless Ad-Hoc Network in a Plane. ALGOSENSORS 2006: 71-82

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. Australian Conference on Artificial Intelligence 2006: 383-392

Tetsuo Asano, Hisao Tamaki, Naoki Katoh, Takeshi Tokuyama: Angular Voronoi Diagram with Applications. ISVD 2006: 18-24

Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama: The distance trisector curve. STOC 2006: 336-343

Kenichiro 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)

Kunihiko 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)

Akiyoshi Shioura, Takeshi Tokuyama: Efficiently Pricing European-Asian Options - Ultimate Implementation and Analysis of the AMO Algorithm. AAIM 2005: 291-300

Akiko Suzuki, Takeshi Tokuyama: Dense Subgraph Problems with Output-Density Conditions. ISAAC 2005: 266-276

Jesper 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)

Tetsuo 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)

Danny 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

Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama: Polyline Fitting of Planar Points Under Min-sum Criteria. ISAAC 2004: 77-88

Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama: On Geometric Structure of Global Roundings for Graphs and Range Spaces. SWAT 2004: 455-467

Takeshi Tokuyama: Efficient algorithms for the minimum diameter bridge problem. Comput. Geom. 24(1): 11-18 (2003)

Tetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama: Matrix Rounding under the L^p-Discrepancy Measure and Its Application to Digital Halftoning. SIAM J. Comput. 32(6): 1423-1435 (2003)

Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama: The Structure and Number of Global Roundings of a Graph. COCOON 2003: 130-138

Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama: Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve. ISAAC 2003: 6-15

Nadia Takki-Chebihi, Takeshi Tokuyama: Enumerating Global Roundings of an Outerplanar Graph. ISAAC 2003: 425-433

Hiroshi Kawazoe, Tetsuo Shibuya, Takeshi Tokuyama: Optimal Online Algorithms for an Electronic Commerce Money Distribution System. Algorithmica 33(3): 287-299 (2002)

Naoki Katoh, Takeshi Tokuyama: K-Levels of Concave Surfaces. Discrete & Computational Geometry 27(4): 567-584 (2002)

Takeshi Tokuyama: Guest Editor's Foreword. Int. J. Comput. Geometry Appl. 12(4): 267-268 (2002)

Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama: Parametric Polymatroid Optimization and Its Geometric Applications. Int. J. Comput. Geometry Appl. 12(5): 429-444 (2002)

Atsushi 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)

Yasuhiko 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)

Kenichiro 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

Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama: Efficient Algorithms for Constructing a Pyramid from a Terrain. JCDCG 2002: 108-117

Tetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama: Matrix rounding under the Lp-discrepancy measure and its application to digital halftoning. SODA 2002: 896-904

Tetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama: Combinatorial and Geometric Problems Related to Digital Halftoning. Theoretical Foundations of Computer Vision 2002: 58-71

Kunihiko Sadakane, Nadia Takki-Chebihi, Takeshi Tokuyama: Discrepancy-Based Digital Halftoning: Automatic Evaluation and Optimization. Theoretical Foundations of Computer Vision 2002: 301-319

Tetsuo Asano, Naoki Katoh, Takeshi Tokuyama: A unified scheme for detecting fundamental curves in binary edge images. Comput. Geom. 18(2): 73-93 (2001)

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)

Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, Takeshi Tokuyama: Data Mining with optimized two-dimensional association rules. ACM Trans. Database Syst. 26(2): 179-213 (2001)

Naoki Katoh, Takeshi Tokuyama: Notes on computing peaks in k-levels and parametric spanning trees. Symposium on Computational Geometry 2001: 241-248

Kunihiko Sadakane, Nadia Takki-Chebihi, Takeshi Tokuyama: Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence. ICALP 2001: 166-177

Kunihiko Sadakane, Norito Sugawara, Takeshi Tokuyama: Quantum Algorithms for Intersection and Proximity Problems. ISAAC 2001: 148-159

Tetsuo Asano, Takeshi Tokuyama: How to Color a Checkerboard with a Given Distribution - Matrix Rounding Achieving Low 2×2-Discrepancy. ISAAC 2001: 636-648

Takeshi Tokuyama: Minimax parametric optimization problems and multi-dimensional parametric searching. STOC 2001: 75-83

Naoki Katoh, Takeshi Tokuyama: Notes on computing peaks in k-levels and parametric spanning trees. CoRR cs.CG/0103024 (2001)

Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama: Greedily Finding a Dense Subgraph. J. Algorithms 34(2): 203-221 (2000)

Tetsuo Asano, Tomomi Matsui, Takeshi Tokuyama: Optimal Roundings of Sequences and Matrices. Nord. J. Comput. 7(3): 241- (2000)

Shin-Ichi Nakano, Takao Nishizeki, Takeshi Tokuyama, Shuhei Watanabe: Labeling Points with Rectangles of Various Shapes. Graph Drawing 2000: 91-102

Takeshi Tokuyama: Efficient Algorithms for the Minimum Diameter Bridge Problem. JCDCG 2000: 362-369

Tetsuo Asano, Tomomi Matsui, Takeshi Tokuyama: On the Complexities of the Optimal Rounding Problems of Sequences and Matrices. SWAT 2000: 476-489

Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, Takeshi Tokuyama: Mining Optimized Association Rules for Numeric Attributes. J. Comput. Syst. Sci. 58(1): 1-12 (1999)

Magnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama: Finding Subsets Maximizing Minimum Structures. SIAM J. Discrete Math. 12(3): 342-359 (1999)

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

Naoki Katoh, Takeshi Tokuyama: Lovász's Lemma for the Three-Dimensional K-Level of Concave Surfaces and its Applications. FOCS 1999: 389-398

Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama: Parametric Polymatroid Optimization and Its Geometric Applications. SODA 1999: 517-526

Hiroshi Kawazoe, Tetsuo Shibuya, Takeshi Tokuyama: Optimal On-line Algorithms for an Electronic Commerce Money Distribution System. SODA 1999: 527-536

Takao Asano, Hiroshi Imai, D. T. Lee, Shin-Ichi Nakano, Takeshi Tokuyama (Eds.): Computing and Combinatorics, 5th Annual International Conference, COCOON '99, Tokyo, Japan, July 26-28, 1999, Proceedings. Lecture Notes in Computer Science 1627, Springer 1999, isbn 3-540-66200-6

Alok Aggarwal, Takeshi Tokuyama: Consecutive Interval Query and Dynamic Programming on Intervals. Discrete Applied Mathematics 85(1): 1-24 (1998)

Hisao Tamaki, Takeshi Tokuyama: How to Cut Pseudoparabolas into Segments. Discrete & Computational Geometry 19(2): 265-290 (1998)

Tatsuya 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)

Takeshi Tokuyama: Application of Algorithm Theory to Data Mining. CATS 1998: 5-20

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

Hisao Tamaki, Takeshi Tokuyama: Algorithms for the Maxium Subarray Problem Based on Matrix Multiplication. SODA 1998: 446-452

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

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

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

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

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 Conference 1996: 13-23

Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, Takeshi Tokuyama: SONAR: System for Optimized Numeric AssociationRules. SIGMOD Conference 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

Naoki Katoh, Takeshi Tokuyama, Kazuo Iwano: On Minimum and Maximum Spanning Trees of Linearly Moving Points. Discrete & Computational Geometry 13: 161-176 (1995)

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

Takeshi Tokuyama, Jun Nakano: Geometric Algorithms for the Minimum Cost Assignment Problem. Random Struct. Algorithms 6(4): 393-406 (1995)

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

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

Magnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama: Finding Subsets Maximizing Minimum Structures. SODA 1995: 150-159

Tomio Hirata, Jirí Matousek, Xuehou Tan, Takeshi Tokuyama: Complexity of Projected Images of Convex Subdivisions. Comput. Geom. 4: 293-308 (1994)

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)

Tetsuo Asano, Leonidas J. Guibas, Takeshi Tokuyama: Walking on an arrangement topologically. Int. J. Comput. Geometry Appl. 4(2): 123-151 (1994)

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

Tetsuo Asano, Takeshi Tokuyama: Topological Walk Revisited. CCCG 1994: 1-6

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

Takeshi Tokuyama: Orthogonal Queries in Segments and Triangles. ISAAC 1994: 505-513

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)

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

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

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

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

Takeshi Tokuyama, Jun Nakano: Efficient Algorithms for the Hitchcock Transportation Problem. SODA 1992: 175-184

Komei Fukuda, Shigemasa Saito, Akihisa Tamura, Takeshi Tokuyama: Bounding the number of k-faces in arrangements of hyperplanes. Discrete Applied Mathematics 31(2): 151-165 (1991)

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

Tetsuo Asano, Takeshi Tokuyama: Circuit Partitioning Algorithms: Graph Model versus Geometry Model. ISA 1991: 94-103

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

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

Kazumiti Numata, Takeshi Tokuyama: Splitting a Configuration in a Simplex. SIGAL International Symposium on Algorithms 1990: 429-438