| 2021 | ISAAC | Simple Envy-Free and Truthful Mechanisms for Cake Cutting with a Small Number of Cuts. | Takao Asano |
| 2020 | ISAAC | Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts. | Takao Asano, Hiroyuki Umeda |
| 2003 | FCT | An Improved Analysis of Goemans and Williamson's LP-Relaxation for MAX SAT. | Takao Asano |
| 2002 | ISAAC | An Improved Algorithm for the Minimum Manhattan Network Problem. | Ryo Kato, Keiko Imai, Takao Asano |
| 2000 | ISAAC | Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits. | Takao Asano, Magns M. Halldrsson, Kazuo Iwama, Takeshi Matsuda |
| 2000 | SODA | Improved approximation algorithms for MAX SAT. | Takao Asano, David P. Williamson |
| 1997 | ISAAC | A Theoretical Framework of Hybrid Approaches to MAX SAT. | Takao Asano, Kuniaki Hori, Takao Ono, Tomio Hirata |
| 1995 | ISAAC | An Approximation Algorithm for MAX 3-SAT. | Takao Ono, Tomio Hirata, Takao Asano |
| 1993 | ISAAC | Graphical Degree Sequence Problems with Connectivity Requirements. | Takao Asano |
| 1985 | FOCS | Visibility-Polygon Search and Euclidean Shortest Paths | Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai |
| 1984 | FOCS | Dynamic Segment Intersection Search with Applications | Hiroshi Imai, Takao Asano |
| 1983 | FOCS | Minimum Partition of Polygonal Regions into Trapezoids | Tetsuo Asano, Takao Asano |
| 1982 | STOC | Edge-Deletion and Edge-Contraction Problems | Takao Asano, Tomio Hirata |