Ogawa Lab., Graduate School of Science Staff Prof. Tetsuo OGAWA, Associate Prof. Kenichi ASANO, Assist. Prof. Takuma OHASHI, Researcher Motoaki BAMBA, Researcher Tatsuro YUGE

Source URL: www.photon.osaka-u.ac.jp

Memory-Constrained Algorithms for Simple Polygons∗ Tetsuo Asano† Kevin Buchin‡ Wolfgang Mulzer¶

Source URL: page.mi.fu-berlin.de

Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 0, no. 0, pp. 0–0 (0) Constant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons Tetsuo Asano 1 Wolfgang Mulzer 2 Yajun Wang 3

Source URL: page.mi.fu-berlin.de

Preliminary Call for Papers

Source URL: www-or.amp.i.kyoto-u.ac.jp

• Theoretical computer science
• Computer science
• Peter Eades
• Mathematics
• Algorithm
• International Symposium on Algorithms and Computation
• Tetsuo Asano
• Academia

Local  arrangement  report Tetsuo  Asano  (JAIST)   David  Avis  (Kyoto)   Jinhee  Chun(Tohoku)   Naoki  Katoh(Kyoto)  

Source URL: computational-geometry.org

CCCG 2011, Toronto ON, August 10–12, 2011 Memory-Constrained Algorithms for Shortest Path Problems Tetsuo Asano∗ Abstract

Source URL: www.cccg.ca

• Network theory
• Routing algorithms
• Planar separator theorem
• Shortest path problem
• Distance
• Induced path
• Tree
• NP-complete problems
• Path decomposition
• Graph theory
• Mathematics
• Theoretical computer science

CCCG 2011, Toronto ON, August 10–12, 2011 Memory-Constrained Algorithms for Shortest Path Problems Tetsuo Asano∗ Abstract

Source URL: 2011.cccg.ca

• Network theory
• Routing algorithms
• Planar separator theorem
• Shortest path problem
• Distance
• Induced path
• Tree
• NP-complete problems
• Path decomposition
• Graph theory
• Mathematics
• Theoretical computer science

Computational Comparison of Voting-based and Arragement-based Schema for Digital Line Detection Tetsuo Asano 1 Yasuyuki Kawamura

Source URL: www.cccg.ca

• Mathematics
• Analytic geometry
• Hough transform
• Elementary geometry
• Line
• Arrangement of lines
• Edge detection
• Slope
• Randomized Hough transform
• Geometry
• Image processing
• Computer vision

Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks − Tetsuo Asano (JAIST, Japan) − Jesper Jansson (Ochanomizu University, Japan) − Kunihiko Sadakane (NII, Japan)

Source URL: www.cs.ucr.edu

• Phylogenetic tree
• Historical linguistics
• Tree
• Vertex
• Computational phylogenetics
• Science
• Mathematics
• Phylogenetics
• Genetics
• Phylogenetic network

Local  arrangement  report Tetsuo  Asano  (JAIST)   David  Avis  (Kyoto)   Jinhee  Chun(Tohoku)   Naoki  Katoh(Kyoto)  

Source URL: www.computational-geometry.org