Tetsuo Asano Professor
School of Information Science（Department of Information Science・Theoretical Information Science）

Results 1-20 of about 145

• 1.　Faster computation of the Robinson-Foulds distance between phylogenetic networks，Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente，Information Science, Vol 197, 2012，pp. 77-90
• 2.　Computation of the Robinson-Foulds Distance between Phylogenetic Networks，Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, and Gabriel Valiente，Information Sciences, accepted
• 3.　Zero-space Data structure for farthest-point Voronoi diagram，Tetsuo Asano and Matsuo Konagaya，Abstract of the 4th Annual Meeting of Asian Association for Algorithms and Computation, p.44，April, 2011
• 4.　NP-completeness of generalized Kaboozle，Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, and Ryuhei Uehara，Journal of Information Processing, 2012，Vol.20，No.3
• 5.　Collision Probability in an In-Line Machines Model，Eishi Chiba, Tetsuo Asano, Takeshi Miura, Naoki Katoh and Ikuo Mitsuka，Transactions on Computational Science XIII, LNCS 6750，pp. 1-12，2011
• 6.　In-place Algorithm for Erasing a Connected Component ina Binary Image，Tetsuo Asano，Theory of Computing, accepted，to appear
• 7.　In-place Algorithm for Connected Components Labeling，T. Asano and H. Tanaka，Journal of Pattern Recognition Research，to appear
• 8.　Constant-Work-Space Image Scan with a Given Angle，T. Asano，Interdisciplinary Information Sciences, (2011)，Vol. 17，No. 1，pp.39-44，2011
• 9.　Memory-Constrained Algorithms for Shortest Path Problem，Tetsuo Asano and Benjamin Doerr，Proc. Canadian Conference on Computational Geometry, pp:135-138, 2011，August, 2011
• 10.　Designing Algorithms with Limited Work Space，Tetsuo Asano，Proc. 8th Annual Conference on Theory and Applications of Models of Computation (Invited Talk)，May, 2011
• 11.　Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon，T. Asano, W. Mulzer, and Y. Wang,，Proc. 4th International Workshop on Algorithms and Computation, WALCOM，9-20,，February, 2010
• 12.　Do We Need a Stack to Erase a Component in a Binary Image?,，T. Asano，Fifth International Conference on FUN WITH ALGORITHMS，16-27，June, 2010
• 13.　Disc Covering Problem with Application to Digital Halftoning，T. Asano, Peter Brass, and Shinji Sasahara，Theory of Computing System，43，2，157-173，February 2010
• 14.　Optimal Triangulations of points and segments with steiner points，B. Aronov, T. Asano, and S. Funke，International Journal of Computational Geometry and Applications，to appear
• 15.　In-place Linear-time Algorithms for Euclidean Distance Transform，T. Asano and H. Tanaka，LNCS Transactions on Computational Science，to appear
• 16.　In-place Algorithm for Connected Components Labeling，T. Asano and H. Tanaka，Journal of Pattern Recognition Research，to appear
• 17.　Kaboozle is NP-hard, even in a strip form，Tetsuo Asano, Erik Demaine, Martin Demaine, and Ryuhei Uehara，5th International Conference on FUN WITH ALGORITHMS, Lecture Notes in Computer Science, 2010/6/2-4
• 18.　Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks，Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, and Gabriel Valiente:，21st Annual Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science, 2010/6/21-23
• 19.　Finding Nearest Larger Neighbors: A Case Stgudy in Algorithm Design and Analysis，Tetsuo Asano, Sergey Bereg, and David Kirkpatrick，Lecture Notes in Computer Science, “Efficient Algorithms,” editied by S. Albers, H. Alt, and S. Naeher, Springer，pp.249-260，2009/08/29
• 20.　Constructing Optimal Highways，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，Internat. J. Found. Comput. Science，20，1，pp.3-23，2009

1  2  3  4  5  6  7  8

[ Next ≫ ]