| 2017 | ESA | Positive-Instance Driven Dynamic Programming for Treewidth. | Hisao Tamaki |
| 2015 | ESA | On the Pathwidth of Almost Semicomplete Digraphs. | Kenta Kitsunai, Yasuaki Kobayashi, Hisao Tamaki |
| 2013 | COCOON | A Linear Edge Kernel for Two-Layer Crossing Minimization. | Yasuaki Kobayashi, Hirokazu Maruta, Yusuke Nakae, Hisao Tamaki |
| 2012 | CSEDU | Tracesheets - Spreadsheets of Program Executions as a Common Ground between Learners and Instructors. | Soichiro Fujii, Hisao Tamaki |
| 2012 | ESA | A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization. | Yasuaki Kobayashi, Hisao Tamaki |
| 2011 | WG | A Polynomial Time Algorithm for Bounded Directed Pathwidth. | Hisao Tamaki |
| 2010 | CSEDU | MAX/C on Sakai - A Web-based C-Programming Course. | Souichirou Fujii, Kazunori Ohkubo, Hisao Tamaki |
| 2010 | ISAAC | Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size. | Qian-Ping Gu, Hisao Tamaki |
| 2010 | ISAAC | Untitled record | Yasuaki Kobayashi, Yuichiro Miyamoto, Hisao Tamaki |
| 2009 | ISAAC | Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in | Qian-Ping Gu, Hisao Tamaki |
| 2009 | ISAAC | Route-Enabling Graph Orientation Problems. | Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara |
| 2008 | ALENEX | Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs. | Zhengbing Bian, Qian-Ping Gu, Marjan Marzban, Hisao Tamaki, Yumi Yoshitake |
| 2005 | ICALP | Optimal Branch-Decomposition of Planar Graphs in | Qian-Ping Gu, Hisao Tamaki |
| 2004 | STACS | Matching Algorithms Are Fast in Sparse Random Graphs. | Hannah Bast, Kurt Mehlhorn, Guido Schfer, Hisao Tamaki |
| 2003 | COCOON | The Structure and Number of Global Roundings of a Graph. | Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama |
| 2003 | ESA | A Linear Time Heuristic for the Branch-Decomposition of Planar Graphs. | Hisao Tamaki |
| 1999 | SODA | Parametric Polymatroid Optimization and Its Geometric Applications. | Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama |
| 1998 | COCOON | Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses. | Kazuo Iwama, Eiji Miyano, Satoshi Tajima, Hisao Tamaki |
| 1998 | ISAAC | Convertibility among Grid Filling Curves. | Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama |
| 1998 | PODS | Latent Semantic Indexing: A Probabilistic Analysis. | Christos H. Papadimitriou, Prabhakar Raghavan, Hisao Tamaki, Santosh S. Vempala |
| 1998 | SODA | Algorithms for the Maxium Subarray Problem Based on Matrix Multiplication. | Hisao Tamaki, Takeshi Tokuyama |
| 1997 | ISAAC | Multi-Color Routing in the Undirected Hypercube. | Qian-Ping Gu, Hisao Tamaki |
| 1997 | ISAAC | A Characterization of Planar Graphs by Pseudo-Line Arrangements. | Hisao Tamaki, Takeshi Tokuyama |
| 1997 | STOC | Covering Points in the Plane by | Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama |
| 1996 | STOC | Noise-Tolerant Distribution-Free Learning of General Geometric Concepts. | Nader H. Bshouty, Sally A. Goldman, H. David Mathias, Subhash Suri, Hisao Tamaki |
| 1995 | STOC | Motion planning for a steering-constrained robot through moderate obstacles. | Pankaj K. Agarwal, Prabhakar Raghavan, Hisao Tamaki |
| 1994 | FOCS | Motion Planning on a Graph (Extended Abstract) | Christos H. Papadimitriou, Prabhakar Raghavan, Madhu Sudan, Hisao Tamaki |
| 1994 | ISAAC | The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection. | Kazuo Iwano, Prabhakar Raghavan, Hisao Tamaki |
| 1994 | STOC | On the fault tolerance of the butterfly. | Anna R. Karlin, Greg Nelson, Hisao Tamaki |
| 1994 | SPAA | Construction of the Mesh and the Torus Tolerating a Large Number of Faults. | Hisao Tamaki |
| 1993 | PODC | Fast Deflection Routing for Packets and Worms (Extended Summary). | Amotz Bar-Noy, Prabhakar Raghavan, Baruch Schieber, Hisao Tamaki |
| 1992 | FOCS | Efficient Self-Embedding of Butterfly Networks with Random Faults | Hisao Tamaki |
| 1992 | SPAA | Robust Bounded-Degree Networks with Small Diameters. | Hisao Tamaki |
| 1987 | ICLP | Stream-Based Compilation of Ground I/O PROLOG into Committed-Choice Languages. | Hisao Tamaki |
| 1986 | ICLP | OLD Resolution with Tabulation. | Hisao Tamaki, Taisuke Sato |
| 1985 | ICPP | A Distributed Unification Scheme for Systolic Logic Programs. | Hisao Tamaki |
| 1984 | ICLP | Unfold/Fold Transformation of Logic Programs. | Hisao Tamaki, Taisuke Sato |
| 1983 | ICALP | Enumeration of Success Patterns in Logic Programs. | Taisuke Sato, Hisao Tamaki |