default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTakeshi Tokuyama
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[c91]Mook Kwon Jung, Sang Duk Yoon, Hee-Kap Ahn, Takeshi Tokuyama:
Universal convex covering problems under affine dihedral group actions. CCCG 2023: 299-305- 2022
- [j64]Man-Kwun Chiu
, Matias Korman, Martin Suderland, Takeshi Tokuyama:
Distance Bounds for High Dimensional Consistent Digital Rays and 2-D Partially-Consistent Digital Rays. Discret. Comput. Geom. 68(3): 902-944 (2022) - [j63]Luis Barba, Otfried Cheong, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot:
Weight balancing on boundaries. J. Comput. Geom. 13(1): 1-12 (2022) - [c90]Takeshi Tokuyama, Ryo Yoshimura:
High Quality Consistent Digital Curved Rays via Vector Field Rounding. STACS 2022: 58:1-58:17 - [i11]Mook Kwon Jung, Sang Duk Yoon, Hee-Kap Ahn, Takeshi Tokuyama:
Universal convex covering problems under translation and discrete rotations. CoRR abs/2211.14807 (2022) - 2020
- [c89]Man-Kwun Chiu, Matias Korman, Martin Suderland, Takeshi Tokuyama:
Distance Bounds for High Dimensional Consistent Digital Rays and 2-D Partially-Consistent Digital Rays. ESA 2020: 34:1-34:22 - [e5]Seok-Hee Hong, Takeshi Tokuyama:
Beyond Planar Graphs, Communications of NII Shonan Meetings. Springer 2020, ISBN 978-981-15-6532-8 [contents] - [i10]Man-Kwun Chiu, Matias Korman, Martin Suderland, Takeshi Tokuyama:
Distance bounds for high dimensional consistent digital rays and 2-D partially-consistent digital rays. CoRR abs/2006.14059 (2020)
2010 – 2019
- 2019
- [j62]Takeshi Tokuyama:
Guest Editor's Foreword. Int. J. Comput. Geom. Appl. 29(1): 1 (2019) - [c88]Jinhee Chun, Kenya Kikuchi, Takeshi Tokuyama:
Consistent Digital Curved Rays and Pseudoline Arrangements. ESA 2019: 32:1-32:16 - [c87]Nguyen Van Quang, Jinhee Chun, Takeshi Tokuyama:
CapsuleNet for Micro-Expression Recognition. FG 2019: 1-7 - [c86]Kohei Asano, Jinhee Chun, Atsushi Koike, Takeshi Tokuyama:
Model-Agnostic Explanations for Decisions Using Minimal Patterns. ICANN (1) 2019: 241-252 - [p2]Kazunori Ohno, Ryunosuke Hamada, Tatsuya Hoshi, Hiroyuki Nishinoma, Shumpei Yamaguchi, Solvi Arnold, Kimitoshi Yamazaki, Takefumi Kikusui, Satoko Matsubara, Miho Nagasawa, Takatomi Kubo, Eri Nakahara, Yuki Maruno, Kazushi Ikeda, Toshitaka Yamakawa, Takeshi Tokuyama, Ayumi Shinohara, Ryo Yoshinaka, Diptarama Hendrian, Kaizaburo Chubachi, Satoshi Kobayashi, Katsuhito Nakashima, Hiroaki Naganuma, Ryu Wakimoto, Shu Ishikawa, Tatsuki Miura, Satoshi Tadokoro:
Cyber-Enhanced Rescue Canine. Disaster Robotics 2019: 143-193 - 2018
- [j61]Ferran Hurtado, Matias Korman, Marc J. van Kreveld, Maarten Löffler, Vera Sacristán, Akiyoshi Shioura, Rodrigo I. Silveira, Bettina Speckmann, Takeshi Tokuyama:
Colored spanning graphs for set visualization. Comput. Geom. 68: 262-276 (2018) - [c85]Quentin Labernia, Yashio Kabashima, Michimasa Irie, Toshiyuki Oike, Kohei Asano, Jinhee Chun, Takeshi Tokuyama:
Large-Scale Taxonomy Problem: a Mixed Machine Learning Approach. eCOM@SIGIR 2018 - 2017
- [j60]Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas, Rasmus Pagh, Takeshi Tokuyama:
Efficiently Correcting Matrix Products. Algorithmica 79(2): 428-443 (2017) - [j59]Shun Fukuda, Akiyoshi Shioura, Takeshi Tokuyama:
Buyback problem with discrete concave valuation functions. Discret. Optim. 26: 78-96 (2017) - [e4]Yoshio Okamoto, Takeshi Tokuyama:
28th International Symposium on Algorithms and Computation, ISAAC 2017, December 9-12, 2017, Phuket, Thailand. LIPIcs 92, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-054-5 [contents] - 2016
- [j58]Natsuda Kaothanthong, Jinhee Chun, Takeshi Tokuyama:
Distance interior ratio: A new shape signature for 2D shape retrieval. Pattern Recognit. Lett. 78: 14-21 (2016) - [i9]Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas, Rasmus Pagh, Takeshi Tokuyama:
Efficiently Correcting Matrix Products. CoRR abs/1602.00435 (2016) - [i8]Ferran Hurtado, Matias Korman, Marc J. van Kreveld, Maarten Löffler, Vera Sacristán, Akiyoshi Shioura, Rodrigo I. Silveira, Bettina Speckmann, Takeshi Tokuyama:
Colored Spanning Graphs for Set Visualization. CoRR abs/1603.00580 (2016) - [i7]Seok-Hee Hong, Takeshi Tokuyama:
Algoritihmcs for Beyond Planar Graphs (NII Shonan Meeting 2016-17). NII Shonan Meet. Rep. 2016 (2016) - 2015
- [j57]Takeshi Tokuyama:
Jiri Matousek 1963 - 2015. Bull. EATCS 116 (2015) - [c84]Shun Fukuda, Akiyoshi Shioura, Takeshi Tokuyama:
Buyback Problem with Discrete Concave Valuation Functions. WAOA 2015: 72-83 - [i6]Luis Barba, Otfried Cheong, Jean-Lou De Carufel, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot, Tianhao Wang:
Weight Balancing on Boundaries and Skeletons. CoRR abs/1511.04123 (2015) - 2014
- [j56]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama, Antoine Vigneron:
A Generalization of the Convex Kakeya Problem. Algorithmica 70(2): 152-170 (2014) - [j55]Jinhee Chun, Akiyoshi Shioura, Truong Minh Tien, Takeshi Tokuyama:
A Unified View to Greedy Geometric Routing Algorithms in Ad Hoc Networks. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(6): 1220-1230 (2014) - [j54]Jinil Kim, Peter Eades, Rudolf Fleischer, Seok-Hee Hong, Costas S. Iliopoulos, Kunsoo Park, Simon J. Puglisi, Takeshi Tokuyama:
Order-preserving matching. Theor. Comput. Sci. 525: 68-79 (2014) - [j53]Meng Li, Yota Otachi, Takeshi Tokuyama:
Efficient algorithms for network localization using cores of underlying graphs. Theor. Comput. Sci. 553: 18-26 (2014) - [j52]Subir Kumar Ghosh, Takeshi Tokuyama:
Guest Editors' foreword. Theor. Comput. Sci. 555: 1 (2014) - [j51]Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno:
Base-object location problems for base-monotone regions. Theor. Comput. Sci. 555: 71-84 (2014) - [c83]Luis Barba, Otfried Cheong, Jean-Lou De Carufel, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot, Tianhao Wang:
Weight Balancing on Boundaries and Skeletons. SoCG 2014: 436 - 2013
- [j50]Cam-Tu Nguyen, Natsuda Kaothanthong, Takeshi Tokuyama, Xuan Hieu Phan:
A feature-word-topic model for image annotation and retrieval. ACM Trans. Web 7(3): 12:1-12:24 (2013) - [c82]Jinhee Chun, Natsuda Kaothanthong, Takeshi Tokuyama:
Classified-Distance Based Shape Descriptor for Application to Image Retrieval. CAIP (2) 2013: 1-8 - [c81]Tran Phuong Nhung, Cam-Tu Nguyen, Jinhee Chun, Ha Vu Le, Takeshi Tokuyama:
A Multiple Instance Learning Approach to Image Annotation with Saliency Map. KDIR/KMIS 2013: 152-159 - [c80]Jinhee Chun, Ricardo Garcia de Gonzalo, Takeshi Tokuyama:
Space-Efficient and Data-Sensitive Polygon Reconstruction Algorithms from Visibility Angle Information. ISAAC 2013: 22-32 - [c79]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 - [e3]Subir Kumar Ghosh, Takeshi Tokuyama:
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 [contents] - [i5]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) - 2012
- [j49]Jinhee Chun, Natsuda Kaothanthong, Ryosei Kasai, Matias Korman, Martin Nöllenburg, Takeshi Tokuyama:
Algorithms for computing the maximum weight region decomposable into elementary shapes. Comput. Vis. Image Underst. 116(7): 803-814 (2012) - [c78]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 - [c77]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 - [i4]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) - 2011
- [c76]Meng Li, Yota Otachi, Takeshi Tokuyama:
Efficient Algorithms for Network Localization Using Cores of Underlying Graphs. ALGOSENSORS 2011: 101-114 - [c75]Cam-Tu Nguyen, Ha Vu Le, Takeshi Tokuyama:
Cascade of Multi-level Multi-instance Classifiers for Image Annotation. KDIR 2011: 14-23 - 2010
- [j48]Takeshi Tokuyama:
Foreword. Algorithmica 56(1): 1-2 (2010) - [j47]Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama:
Distance k-sectors exist. Comput. Geom. 43(9): 713-720 (2010) - [j46]Shinya Anzai, Jinhee Chun, Ryosei Kasai, Matias Korman, Takeshi Tokuyama:
Effect of Corner Information in Simultaneous Placement of k Rectangles and Tableaux. Discret. Math. Algorithms Appl. 2(4): 527-538 (2010) - [j45]Takeshi Tokuyama:
Foreword. Int. J. Comput. Geom. Appl. 20(1): 1-2 (2010) - [c74]Cam-Tu Nguyen, Natsuda Kaothanthong, Xuan Hieu Phan, Takeshi Tokuyama:
A feature-word-topic model for image annotation. CIKM 2010: 1481-1484 - [c73]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 - [c72]Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama:
Distance k-sectors exist. SCG 2010: 210-215 - [c71]Akitoshi Kawamura, Jirí Matousek, Takeshi Tokuyama:
Zone diagrams in Euclidean spaces and in other normed spaces. SCG 2010: 216-221
2000 – 2009
- 2009
- [j44]Jinhee Chun, Matias Korman, Martin Nöllenburg, Takeshi Tokuyama:
Consistent Digital Rays. Discret. Comput. Geom. 42(3): 359-378 (2009) - [c70]Kazushige Sato, Takeshi Tokuyama:
Directional Geometric Routing on Mobile Ad Hoc Networks. COCOON 2009: 527-537 - [c69]Jinhee Chun, Ryosei Kasai, Matias Korman, Takeshi Tokuyama:
Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes. ISAAC 2009: 1166-1174 - [c68]Sang Won Bae, Matias Korman, Takeshi Tokuyama:
All Farthest Neighbors in the Presence of Highways and Obstacles. WALCOM 2009: 71-82 - [i3]Akitoshi Kawamura, Jirí Matousek, Takeshi Tokuyama:
Zone Diagrams in Euclidean Spaces and in Other Normed Spaces. CoRR abs/0912.3016 (2009) - [i2]Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama:
Distance k-Sectors Exist. CoRR abs/0912.4164 (2009) - 2008
- [j43]Akiko Suzuki, Takeshi Tokuyama:
Dense subgraph problems with output-density conditions. ACM Trans. Algorithms 4(4): 43:1-43:18 (2008) - [j42]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) - [c67]Matias Korman, Takeshi Tokuyama:
Optimal Insertion of a Segment Highway in a City Metric. COCOON 2008: 611-620 - [c66]Jinhee Chun, Matias Korman, Martin Nöllenburg, Takeshi Tokuyama:
Consistent digital rays. SCG 2008: 355-364 - 2007
- [j41]Takeshi Tokuyama:
Recent Progress on Combinatorics and Algorithms for Low Discrepancy Roundings. Graphs Comb. 23(Supplement-1): 359-378 (2007) - [j40]Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama:
Zone Diagrams: Existence, Uniqueness, and Algorithmic Challenge. SIAM J. Comput. 37(4): 1182-1198 (2007) - [c65]Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama:
Voronoi Diagram with Respect to Criteria on Vision Information. ISVD 2007: 25-32 - [c64]Jinhee Chun, Yuji Okada, Takeshi Tokuyama:
Distance Trisector of Segments and Zone Diagram of Segments in a Plane. ISVD 2007: 66-73 - [c63]Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama:
Zone diagrams: existence, uniqueness and algorithmic challenge. SODA 2007: 756-765 - [c62]Magnús M. Halldórsson, Christian Knauer, Andreas Spillner, Takeshi Tokuyama:
Fixed-Parameter Tractability for Non-Crossing Spanning Trees. WADS 2007: 410-421 - [e2]Takeshi Tokuyama:
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 [contents] - 2006
- [j39]Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama:
Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve. Algorithmica 44(2): 103-115 (2006) - [j38]Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama:
Efficient Algorithms for Constructing a Pyramid from a Terrain. IEICE Trans. Inf. Syst. 89-D(2): 783-788 (2006) - [j37]Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama:
Polyline Fitting of Planar Points under Min-sum Criteria. Int. J. Comput. Geom. Appl. 16(2-3): 97-116 (2006) - [j36]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) - [c61]Ashkan Sami, Ryoichi Nagatomi, Makoto Takahashi, Takeshi Tokuyama:
OSDM: Optimized Shape Distribution Method. ADMA 2006: 1057-1064 - [c60]Magnús M. Halldórsson, Takeshi Tokuyama:
Minimizing Interference of a Wireless Ad-Hoc Network in a Plane. ALGOSENSORS 2006: 71-82 - [c59]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 - [c58]Tetsuo Asano, Hisao Tamaki, Naoki Katoh, Takeshi Tokuyama:
Angular Voronoi Diagram with Applications. ISVD 2006: 18-24 - [c57]Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama:
The distance trisector curve. STOC 2006: 336-343 - 2005
- [j35]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) - [j34]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) - [c56]Akiyoshi Shioura, Takeshi Tokuyama:
Efficiently Pricing European-Asian Options - Ultimate Implementation and Analysis of the AMO Algorithm. AAIM 2005: 291-300 - [c55]Akiko Suzuki, Takeshi Tokuyama:
Dense Subgraph Problems with Output-Density Conditions. ISAAC 2005: 266-276 - 2004
- [j33]Jesper Jansson, Takeshi Tokuyama:
Semi-Balanced Colorings of Graphs: Generalized 2-Colorings Based on a Relaxed Discrepancy Condition. Graphs Comb. 20(2): 205-222 (2004) - [j32]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) - [c54]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 - [c53]Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama:
Polyline Fitting of Planar Points Under Min-sum Criteria. ISAAC 2004: 77-88 - [c52]Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama:
On Geometric Structure of Global Roundings for Graphs and Range Spaces. SWAT 2004: 455-467 - 2003
- [j31]Takeshi Tokuyama:
Efficient algorithms for the minimum diameter bridge problem. Comput. Geom. 24(1): 11-18 (2003) - [j30]Kunihiko Sadakane, Norito Sugawara, Takeshi Tokuyama:
Quantum Algorithms for Intersection and Proximity Problems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(5): 1113-1119 (2003) - [j29]Tetsuo 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) - [c51]Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama:
The Structure and Number of Global Roundings of a Graph. COCOON 2003: 130-138 - [c50]Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama:
Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve. ISAAC 2003: 6-15 - [c49]Nadia Takki-Chebihi, Takeshi Tokuyama:
Enumerating Global Roundings of an Outerplanar Graph. ISAAC 2003: 425-433 - 2002
- [j28]Hiroshi Kawazoe, Tetsuo Shibuya, Takeshi Tokuyama:
Optimal Online Algorithms for an Electronic Commerce Money Distribution System. Algorithmica 33(3): 287-299 (2002) - [j27]Naoki Katoh, Takeshi Tokuyama:
K-Levels of Concave Surfaces. Discret. Comput. Geom. 27(4): 567-584 (2002) - [j26]Takeshi Tokuyama:
Guest Editor's Foreword. Int. J. Comput. Geom. Appl. 12(4): 267-268 (2002) - [j25]Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama:
Parametric Polymatroid Optimization and Its Geometric Applications. Int. J. Comput. Geom. Appl. 12(5): 429-444 (2002) - [j24]Atsushi Koike, Shin-Ichi Nakano, Takao Nishizeki, Takeshi Tokuyama, Shuhei Watanabe:
Labeling Points with Rectangles of Various Shapes. Int. J. Comput. Geom. Appl. 12(6): 511-528 (2002) - [j23]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) - [c48]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 - [c47]Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama:
Efficient Algorithms for Constructing a Pyramid from a Terrain. JCDCG 2002: 108-117 - [c46]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 - [c45]Tetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama:
Combinatorial and Geometric Problems Related to Digital Halftoning. Theoretical Foundations of Computer Vision 2002: 58-71 - [c44]Kunihiko Sadakane, Nadia Takki-Chebihi, Takeshi Tokuyama:
Discrepancy-Based Digital Halftoning: Automatic Evaluation and Optimization. Theoretical Foundations of Computer Vision 2002: 301-319 - 2001
- [j22]Tetsuo Asano, Naoki Katoh, Takeshi Tokuyama:
A unified scheme for detecting fundamental curves in binary edge images. Comput. Geom. 18(2): 73-93 (2001) - [j21]Tetsuo Asano, Danny Z. Chen, Naoki Katoh, Takeshi Tokuyama:
Efficient Algorithms for Optimization-Based Image Segmentation. Int. J. Comput. Geom. Appl. 11(2): 145-166 (2001) - [j20]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) - [c43]Naoki Katoh, Takeshi Tokuyama:
Notes on computing peaks in k-levels and parametric spanning trees. SCG 2001: 241-248 - [c42]Kunihiko Sadakane, Nadia Takki-Chebihi, Takeshi Tokuyama:
Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence. ICALP 2001: 166-177 - [c41]Kunihiko Sadakane, Norito Sugawara, Takeshi Tokuyama:
Quantum Algorithms for Intersection and Proximity Problems. ISAAC 2001: 148-159 - [c40]Tetsuo Asano, Takeshi Tokuyama:
How to Color a Checkerboard with a Given Distribution - Matrix Rounding Achieving Low 2×2-Discrepancy. ISAAC 2001: 636-648 - [c39]Takeshi Tokuyama:
Minimax parametric optimization problems and multi-dimensional parametric searching. STOC 2001: 75-83 - [i1]Naoki Katoh, Takeshi Tokuyama:
Notes on computing peaks in k-levels and parametric spanning trees. CoRR cs.CG/0103024 (2001) - 2000
- [j19]Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama:
Greedily Finding a Dense Subgraph. J. Algorithms 34(2): 203-221 (2000) - [j18]Tetsuo Asano, Tomomi Matsui, Takeshi Tokuyama:
Optimal Roundings of Sequences and Matrices. Nord. J. Comput. 7(3): 241- (2000) - [c38]Shin-Ichi Nakano, Takao Nishizeki, Takeshi Tokuyama, Shuhei Watanabe:
Labeling Points with Rectangles of Various Shapes. GD 2000: 91-102 - [c37]Takeshi Tokuyama:
Efficient Algorithms for the Minimum Diameter Bridge Problem. JCDCG 2000: 362-369 - [c36]Tetsuo Asano, Tomomi Matsui, Takeshi Tokuyama:
On the Complexities of the Optimal Rounding Problems of Sequences and Matrices. SWAT 2000: 476-489
1990 – 1999
- 1999
- [j17]Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, Takeshi Tokuyama:
Mining Optimized Association Rules for Numeric Attributes. J. Comput. Syst. Sci. 58(1): 1-12 (1999) - [j16]Magnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama:
Finding Subsets Maximizing Minimum Structures. SIAM J. Discret. Math. 12(3): 342-359 (1999) - [c35]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 - [c34]Naoki Katoh, Takeshi Tokuyama:
Lovász's Lemma for the Three-Dimensional K-Level of Concave Surfaces and its Applications. FOCS 1999: 389-398 - [c33]Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama:
Parametric Polymatroid Optimization and Its Geometric Applications. SODA 1999: 517-526 - [c32]Hiroshi Kawazoe, Tetsuo Shibuya, Takeshi Tokuyama:
Optimal On-line Algorithms for an Electronic Commerce Money Distribution System. SODA 1999: 527-536 - [e1]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. Lecture Notes in Computer Science 1627, Springer 1999, ISBN 3-540-66200-6 [contents] - 1998
- [j15]Alok Aggarwal, Takeshi Tokuyama:
Consecutive Interval Query and Dynamic Programming on Intervals. Discret. Appl. Math. 85(1): 1-24 (1998) - [j14]Hisao Tamaki, Takeshi Tokuyama:
How to Cut Pseudoparabolas into Segments. Discret. Comput. Geom. 19(2): 265-290 (1998) - [j13]Tatsuya Akutsu, Hisao Tamaki, Takeshi Tokuyama:
Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets. Discret. Comput. Geom. 20(3): 307-331 (1998) - [c31]Takeshi Tokuyama:
Application of Algorithm Theory to Data Mining. CATS 1998: 5-20 - [c30]Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama:
Convertibility among Grid Filling Curves. ISAAC 1998: 307-316 - [c29]Hisao Tamaki, Takeshi Tokuyama:
Algorithms for the Maxium Subarray Problem Based on Matrix Multiplication. SODA 1998: 446-452 - [c28]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 - 1997
- [j12]Takeshi Tokuyama:
Orthogonal Queries in Segments. Algorithmica 18(2): 229-245 (1997) - [c27]Tatsuya Akutsu, Hisao Tamaki, Takeshi Tokuyama:
Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets. SCG 1997: 314-323 - [c26]Hisao Tamaki, Takeshi Tokuyama:
A Characterization of Planar Graphs by Pseudo-Line Arrangements. ISAAC 1997: 133-142 - [c25]Kunikazu Yoda, Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, Takeshi Tokuyama:
Computing Optimized Rectilinear Regions for Association Rules. KDD 1997: 96-103 - [c24]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 - 1996
- [c23]Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, Takeshi Tokuyama:
Interval Finding and Its Application to Data Mining. ISAAC 1996: 55-64 - [c22]Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, Takeshi Tokuyama:
Mining Optimized Association Rules for Numeric Attributes. PODS 1996: 182-191 - [c21]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 - [c20]Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, Takeshi Tokuyama:
SONAR: System for Optimized Numeric AssociationRules. SIGMOD Conference 1996: 553 - [c19]Tetsuo Asano, Danny Z. Chen, Naoki Katoh, Takeshi Tokuyama:
Polynomial-Time Solutions to Image Segmentation. SODA 1996: 104-113 - [c18]Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama:
Greedily Finding a Dense Subgraph. SWAT 1996: 136-148 - [c17]Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, Takeshi Tokuyama:
Constructing Efficient Decision Trees by Using Optimized Numeric Association Rules. VLDB 1996: 146-155 - 1995
- [j11]Naoki Katoh, Takeshi Tokuyama, Kazuo Iwano:
On Minimum and Maximum Spanning Trees of Linearly Moving Points. Discret. Comput. Geom. 13: 161-176 (1995) - [j10]Alok Aggarwal, Takeshi Tokuyama:
An Improved Algorithm for the Traveler's Problem. J. Algorithms 19(2): 318-330 (1995) - [j9]Takeshi Tokuyama, Jun Nakano:
Geometric Algorithms for the Minimum Cost Assignment Problem. Random Struct. Algorithms 6(4): 393-406 (1995) - [j8]Takeshi Tokuyama, Jun Nakano:
Efficient Algorithms for the Hitchcock Transportation Problem. SIAM J. Comput. 24(3): 563-578 (1995) - [c16]Hisao Tamaki, Takeshi Tokuyama:
How to Cut Pseudo-Parabolas into Segments. SCG 1995: 230-237 - [c15]Magnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama:
Finding Subsets Maximizing Minimum Structures. SODA 1995: 150-159 - 1994
- [j7]Tomio Hirata, Jirí Matousek, Xuehou Tan, Takeshi Tokuyama:
Complexity of Projected Images of Convex Subdivisions. Comput. Geom. 4: 293-308 (1994) - [j6]Alok Aggarwal, Baruch Schieber, Takeshi Tokuyama:
Finding a Minimum-Weight k-Link Path Graphs with the Concae Monge Property and Applications. Discret. Comput. Geom. 12: 263-280 (1994) - [j5]Tetsuo Asano, Leonidas J. Guibas, Takeshi Tokuyama:
Walking on an arrangement topologically. Int. J. Comput. Geom. Appl. 4(2): 123-151 (1994) - [j4]Shu Tezuka, Takeshi Tokuyama:
A Note on Polynomial Arithmetic Analogue of Halton Sequences. ACM Trans. Model. Comput. Simul. 4(3): 279-284 (1994) - [c14]Tetsuo Asano, Takeshi Tokuyama:
Topological Walk Revisited. CCCG 1994: 1-6 - [c13]Tetsuo Asano, Naoki Katoh, Takeshi Tokuyama:
A Unified Scheme for Detecting Fundamental Curves in Binary Edge Images. ESA 1994: 215-226 - [c12]Takeshi Tokuyama:
Orthogonal Queries in Segments and Triangles. ISAAC 1994: 505-513 - 1993
- [j3]Tetsuo Asano, Takeshi Tokuyama:
Algorithms for Projecting Points To Give the Most Uniform Distribution with Applications to Hashing. Algorithmica 9(6): 572-590 (1993) - [j2]Kazumiti Numata, Takeshi Tokuyama:
Splitting a Configuration in a Simplex. Algorithmica 9(6): 649-668 (1993) - [c11]Alok Aggarwal, Baruch Schieber, Takeshi Tokuyama:
Finding a Minimum Weight K-Link Path in Graphs with Monge Property and Applications. SCG 1993: 189-197 - [c10]Alok Aggarwal, Takeshi Tokuyama:
Consecutive Interval Query and Dynamic Programming on Intervals. ISAAC 1993: 466-475 - [c9]Alok Aggarwal, Takeshi Tokuyama:
An Improved Algorithm for the Traveler's Problem. ISAAC 1993: 476-485 - [p1]Tetsuo Asano, Takeshi Tokuyama:
Circuit Partitioning Algorithms based on Geometry Model. Algorithmic Aspects of VLSI Layout 1993: 199-212 - 1992
- [c8]Naoki Katoh, Takeshi Tokuyama, Kazuo Iwano:
On Minimum and Maximum Spanning Trees of Linearly Moving Points. FOCS 1992: 396-405 - [c7]Takeshi Tokuyama, Jun Nakano:
Efficient Algorithms for the Hitchcock Transportation Problem. SODA 1992: 175-184 - 1991
- [j1]Komei Fukuda, Shigemasa Saito, Akihisa Tamura, Takeshi Tokuyama:
Bounding the number of k-faces in arrangements of hyperplanes. Discret. Appl. Math. 31(2): 151-165 (1991) - [c6]Takeshi Tokuyama, Jun Nakano:
Geometric Algorithms for a Minimum Cost Assignment Problem. SCG 1991: 262-271 - [c5]Tetsuo Asano, Leonidas J. Guibas, Takeshi Tokuyama:
Walking on an Arrangement Topologically. SCG 1991: 297-306 - [c4]Tetsuo Asano, Takeshi Tokuyama:
Circuit Partitioning Algorithms: Graph Model versus Geometry Model. ISA 1991: 94-103 - 1990
- [c3]Hiromi Aonuma, Hiroshi Imai, Keiko Imai, Takeshi Tokuyama:
Maximin Location of Convex Objects in a Polygon and Related Dynamic Voronoi Diagrams. SCG 1990: 225-234 - [c2]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 - [c1]Kazumiti Numata, Takeshi Tokuyama:
Splitting a Configuration in a Simplex. SIGAL International Symposium on Algorithms 1990: 429-438
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
