Network Planning for a Common Use Computer Communication Network. - Mitsuo Kurachi; Y. Matsui; Tetsuo Asano (ICCC, 1976)

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

Image segmentation schema for low-level computer vision. - Tetsuo Asano; Naokazu Yokoya (Pattern Recognit., 1981)

Parametric pattern router. - Tetsuo Asano (DAC, 1982)

Minimum Partition of Polygonal Regions into Trapezoids - Tetsuo Asano; Takao Asano (FOCS, 1983)

Visibility-Polygon Search and Euclidean Shortest Paths - Takao Asano; Tetsuo Asano; Leonidas J. Guibas; John Hershberger 001; Hiroshi Imai (FOCS, 1985)

Routing Region Definition and Ordering Scheme for Building-Block Layout. - Wayne Wei-Ming Dai; Tetsuo Asano; Ernest S. Kuh (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1985)

Visibility of Disjoint Polygons. - Takao Asano; Tetsuo Asano; Leonidas J. Guibas; John Hershberger 001; Hiroshi Imai (Algorithmica, 1986)

Generating and counting valid patterns in routes between two points. - Tetsuo Asano (Graphs Comb., 1986)

Partitioning a polygonal region into trapezoids. - Takao Asano; Tetsuo Asano; Hiroshi Imai (J. ACM, 1986)

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

Shortest Path Between Two Simple Polygons. - Takao Asano; Tetsuo Asano; Hiroshi Imai (Inf. Process. Lett., 1987)

The Effects of Distant Cardiac Electrical Events on Local Activation in Unipolar Epicardial Electrograms. - Susan M. Blanchard; Ralph J. Damiano Jr.; Tetsuo Asano; William M. Smith; Raymond E. Ideker; James E. Lowe (IEEE Trans. Biomed. Eng., 1987)

Clustering Algorithms Based on Minimum and Maximum Spanning Trees. - Tetsuo Asano; Binay K. Bhattacharya; J. Mark Keil; F. Frances Yao (SCG, 1988)

Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region. - Tetsuo Asano; Hiroshi Umeo (Parallel Comput., 1988)

Systolic algorithms for computational geometry problems - A survey. - Hiroshi Umeo; Tetsuo Asano (Computing, 1989)

Circuit Partitioning Algorithms: Graph Model versus Geometry Model. - Tetsuo Asano; Takeshi Tokuyama (ISA, 1991)

Circuit Partitioning Algorithms based on Geometry Model. - Tetsuo Asano; Takeshi Tokuyama (Algorithmic Aspects of VLSI Layout, 1993)

Number Theory Helps Line Detection in Digital Images. - Tetsuo Asano; Naoki Katoh (ISAAC, 1993)

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

Topological Walk Revisited. - Tetsuo Asano; Takeshi Tokuyama (CCCG, 1994)

Reporting and Counting Intersections of Lines within a Polygon. - Tetsuo Asano (ISAAC, 1994)

Walking on an arrangement topologically. - Tetsuo Asano; Leonidas J. Guibas; Takeshi Tokuyama (Int. J. Comput. Geom. Appl., 1994)

Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming. - Naoyoshi Kanamaru; Takao Nishizeki; Tetsuo Asano (Int. J. Comput. Geom. Appl., 1994)

Optimal approximation of monotone curves on a grid. - Tetsuo Asano; Naoki Katoh; Elena Lodi; Thomas Roos (CCCG, 1995)

d1-Optimal Motion for a Rod (Extended Abstract). - Tetsuo Asano; David G. Kirkpatrick; Chee-Keng Yap (SCG, 1996)

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

Polynomial-Time Solutions to Image Segmentation. - Tetsuo Asano; Danny Z. Chen; Naoki Katoh; Takeshi Tokuyama (SODA, 1996)

Variants for the Hough Transform for Line Detection. - Tetsuo Asano; Naoki Katoh (Comput. Geom., 1996)

Covering Points in the Plane by k-Tours: Towards a Polynomial Time Approximation Scheme for General k. - Tetsuo Asano; Naoki Katoh; Hisao Tamaki; Takeshi Tokuyama (STOC, 1997)

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

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

Convertibility among Grid Filling Curves. - Tetsuo Asano; Naoki Katoh; Hisao Tamaki; Takeshi Tokuyama (ISAAC, 1998)

Effective Use of Geometric Properties for Clustering. - Tetsuo Asano (JCDCG, 1998)

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

Visibility in the Plane. - Tetsuo Asano; Subir Kumar Ghosh; Thomas C. Shermer (Handbook of Computational Geometry, 2000)

On the Complexities of the Optimal Rounding Problems of Sequences and Matrices. - Tetsuo Asano; Tomomi Matsui; Takeshi Tokuyama (SWAT, 2000)

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

Algorithmic considerations on the computational complexities of digital line extraction problem. - Tetsuo Asano; Yasuyuki Kawamura (Syst. Comput. Jpn., 2000)

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

Minimum-Length Polygons in Approximation Sausages. - Tetsuo Asano; Yasuyuki Kawamura; Reinhard Klette; Koji Obokata (IWVF, 2001)

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

Efficient Algorithms for Optimization-Based Image Segmentation. - Tetsuo Asano; Danny Z. Chen; Naoki Katoh; Takeshi Tokuyama (Int. J. Comput. Geom. Appl., 2001)

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

Dynamically maintaining the widest k-dense corridor. - Subhas C. Nandy; Tomohiro Harayama; Tetsuo Asano (Theor. Comput. Sci., 2001)

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

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

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

Shattering a set of objects in 2D. - Subhas C. Nandy; Tetsuo Asano; Tomohiro Harayama (Discret. Appl. Math., 2002)

Minimizing the trace length of a rod endpoint in the presence of polygonal obstacles is NP-hard. - Tetsuo Asano; David G. Kirkpatrick; Chee-Keng Yap (CCCG, 2003)

Spanning Trees Crossing Few Barriers. - Tetsuo Asano; Mark de Berg; Otfried Cheong; Leonidas J. Guibas; Jack Snoeyink; Hisao Tamaki (Discret. Comput. Geom., 2003)

Digital Curve Approximation with Length Evaluation. - Tetsuo Asano; Yasuyuki Kawamura; Reinhard Klette; Koji Obokata (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003)

Matrix Rounding under the Lp-Discrepancy Measure and Its Application to Digital Halftoning. - Tetsuo Asano; Naoki Katoh; Koji Obokata; Takeshi Tokuyama (SIAM J. Comput., 2003)

A new halftoning technique to eliminate ambiguous pixels for stable printing. - Shinji Sasahara; Tetsuo Asano (Color Imaging: Processing, Hardcopy, and Applications, 2004)

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

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

Pseudo Approximation Algorithms with Applications to Optimal Motion Planning. - Tetsuo Asano; David G. Kirkpatrick; Chee-Keng Yap (Discret. Comput. Geom., 2004)

Foreword. - Tetsuo Asano; Koji Nakano (IEICE Trans. Inf. Syst., 2004)

The structure and number of global roundings of a graph. - Tetsuo Asano; Naoki Katoh; Hisao Tamaki; Takeshi Tokuyama (Theor. Comput. Sci., 2004)

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

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

Computational Geometric and Combinatorial Approaches to Digital Halftoning. - Tetsuo Asano (CATS, 2006)

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

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

Distance Trisector Curves in Regular Convex Distance Me. - Tetsuo Asano; David G. Kirkpatrick (ISVD, 2006)

Aspect-Ratio Voronoi Diagram with Applications. - Tetsuo Asano; Hideyuki Sakai; Kokichi Sugihara (ISVD, 2006)

Angular Voronoi Diagram with Applications. - Tetsuo Asano; Hisao Tamaki; Naoki Katoh; Takeshi Tokuyama (ISVD, 2006)

Distorted Fingerprint Indexing Using Minutia Detail and Delaunay Triangle. - Xuefeng Liang; Tetsuo Asano; Arijit Bishnu (ISVD, 2006)

The distance trisector curve. - Tetsuo Asano; Jirí Matousek 001; Takeshi Tokuyama (STOC, 2006)

A Linear Time Algorithm for Binary Fingerprint Image Denoising Using Distance Transform. - Xuefeng Liang; Tetsuo Asano (IEICE Trans. Inf. Syst., 2006)

Inserting Points Uniformly at Every Instance. - Sachio Teramoto; Tetsuo Asano; Naoki Katoh; Benjamin Doerr (IEICE Trans. Inf. Syst., 2006)

Polyline Fitting of Planar Points under Min-sum Criteria. - Boris Aronov; Tetsuo Asano; Naoki Katoh; Kurt Mehlhorn; Takeshi Tokuyama (Int. J. Comput. Geom. Appl., 2006)

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

Optimal Triangulation with Steiner Points. - Boris Aronov; Tetsuo Asano; Stefan Funke (ISAAC, 2007)

In-Place Algorithm for Image Rotation. - Tetsuo Asano; Shinnya Bitou; Mitsuo Motoki; Nobuaki Usui (ISAAC, 2007)

Voronoi Diagram with Respect to Criteria on Vision Information. - Tetsuo Asano; Naoki Katoh; Hisao Tamaki; Takeshi Tokuyama (ISVD, 2007)

A Combinatorial Approach to Fingerprint Binarization and Minutiae Extraction Using Euclidean Distance Transform. - Xuefeng Liang; Arijit Bishnu; Tetsuo Asano (Int. J. Pattern Recognit. Artif. Intell., 2007)

Aspect-ratio Voronoi diagram and its complexity bounds. - Tetsuo Asano (Inf. Process. Lett., 2007)

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

A Robust Fingerprint Indexing Scheme Using Minutia Neighborhood Structure and Low-Order Delaunay Triangles. - Xuefeng Liang; Arijit Bishnu; Tetsuo Asano (IEEE Trans. Inf. Forensics Secur., 2007)

Constant-Working-Space Algorithms for Image Processing. - Tetsuo Asano (ETVC, 2008)

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

Linear Boundary and Corner Detection Using Limited Number of Sensor Rows. - Bishal Prasad; Arijit Bishnu; Tetsuo Asano (IWCIA, 2008)

Space-Efficient Algorithm for Image Rotation. - Tetsuo Asano; Shinnya Bitou; Mitsuo Motoki; Nobuaki Usui (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008)

Online uniformity of integer points on a line. - Tetsuo Asano (Inf. Process. Lett., 2008)

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

Finding Nearest Larger Neighbors. - Tetsuo Asano; Sergey Bereg; David G. Kirkpatrick (Efficient Algorithms, 2009)

Constant-Working-Space Algorithms for Geometric Problems. - Tetsuo Asano; Günter Rote (CCCG, 2009)

Editorial. - Tetsuo Asano (Algorithmica, 2009)

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

Some theoretical challenges in digital geometry: A perspective. - Tetsuo Asano; Valentin E. Brimkov; Reneta P. Barneva (Discret. Appl. Math., 2009)

Guest Editor's Foreword. - Tetsuo Asano (Int. J. Comput. Geom. Appl., 2009)

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

Do We Need a Stack to Erase a Component in a Binary Image? - Tetsuo Asano (FUN, 2010)

Kaboozle Is NP-complete, Even in a Strip. - Tetsuo Asano; Erik D. Demaine; Martin L. Demaine; Ryuhei Uehara (FUN, 2010)

Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon. - Tetsuo Asano; Wolfgang Mulzer; Yajun Wang (WALCOM, 2010)

Optimal Triangulations of Points and Segments with Steiner Points. - Boris Aronov; Tetsuo Asano; Stefan Funke (Int. J. Comput. Geom. Appl., 2010)

Disc Covering Problem with Application to Digital Halftoning. - Tetsuo Asano; Peter Brass; Shinji Sasahara (Theory Comput. Syst., 2010)

In-Place Linear-Time Algorithms for Euclidean Distance Transform. - Tetsuo Asano; Hiroshi Tanaka (Trans. Comput. Sci., 2010)

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

Designing Algorithms with Limited Work Space. - Tetsuo Asano (TAMC, 2011)

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

Constant-Work-Space Algorithms for Geometric Problems. - Tetsuo Asano; Wolfgang Mulzer; Günter Rote; Yajun Wang (J. Comput. Geom., 2011)

Collision Probability in an In-Line Machines Model. - Eishi Chiba; Tetsuo Asano; Takeshi Miura; Naoki Katoh; Ikuo Mitsuka (Trans. Comput. Sci., 2011)

A New Framework for Connected Components Labeling of Binary Images. - Tetsuo Asano; Sergey Bereg (IWCIA, 2012)

Small Work Space Algorithms for Some Basic Problems on Binary Images. - Tetsuo Asano; Sergey Bereg; Lilian Buzer (IWCIA, 2012)

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

NP-completeness of generalized Kaboozle. - Tetsuo Asano; Erik D. Demaine; Martin L. Demaine; Ryuhei Uehara (J. Inf. Process., 2012)

In-place Algorithm for Erasing a Connected Component in a Binary Image. - Tetsuo Asano (Theory Comput. Syst., 2012)

Priority Queues and Sorting for Read-Only Data. - Tetsuo Asano; Amr Elmasry; Jyrki Katajainen (TAMC, 2013)

Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems. - Tetsuo Asano; David G. Kirkpatrick (WADS, 2013)

Memory-constrained algorithms for simple polygons. - Tetsuo Asano; Kevin Buchin; Maike Buchin; Matias Korman; Wolfgang Mulzer; Günter Rote; André Schulz 001 (Comput. Geom., 2013)

A Small-Space Algorithm for Removing Small Connected Components from a Binary Image. - Tetsuo Asano; Revant Kumar (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013)

Reporting All Segment Intersections Using an Arbitrary Sized Work Space. - Matsuo Konagaya; Tetsuo Asano (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013)

Depth-First Search Using O(n) Bits. - Tetsuo Asano; Taisuke Izumi; Masashi Kiyomi; Matsuo Konagaya; Hirotaka Ono 001; Yota Otachi; Pascal Schweitzer; Jun Tarui; Ryuhei Uehara (ISAAC, 2014)

Õ(√n)-Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability. - Tetsuo Asano; David G. Kirkpatrick; Kotaro Nakagawa; Osamu Watanabe 001 (MFCS (2), 2014)

Reprint of: Memory-constrained algorithms for simple polygons. - Tetsuo Asano; Kevin Buchin; Maike Buchin; Matias Korman; Wolfgang Mulzer; Günter Rote; André Schulz 001 (Comput. Geom., 2014)

O(sqrt(n))-Space and Polynomial-time Algorithm for the Planar Directed Graph Reachability Problem. - Tetsuo Asano; David G. Kirkpatrick; Kotaro Nakagawa; Osamu Watanabe 001 (Electron. Colloquium Comput. Complex., 2014)

A new algorithmic framework for basic problems on binary images. - Tetsuo Asano; Lilian Buzer; Sergey Bereg (Discret. Appl. Math., 2017)

A New Transportation Problem on a Graph with Sending and Bringing-Back Operations. - Tetsuo Asano (WALCOM, 2021)

Transportation Problem Allowing Sending and Bringing Back. - Tetsuo Asano (Int. J. Found. Comput. Sci., 2023)

Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands. - Tetsuo Asano (Int. J. Found. Comput. Sci., 2023)