Tetsuo Asano

Tetsuo Asano, Amr Elmasry, Jyrki Katajainen: Priority Queues and Sorting for Read-Only Data. TAMC 2013: 32-41

Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente: Faster computation of the Robinson-Foulds distance between phylogenetic networks. Inf. Sci. 197: 77-90 (2012)

Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara: NP-completeness of generalized Kaboozle. JIP 20(3): 713-718 (2012)

Tetsuo Asano: In-place Algorithm for Erasing a Connected Component in a Binary Image. Theory Comput. Syst. 50(1): 111-123 (2012)

Tetsuo Asano, Sergey Bereg: A New Framework for Connected Components Labeling of Binary Images. IWCIA 2012: 90-102

Tetsuo Asano, Sergey Bereg, Lilian Buzer: Small Work Space Algorithms for Some Basic Problems on Binary Images. IWCIA 2012: 103-114

Tetsuo Asano, Wolfgang Mulzer, Yajun Wang: Constant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons. J. Graph Algorithms Appl. 15(5): 569-586 (2011)

Tetsuo Asano, Wolfgang Mulzer, Günter Rote, Yajun Wang: Constant-Work-Space Algorithms for Geometric Problems. JoCG 2(1): 46-68 (2011)

Eishi Chiba, Tetsuo Asano, Takeshi Miura, Naoki Katoh, Ikuo Mitsuka: Collision Probability in an In-Line Machines Model. Transactions on Computational Science 13: 1-12 (2011)

Tetsuo Asano, Benjamin Doerr: Memory-Constrained Algorithms for Shortest Path Problem. CCCG 2011

Tetsuo Asano: Designing Algorithms with Limited Work Space. TAMC 2011: 1

Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Günter Rote, André Schulz: Memory-Constrained Algorithms for Simple Polygons. CoRR abs/1112.5904 (2011)

Boris Aronov, Tetsuo Asano, Stefan Funke: Optimal Triangulations of Points and Segments with Steiner Points. Int. J. Comput. Geometry Appl. 20(1): 89-104 (2010)

Tetsuo Asano, Peter Brass, Shinji Sasahara: Disc Covering Problem with Application to Digital Halftoning. Theory Comput. Syst. 46(2): 157-173 (2010)

Tetsuo Asano, Hiroshi Tanaka: In-Place Linear-Time Algorithms for Euclidean Distance Transform. Transactions on Computational Science 8: 103-113 (2010)

Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente: Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks. CPM 2010: 190-201

Tetsuo Asano: Do We Need a Stack to Erase a Component in a Binary Image? FUN 2010: 16-27

Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara: Kaboozle Is NP-complete, Even in a Strip. FUN 2010: 28-36

Tetsuo Asano, Wolfgang Mulzer, Yajun Wang: Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon. WALCOM 2010: 9-20

Tetsuo Asano: Editorial. Algorithmica 54(2): 141 (2009)

Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer: A linear-space algorithm for distance preserving graph embedding. Comput. Geom. 42(4): 289-304 (2009)

Tetsuo Asano, Valentin E. Brimkov, Reneta P. Barneva: Some theoretical challenges in digital geometry: A perspective. Discrete Applied Mathematics 157(16): 3362-3371 (2009)

Tetsuo Asano: Guest Editor's Foreword. Int. J. Comput. Geometry Appl. 19(2): 93 (2009)

Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff: Constructing Optimal Highways. Int. J. Found. Comput. Sci. 20(1): 3-23 (2009)

Tetsuo Asano, Sergey Bereg, David G. Kirkpatrick: Finding Nearest Larger Neighbors. Efficient Algorithms 2009: 249-260

Tetsuo Asano, Günter Rote: Constant-Working-Space Algorithms for Geometric Problems. CCCG 2009: 87-90

Tetsuo Asano, Shinnya Bitou, Mitsuo Motoki, Nobuaki Usui: Space-Efficient Algorithm for Image Rotation. IEICE Transactions 91-A(9): 2341-2348 (2008)

Tetsuo Asano: Online uniformity of integer points on a line. Inf. Process. Lett. 109(1): 57-60 (2008)

Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno: A Generalization of Magic Squares with Applications to Digital Halftoning. Theory Comput. Syst. 42(2): 143-156 (2008)

Tetsuo Asano: Constant-Working-Space Algorithms for Image Processing. ETVC 2008: 268-283

Tetsuo Asano: Constant-Working-Space Algorithms: How Fast Can We Solve Problems without Using Any Extra Array?. ISAAC 2008: 1

Bishal Prasad, Arijit Bishnu, Tetsuo Asano: Linear Boundary and Corner Detection Using Limited Number of Sensor Rows. IWCIA 2008: 250-261

Xuefeng Liang, Arijit Bishnu, Tetsuo Asano: A Combinatorial Approach to Fingerprint Binarization and Minutiae Extraction Using Euclidean Distance Transform. IJPRAI 21(7): 1141-1158 (2007)

Tetsuo Asano: Aspect-ratio Voronoi diagram and its complexity bounds. Inf. Process. Lett. 105(1): 26-31 (2007)

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

Xuefeng Liang, Arijit Bishnu, Tetsuo Asano: A Robust Fingerprint Indexing Scheme Using Minutia Neighborhood Structure and Low-Order Delaunay Triangles. IEEE Transactions on Information Forensics and Security 2(4): 721-733 (2007)

Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff: Constructing Optimal Highways. CATS 2007: 7-14

Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer: Linear-Space Algorithms for Distance Preserving Embedding. CCCG 2007: 185-188

Boris Aronov, Tetsuo Asano, Stefan Funke: Optimal Triangulation with Steiner Points. ISAAC 2007: 681-691

Tetsuo Asano, Shinnya Bitou, Mitsuo Motoki, Nobuaki Usui: In-Place Algorithm for Image Rotation. ISAAC 2007: 704-715

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

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

Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff: Constructing Optimal Highways. CoRR abs/cs/0703037 (2007)

Xuefeng Liang, Tetsuo Asano: A Linear Time Algorithm for Binary Fingerprint Image Denoising Using Distance Transform. IEICE Transactions 89-D(4): 1534-1542 (2006)

Sachio Teramoto, Tetsuo Asano, Naoki Katoh, Benjamin Doerr: Inserting Points Uniformly at Every Instance. IEICE Transactions 89-D(8): 2348-2356 (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)

Tetsuo Asano: Computational Geometric and Combinatorial Approaches to Digital Halftoning. CATS 2006: 3

Xuefeng Liang, Tetsuo Asano, Hui Zhang: A Combined Radial Basis Function Model for Fingerprint Distortion. ICIAR (2) 2006: 286-296

Xuefeng Liang, Tetsuo Asano: Fingerprint Matching Using Minutia Polygons. ICPR (1) 2006: 1046-1049

Tetsuo Asano, David G. Kirkpatrick: Distance Trisector Curves in Regular Convex Distance Me. ISVD 2006: 8-17

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

Tetsuo Asano, Hideyuki Sakai, Kokichi Sugihara: Aspect-Ratio Voronoi Diagram with Applications. ISVD 2006: 32-39

Xuefeng Liang, Tetsuo Asano, Arijit Bishnu: Distorted Fingerprint Indexing Using Minutia Detail and Delaunay Triangle. ISVD 2006: 217-223

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

Tetsuo Asano (Ed.): Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings. Lecture Notes in Computer Science 4288, Springer 2006, isbn 3-540-49694-7

Tetsuo Asano, Mark de Berg, Otfried Cheong, Hazel Everett, Herman J. Haverkort, Naoki Katoh, Alexander Wolff: Optimal spanners for axis-aligned rectangles. Comput. Geom. 30(1): 59-77 (2005)

Shinji Sasahara, Tetsuo Asano: New dispersed-dot halftoning technique by elimination of unstable pixels for electrophotography. J. Electronic Imaging 14(2): 023006 (2005)

Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap: Pseudo Approximation Algorithms with Applications to Optimal Motion Planning. Discrete & Computational Geometry 31(1): 139-171 (2004)

Tetsuo Asano, Koji Nakano: Foreword. IEICE Transactions 87-D(2): 279-280 (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)

Tetsuo Asano, Peter Braß, Shinji Sasahara: Disc Covering Problem with Application to Digital Halftoning. ICCSA (3) 2004: 11-21

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

Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno: A Generalization of Magic Squares with Applications to Digital Halftoning. ISAAC 2004: 89-100

Xuefeng Liang, Arijit Bishnu, Tetsuo Asano: A Near-Linear Time Algorithm for Binarization of Fingerprint Images Using Distance Transform. IWCIA 2004: 197-208

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

Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki: Spanning Trees Crossing Few Barriers. Discrete & Computational Geometry 30(4): 591-606 (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, David G. Kirkpatrick, Chee-Keng Yap: Minimizing the trace length of a rod endpoint in the presence of polygonal obstacles is NP-hard. CCCG 2003: 10-13

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

Tetsuo Asano, Reinhard Klette, Christian Ronse (Eds.): Geometry, Morphology, and Computational Imaging, 11th International Workshop on Theoretical Foundations of Computer Vision Dagstuhl Castle, Germany, April 7-12, 2002, Revised Papers. Lecture Notes in Computer Science 2616, Springer 2003, isbn 3-540-00916-7

Tetsuo Asano, Antonio Hernández-Barrera, Subhas C. Nandy: Translating a convex polyhedron over monotone polyhedra. Comput. Geom. 23(3): 257-269 (2002)

Subhas C. Nandy, Tetsuo Asano, Tomohiro Harayama: Shattering a set of objects in 2D. Discrete Applied Mathematics 122(1-3): 183-194 (2002)

Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap: Pseudo approximation algorithms, with applications to optimal motion planning. Symposium on Computational Geometry 2002: 170-178

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

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)

Tetsuo Asano, Naoki Katoh, Kazuhiro Kawashima: A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree. J. Comb. Optim. 5(2): 213-231 (2001)

Subhas C. Nandy, Tomohiro Harayama, Tetsuo Asano: Dynamically maintaining the widest k-dense corridor. Theor. Comput. Sci. 255(1-2): 627-639 (2001)

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

Tetsuo Asano, Yasuyuki Kawamura, Reinhard Klette, Koji Obokata: Minimum-Length Polygons in Approximation Sausages. IWVF 2001: 103-112

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

Tetsuo Asano, Yasuyuki Kawamura: Algorithmic considerations on the computational complexities of digital line extraction problem. Systems and Computers in Japan 31(14): 29-37 (2000)

Subhas C. Nandy, Tomohiro Harayama, Tetsuo Asano: Dynamically Maintaining the Widest k -Dense Corridor. CIAC 2000: 187-198

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

Tetsuo Asano, Yasuyuki Kawamura: Computational comparison of voting-based and arrangement-based schema for digital line detection. CCCG 1999

Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki: Spanning Trees Crossing Few Barriers. Symposium on Computational Geometry 1999: 41-48

Tetsuo Asano, Naoki Katoh, Kazuhiro Kawashima: A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree. ISAAC 1999: 317-326

Tetsuo Asano, Hiro Ito, Souichi Kimura, Shigeaki Shimazu: Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image. ISAAC 1998: 149-158

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

Tetsuo Asano: Effective Use of Geometric Properties for Clustering. JCDCG 1998: 30-46

Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer: Space-Filling Curves and Their Use in the Design of Geometric Data Structures. Theor. Comput. Sci. 181(1): 3-15 (1997)

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

Tetsuo Asano, Naoki Katoh: Variants for the Hough Transform for Line Detection. Comput. Geom. 6: 231-252 (1996)

Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap: d₁-Optimal Motion for a Rod (Extended Abstract). Symposium on Computational Geometry 1996: 252-263

Tetsuo Asano: Digital halftoning algorithm based on random space-filling curve. ICIP (1) 1996: 545-548

Tetsuo Asano, Danny Z. Chen, Naoki Katoh, Takeshi Tokuyama: Polynomial-Time Solutions to Image Segmentation. SODA 1996: 104-113

Tetsuo Asano, Yoshihide Igarashi, Hiroshi Nagamochi, Satoru Miyano, Subhash Suri (Eds.): Algorithms and Computation, 7th International Symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996, Proceedings. Lecture Notes in Computer Science 1178, Springer 1996, isbn 3-540-62048-6

Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer: Space Filling Curves and Their Use in the Design of Geometric Data Structures. LATIN 1995: 36-48

Naoyoshi Kanamaru, Takao Nishizeki, Tetsuo Asano: Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming. Int. J. Comput. Geometry Appl. 4(1): 69-85 (1994)

Tetsuo Asano, Leonidas J. Guibas, Takeshi Tokuyama: Walking on an arrangement topologically. Int. J. Comput. Geometry Appl. 4(2): 123-151 (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

Tetsuo Asano: Reporting and Counting Intersections of Lines within a Polygon. ISAAC 1994: 652-659

Tetsuo Asano, Takeshi Tokuyama: Algorithms for Projecting Points To Give the Most Uniform Distribution with Applications to Hashing. Algorithmica 9(6): 572-590 (1993)

Tetsuo Asano, Naoki Katoh: Number Theory Helps Line Detection in Digital Images. ISAAC 1993: 313-322

Naoyoshi Kanamaru, Takao Nishizeki, Tetsuo Asano: Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming. IPCO 1992: 61-71

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

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

Tetsuo Asano, Toshihide Ibaraki, Hiroshi Imai, Takao Nishizeki (Eds.): Algorithms, International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990, Proceedings. Lecture Notes in Computer Science 450, Springer 1990, isbn 3-540-52921-7

Tetsuo Asano, Binay K. Bhattacharya, J. Mark Keil, F. Frances Yao: Clustering Algorithms Based on Minimum and Maximum Spanning Trees. Symposium on Computational Geometry 1988: 252-257

Takao Asano, Tetsuo Asano, Hiroshi Imai: Shortest Path Between Two Simple Polygons. Inf. Process. Lett. 24(5): 285-288 (1987)

Tetsuo Asano, Hiroshi Umeo: Systolic Algorithms for Computing the Visibility Polygon and Triangulation of A Polygonal Region. Parallel Algorithms and Architectures 1987: 77-85

Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai: Visibility of Disjoint Polygons. Algorithmica 1(1): 49-63 (1986)

Tetsuo Asano: Generating and counting valid patterns in routes between two points. Graphs and Combinatorics 2(1): 9-13 (1986)

Takao Asano, Tetsuo Asano, Hiroshi Imai: Partitioning a polygonal region into trapezoids. J. ACM 33(2): 290-312 (1986)

Takao Asano, Tetsuo Asano, Ron Y. Pinter: Polygon Triangulation: Efficiency and Minimality. J. Algorithms 7(2): 221-231 (1986)

Wayne Wei-Ming Dai, Tetsuo Asano, Ernest S. Kuh: Routing Region Definition and Ordering Scheme for Building-Block Layout. IEEE Trans. on CAD of Integrated Circuits and Systems 4(3): 189-197 (1985)

Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai: Visibility-Polygon Search and Euclidean Shortest Paths. FOCS 1985: 155-164

Tetsuo Asano, Takao Asano: Minimum Partition of Polygonal Regions into Trapezoids. FOCS 1983: 233-241

Tetsuo Asano: Parametric pattern router. DAC 1982: 411-417

Tetsuo Asano, Naokazu Yokoya: Image segmentation schema for low-level computer vision. Pattern Recognition 14(1-6): 267-273 (1981)

Tetsuo Asano, Tadahiro Kitahashi, Kokichi Tanaka, Hiroshi Horino, Nobutaka Amano: A Wire-Routing Scheme Based on Trunk-Division Methods. IEEE Trans. Computers 26(8): 764-772 (1977)

Mitsuo Kurachi, Y. Matsui, Tetsuo Asano: Network Planning for a Common Use Computer Communication Network. ICCC 1976: 379-382