| 2016 | COCOA | Minimum Weight Polygon Triangulation Problem in Sub-Cubic Time Bound. | Sung Eun Bae, Tong-Wook Shinn, Tadao Takaoka |
| 2015 | ATMOS | Single Source Shortest Paths for All Flows with Integer Costs. | Tadao Takaoka |
| 2015 | COCOA | Algebraic Theory on Shortest Paths for All Flows. | Tadao Takaoka |
| 2014 | ICCS | A Faster Parallel Algorithm for Matrix Multiplication on a Mesh Array. | Sung Eun Bae, Tong-Wook Shinn, Tadao Takaoka |
| 2014 | LATIN | Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems. | Tong-Wook Shinn, Tadao Takaoka |
| 2014 | WALCOM | Some Extensions of the Bottleneck Paths Problem. | Tong-Wook Shinn, Tadao Takaoka |
| 2013 | ICCS | Application of the Maximum Convex Sum Algorithm in Determining Environmental Variables That Affect Nigerian Highland Stream Benthic Communities. | Mohammed Thaher, Danladi Umar, Tadao Takaoka, Jon Harding |
| 2013 | TrustCom | Scalable Attack Representation Model Using Logic Reduction Techniques. | Jin Bum Hong, Dong Seong Kim, Tadao Takaoka |
| 2010 | COCOA | A Simpler Algorithm for the All Pairs Shortest Path Problem with | Tadao Takaoka, Mashitoh Hashim |
| 2010 | ICCSA | Efficient Algorithms for the 2-Center Problems. | Tadao Takaoka |
| 2009 | MFCS | Partial Solution and Entropy. | Tadao Takaoka |
| 2007 | ISAAC | A Sub-cubic Time Algorithm for the | Sung Eun Bae, Tadao Takaoka |
| 2006 | ICCS | Algorithm for | Sung Eun Bae, Tadao Takaoka |
| 2005 | COCOON | Improved Algorithms for the | Sung Eun Bae, Tadao Takaoka |
| 2004 | COCOON | A Faster Algorithm for the All-Pairs Shortest Path Problem and Its Application. | Tadao Takaoka |
| 2000 | COCOON | Theory of Trinomial Heaps. | Tadao Takaoka |
| 1999 | COCOON | Theory of 2-3 Heaps. | Tadao Takaoka |
| 1999 | ISAAC | An O(1) Time Algorithm for Generating Multiset Permutations. | Tadao Takaoka |
| 1996 | WG | Shortest Path Algorithms for Nearly Acyclic Directed Graphs. | Tadao Takaoka |
| 1995 | WG | Sub-Cubic Cost Algorithms for the All Pairs Shortest Path Problem. | Tadao Takaoka |
| 1994 | ISAAC | Approximate Pattern Matching with Samples. | Tadao Takaoka |
| 1994 | SAC | Parallel program verification with directed graphs. | Tadao Takaoka |
| 1991 | WG | A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem. | Tadao Takaoka |
| 1988 | WG | An Efficient Parallel Algorithm for the All Pairs Shortest Path Problem. | Tadao Takaoka |
| 1985 | FOCS | An All Pairs Shortest Path Algorithm with Expected Running Time O(n^2 log n) | Alistair Moffat, Tadao Takaoka |
| 1980 | MFCS | An O(n² log log log n) Expected Time Algorithm for the all Shortest Distance Problem. | Tadao Takaoka, Alistair Moffat |