Program Transformation Through Meta-shifting. - Hisao Tamaki; Taisuke Sato (New Gener. Comput., 1983)

Transformational Logic Program Synthesis. - Taisuke Sato; Hisao Tamaki (FGCS, 1984)

Unfold/Fold Transformation of Logic Programs. - Hisao Tamaki; Taisuke Sato (ICLP, 1984)

Semantics of a Logic Programming Language with a Reducibility Predicate. - Hisao Tamaki (SLP, 1984)

Enumeration of Success Patterns in Logic Programs. - Taisuke Sato; Hisao Tamaki (Theor. Comput. Sci., 1984)

A Distributed Unification Scheme for Systolic Logic Programs. - Hisao Tamaki (ICPP, 1985)

OLD Resolution with Tabulation. - Hisao Tamaki; Taisuke Sato (ICLP, 1986)

Stream-Based Compilation of Ground I/O PROLOG into Committed-Choice Languages. - Hisao Tamaki (ICLP, 1987)

First Order Compiler: A Deterministic Logic Program Synthesis Algorithm. - Taisuke Sato; Hisao Tamaki (J. Symb. Comput., 1989)

Existential Continuation. - Taisuke Sato; Hisao Tamaki (New Gener. Comput., 1989)

Robust Bounded-Degree Networks with Small Diameters. - Hisao Tamaki (SPAA, 1992)

Fast Deflection Routing for Packets and Worms (Extended Summary). - Amotz Bar-Noy; Prabhakar Raghavan; Baruch Schieber; Hisao Tamaki (PODC, 1993)

Structural robustness of the butterfly and related networks against random faults. - Hisao Tamaki (1993)

Motion Planning on a Graph (Extended Abstract) - Christos H. Papadimitriou; Prabhakar Raghavan; Madhu Sudan 001; Hisao Tamaki (FOCS, 1994)

The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection. - Kazuo Iwano; Prabhakar Raghavan; Hisao Tamaki (ISAAC, 1994)

On the fault tolerance of the butterfly. - Anna R. Karlin; Greg Nelson; Hisao Tamaki (STOC, 1994)

Routings for Involutions of a Hypercube. - Alan P. Sprague; Hisao Tamaki (Discret. Appl. Math., 1994)

How to Cut Pseudo-Parabolas into Segments. - Hisao Tamaki; Takeshi Tokuyama (SCG, 1995)

Motion planning for a steering-constrained robot through moderate obstacles. - Pankaj K. Agarwal; Prabhakar Raghavan; Hisao Tamaki (STOC, 1995)

Construction of the Mesh and the Torus Tolerating a Large Number of Faults. - Hisao Tamaki (J. Comput. Syst. Sci., 1996)

Multi-Color Routing in the Undirected Hypercube. - Qian-Ping Gu; Hisao Tamaki (ISAAC, 1997)

A Characterization of Planar Graphs by Pseudo-Line Arrangements. - Hisao Tamaki; Takeshi Tokuyama (ISAAC, 1997)

Covering Points in the Plane by k-Tours: Towards a Polynomial Time Approximation Scheme for General k. - Tetsuo Asano; Naoki Katoh; Hisao Tamaki; Takeshi Tokuyama (STOC, 1997)

Routing a Permutation in the Hypercube by Two Sets of Edge Disjoint Paths. - Qian-Ping Gu; Hisao Tamaki (J. Parallel Distributed Comput., 1997)

Convertibility among Grid Filling Curves. - Tetsuo Asano; Naoki Katoh; Hisao Tamaki; Takeshi Tokuyama (ISAAC, 1998)

Algorithms for the Maxium Subarray Problem Based on Matrix Multiplication. - Hisao Tamaki; Takeshi Tokuyama (SODA, 1998)

Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets. - Tatsuya Akutsu; Hisao Tamaki; Takeshi Tokuyama (Discret. Comput. Geom., 1998)

How to Cut Pseudoparabolas into Segments. - Hisao Tamaki; Takeshi Tokuyama (Discret. Comput. Geom., 1998)

Noise-Tolerant Distribution-Free Learning of General Geometric Concepts. - Nader H. Bshouty; Sally A. Goldman; H. David Mathias; Subhash Suri; Hisao Tamaki (J. ACM, 1998)

Efficient Self-Embedding of Butterfly Networks with Random Faults. - Hisao Tamaki (SIAM J. Comput., 1998)

Multicolor routing in the undirected hypercube. - Qian-Ping Gu; Hisao Tamaki (Discret. Appl. Math., 2000)

Greedily Finding a Dense Subgraph. - Yuichi Asahiro; Kazuo Iwama; Hisao Tamaki; Takeshi Tokuyama (J. Algorithms, 2000)

Latent Semantic Indexing: A Probabilistic Analysis. - Christos H. Papadimitriou; Prabhakar Raghavan; Hisao Tamaki; Santosh S. Vempala (J. Comput. Syst. Sci., 2000)

Efficient randomized routing algorithms on the two-dimensional mesh of buses. - Kazuo Iwama; Eiji Miyano; Satoshi Tajima; Hisao Tamaki (Theor. Comput. Sci., 2001)

Parametric Polymatroid Optimization and Its Geometric Applications. - Naoki Katoh; Hisao Tamaki; Takeshi Tokuyama (Int. J. Comput. Geom. Appl., 2002)

A Linear Time Heuristic for the Branch-Decomposition of Planar Graphs. - Hisao Tamaki (ESA, 2003)

Spanning Trees Crossing Few Barriers. - Tetsuo Asano; Mark de Berg; Otfried Cheong; Leonidas J. Guibas; Jack Snoeyink; Hisao Tamaki (Discret. Comput. Geom., 2003)

On Geometric Structure of Global Roundings for Graphs and Range Spaces. - Tetsuo Asano; Naoki Katoh; Hisao Tamaki; Takeshi Tokuyama (SWAT, 2004)

The structure and number of global roundings of a graph. - Tetsuo Asano; Naoki Katoh; Hisao Tamaki; Takeshi Tokuyama (Theor. Comput. Sci., 2004)

On the probability of rendezvous in graphs. - Martin Dietzfelbinger; Hisao Tamaki (Random Struct. Algorithms, 2005)

Angular Voronoi Diagram with Applications. - Tetsuo Asano; Hisao Tamaki; Naoki Katoh; Takeshi Tokuyama (ISVD, 2006)

Matching Algorithms Are Fast in Sparse Random Graphs. - Hannah Bast; Kurt Mehlhorn; Guido Schäfer; Hisao Tamaki (Theory Comput. Syst., 2006)

Voronoi Diagram with Respect to Criteria on Vision Information. - Tetsuo Asano; Naoki Katoh; Hisao Tamaki; Takeshi Tokuyama (ISVD, 2007)

Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs. - Zhengbing Bian; Qian-Ping Gu; Marjan Marzban; Hisao Tamaki; Yumi Yoshitake (ALENEX, 2008)

Optimal branch-decomposition of planar graphs in O(n3) Time. - Qian-Ping Gu; Hisao Tamaki (ACM Trans. Algorithms, 2008)

Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n1 + ε) Time. - Qian-Ping Gu; Hisao Tamaki (ISAAC, 2009)

MAX/C on Sakai - A Web-based C-Programming Course. - Souichirou Fujii; Kazunori Ohkubo; Hisao Tamaki (CSEDU (1), 2010)

k-cyclic Orientations of Graphs. - Yasuaki Kobayashi; Yuichiro Miyamoto; Hisao Tamaki (ISAAC (2), 2010)

A Polynomial Time Algorithm for Bounded Directed Pathwidth. - Hisao Tamaki (WG, 2011)

Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in O(n1+ϵ) time. - Qian-Ping Gu; Hisao Tamaki (Theor. Comput. Sci., 2011)

Tracesheets - Spreadsheets of Program Executions as a Common Ground between Learners and Instructors. - Soichiro Fujii; Hisao Tamaki (CSEDU (1), 2012)

Computing Directed Pathwidth in O(1.89 n ) Time. - Kenta Kitsunai; Yasuaki Kobayashi; Keita Komuro; Hisao Tamaki; Toshihiro Tano (IPEC, 2012)

Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size. - Qian-Ping Gu; Hisao Tamaki (Algorithmica, 2012)

Route-Enabling Graph Orientation Problems. - Takehiro Ito; Yuichiro Miyamoto; Hirotaka Ono 001; Hisao Tamaki; Ryuhei Uehara (Algorithmica, 2013)

Search Space Reduction through Commitments in Pathwidth Computation: An Experimental Study. - Yasuaki Kobayashi; Keita Komuro; Hisao Tamaki (SEA, 2014)

A linear edge kernel for two-layer crossing minimization. - Yasuaki Kobayashi; Hirokazu Maruta; Yusuke Nakae; Hisao Tamaki (Theor. Comput. Sci., 2014)

On the Pathwidth of Almost Semicomplete Digraphs. - Kenta Kitsunai; Yasuaki Kobayashi; Hisao Tamaki (ESA, 2015)

A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization. - Yasuaki Kobayashi; Hisao Tamaki (Algorithmica, 2015)

Treedepth Parameterized by Vertex Cover Number. - Yasuaki Kobayashi; Hisao Tamaki (IPEC, 2016)

Computing Directed Pathwidth in O(1.89n) Time. - Kenta Kitsunai; Yasuaki Kobayashi; Keita Komuro; Hisao Tamaki; Toshihiro Tano (Algorithmica, 2016)

Finalizing tentative matches from truncated preference lists. - Hisao Tamaki (CoRR, 2016)

A faster fixed parameter algorithm for two-layer crossing minimization. - Yasuaki Kobayashi; Hisao Tamaki (Inf. Process. Lett., 2016)

An Improved Fixed-Parameter Algorithm for One-Page Crossing Minimization. - Yasuaki Kobayashi; Hiromu Ohtsuka; Hisao Tamaki (IPEC, 2017)

Computing Treewidth via Exact and Heuristic Lists of Minimal Separators. - Hisao Tamaki (SEA², 2019)

A heuristic use of dynamic programming to upperbound treewidth. - Hisao Tamaki (CoRR, 2019)

Positive-instance driven dynamic programming for treewidth. - Hisao Tamaki (J. Comb. Optim., 2019)

Parameterized Graph Algorithms & Data Reduction: Theory Meets Practice (NII Shonan Meeting 144). - Bart M. P. Jansen; Christian Schulz 003; Hisao Tamaki (NII Shonan Meet. Rep., 2019)

Experimental Analysis of Treewidth. - Hisao Tamaki (Treewidth, Kernels, and Algorithms, 2020)

A heuristic for listing almost-clique minimal separators of a graph. - Hisao Tamaki (CoRR, 2021)

Heuristic Computation of Exact Treewidth. - Hisao Tamaki (SEA, 2022)

A Contraction-Recursive Algorithm for Treewidth. - Hisao Tamaki (IPEC, 2023)

A polynomial delay algorithm generating all potential maximal cliques in triconnected planar graphs. - Alexander Grigoriev; Yasuaki Kobayashi; Hisao Tamaki; Tom C. van der Zanden (CoRR, 2025)