Tetsuo Asano - RankMe

146 papers A* 8A 1B 20C 8Misc 3Journal 68Unranked 34

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Transportation Problem on a Tree Using Two-way Trips. J. Inf. Process. Tetsuo Asano, Shin-Ichi Nakano
2023	J	`jnl`	Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands. Int. J. Found. Comput. Sci. Tetsuo Asano
2023	J	`jnl`	Transportation Problem Allowing Sending and Bringing Back. Int. J. Found. Comput. Sci. Tetsuo Asano
2021	B	`conf`	A New Transportation Problem on a Graph with Sending and Bringing-Back Operations. WALCOM Tetsuo Asano
2017	J	`jnl`	A new algorithmic framework for basic problems on binary images. Discret. Appl. Math. Tetsuo Asano, Lilian Buzer, Sergey Bereg
2014	B	`conf`	Depth-First Search Using O(n) Bits. ISAAC Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, Ryuhei Uehara
2014	J	`jnl`	O(sqrt(n))-Space and Polynomial-time Algorithm for the Planar Directed Graph Reachability Problem. Electron. Colloquium Comput. Complex. Tetsuo Asano, David G. Kirkpatrick, Kotaro Nakagawa, Osamu Watanabe
2014	J	`jnl`	Reprint of: Memory-constrained algorithms for simple polygons. Comput. Geom. Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Günter Rote, André Schulz
2014	—	`conf`	Õ(√n)-Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability. MFCS (2) Tetsuo Asano, David G. Kirkpatrick, Kotaro Nakagawa, Osamu Watanabe
2013	J	`jnl`	A Small-Space Algorithm for Removing Small Connected Components from a Binary Image. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Tetsuo Asano, Revant Kumar
2013	J	`jnl`	Memory-constrained algorithms for simple polygons. Comput. Geom. Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Günter Rote, André Schulz
2013	C	`conf`	Priority Queues and Sorting for Read-Only Data. TAMC Tetsuo Asano, Amr Elmasry, Jyrki Katajainen
2013	J	`jnl`	Reporting All Segment Intersections Using an Arbitrary Sized Work Space. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Matsuo Konagaya, Tetsuo Asano
2013	B	`conf`	Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems. WADS Tetsuo Asano, David G. Kirkpatrick
2012	C	`conf`	A New Framework for Connected Components Labeling of Binary Images. IWCIA Tetsuo Asano, Sergey Bereg
2012	J	`jnl`	Faster computation of the Robinson-Foulds distance between phylogenetic networks. Inf. Sci. Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente
2012	J	`jnl`	In-place Algorithm for Erasing a Connected Component in a Binary Image. Theory Comput. Syst. Tetsuo Asano
2012	J	`jnl`	NP-completeness of generalized Kaboozle. Inf. Media Technol. Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
2012	J	`jnl`	NP-completeness of generalized Kaboozle. J. Inf. Process. Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
2012	C	`conf`	Small Work Space Algorithms for Some Basic Problems on Binary Images. IWCIA Tetsuo Asano, Sergey Bereg, Lilian Buzer
2011	J	`jnl`	Collision Probability in an In-Line Machines Model. Trans. Comput. Sci. Eishi Chiba, Tetsuo Asano, Takeshi Miura, Naoki Katoh, Ikuo Mitsuka
2011	J	`jnl`	Constant-Work-Space Algorithms for Geometric Problems. J. Comput. Geom. Tetsuo Asano, Wolfgang Mulzer, Günter Rote, Yajun Wang
2011	J	`jnl`	Constant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons. J. Graph Algorithms Appl. Tetsuo Asano, Wolfgang Mulzer, Yajun Wang
2011	C	`conf`	Designing Algorithms with Limited Work Space. TAMC Tetsuo Asano
2011	—	`conf`	Memory-Constrained Algorithms for Shortest Path Problem. CCCG Tetsuo Asano, Benjamin Doerr
2011	J	`jnl`	Memory-Constrained Algorithms for Simple Polygons CoRR Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Günter Rote, André Schulz
2010	B	`conf`	Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon. WALCOM Tetsuo Asano, Wolfgang Mulzer, Yajun Wang
2010	J	`jnl`	Disc Covering Problem with Application to Digital Halftoning. Theory Comput. Syst. Tetsuo Asano, Peter Brass, Shinji Sasahara
2010	Misc	`conf`	Do We Need a Stack to Erase a Component in a Binary Image? FUN Tetsuo Asano
2010	B	`conf`	Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks. CPM Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente
2010	J	`jnl`	In-Place Linear-Time Algorithms for Euclidean Distance Transform. Trans. Comput. Sci. Tetsuo Asano, Hiroshi Tanaka
2010	Misc	`conf`	Kaboozle Is NP-complete, Even in a Strip. FUN Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
2010	J	`jnl`	Optimal Triangulations of Points and Segments with Steiner Points. Int. J. Comput. Geom. Appl. Boris Aronov, Tetsuo Asano, Stefan Funke
2009	J	`jnl`	A linear-space algorithm for distance preserving graph embedding. Comput. Geom. Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer
2009	—	`conf`	Constant-Working-Space Algorithms for Geometric Problems. CCCG Tetsuo Asano, Günter Rote
2009	J	`jnl`	Constructing Optimal Highways. Int. J. Found. Comput. Sci. Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff
2009	J	`jnl`	Editorial. Algorithmica Tetsuo Asano
2009	—	`conf`	Finding Nearest Larger Neighbors. Efficient Algorithms Tetsuo Asano, Sergey Bereg, David G. Kirkpatrick
2009	J	`jnl`	Guest Editor's Foreword. Int. J. Comput. Geom. Appl. Tetsuo Asano
2009	J	`jnl`	Some theoretical challenges in digital geometry: A perspective. Discret. Appl. Math. Tetsuo Asano, Valentin E. Brimkov, Reneta P. Barneva
2008	J	`jnl`	A Generalization of Magic Squares with Applications to Digital Halftoning. Theory Comput. Syst. Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno
2008	—	`conf`	Constant-Working-Space Algorithms for Image Processing. ETVC Tetsuo Asano
2008	B	`conf`	Constant-Working-Space Algorithms: How Fast Can We Solve Problems without Using Any Extra Array?. ISAAC Tetsuo Asano
2008	C	`conf`	Linear Boundary and Corner Detection Using Limited Number of Sensor Rows. IWCIA Bishal Prasad, Arijit Bishnu, Tetsuo Asano
2008	J	`jnl`	Online uniformity of integer points on a line. Inf. Process. Lett. Tetsuo Asano
2008	J	`jnl`	Space-Efficient Algorithm for Image Rotation. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Tetsuo Asano, Shinnya Bitou, Mitsuo Motoki, Nobuaki Usui
2007	J	`jnl`	A Combinatorial Approach to Fingerprint Binarization and Minutiae Extraction Using Euclidean Distance Transform. Int. J. Pattern Recognit. Artif. Intell. Xuefeng Liang, Arijit Bishnu, Tetsuo Asano
2007	J	`jnl`	A Robust Fingerprint Indexing Scheme Using Minutia Neighborhood Structure and Low-Order Delaunay Triangles. IEEE Trans. Inf. Forensics Secur. Xuefeng Liang, Arijit Bishnu, Tetsuo Asano
2007	J	`jnl`	Aspect-ratio Voronoi diagram and its complexity bounds. Inf. Process. Lett. Tetsuo Asano
2007	J	`jnl`	Constructing Optimal Highways CoRR Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff
2007	—	`conf`	Constructing Optimal Highways. CATS Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff
2007	B	`conf`	In-Place Algorithm for Image Rotation. ISAAC Tetsuo Asano, Shinnya Bitou, Mitsuo Motoki, Nobuaki Usui
2007	—	`conf`	Linear-Space Algorithms for Distance Preserving Embedding. CCCG Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer
2007	B	`conf`	Optimal Triangulation with Steiner Points. ISAAC Boris Aronov, Tetsuo Asano, Stefan Funke
2007	—	`conf`	Voronoi Diagram with Respect to Criteria on Vision Information. ISVD Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
2007	J	`jnl`	Zone Diagrams: Existence, Uniqueness, and Algorithmic Challenge. SIAM J. Comput. Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama
2007	A*	`conf`	Zone diagrams: existence, uniqueness and algorithmic challenge. SODA Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama
2006	—	`conf`	A Combined Radial Basis Function Model for Fingerprint Distortion. ICIAR (2) Xuefeng Liang, Tetsuo Asano, Hui Zhang
2006	J	`jnl`	A Linear Time Algorithm for Binary Fingerprint Image Denoising Using Distance Transform. IEICE Trans. Inf. Syst. Xuefeng Liang, Tetsuo Asano
2006	B	`ed.`	Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings ISAAC Tetsuo Asano
2006	—	`conf`	Angular Voronoi Diagram with Applications. ISVD Tetsuo Asano, Hisao Tamaki, Naoki Katoh, Takeshi Tokuyama
2006	—	`conf`	Aspect-Ratio Voronoi Diagram with Applications. ISVD Tetsuo Asano, Hideyuki Sakai, Kokichi Sugihara
2006	—	`conf`	Computational Geometric and Combinatorial Approaches to Digital Halftoning. CATS Tetsuo Asano
2006	—	`conf`	Distance Trisector Curves in Regular Convex Distance Me. ISVD Tetsuo Asano, David G. Kirkpatrick
2006	—	`conf`	Distorted Fingerprint Indexing Using Minutia Detail and Delaunay Triangle. ISVD Xuefeng Liang, Tetsuo Asano, Arijit Bishnu
2006	—	`conf`	Fingerprint Matching Using Minutia Polygons. ICPR (1) Xuefeng Liang, Tetsuo Asano
2006	J	`jnl`	Inserting Points Uniformly at Every Instance. IEICE Trans. Inf. Syst. Sachio Teramoto, Tetsuo Asano, Naoki Katoh, Benjamin Doerr
2006	J	`jnl`	Polyline Fitting of Planar Points under Min-sum Criteria. Int. J. Comput. Geom. Appl. Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama
2006	A*	`conf`	The distance trisector curve. STOC Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama
2005	J	`jnl`	New dispersed-dot halftoning technique by elimination of unstable pixels for electrophotography. J. Electronic Imaging Shinji Sasahara, Tetsuo Asano
2005	J	`jnl`	Optimal spanners for axis-aligned rectangles. Comput. Geom. Tetsuo Asano, Mark de Berg, Otfried Cheong, Hazel Everett, Herman J. Haverkort, Naoki Katoh, Alexander Wolff
2004	B	`conf`	A Generalization of Magic Squares with Applications to Digital Halftoning. ISAAC Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno
2004	C	`conf`	A Near-Linear Time Algorithm for Binarization of Fingerprint Images Using Distance Transform. IWCIA Xuefeng Liang, Arijit Bishnu, Tetsuo Asano
2004	—	`conf`	A new halftoning technique to eliminate ambiguous pixels for stable printing. Color Imaging: Processing, Hardcopy, and Applications Shinji Sasahara, Tetsuo Asano
2004	—	`conf`	Disc Covering Problem with Application to Digital Halftoning. ICCSA (3) Tetsuo Asano, Peter Braß, Shinji Sasahara
2004	J	`jnl`	Foreword. IEICE Trans. Inf. Syst. Tetsuo Asano, Koji Nakano
2004	—	`conf`	On Geometric Structure of Global Roundings for Graphs and Range Spaces. SWAT Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
2004	B	`conf`	Polyline Fitting of Planar Points Under Min-sum Criteria. ISAAC Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama
2004	J	`jnl`	Pseudo Approximation Algorithms with Applications to Optimal Motion Planning. Discret. Comput. Geom. Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap
2004	J	`jnl`	The structure and number of global roundings of a graph. Theor. Comput. Sci. Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
2003	J	`jnl`	Digital Curve Approximation with Length Evaluation. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Tetsuo Asano, Yasuyuki Kawamura, Reinhard Klette, Koji Obokata
2003	—	`ed.`	Geometry, Morphology, and Computational Imaging, 11th International Workshop on Theoretical Foundations of Computer Vision Dagstuhl Castle, Germany, April 7-12, 2002, Revised Papers Theoretical Foundations of Computer Vision Tetsuo Asano, Reinhard Klette, Christian Ronse
2003	J	`jnl`	Matrix Rounding under the L SIAM J. Comput. Tetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama
2003	—	`conf`	Minimizing the trace length of a rod endpoint in the presence of polygonal obstacles is NP-hard. CCCG Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap
2003	J	`jnl`	Spanning Trees Crossing Few Barriers. Discret. Comput. Geom. Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki
2003	Misc	`conf`	The Structure and Number of Global Roundings of a Graph. COCOON Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
2002	—	`conf`	Combinatorial and Geometric Problems Related to Digital Halftoning. Theoretical Foundations of Computer Vision Tetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama
2002	A*	`conf`	Matrix rounding under the Lp-discrepancy measure and its application to digital halftoning. SODA Tetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama
2002	—	`conf`	Pseudo approximation algorithms, with applications to optimal motion planning. SCG Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap
2002	J	`jnl`	Shattering a set of objects in 2D. Discret. Appl. Math. Subhas C. Nandy, Tetsuo Asano, Tomohiro Harayama
2002	J	`jnl`	Translating a convex polyhedron over monotone polyhedra. Comput. Geom. Tetsuo Asano, Antonio Hernández-Barrera, Subhas C. Nandy
2001	J	`jnl`	A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree. J. Comb. Optim. Tetsuo Asano, Naoki Katoh, Kazuhiro Kawashima
2001	J	`jnl`	A unified scheme for detecting fundamental curves in binary edge images. Comput. Geom. Tetsuo Asano, Naoki Katoh, Takeshi Tokuyama
2001	J	`jnl`	Dynamically maintaining the widest k-dense corridor. Theor. Comput. Sci. Subhas C. Nandy, Tomohiro Harayama, Tetsuo Asano
2001	J	`jnl`	Efficient Algorithms for Optimization-Based Image Segmentation. Int. J. Comput. Geom. Appl. Tetsuo Asano, Danny Z. Chen, Naoki Katoh, Takeshi Tokuyama
2001	B	`conf`	How to Color a Checkerboard with a Given Distribution - Matrix Rounding Achieving Low 2×2-Discrepancy. ISAAC Tetsuo Asano, Takeshi Tokuyama
2001	—	`conf`	Minimum-Length Polygons in Approximation Sausages. IWVF Tetsuo Asano, Yasuyuki Kawamura, Reinhard Klette, Koji Obokata
2000	J	`jnl`	Algorithmic considerations on the computational complexities of digital line extraction problem. Syst. Comput. Jpn. Tetsuo Asano, Yasuyuki Kawamura
2000	C	`conf`	Dynamically Maintaining the Widest k -Dense Corridor. CIAC Subhas C. Nandy, Tomohiro Harayama, Tetsuo Asano
2000	—	`conf`	On the Complexities of the Optimal Rounding Problems of Sequences and Matrices. SWAT Tetsuo Asano, Tomomi Matsui, Takeshi Tokuyama
2000	J	`jnl`	Optimal Roundings of Sequences and Matrices. Nord. J. Comput. Tetsuo Asano, Tomomi Matsui, Takeshi Tokuyama
2000	—	`ch.`	Visibility in the Plane. Handbook of Computational Geometry Tetsuo Asano, Subir Kumar Ghosh, Thomas C. Shermer
1999	B	`conf`	A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree. ISAAC Tetsuo Asano, Naoki Katoh, Kazuhiro Kawashima
1999	—	`conf`	Computational comparison of voting-based and arrangement-based schema for digital line detection. CCCG Tetsuo Asano, Yasuyuki Kawamura
1999	—	`conf`	Spanning Trees Crossing Few Barriers. SCG Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki
1998	B	`conf`	Convertibility among Grid Filling Curves. ISAAC Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
1998	—	`conf`	Effective Use of Geometric Properties for Clustering. JCDCG Tetsuo Asano
1998	B	`conf`	Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image. ISAAC Tetsuo Asano, Hiro Ito, Souichi Kimura, Shigeaki Shimazu
1997	A*	`conf`	Covering Points in the Plane by STOC Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
1997	J	`jnl`	Space-Filling Curves and Their Use in the Design of Geometric Data Structures. Theor. Comput. Sci. Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer
1996	B	`ed.`	Algorithms and Computation, 7th International Symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996, Proceedings ISAAC Tetsuo Asano, Yoshihide Igarashi, Hiroshi Nagamochi, Satoru Miyano, Subhash Suri
1996	—	`conf`	Digital halftoning algorithm based on random space-filling curve. ICIP (1) Tetsuo Asano
1996	A*	`conf`	Polynomial-Time Solutions to Image Segmentation. SODA Tetsuo Asano, Danny Z. Chen, Naoki Katoh, Takeshi Tokuyama
1996	J	`jnl`	Variants for the Hough Transform for Line Detection. Comput. Geom. Tetsuo Asano, Naoki Katoh
1995	—	`conf`	Optimal approximation of monotone curves on a grid. CCCG Tetsuo Asano, Naoki Katoh, Elena Lodi, Thomas Roos
1995	B	`conf`	Space Filling Curves and Their Use in the Design of Geometric Data Structures. LATIN Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer
1994	A	`conf`	A Unified Scheme for Detecting Fundamental Curves in Binary Edge Images. ESA Tetsuo Asano, Naoki Katoh, Takeshi Tokuyama
1994	J	`jnl`	Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming. Int. J. Comput. Geom. Appl. Naoyoshi Kanamaru, Takao Nishizeki, Tetsuo Asano
1994	B	`conf`	Reporting and Counting Intersections of Lines within a Polygon. ISAAC Tetsuo Asano
1994	—	`conf`	Topological Walk Revisited. CCCG Tetsuo Asano, Takeshi Tokuyama
1994	J	`jnl`	Walking on an arrangement topologically. Int. J. Comput. Geom. Appl. Tetsuo Asano, Leonidas J. Guibas, Takeshi Tokuyama
1993	J	`jnl`	Algorithms for Projecting Points To Give the Most Uniform Distribution with Applications to Hashing. Algorithmica Tetsuo Asano, Takeshi Tokuyama
1993	—	`ch.`	Circuit Partitioning Algorithms based on Geometry Model. Algorithmic Aspects of VLSI Layout Tetsuo Asano, Takeshi Tokuyama
1993	B	`conf`	Number Theory Helps Line Detection in Digital Images. ISAAC Tetsuo Asano, Naoki Katoh
1992	B	`conf`	Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming. IPCO Naoyoshi Kanamaru, Takao Nishizeki, Tetsuo Asano
1991	—	`conf`	Circuit Partitioning Algorithms: Graph Model versus Geometry Model. ISA Tetsuo Asano, Takeshi Tokuyama
1991	—	`conf`	Walking on an Arrangement Topologically. SCG Tetsuo Asano, Leonidas J. Guibas, Takeshi Tokuyama
1990	—	`conf`	Algorithms for Projecting Points to Give the Most Uniform Distribution with Applications to Hashing. SIGAL International Symposium on Algorithms Tetsuo Asano, Takeshi Tokuyama
1990	—	`ed.`	Algorithms, International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990, Proceedings SIGAL International Symposium on Algorithms Tetsuo Asano, Toshihide Ibaraki, Hiroshi Imai, Takao Nishizeki
1989	J	`jnl`	Systolic algorithms for computational geometry problems - A survey. Computing Hiroshi Umeo, Tetsuo Asano
1988	—	`conf`	Clustering Algorithms Based on Minimum and Maximum Spanning Trees. SCG Tetsuo Asano, Binay K. Bhattacharya, J. Mark Keil, F. Frances Yao
1988	J	`jnl`	Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region. Parallel Comput. Tetsuo Asano, Hiroshi Umeo
1987	J	`jnl`	Shortest Path Between Two Simple Polygons. Inf. Process. Lett. Takao Asano, Tetsuo Asano, Hiroshi Imai
1987	—	`conf`	Systolic Algorithms for Computing the Visibility Polygon and Triangulation of A Polygonal Region. Parallel Algorithms and Architectures Tetsuo Asano, Hiroshi Umeo
1987	J	`jnl`	The Effects of Distant Cardiac Electrical Events on Local Activation in Unipolar Epicardial Electrograms. IEEE Trans. Biomed. Eng. Susan M. Blanchard, Ralph J. Damiano Jr., Tetsuo Asano, William M. Smith, Raymond E. Ideker, James E. Lowe
1986	J	`jnl`	Generating and counting valid patterns in routes between two points. Graphs Comb. Tetsuo Asano
1986	J	`jnl`	Partitioning a polygonal region into trapezoids. J. ACM Takao Asano, Tetsuo Asano, Hiroshi Imai
1986	J	`jnl`	Polygon Triangulation: Efficiency and Minimality. J. Algorithms Takao Asano, Tetsuo Asano, Ron Y. Pinter
1986	J	`jnl`	Visibility of Disjoint Polygons. Algorithmica Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai
1985	J	`jnl`	Routing Region Definition and Ordering Scheme for Building-Block Layout. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Wayne Wei-Ming Dai, Tetsuo Asano, Ernest S. Kuh
1985	A*	`conf`	Visibility-Polygon Search and Euclidean Shortest Paths FOCS Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai
1983	A*	`conf`	Minimum Partition of Polygonal Regions into Trapezoids FOCS Tetsuo Asano, Takao Asano
1982	A*	`conf`	Parametric pattern router. DAC Tetsuo Asano
1981	J	`jnl`	Image segmentation schema for low-level computer vision. Pattern Recognit. Tetsuo Asano, Naokazu Yokoya
1977	J	`jnl`	A Wire-Routing Scheme Based on Trunk-Division Methods. IEEE Trans. Computers Tetsuo Asano, Tadahiro Kitahashi, Kokichi Tanaka, Hiroshi Horino, Nobutaka Amano
1976	C	`conf`	Network Planning for a Common Use Computer Communication Network. ICCC Mitsuo Kurachi, Y. Matsui, Tetsuo Asano