Hisao Tamaki

发表

Motion planning for a steering-constrained robot through moderate obstacles

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

The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection

Prabhakar Raghavan, Hisao Tamaki, Kazuo Iwano, 1994, ISAAC.

MAX/C on Sakai - A Web-based C-Programming Course

Hisao Tamaki, Souichirou Fujii, Kazunori Ohkubo, 2010, CSEDU.

Semantics of a Logic Programming Language with a Reducibility Predicate

Hisao Tamaki, H. Tamaki, 1984, SLP.

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.

Enumeration of Success Patterns in Logic Programs

Hisao Tamaki, Taisuke Sato, 1983, ICALP.

A Linear Edge Kernel for Two-Layer Crossing Minimization

Hisao Tamaki, Yasuaki Kobayashi, Hirokazu Maruta, 2013, COCOON.

Computing Treewidth via Exact and Heuristic Lists of Minimal Separators

Hisao Tamaki, 2019, SEA².

On the probability of rendezvous in graphs

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

How to Cut Pseudoparabolas into Segments

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

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.

A Linear Time Heuristic for the Branch-Decomposition of Planar Graphs

Hisao Tamaki, 2003, ESA.

Route-Enabling Graph Orientation Problems

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

A linear edge kernel for two-layer crossing minimization

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

Program transformation through meta-shifting

Hisao Tamaki, Taisuke Sato, 2009, New Generation Computing.

The structure and number of global roundings of a graph

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

Tracesheets - Spreadsheets of Program Executions as a Common Ground between Learners and Instructors

Hisao Tamaki, Soichiro Fujii, 2012, CSEDU.

Convertibility among Grid Filling Curves

Tetsuo Asano, Hisao Tamaki, Takeshi Tokuyama, 1998, ISAAC.

Robust bounded-degree networks with small diameters

Hisao Tamaki, 1992, SPAA '92.

Greedily Finding a Dense Subgraph

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

Positive-instance driven dynamic programming for treewidth

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

Motion Planning on a Graph (Extended Abstract)

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

Routings for Involutions of a Hypercube

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

Unfold/Fold Transformation of Logic Programs

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

How to cut pseudo-parabolas into segments

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

Existential continuation

Hisao Tamaki, Taisuke Sato, 2009, New Generation Computing.

On the fault tolerance of the butterfly

Anna R. Karlin, Hisao Tamaki, Greg Nelson, 1994, STOC '94.

Edge-Disjoint Routing in the Undirected Hypercube

Hisao Tamaki, Qian-Ping Gu, 1996 .

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.

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

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

Treedepth Parameterized by Vertex Cover Number

Hisao Tamaki, Yasuaki Kobayashi, 2016, IPEC.

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

Hisao Tamaki, H. Tamaki, 2003 .

Noise-tolerant distribution-free learning of general geometric concepts

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

Spanning Trees Crossing Few Barriers

Leonidas J. Guibas, Mark de Berg, Otfried Cheong, 2003, Discret. Comput. Geom..

Motion planning on a graph

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

Latent semantic indexing: a probabilistic analysis

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

Angular Voronoi Diagram with Applications

Tetsuo Asano, Hisao Tamaki, Takeshi Tokuyama, 2006, 2006 3rd International Symposium on Voronoi Diagrams in Science and Engineering.

A Characterization of Planar Graphs by Pseudo-Line Arrangements

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

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.

Efficient randomized routing algorithms on the two-dimensional mesh of buses

Hisao Tamaki, Kazuo Iwama, Eiji Miyano, 2001, Theor. Comput. Sci..

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

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

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

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

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

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

Approximation algorithms for geometric optimization problems

Hisao Tamaki, 2000 .

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..

A heuristic use of dynamic programming to upperbound treewidth pdf

Hisao Tamaki, 2019, ArXiv.

k-cyclic Orientations of Graphs

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

Fast deflection routing for packets and worms

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

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

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

Voronoi Diagram with Respect to Criteria on Vision Information

Tetsuo Asano, Hisao Tamaki, Takeshi Tokuyama, 2007, 4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007).

Route-Enabling Graph Orientation Problems

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

Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs

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

Spanning Trees Crossing Few Barriers (Algorithm Engineering as a New Paradigm)

Leonidas J. Guibas, Mark de Berg, Otfried Cheong, 1999 .

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

Hisao Tamaki, Qian-Ping Gu, 2010, ISAAC.

A Distributed Unification Scheme for Systolic Logic Programs

Hisao Tamaki, 1985, ICPP.

Greedily Finding a Dense Subgraph

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

Computing Directed Pathwidth in O(1.89 n ) Time

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

Optimal Branch-Decomposition of Planar Graphs in O(n3) Time

Hisao Tamaki, Qian-Ping Gu, 2005, ICALP.

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

Tatsuya Akutsu, Hisao Tamaki, Takeshi Tokuyama, 1998, Discret. Comput. Geom..

Enumeration of Success Patterns in Logic Programs

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

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

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

Multi-Color Routing in the Undirected Hypercube

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

Experimental Analysis of Treewidth

Hisao Tamaki, 2020, Treewidth, Kernels, and Algorithms.

Stream-Based Compilation of Ground I/O PROLOG into Committed-Choice Languages

Hisao Tamaki, 1987, ICLP.

OLD Resolution with Tabulation

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

A Polynomial Time Algorithm for Bounded Directed Pathwidth

Hisao Tamaki, 2011, WG.

Spanning trees crossing few barriers

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

Efficient self-embedding of butterfly networks with random faults

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

Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n1 + ε) Time

Hisao Tamaki, Qian-Ping Gu, 2009, ISAAC.

Latent Semantic Indexing

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

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

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

Finalizing tentative matches from truncated preference lists pdf

Hisao Tamaki, 2016, ArXiv.

Multicolor routing in the undirected hypercube

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

Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in O(n1+ϵ) time

Hisao Tamaki, Qian-Ping Gu, 2011, Theor. Comput. Sci..

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.

On the Pathwidth of Almost Semicomplete Digraphs pdf

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

Matching Algorithms Are Fast in Sparse Random Graphs

Kurt Mehlhorn, Hisao Tamaki, Guido Schäfer, 2004, STACS.

A faster fixed parameter algorithm for two-layer crossing minimization pdf

Hisao Tamaki, Yasuaki Kobayashi, 2016, Inf. Process. Lett..

First Order Compiler: A Deterministic Logic Program Synthesis Algorithm

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

The structure and number of global roundings of a graph

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

Efficient Self-Embedding of Butterfly Networks with Random Faults

Hisao Tamaki, 1998, SIAM J. Comput..

Parametric polymatroid optimization and its geometric applications

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

Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses

Hisao Tamaki, Kazuo Iwama, Eiji Miyano, 1998, COCOON.

Algorithms for the maximum subarray problem based on matrix multiplication

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

On Geometric Structure of Global Roundings for Graphs and Range Spaces

Tetsuo Asano, Hisao Tamaki, Takeshi Tokuyama, 2004, SWAT.

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

Hisao Tamaki, H. Tamaki, 2021, ArXiv.

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.

Structural robustness of the butterfly and related networks against random faults

Hisao Tamaki, 1993 .

On the Fault Tolerance of the Butter y

Anna R. Karlin, Hisao Tamaki, Greg Nelson, 1994 .

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 .