| 2021 | WALCOM | A New Transportation Problem on a Graph with Sending and Bringing-Back Operations. | Tetsuo Asano |
| 2014 | ISAAC | Depth-First Search Using O(n) Bits. | Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, Ryuhei Uehara |
| 2014 | MFCS | (√n)-Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability. | Tetsuo Asano, David G. Kirkpatrick, Kotaro Nakagawa, Osamu Watanabe |
| 2013 | TAMC | Priority Queues and Sorting for Read-Only Data. | Tetsuo Asano, Amr Elmasry, Jyrki Katajainen |
| 2013 | WADS | Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems. | Tetsuo Asano, David G. Kirkpatrick |
| 2012 | IWCIA | A New Framework for Connected Components Labeling of Binary Images. | Tetsuo Asano, Sergey Bereg |
| 2012 | IWCIA | Small Work Space Algorithms for Some Basic Problems on Binary Images. | Tetsuo Asano, Sergey Bereg, Lilian Buzer |
| 2011 | TAMC | Designing Algorithms with Limited Work Space. | Tetsuo Asano |
| 2010 | CPM | Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks. | Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente |
| 2010 | FUN | Do We Need a Stack to Erase a Component in a Binary Image? | Tetsuo Asano |
| 2010 | FUN | Kaboozle Is NP-complete, Even in a Strip. | Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara |
| 2010 | WALCOM | Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon. | Tetsuo Asano, Wolfgang Mulzer, Yajun Wang |
| 2008 | ISAAC | Constant-Working-Space Algorithms: How Fast Can We Solve Problems without Using Any Extra Array?. | Tetsuo Asano |
| 2008 | IWCIA | Linear Boundary and Corner Detection Using Limited Number of Sensor Rows. | Bishal Prasad, Arijit Bishnu, Tetsuo Asano |
| 2007 | ISAAC | Optimal Triangulation with Steiner Points. | Boris Aronov, Tetsuo Asano, Stefan Funke |
| 2007 | ISAAC | In-Place Algorithm for Image Rotation. | Tetsuo Asano, Shinnya Bitou, Mitsuo Motoki, Nobuaki Usui |
| 2007 | SODA | Zone diagrams: existence, uniqueness and algorithmic challenge. | Tetsuo Asano, Jir Matousek, Takeshi Tokuyama |
| 2006 | ICPR | Fingerprint Matching Using Minutia Polygons. | Xuefeng Liang, Tetsuo Asano |
| 2006 | STOC | The distance trisector curve. | Tetsuo Asano, Jir Matousek, Takeshi Tokuyama |
| 2004 | ICCSA | Disc Covering Problem with Application to Digital Halftoning. | Tetsuo Asano, Peter Bra, Shinji Sasahara |
| 2004 | ISAAC | Polyline Fitting of Planar Points Under Min-sum Criteria. | Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama |
| 2004 | ISAAC | A Generalization of Magic Squares with Applications to Digital Halftoning. | Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno |
| 2004 | IWCIA | A Near-Linear Time Algorithm for Binarization of Fingerprint Images Using Distance Transform. | Xuefeng Liang, Arijit Bishnu, Tetsuo Asano |
| 2003 | COCOON | The Structure and Number of Global Roundings of a Graph. | Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama |
| 2002 | SODA | Matrix rounding under the Lp-discrepancy measure and its application to digital halftoning. | Tetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama |
| 2001 | ISAAC | How to Color a Checkerboard with a Given Distribution - Matrix Rounding Achieving Low 2×2-Discrepancy. | Tetsuo Asano, Takeshi Tokuyama |
| 2000 | CIAC | Dynamically Maintaining the Widest k -Dense Corridor. | Subhas C. Nandy, Tomohiro Harayama, Tetsuo Asano |
| 1999 | ISAAC | A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree. | Tetsuo Asano, Naoki Katoh, Kazuhiro Kawashima |
| 1998 | ISAAC | Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image. | Tetsuo Asano, Hiro Ito, Souichi Kimura, Shigeaki Shimazu |
| 1998 | ISAAC | Convertibility among Grid Filling Curves. | Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama |
| 1997 | STOC | Covering Points in the Plane by | Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama |
| 1996 | ICIP | Digital halftoning algorithm based on random space-filling curve. | Tetsuo Asano |
| 1996 | SODA | Polynomial-Time Solutions to Image Segmentation. | Tetsuo Asano, Danny Z. Chen, Naoki Katoh, Takeshi Tokuyama |
| 1995 | LATIN | Space Filling Curves and Their Use in the Design of Geometric Data Structures. | Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer |
| 1994 | ESA | A Unified Scheme for Detecting Fundamental Curves in Binary Edge Images. | Tetsuo Asano, Naoki Katoh, Takeshi Tokuyama |
| 1994 | ISAAC | Reporting and Counting Intersections of Lines within a Polygon. | Tetsuo Asano |
| 1993 | ISAAC | Number Theory Helps Line Detection in Digital Images. | Tetsuo Asano, Naoki Katoh |
| 1992 | IPCO | Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming. | Naoyoshi Kanamaru, Takao Nishizeki, Tetsuo Asano |
| 1985 | FOCS | Visibility-Polygon Search and Euclidean Shortest Paths | Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai |
| 1983 | FOCS | Minimum Partition of Polygonal Regions into Trapezoids | Tetsuo Asano, Takao Asano |
| 1982 | DAC | Parametric pattern router. | Tetsuo Asano |
| 1976 | ICCC | Network Planning for a Common Use Computer Communication Network. | Mitsuo Kurachi, Y. Matsui, Tetsuo Asano |