H. Tamaki

发表

Motion Planning

S. LaValle, L. Kavraki, GraphChristos, 2008, Springer Handbook of Robotics.

Latent semantic indexing: a probabilistic analysis

Santosh S. Vempala, Christos H. Papadimitriou, Prabhakar Raghavan, 1998, PODS '98.

Spanning trees crossing few barriers

Leonidas J. Guibas, Mark de Berg, Otfried Cheong, 1999, SCG '99.

Latent Semantic Indexing

Santosh S. Vempala, Christos H. Papadimitriou, Prabhakar Raghavan, 2000, PODS 2000.

A Characterization of Planar Graphs by Pseudo-Line Arrangements

Hisao Tamaki, Takeshi Tokuyama, H. Tamaki, 2003 .

Space-efficient enumeration of minimal transversals of a hypergraph

Hisao Tamaki, H. Tamaki, 2000 .

On the probability of rendezvous in graphs

H. Tamaki, Martin Dietzfelbinger, 2005 .

ENUMERATION OF SUCCESS PA’ITERNS IN LOGIC PROGRAMS

H. Tamaki, 2001 .

Unfold/Fold Transformation of Logic Programs

Hisao Tamaki, Taisuke Sato, Taisuke Sato, 1984, ICLP.

Fast Deflection Routing for Packets and Worms (Extended Summary).

Baruch Schieber, Prabhakar Raghavan, Hisao Tamaki, 1993, PODC 1993.

Transformational Logic Program Synthesis

Hisao Tamaki, Taisuke Sato, Taisuke Sato, 1984, FGCS.

Construction of the mesh and the torus tolerating a large number of faults

Hisao Tamaki, H. Tamaki, 1994, SPAA '94.

The structure and number of global roundings of a graph

Tetsuo Asano, Hisao Tamaki, Takeshi Tokuyama, 2004, Theor. Comput. Sci..

A linear edge kernel for two-layer crossing minimization

Hisao Tamaki, Yasuaki Kobayashi, Hirokazu Maruta, 2013, Theor. Comput. Sci..

Positive-instance driven dynamic programming for treewidth

H. Tamaki, 2018, Journal of Combinatorial Optimization.

Semantics of a Logic Programming Language with a Reducibility Predicate

Hisao Tamaki, H. Tamaki, 1984, SLP.

Alternating cycles contribution: a strategy of tour-merging for the traveling salesman problem

Hisao Tamaki, H. Tamaki, 2003 .

Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs

Hisao Tamaki, Marjan Marzban, Qian-Ping Gu, 2008, ALENEX.

Routing a Permutation in the Hypercube by Two Sets of Edge Disjoint Paths

Hisao Tamaki, Qian-Ping Gu, H. Tamaki, 1997, J. Parallel Distributed Comput..

Routing a permutation in the hypercube by two sets of edge-disjoint paths

Hisao Tamaki, Qian-Ping Gu, H. Tamaki, 1996, Proceedings of International Conference on Parallel Processing.

Computing Directed Pathwidth in O(1.89n)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(1.89^{n})$$\end{document} Ti

Hisao Tamaki, Yasuaki Kobayashi, Keita Komuro, 2015, Algorithmica.

Computing Directed Pathwidth in O(1.89 n ) Time

Hisao Tamaki, Yasuaki Kobayashi, Keita Komuro, 2012, IPEC.

On the probability of rendezvous in graphs

Hisao Tamaki, Martin Dietzfelbinger, H. Tamaki, 2005, Random Struct. Algorithms.

A directed path-decomposition approach to exactly identifying attractors of boolean networks

Hisao Tamaki, H. Tamaki, 2010, 2010 10th International Symposium on Communications and Information Technologies.

Covering points in the plane by k-tours: towards a polynomial time approximation scheme for general k

Tetsuo Asano, Hisao Tamaki, Takeshi Tokuyama, 1997, STOC '97.

The structure and number of global roundings of a graph

Tetsuo Asano, Hisao Tamaki, Takeshi Tokuyama, 2004, Theor. Comput. Sci..

How to Cut Pseudoparabolas into Segments

Hisao Tamaki, Takeshi Tokuyama, H. Tamaki, 1998, Discret. Comput. Geom..

OLD Resolution with Tabulation

Hisao Tamaki, Taisuke Sato, Taisuke Sato, 1986, ICLP.

How to cut pseudo-parabolas into segments

Hisao Tamaki, Takeshi Tokuyama, H. Tamaki, 1995, SCG '95.

Multicolor routing in the undirected hypercube

Hisao Tamaki, Qian-Ping Gu, H. Tamaki, 2000, Discret. Appl. Math..

Multi-Color Routing in the Undirected Hypercube

Hisao Tamaki, Qian-Ping Gu, H. Tamaki, 1997, ISAAC.

Greedily Finding a Dense Subgraph

Hisao Tamaki, Takeshi Tokuyama, Yuichi Asahiro, 1996, J. Algorithms.

Motion planning on a graph

Madhu Sudan, Christos H. Papadimitriou, Prabhakar Raghavan, 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

Positive-instance driven dynamic programming for treewidth

Hisao Tamaki, H. Tamaki, 2017, Journal of Combinatorial Optimization.

Motion planning for a steering-constrained robot through moderate obstacles

Pankaj K. Agarwal, Prabhakar Raghavan, Hisao Tamaki, 1995, STOC '95.

Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets

Tatsuya Akutsu, Hisao Tamaki, Takeshi Tokuyama, 1997, SCG '97.

Motion Planning on a Graph (Extended Abstract)

Madhu Sudan, Christos H. Papadimitriou, Prabhakar Raghavan, 1994, FOCS 1994.

Noise-tolerant distribution-free learning of general geometric concepts

S. Goldman, H. Tamaki, S. Suri, 1998, JACM.

Noise-tolerant distribution-free learning of general geometric concepts

Subhash Suri, Hisao Tamaki, Nader H. Bshouty, 1996, STOC '96.

k-cyclic Orientations of Graphs

Hisao Tamaki, Yasuaki Kobayashi, Yuichiro Miyamoto, 2010, ISAAC.

Route-Enabling Graph Orientation Problems

Takehiro Ito, Ryuhei Uehara, Hisao Tamaki, 2009, Algorithmica.

Graph Orientation Problems for Multiple st-Reachability

H. Tamaki, Ryuhei Uehara, Takehiro Ito, 2009 .

A heuristic for listing almost-clique minimal separators of a graph pdf

Hisao Tamaki, H. Tamaki, 2021, ArXiv.

Enumeration of Success Patterns in Logic Programs

Hisao Tamaki, Taisuke Sato, Taisuke Sato, 1983, Theor. Comput. Sci..

A Characterization of Planar Graphs by Pseudo-Line Arrangements

Hisao Tamaki, Takeshi Tokuyama, H. Tamaki, 1997, Algorithmica.

Algorithms for the maximum subarray problem based on matrix multiplication

Hisao Tamaki, Takeshi Tokuyama, H. Tamaki, 1998, SODA '98.

Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size

Hisao Tamaki, Qian-Ping Gu, H. Tamaki, 2010, Algorithmica.

A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization

Hisao Tamaki, Yasuaki Kobayashi, H. Tamaki, 2012, Algorithmica.

An Improved Fixed-Parameter Algorithm for One-Page Crossing Minimization

Hisao Tamaki, Yasuaki Kobayashi, Hiromu Ohtsuka, 2017, IPEC.

Parametric polymatroid optimization and its geometric applications

Hisao Tamaki, Takeshi Tokuyama, Naoki Katoh, 2002, SODA '99.

Latent semantic indexing: a probabilistic analysis

C. Papadimitriou, S. Vempala, H. Tamaki, 1998, J. Comput. Syst. Sci..

Optimal branch-decomposition of planar graphs in O(n3) Time

Hisao Tamaki, Qian-Ping Gu, H. Tamaki, 2005, TALG.

On the Pathwidth of Almost Semicomplete Digraphs pdf

Hisao Tamaki, Yasuaki Kobayashi, Kenta Kitsunai, 2015, ESA.

Search Space Reduction through Commitments in Pathwidth Computation: An Experimental Study

Hisao Tamaki, Yasuaki Kobayashi, Keita Komuro, 2014, SEA.

Efficient self-embedding of butterfly networks with random faults

Hisao Tamaki, H. Tamaki, 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

First Order Compiler: A Deterministic Logic Program Synthesis Algorithm

Hisao Tamaki, Taisuke Sato, Taisuke Sato, 1989, J. Symb. Comput..

Routings for Involutions of a Hypercube

Hisao Tamaki, Alan P. Sprague, H. Tamaki, 1994, Discret. Appl. Math..

Construction of the mesh and the torus tolerating a large number of faults

Hisao Tamaki, H. Tamaki, 1994, SPAA '94.