| 2009 |
|---|
| 92 | EE | 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) |
| 91 | EE | 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) |
| 2008 |
|---|
| 90 | EE | Tetsuo Asano:
Constant-Working-Space Algorithms for Image Processing.
ETVC 2008: 268-283 |
| 89 | EE | Tetsuo Asano:
Constant-Working-Space Algorithms: How Fast Can We Solve Problems without Using Any Extra Array?.
ISAAC 2008: 1 |
| 88 | EE | Bishal Prasad,
Arijit Bishnu,
Tetsuo Asano:
Linear Boundary and Corner Detection Using Limited Number of Sensor Rows.
IWCIA 2008: 250-261 |
| 87 | EE | Tetsuo Asano,
Shinnya Bitou,
Mitsuo Motoki,
Nobuaki Usui:
Space-Efficient Algorithm for Image Rotation.
IEICE Transactions 91-A(9): 2341-2348 (2008) |
| 86 | EE | Tetsuo Asano:
Online uniformity of integer points on a line.
Inf. Process. Lett. 109(1): 57-60 (2008) |
| 85 | EE | 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) |
| 2007 |
|---|
| 84 | EE | 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 |
| 83 | | 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 |
| 82 | EE | Boris Aronov,
Tetsuo Asano,
Stefan Funke:
Optimal Triangulation with Steiner Points.
ISAAC 2007: 681-691 |
| 81 | EE | Tetsuo Asano,
Shinnya Bitou,
Mitsuo Motoki,
Nobuaki Usui:
In-Place Algorithm for Image Rotation.
ISAAC 2007: 704-715 |
| 80 | EE | Tetsuo Asano,
Naoki Katoh,
Hisao Tamaki,
Takeshi Tokuyama:
Voronoi Diagram with Respect to Criteria on Vision Information.
ISVD 2007: 25-32 |
| 79 | EE | Tetsuo Asano,
Jirí Matousek,
Takeshi Tokuyama:
Zone diagrams: existence, uniqueness and algorithmic challenge.
SODA 2007: 756-765 |
| 78 | EE | 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) |
| 77 | EE | 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) |
| 76 | EE | 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) |
| 75 | EE | Tetsuo Asano:
Aspect-ratio Voronoi diagram and its complexity bounds.
Inf. Process. Lett. 105(1): 26-31 (2007) |
| 74 | EE | Tetsuo Asano,
Jirí Matousek,
Takeshi Tokuyama:
Zone Diagrams: Existence, Uniqueness, and Algorithmic Challenge.
SIAM J. Comput. 37(4): 1182-1198 (2007) |
| 2006 |
|---|
| 73 | | Tetsuo Asano:
Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings
Springer 2006 |
| 72 | EE | Tetsuo Asano:
Computational Geometric and Combinatorial Approaches to Digital Halftoning.
CATS 2006: 3 |
| 71 | EE | Xuefeng Liang,
Tetsuo Asano,
Hui Zhang:
A Combined Radial Basis Function Model for Fingerprint Distortion.
ICIAR (2) 2006: 286-296 |
| 70 | EE | Xuefeng Liang,
Tetsuo Asano:
Fingerprint Matching Using Minutia Polygons.
ICPR (1) 2006: 1046-1049 |
| 69 | EE | Tetsuo Asano,
Jirí Matousek,
Takeshi Tokuyama:
The distance trisector curve.
STOC 2006: 336-343 |
| 68 | EE | Xuefeng Liang,
Tetsuo Asano:
A Linear Time Algorithm for Binary Fingerprint Image Denoising Using Distance Transform.
IEICE Transactions 89-D(4): 1534-1542 (2006) |
| 67 | EE | Sachio Teramoto,
Tetsuo Asano,
Naoki Katoh,
Benjamin Doerr:
Inserting Points Uniformly at Every Instance.
IEICE Transactions 89-D(8): 2348-2356 (2006) |
| 66 | EE | 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) |
| 2005 |
|---|
| 65 | EE | 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) |
| 2004 |
|---|
| 64 | EE | Tetsuo Asano,
Peter Braß,
Shinji Sasahara:
Disc Covering Problem with Application to Digital Halftoning.
ICCSA (3) 2004: 11-21 |
| 63 | EE | Boris Aronov,
Tetsuo Asano,
Naoki Katoh,
Kurt Mehlhorn,
Takeshi Tokuyama:
Polyline Fitting of Planar Points Under Min-sum Criteria.
ISAAC 2004: 77-88 |
| 62 | EE | 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 |
| 61 | EE | Xuefeng Liang,
Arijit Bishnu,
Tetsuo Asano:
A Near-Linear Time Algorithm for Binarization of Fingerprint Images Using Distance Transform.
IWCIA 2004: 197-208 |
| 60 | EE | Tetsuo Asano,
Naoki Katoh,
Hisao Tamaki,
Takeshi Tokuyama:
On Geometric Structure of Global Roundings for Graphs and Range Spaces.
SWAT 2004: 455-467 |
| 59 | EE | 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) |
| 58 | EE | 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) |
| 2003 |
|---|
| 57 | | Tetsuo Asano,
Reinhard Klette,
Christian Ronse:
Geometry, Morphology, and Computational Imaging, 11th International Workshop on Theoretical Foundations of Computer Vision Dagstuhl Castle, Germany, April 7-12, 2002, Revised Papers
Springer 2003 |
| 56 | | 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 |
| 55 | EE | Tetsuo Asano,
Naoki Katoh,
Hisao Tamaki,
Takeshi Tokuyama:
The Structure and Number of Global Roundings of a Graph.
COCOON 2003: 130-138 |
| 54 | EE | 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) |
| 53 | EE | 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) |
| 2002 |
|---|
| 52 | EE | 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 |
| 51 | EE | Tetsuo Asano,
David G. Kirkpatrick,
Chee-Keng Yap:
Pseudo approximation algorithms, with applications to optimal motion planning.
Symposium on Computational Geometry 2002: 170-178 |
| 50 | EE | Tetsuo Asano,
Naoki Katoh,
Koji Obokata,
Takeshi Tokuyama:
Combinatorial and Geometric Problems Related to Digital Halftoning.
Theoretical Foundations of Computer Vision 2002: 58-71 |
| 49 | | Tetsuo Asano,
Antonio Hernández-Barrera,
Subhas C. Nandy:
Translating a convex polyhedron over monotone polyhedra.
Comput. Geom. 23(3): 257-269 (2002) |
| 48 | | Subhas C. Nandy,
Tetsuo Asano,
Tomohiro Harayama:
Shattering a set of objects in 2D.
Discrete Applied Mathematics 122(1-3): 183-194 (2002) |
| 2001 |
|---|
| 47 | EE | Tetsuo Asano,
Takeshi Tokuyama:
How to Color a Checkerboard with a Given Distribution - Matrix Rounding Achieving Low 2×2-Discrepancy.
ISAAC 2001: 636-648 |
| 46 | EE | Tetsuo Asano,
Yasuyuki Kawamura,
Reinhard Klette,
Koji Obokata:
Minimum-Length Polygons in Approximation Sausages.
IWVF 2001: 103-112 |
| 45 | | Tetsuo Asano,
Naoki Katoh,
Takeshi Tokuyama:
A unified scheme for detecting fundamental curves in binary edge images.
Comput. Geom. 18(2): 73-93 (2001) |
| 44 | | 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) |
| 43 | | 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) |
| 42 | EE | Subhas C. Nandy,
Tomohiro Harayama,
Tetsuo Asano:
Dynamically maintaining the widest k-dense corridor.
Theor. Comput. Sci. 255(1-2): 627-639 (2001) |
| 2000 |
|---|
| 41 | EE | Subhas C. Nandy,
Tomohiro Harayama,
Tetsuo Asano:
Dynamically Maintaining the Widest k -Dense Corridor.
CIAC 2000: 187-198 |
| 40 | EE | Tetsuo Asano,
Tomomi Matsui,
Takeshi Tokuyama:
On the Complexities of the Optimal Rounding Problems of Sequences and Matrices.
SWAT 2000: 476-489 |
| 39 | | Tetsuo Asano,
Tomomi Matsui,
Takeshi Tokuyama:
Optimal Roundings of Sequences and Matrices.
Nord. J. Comput. 7(3): 241- (2000) |
| 38 | EE | 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) |
| 1999 |
|---|
| 37 | EE | Tetsuo Asano,
Yasuyuki Kawamura:
Computational comparison of voting-based and arrangement-based schema for digital line detection.
CCCG 1999 |
| 36 | EE | Tetsuo Asano,
Naoki Katoh,
Kazuhiro Kawashima:
A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree.
ISAAC 1999: 317-326 |
| 35 | EE | 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 |
| 1998 |
|---|
| 34 | EE | 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 |
| 33 | EE | Tetsuo Asano,
Naoki Katoh,
Hisao Tamaki,
Takeshi Tokuyama:
Convertibility among Grid Filling Curves.
ISAAC 1998: 307-316 |
| 32 | | Tetsuo Asano:
Effective Use of Geometric Properties for Clustering.
JCDCG 1998: 30-46 |
| 1997 |
|---|
| 31 | EE | 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 |
| 30 | EE | 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) |
| 1996 |
|---|
| 29 | | Tetsuo Asano,
Yoshihide Igarashi,
Hiroshi Nagamochi,
Satoru Miyano,
Subhash Suri:
Algorithms and Computation, 7th International Symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996, Proceedings
Springer 1996 |
| 28 | | Tetsuo Asano,
Danny Z. Chen,
Naoki Katoh,
Takeshi Tokuyama:
Polynomial-Time Solutions to Image Segmentation.
SODA 1996: 104-113 |
| 27 | EE | Tetsuo Asano,
David G. Kirkpatrick,
Chee-Keng Yap:
d1-Optimal Motion for a Rod (Extended Abstract).
Symposium on Computational Geometry 1996: 252-263 |
| 26 | | Tetsuo Asano,
Naoki Katoh:
Variants for the Hough Transform for Line Detection.
Comput. Geom. 6: 231-252 (1996) |
| 1995 |
|---|
| 25 | | 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 |
| 1994 |
|---|
| 24 | | Tetsuo Asano,
Takeshi Tokuyama:
Topological Walk Revisited.
CCCG 1994: 1-6 |
| 23 | | Tetsuo Asano,
Naoki Katoh,
Takeshi Tokuyama:
A Unified Scheme for Detecting Fundamental Curves in Binary Edge Images.
ESA 1994: 215-226 |
| 22 | | Tetsuo Asano:
Reporting and Counting Intersections of Lines within a Polygon.
ISAAC 1994: 652-659 |
| 21 | | 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) |
| 20 | | Tetsuo Asano,
Leonidas J. Guibas,
Takeshi Tokuyama:
Walking on an arrangement topologically.
Int. J. Comput. Geometry Appl. 4(2): 123-151 (1994) |
| 1993 |
|---|
| 19 | | Tetsuo Asano,
Naoki Katoh:
Number Theory Helps Line Detection in Digital Images.
ISAAC 1993: 313-322 |
| 18 | | Tetsuo Asano,
Takeshi Tokuyama:
Algorithms for Projecting Points To Give the Most Uniform Distribution with Applications to Hashing.
Algorithmica 9(6): 572-590 (1993) |
| 1992 |
|---|
| 17 | | Naoyoshi Kanamaru,
Takao Nishizeki,
Tetsuo Asano:
Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming.
IPCO 1992: 61-71 |
| 1991 |
|---|
| 16 | | Tetsuo Asano,
Takeshi Tokuyama:
Circuit Partitioning Algorithms: Graph Model versus Geometry Model.
ISA 1991: 94-103 |
| 15 | EE | Tetsuo Asano,
Leonidas J. Guibas,
Takeshi Tokuyama:
Walking on an Arrangement Topologically.
Symposium on Computational Geometry 1991: 297-306 |
| 1990 |
|---|
| 14 | | Tetsuo Asano,
Toshihide Ibaraki,
Hiroshi Imai,
Takao Nishizeki:
Algorithms, International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990, Proceedings
Springer 1990 |
| 13 | | 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 |
| 1988 |
|---|
| 12 | EE | 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 |
| 1987 |
|---|
| 11 | | Tetsuo Asano,
Hiroshi Umeo:
Systolic Algorithms for Computing the Visibility Polygon and Triangulation of A Polygonal Region.
Parallel Algorithms and Architectures 1987: 77-85 |
| 10 | | Takao Asano,
Tetsuo Asano,
Hiroshi Imai:
Shortest Path Between Two Simple Polygons.
Inf. Process. Lett. 24(5): 285-288 (1987) |
| 1986 |
|---|
| 9 | | Takao Asano,
Tetsuo Asano,
Leonidas J. Guibas,
John Hershberger,
Hiroshi Imai:
Visibility of Disjoint Polygons.
Algorithmica 1(1): 49-63 (1986) |
| 8 | EE | Takao Asano,
Tetsuo Asano,
Hiroshi Imai:
Partitioning a polygonal region into trapezoids.
J. ACM 33(2): 290-312 (1986) |
| 7 | | Takao Asano,
Tetsuo Asano,
Ron Y. Pinter:
Polygon Triangulation: Efficiency and Minimality.
J. Algorithms 7(2): 221-231 (1986) |
| 1985 |
|---|
| 6 | | Takao Asano,
Tetsuo Asano,
Leonidas J. Guibas,
John Hershberger,
Hiroshi Imai:
Visibility-Polygon Search and Euclidean Shortest Paths
FOCS 1985: 155-164 |
| 5 | EE | 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) |
| 1983 |
|---|
| 4 | | Tetsuo Asano,
Takao Asano:
Minimum Partition of Polygonal Regions into Trapezoids
FOCS 1983: 233-241 |
| 1981 |
|---|
| 3 | EE | Tetsuo Asano,
Naokazu Yokoya:
Image segmentation schema for low-level computer vision.
Pattern Recognition 14(1-6): 267-273 (1981) |
| 1977 |
|---|
| 2 | | 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) |
| 1976 |
|---|
| 1 | | Mitsuo Kurachi,
Y. Matsui,
Tetsuo Asano:
Network Planning for a Common Use Computer Communication Network.
ICCC 1976: 379-382 |
