**List of Publications**

**Tetsuo ASANO**

**Ph.D. Thesis (Doctor of Engineering)**

"**Wire Routing Scheme Based on Graph Theory Model**"

[101] Matsuo Konagaya and Tetsuo Asano, "

[100] Tetsuo Asano and Revant Kumar, "**A Small-Space Algorithm for Removing Small Connected Components
from a Binary Image**," to appear in IEICE Trans. EA, Special
Section on Discrete Mathematics and Its Applications.

**2012**

[99] Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, and
Ryuhei Uehara: ``**Kaboozle is NP-complete, even in a
Strip Form**,'' Journal of Information Processing, 20(3), pp. 713-718, 2012.

[98] Tetsuo Asano, Jesper
Jansson, Kunihiko Sadakane, Ryuhei Uehara, and Gabriel Valiente: ``**Faster Computation of the Robinson-Foulds Distance between
Phylogenetic Networks**,'' Information Sciences, Inf. Sci. 197: 77-90 (2012).

[97] T. Asano,
``**In-place Algorithm for Erasing a Connected
Component in a Binary Image**,''
Theory of Computing Systems, 50, 1, pp. 111-123,2 2012.

**2011**

[96] Tetsuo Asano, Wolfgang Mulzer, and yajun Wang, ``

[95] Eishi Chiba, Tetsuo Asano, Takeshi Miura, Naoki Katoh and Ikuo Mitsuka, "

[94] T. Asano, W. Mulzer, G. Rote, Y. Wang,``

[93] T. Asano, ``

[92] T. Asano and H. Tanaka, ``**In-place Algorithm for Connected Components Labeling**,'' Journal of Pattern Recognition Research, vol.5, No. 1, pp:10-22, 2010.

[91] T. Asano and H. Tanaka, ``**In-place Linear-time Algorithms for Euclidean Distance Transform**,'' LNCS Transactions on Computational Science, 8, pp:103-113, 2010.

[90] B. Aronov, T. Asano, and S. Funke, ``**Optimal Triangulations of points and segments with steiner points**,'' International Journal of Computational Geometry and Applications, 20,
1, pp:89-104, 2010.

[89] T. Asano, Peter Brass, and Shinji Sasahara, ``** Disc Covering Problem
with Application to Digital Halftoning,’’ **Theory of Computing System, vol. 46, No.2, pp.157-173, February 2010

**2009**

[88] T. Asano, V. E. Brimkov, R. P. Barneva: **Some theoretical challenges in digital geometry: A perspective**. Discrete Applied Mathematics, 157(16), pp: 3362-3371, 2009.

[87] Tetsuo Asano, Sergey Bereg, and David Kirkpatrick: “**Finding Nearest Larger Neighbors: A Case
Stgudy in Algorithm Design and Analysis**,” Lecture Notes in Computer Science, “Efficient
Algorithms,” editied by S. Albers, H. Alt, and S.
Naeher, Springer, pp.249-260, 2009.

[86] Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass,
Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, and Alexander
Wolff, ``**Constructing Optimal Highways**,'' Internat. J. Found. Comput. Sci., 20, 1, pp.3-23, 2009.

[85] Tetsuo Asano, Naoki Katoh, Kurt
Mehlhorn, and Takeshi Tokuyama: “**Some Generalizations of Least-Squares Algorithms**,”
in Statistical Science and Interdiciplinary Research Vol.3,
``Algorithms, Architectures and Information Systems Security,'' edited by B.B.
Bhattacharya, S. Sur-Kolay, S.C. Nandy, and A. BaguchiI, World Scientific Publishers, pp.55-74, 2009.

[84] T. Asano, ``**Constant-Working-Space
Algorithms for Image Processing**,'' Monograph:
``ETVC08: Emerging Trends and Challenges in Visual Computing，'' ETVC 2008:
268-283, edited
by Frank Nielsen, 2009.

[83] T. Asano, P. Bose, P. Carmi, A.
Maheshwari, C. Shu, M.. Smid, and S. Wuhrer, `` **A Linear-Space Algorithm for
Distance Preserving Graph Embedding**,’’Computational Geometry: Theory and Applications, 42(4), pp.289-304,,
2009.

[82] 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**

[81] Tetsuo Asano, `**`Online
Uniformity of Integer Points on a Line**,'' Inf. Process.
Lett. 109(1): 57-60 (2008)

[80] T. Asano, S. Bitou, M. Motoki and N. Usui, “**Space-Efficient
Algorithm for Image Rotation**,” IEICE
Transactions 91-A(9): 2341-2348 (2008).

[79] T. Asano, N. Katoh, H. Tamaki, and
T. Tokuyama, “**Voronoi Diagrams with Respect
to Criteria on Vision Information**”, Japan Journal of Industrial and Applied Mathematics, Vol.25, pp.1-16, 2008.

[78] Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C.
Nandy, Shinji Sasahara, and Takeaki Uno: "**A Generalization of Magic Squares with
Applications to Digital Halftoning**," *Theory
of Computing System*, Volume 42, Number 2, pp.143-156, February 2008.

**2007**

[77] Xuefeng Liang, Arijit Bishnu and
Tetsuo Asano, “**A Robust Fingerprint Indexing Scheme Using Minutia
Neighborhood Structure and Low-order Delaunay Triangles**,” IEEE Transactions on Information
Forensics and Security，Volume 2, No. 4, pp.721-733,
December 2007.

[76] T. Asano, “**Aspect-Ratio Voronoi Diagram and Its Complexity
Bounds**”, Information Processing Letters, volume
105, Issue 1, 31, pp 26-31, December 2007.

[75] T. Asano, J. Matousek, and T.
Tokuyama, “**Zone diagrams: Existence,
Uniqueness and Algorithmic Challenge**,” SIAM J. on Computing, Vol.37, Issue 4, pp.1182-1198, September 2007.

[74] X. Liang, A. Bishnu and T. Asano, "**Combinatorial Approach to
Fingerprint Binarization and Minutiae Extraction Using Euclidean Distance
Transform**," International Journal of Pattern
Recognition and Artificial Intelligence, vol. 27, no. 7, pp.1141 –
1158, Nov., 2007.

[73] T. Asano, J. Matousek,
and T. Tokuyama “**The distance trisector
curve**,” Advances in
Mathematics, Vol.212, Issue 1, pp.338-360, 2007.

**2006**

[72] S. Teramoto T. Asano, N.
Katoh, and B. Doerr, “**Inserting Points
Uniformly at Every Instance**,” IEICE Trans. on Info. and Systems, E89-D, 8, pp.2348-2356, 2006

[71] X.
Liang and T. Asano, “**A Linear Time Algorithm for Binary Fingerprint
Image Denoising Using Distance Transform**,” IEICE Trans. on e89-D, 4, pp.1534-1542, 2006.

[70] B. Aronov, T. Asano, N. Katoh, K. Mehlhorn, and T. Tokuyama: “**Polyline
fitting of planar points under min-sum criterion**,” International Journal on Computational
Geometry and Applications, 16(2-3), pp.97-116, 2006.

[69] T. Asano, P. Evans, R. Uehara, G. Valiente: “**Site consistency
in phylogenetic networks with recombination**,” In Iliopoulos, C.S., Park, K., Steinh¨ofel,
K., eds.: Algorithmics in Bioinformatics. Volume 6 of Texts in Algorithmics.
College Publications (2006) ch. 2, pp.15-26.

**2005**

[68] S.
Sasahara and T. Asano: "**New Dispersed-dot halftoning technique by
elimination of unstable pixels for electrophotography**," Journal of Electronic Imaging, pp.023006-1-9, 2005.

[67]T. Asano, M. de Berg, O. Cheong, H. Everett, H.
Haverkort, N. Katoh, and A. Wolff: "**Optimal Spanners for
Axis-Aligned Buildings**," *Computational
Geometry: Theory and Applications*, 30, 1, pp.59-77, January 2005.

**2004**

[66] T. Asano, N. Katoh, H. Tamaki and T. Tokuyama, "**The structure and number of global roundings of a
graph**.",
*Theoretical Computer Science*, Vol.325, pp.425-437, 2004.

[65] T. Shimamoto and T. Asano: "**Arranging Fewest Possible Probes to Detect a
Hidden Object with Industrial Application**," *IEICE
Trans. Fundamentals*, 87-A (5), pp.1053-1058, May 2004.

[64] T. Asano, D.G. Kirkpatrick, and C.K.
Yap, ``**Pseudo-approximation algorithm with applications to optimal
motion planning**,'' Discrete
and Computational Geometry, 31, 1, pp.139-171, 2004.

**2003**

[63]S. Sasahara, T. Asano, "**Adaptive
****cluster arrangement for Cluster-dot halftoning**", Journal
of the Imaging Society of Japan,
Vol.42 No.4 pp.333-339, 2003

[62] T. Asano, M. de
Berg, O. Cheong, L. J. Guibas, J. Snoeyink, and H. Tamaki, "**Spanning Trees Crossing Few Barriers**," Discrete
and Computational Geometry, 30, 4, pp.591-606, 2003.

[61]
T. Asano, N. Katoh, K. Obokata, and T. Tokuyama, "**Matrix Rounding under
the Lp-Discrepancy Measure and Its Application to Digital Halftoning **", *SIAM
Journal on Computing*, 32(6), pp. 1423-1435, December 2003

[60] T.Asano, Y. Kawamura, R. Klette, and K. Obokata, "**Digital
Curve Approximation with Length Evaluation**," IEICE Trans. on
Fundamentals, E86-A, 5, May 2003

[59] T. Asano, N. Katoh, K. Obokata, and T.
Tokuyama, "**Combinatorial and
Geometric Problems Related to Digital Halftoning**," Lecture Notes of Computer Science,
Theoretical Foundations of Computer Vision "Geometry, Morphology, and
Computational Imaging," Springer, LNCS 2616, pp.58-71, 2003

[58] T. Asano, "**Digital Halftoning: Algorithm
Engineering Challenges**," IEICE
Trans. on Inf. and Syst., E86-D, 2, pp.159-178, 2003.

**2002**

[57] T. Asano, "**Algorithmic
Evaluation of Line Detection Problem**," Interdisciplinary Information Sciences,
Vol. 8, No.2, pp. 137-145, December 2002.

[56] T. Asano, A. Hernandez-Barrera, and S.C.
Nandy, "**Translating
a convex polyhedron over monotone polyhedra**," CGTA: Comput. Geom. Theory and Appli., 23,
pp257-269, 2002.

[55] S. C.
Nandy, T. Asano, and T. Harayama, "**Shattering a set of objects in 2D**," Discrete
Applied Math., 122 pp.183-194, 2002.

**2001**

[54]T. Asano, D.Z. Chen, N. Katoh, and T. Tokuyama, "**Efficient Algorithms for Optimization-based
Image Segmentation**,"
International Journal of Computational Geometry and
Applications,11,2,145-166,2001

[53]T.
Asano, K. Obokata, T. Tokuyama,"**On
detecting digital line components in a binary image**

,"
IEICE Trans. on Fundamentals,E84-A,5,1120-1129,May 2001