Tetsuo Asano

ORCID

Publication Activity (10 Years)

Years Active: 1976-2023
Publications (10 Years): 4

Top Venues

Int. J. Found. Comput. Sci.

WALCOM

Discret. Appl. Math.

Electron. Colloquium Comput. Complex.

Publications

Tetsuo Asano
Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands. Int. J. Found. Comput. Sci. 34 (7) (2023)
Tetsuo Asano
Transportation Problem Allowing Sending and Bringing Back. Int. J. Found. Comput. Sci. 34 (5) (2023)
Tetsuo Asano
A New Transportation Problem on a Graph with Sending and Bringing-Back Operations. WALCOM (2021)
Tetsuo Asano, Lilian Buzer, Sergey Bereg
A new algorithmic framework for basic problems on binary images. Discret. Appl. Math. 216 (2017)
Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Günter Rote, André Schulz
Reprint of: Memory-constrained algorithms for simple polygons. Comput. Geom. 47 (3) (2014)
Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, Ryuhei Uehara
Depth-First Search Using O(n) Bits. ISAAC (2014)
Tetsuo Asano, David G. Kirkpatrick, Kotaro Nakagawa, Osamu Watanabe
Õ(√n)-Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability. MFCS (2) (2014)
Tetsuo Asano, David G. Kirkpatrick, Kotaro Nakagawa, Osamu Watanabe
O(sqrt(n))-Space and Polynomial-time Algorithm for the Planar Directed Graph Reachability Problem. Electron. Colloquium Comput. Complex. 21 (2014)
Tetsuo Asano, Amr Elmasry, Jyrki Katajainen
Priority Queues and Sorting for Read-Only Data. TAMC (2013)
Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Günter Rote, André Schulz
Memory-constrained algorithms for simple polygons. Comput. Geom. 46 (8) (2013)
Matsuo Konagaya, Tetsuo Asano
Reporting All Segment Intersections Using an Arbitrary Sized Work Space. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (6) (2013)
Tetsuo Asano, David G. Kirkpatrick
Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems. WADS (2013)
Tetsuo Asano, Revant Kumar
A Small-Space Algorithm for Removing Small Connected Components from a Binary Image. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (6) (2013)
Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente
Faster computation of the Robinson-Foulds distance between phylogenetic networks. Inf. Sci. 197 (2012)
Tetsuo Asano
In-place Algorithm for Erasing a Connected Component in a Binary Image. Theory Comput. Syst. 50 (1) (2012)
Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
NP-completeness of generalized Kaboozle. Inf. Media Technol. 7 (3) (2012)
Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
NP-completeness of generalized Kaboozle. J. Inf. Process. 20 (3) (2012)
Tetsuo Asano, Sergey Bereg, Lilian Buzer
Small Work Space Algorithms for Some Basic Problems on Binary Images. IWCIA (2012)
Tetsuo Asano, Sergey Bereg
A New Framework for Connected Components Labeling of Binary Images. IWCIA (2012)
Tetsuo Asano, Wolfgang Mulzer, Günter Rote, Yajun Wang
Constant-Work-Space Algorithms for Geometric Problems. J. Comput. Geom. 2 (1) (2011)
Eishi Chiba, Tetsuo Asano, Takeshi Miura, Naoki Katoh, Ikuo Mitsuka
Collision Probability in an In-Line Machines Model. Trans. Comput. Sci. 13 (2011)
Tetsuo Asano, Benjamin Doerr
Memory-Constrained Algorithms for Shortest Path Problem. CCCG (2011)
Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Günter Rote, André Schulz
Memory-Constrained Algorithms for Simple Polygons CoRR (2011)
Tetsuo Asano
Designing Algorithms with Limited Work Space. TAMC (2011)
Tetsuo Asano, Wolfgang Mulzer, Yajun Wang
Constant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons. J. Graph Algorithms Appl. 15 (5) (2011)
Tetsuo Asano, Peter Brass, Shinji Sasahara
Disc Covering Problem with Application to Digital Halftoning. Theory Comput. Syst. 46 (2) (2010)
Tetsuo Asano, Hiroshi Tanaka
In-Place Linear-Time Algorithms for Euclidean Distance Transform. Trans. Comput. Sci. 8 (2010)
Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
Kaboozle Is NP-complete, Even in a Strip. FUN (2010)
Boris Aronov, Tetsuo Asano, Stefan Funke
Optimal Triangulations of Points and Segments with Steiner Points. Int. J. Comput. Geom. Appl. 20 (1) (2010)
Tetsuo Asano
Do We Need a Stack to Erase a Component in a Binary Image? FUN (2010)
Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente
Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks. CPM (2010)
Tetsuo Asano, Wolfgang Mulzer, Yajun Wang
Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon. WALCOM (2010)
Tetsuo Asano
Guest Editor's Foreword. Int. J. Comput. Geom. Appl. 19 (2) (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) (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) (2009)
Tetsuo Asano, Günter Rote
Constant-Working-Space Algorithms for Geometric Problems. CCCG (2009)
Tetsuo Asano, Valentin E. Brimkov, Reneta P. Barneva
Some theoretical challenges in digital geometry: A perspective. Discret. Appl. Math. 157 (16) (2009)
Tetsuo Asano, Sergey Bereg, David G. Kirkpatrick
Finding Nearest Larger Neighbors. Efficient Algorithms (2009)
Tetsuo Asano
Editorial. Algorithmica 54 (2) (2009)
Tetsuo Asano
Constant-Working-Space Algorithms: How Fast Can We Solve Problems without Using Any Extra Array?. ISAAC (2008)
Tetsuo Asano
Constant-Working-Space Algorithms for Image Processing. ETVC (2008)
Bishal Prasad, Arijit Bishnu, Tetsuo Asano
Linear Boundary and Corner Detection Using Limited Number of Sensor Rows. IWCIA (2008)
Tetsuo Asano, Shinnya Bitou, Mitsuo Motoki, Nobuaki Usui
Space-Efficient Algorithm for Image Rotation. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2008)
Tetsuo Asano
Online uniformity of integer points on a line. Inf. Process. Lett. 109 (1) (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) (2008)
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)
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)
Xuefeng Liang, Arijit Bishnu, Tetsuo Asano
A Robust Fingerprint Indexing Scheme Using Minutia Neighborhood Structure and Low-Order Delaunay Triangles. IEEE Trans. Inf. Forensics Secur. 2 (4) (2007)
Boris Aronov, Tetsuo Asano, Stefan Funke
Optimal Triangulation with Steiner Points. ISAAC (2007)
Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama
Zone Diagrams: Existence, Uniqueness, and Algorithmic Challenge. SIAM J. Comput. 37 (4) (2007)
Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama
Zone diagrams: existence, uniqueness and algorithmic challenge. SODA (2007)
Tetsuo Asano
Aspect-ratio Voronoi diagram and its complexity bounds. Inf. Process. Lett. 105 (1) (2007)
Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
Voronoi Diagram with Respect to Criteria on Vision Information. ISVD (2007)
Tetsuo Asano, Shinnya Bitou, Mitsuo Motoki, Nobuaki Usui
In-Place Algorithm for Image Rotation. ISAAC (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 CoRR (2007)
Xuefeng Liang, Arijit Bishnu, Tetsuo Asano
A Combinatorial Approach to Fingerprint Binarization and Minutiae Extraction Using Euclidean Distance Transform. Int. J. Pattern Recognit. Artif. Intell. 21 (7) (2007)
Xuefeng Liang, Tetsuo Asano, Arijit Bishnu
Distorted Fingerprint Indexing Using Minutia Detail and Delaunay Triangle. ISVD (2006)
Tetsuo Asano, Hideyuki Sakai, Kokichi Sugihara
Aspect-Ratio Voronoi Diagram with Applications. ISVD (2006)
Tetsuo Asano, David G. Kirkpatrick
Distance Trisector Curves in Regular Convex Distance Me. ISVD (2006)
Xuefeng Liang, Tetsuo Asano
Fingerprint Matching Using Minutia Polygons. ICPR (1) (2006)
Tetsuo Asano
Computational Geometric and Combinatorial Approaches to Digital Halftoning. CATS (2006)
Tetsuo Asano, Hisao Tamaki, Naoki Katoh, Takeshi Tokuyama
Angular Voronoi Diagram with Applications. ISVD (2006)
Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama
The distance trisector curve. STOC (2006)
Sachio Teramoto, Tetsuo Asano, Naoki Katoh, Benjamin Doerr
Inserting Points Uniformly at Every Instance. IEICE Trans. Inf. Syst. (8) (2006)
Xuefeng Liang, Tetsuo Asano
A Linear Time Algorithm for Binary Fingerprint Image Denoising Using Distance Transform. IEICE Trans. Inf. Syst. (4) (2006)
Xuefeng Liang, Tetsuo Asano, Hui Zhang
A Combined Radial Basis Function Model for Fingerprint Distortion. ICIAR (2) (2006)
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) (2006)
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) (2005)
Shinji Sasahara, Tetsuo Asano
New dispersed-dot halftoning technique by elimination of unstable pixels for electrophotography. J. Electronic Imaging 14 (2) (2005)
Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
The structure and number of global roundings of a graph. Theor. Comput. Sci. 325 (3) (2004)
Tetsuo Asano, Peter Braß, Shinji Sasahara
Disc Covering Problem with Application to Digital Halftoning. ICCSA (3) (2004)
Shinji Sasahara, Tetsuo Asano
A new halftoning technique to eliminate ambiguous pixels for stable printing. Color Imaging: Processing, Hardcopy, and Applications (2004)
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)
Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
On Geometric Structure of Global Roundings for Graphs and Range Spaces. SWAT (2004)
Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama
Polyline Fitting of Planar Points Under Min-sum Criteria. ISAAC (2004)
Xuefeng Liang, Arijit Bishnu, Tetsuo Asano
A Near-Linear Time Algorithm for Binarization of Fingerprint Images Using Distance Transform. IWCIA (2004)
Tetsuo Asano, Koji Nakano
Foreword. IEICE Trans. Inf. Syst. (2) (2004)
Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap
Pseudo Approximation Algorithms with Applications to Optimal Motion Planning. Discret. Comput. Geom. 31 (1) (2004)
Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
The Structure and Number of Global Roundings of a Graph. COCOON (2003)
Tetsuo Asano, Yasuyuki Kawamura, Reinhard Klette, Koji Obokata
Digital Curve Approximation with Length Evaluation. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (5) (2003)
Tetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama
-Discrepancy Measure and Its Application to Digital Halftoning. SIAM J. Comput. 32 (6) (2003)
Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki
Spanning Trees Crossing Few Barriers. Discret. Comput. Geom. 30 (4) (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)
Tetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama
Combinatorial and Geometric Problems Related to Digital Halftoning. Theoretical Foundations of Computer Vision (2002)
Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap
Pseudo approximation algorithms, with applications to optimal motion planning. SCG (2002)
Subhas C. Nandy, Tetsuo Asano, Tomohiro Harayama
Shattering a set of objects in 2D. Discret. Appl. Math. 122 (1-3) (2002)
Tetsuo Asano, Antonio Hernández-Barrera, Subhas C. Nandy
Translating a convex polyhedron over monotone polyhedra. Comput. Geom. 23 (3) (2002)
Tetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama
Matrix rounding under the Lp-discrepancy measure and its application to digital halftoning. SODA (2002)
Tetsuo Asano, Naoki Katoh, Kazuhiro Kawashima
A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree. J. Comb. Optim. 5 (2) (2001)
Tetsuo Asano, Yasuyuki Kawamura, Reinhard Klette, Koji Obokata
Minimum-Length Polygons in Approximation Sausages. IWVF (2001)
Tetsuo Asano, Takeshi Tokuyama
How to Color a Checkerboard with a Given Distribution - Matrix Rounding Achieving Low 2×2-Discrepancy. ISAAC (2001)
Tetsuo Asano, Danny Z. Chen, Naoki Katoh, Takeshi Tokuyama
Efficient Algorithms for Optimization-Based Image Segmentation. Int. J. Comput. Geom. Appl. 11 (2) (2001)
Tetsuo Asano, Naoki Katoh, Takeshi Tokuyama
A unified scheme for detecting fundamental curves in binary edge images. Comput. Geom. 18 (2) (2001)
Subhas C. Nandy, Tomohiro Harayama, Tetsuo Asano
Dynamically maintaining the widest k-dense corridor. Theor. Comput. Sci. 255 (1-2) (2001)
Tetsuo Asano, Yasuyuki Kawamura
Algorithmic considerations on the computational complexities of digital line extraction problem. Systems and Computers in Japan 31 (14) (2000)
Subhas C. Nandy, Tomohiro Harayama, Tetsuo Asano
Dynamically Maintaining the Widest k -Dense Corridor. CIAC (2000)
Tetsuo Asano, Tomomi Matsui, Takeshi Tokuyama
Optimal Roundings of Sequences and Matrices. Nord. J. Comput. 7 (3) (2000)
Tetsuo Asano, Tomomi Matsui, Takeshi Tokuyama
On the Complexities of the Optimal Rounding Problems of Sequences and Matrices. SWAT (2000)
Tetsuo Asano, Yasuyuki Kawamura
Computational comparison of voting-based and arrangement-based schema for digital line detection. CCCG (1999)
Tetsuo Asano, Naoki Katoh, Kazuhiro Kawashima
A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree. ISAAC (1999)

Tetsuo Asano.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Tetsuo Asano