Hisao Tamaki

Publication Activity (10 Years)

Years Active: 1983-2023
Publications (10 Years): 17

Top Topics

Bounded Treewidth

Recursive Algorithm

Dynamic Programming

Top Venues

Publications

Hisao Tamaki
A contraction-recursive algorithm for treewidth. CoRR (2023)
Hisao Tamaki
A Contraction-Recursive Algorithm for Treewidth. IPEC (2023)
Hisao Tamaki
Heuristic Computation of Exact Treewidth. SEA (2022)
Hisao Tamaki
Heuristic computation of exact treewidth. CoRR (2022)
Hisao Tamaki
A heuristic for listing almost-clique minimal separators of a graph. CoRR (2021)
Hisao Tamaki
Experimental Analysis of Treewidth. Treewidth, Kernels, and Algorithms (2020)
Hisao Tamaki
Computing Treewidth via Exact and Heuristic Lists of Minimal Separators. SEA² (2019)
Hisao Tamaki
Positive-instance driven dynamic programming for treewidth. J. Comb. Optim. 37 (4) (2019)
Bart M. P. Jansen, Christian Schulz, Hisao Tamaki
Parameterized Graph Algorithms & Data Reduction: Theory Meets Practice (NII Shonan Meeting 144). NII Shonan Meet. Rep. 2019 (2019)
Hisao Tamaki
A heuristic use of dynamic programming to upperbound treewidth. CoRR (2019)
Yasuaki Kobayashi, Hiromu Ohtsuka, Hisao Tamaki
An Improved Fixed-Parameter Algorithm for One-Page Crossing Minimization. IPEC (2017)
Hisao Tamaki
Positive-Instance Driven Dynamic Programming for Treewidth. ESA (2017)
Hisao Tamaki
Positive-instance driven dynamic programming for treewidth. CoRR (2017)
Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki, Toshihiro Tano
) Time. Algorithmica 75 (1) (2016)
Yasuaki Kobayashi, Hisao Tamaki
A faster fixed parameter algorithm for two-layer crossing minimization. Inf. Process. Lett. 116 (9) (2016)
Yasuaki Kobayashi, Hisao Tamaki
Treedepth Parameterized by Vertex Cover Number. IPEC (2016)
Hisao Tamaki
Finalizing tentative matches from truncated preference lists. CoRR (2016)
Kenta Kitsunai, Yasuaki Kobayashi, Hisao Tamaki
On the Pathwidth of Almost Semicomplete Digraphs. ESA (2015)
Kenta Kitsunai, Yasuaki Kobayashi, Hisao Tamaki
On the pathwidth of almost semicomplete digraphs. CoRR (2015)
Yasuaki Kobayashi, Hisao Tamaki
A faster fixed parameter algorithm for two-layer crossing minimization. CoRR (2015)
Yasuaki Kobayashi, Hisao Tamaki
A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization. Algorithmica 72 (3) (2015)
Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki
Search Space Reduction through Commitments in Pathwidth Computation: An Experimental Study. SEA (2014)
Yasuaki Kobayashi, Hirokazu Maruta, Yusuke Nakae, Hisao Tamaki
A linear edge kernel for two-layer crossing minimization. Theor. Comput. Sci. 554 (2014)
Yasuaki Kobayashi, Hirokazu Maruta, Yusuke Nakae, Hisao Tamaki
A Linear Edge Kernel for Two-Layer Crossing Minimization. COCOON (2013)
Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara
Route-Enabling Graph Orientation Problems. Algorithmica 65 (2) (2013)
Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki, Toshihiro Tano
Computing Directed Pathwidth in O(1.89 n ) Time. IPEC (2012)
Yasuaki Kobayashi, Hisao Tamaki
A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization. ESA (2012)
Soichiro Fujii, Hisao Tamaki
Tracesheets - Spreadsheets of Program Executions as a Common Ground between Learners and Instructors. CSEDU (1) (2012)
Qian-Ping Gu, Hisao Tamaki
Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size. Algorithmica 64 (3) (2012)
Qian-Ping Gu, Hisao Tamaki
) time. Theor. Comput. Sci. 412 (32) (2011)
Hisao Tamaki
A Polynomial Time Algorithm for Bounded Directed Pathwidth. WG (2011)
Yasuaki Kobayashi, Yuichiro Miyamoto, Hisao Tamaki
-cyclic Orientations of Graphs. ISAAC (2) (2010)
Qian-Ping Gu, Hisao Tamaki
Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size. ISAAC (2) (2010)
Souichirou Fujii, Kazunori Ohkubo, Hisao Tamaki
MAX/C on Sakai - A Web-based C-Programming Course. CSEDU (1) (2010)
Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara
Route-Enabling Graph Orientation Problems. ISAAC (2009)
Qian-Ping Gu, Hisao Tamaki
) Time. ISAAC (2009)
Qian-Ping Gu, Hisao Tamaki
) Time. ACM Trans. Algorithms 4 (3) (2008)
Zhengbing Bian, Qian-Ping Gu, Marjan Marzban, Hisao Tamaki, Yumi Yoshitake
Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs. ALENEX (2008)
Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
Voronoi Diagram with Respect to Criteria on Vision Information. ISVD (2007)
Tetsuo Asano, Hisao Tamaki, Naoki Katoh, Takeshi Tokuyama
Angular Voronoi Diagram with Applications. ISVD (2006)
Hannah Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki
Matching Algorithms Are Fast in Sparse Random Graphs. Theory Comput. Syst. 39 (1) (2006)
Qian-Ping Gu, Hisao Tamaki
) Time. ICALP (2005)
Martin Dietzfelbinger, Hisao Tamaki
On the probability of rendezvous in graphs. Random Struct. Algorithms 26 (3) (2005)
Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
The structure and number of global roundings of a graph. Theor. Comput. Sci. 325 (3) (2004)
Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
On Geometric Structure of Global Roundings for Graphs and Range Spaces. SWAT (2004)
Hannah Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki
Matching Algorithms Are Fast in Sparse Random Graphs. STACS (2004)
Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
The Structure and Number of Global Roundings of a Graph. COCOON (2003)
Hisao Tamaki
A Linear Time Heuristic for the Branch-Decomposition of Planar Graphs. ESA (2003)
Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki
Spanning Trees Crossing Few Barriers. Discret. Comput. Geom. 30 (4) (2003)
Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
Parametric Polymatroid Optimization and Its Geometric Applications. Int. J. Comput. Geom. Appl. 12 (5) (2002)
Kazuo Iwama, Eiji Miyano, Satoshi Tajima, Hisao Tamaki
Efficient randomized routing algorithms on the two-dimensional mesh of buses. Theor. Comput. Sci. 261 (2) (2001)
Qian-Ping Gu, Hisao Tamaki
Multicolor routing in the undirected hypercube. Discret. Appl. Math. 100 (3) (2000)
Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama
Greedily Finding a Dense Subgraph. J. Algorithms 34 (2) (2000)
Christos H. Papadimitriou, Prabhakar Raghavan, Hisao Tamaki, Santosh S. Vempala
Latent Semantic Indexing: A Probabilistic Analysis. J. Comput. Syst. Sci. 61 (2) (2000)
Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
Parametric Polymatroid Optimization and Its Geometric Applications. SODA (1999)
Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki
Spanning Trees Crossing Few Barriers. SCG (1999)
Hisao Tamaki, Takeshi Tokuyama
Algorithms for the Maxium Subarray Problem Based on Matrix Multiplication. SODA (1998)
Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
Convertibility among Grid Filling Curves. ISAAC (1998)
Kazuo Iwama, Eiji Miyano, Satoshi Tajima, Hisao Tamaki
Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses. COCOON (1998)
Tatsuya Akutsu, Hisao Tamaki, Takeshi Tokuyama
Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets. Discret. Comput. Geom. 20 (3) (1998)
Hisao Tamaki
Efficient Self-Embedding of Butterfly Networks with Random Faults. SIAM J. Comput. 27 (3) (1998)
Hisao Tamaki, Takeshi Tokuyama
How to Cut Pseudoparabolas into Segments. Discret. Comput. Geom. 19 (2) (1998)
Christos H. Papadimitriou, Prabhakar Raghavan, Hisao Tamaki, Santosh S. Vempala
Latent Semantic Indexing: A Probabilistic Analysis. PODS (1998)
Nader H. Bshouty, Sally A. Goldman, H. David Mathias, Subhash Suri, Hisao Tamaki
Noise-Tolerant Distribution-Free Learning of General Geometric Concepts. J. ACM 45 (5) (1998)
Hisao Tamaki, Takeshi Tokuyama
A Characterization of Planar Graphs by Pseudo-Line Arrangements. ISAAC (1997)
Qian-Ping Gu, Hisao Tamaki
Routing a Permutation in the Hypercube by Two Sets of Edge Disjoint Paths. J. Parallel Distributed Comput. 44 (2) (1997)
Tatsuya Akutsu, Hisao Tamaki, Takeshi Tokuyama
Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets. SCG (1997)
Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
. STOC (1997)
Qian-Ping Gu, Hisao Tamaki
Multi-Color Routing in the Undirected Hypercube. ISAAC (1997)
Hisao Tamaki
Construction of the Mesh and the Torus Tolerating a Large Number of Faults. J. Comput. Syst. Sci. 53 (3) (1996)
Qian-Ping Gu, Hisao Tamaki
Routing a Permutation in the Hypercube by Two Sets of Edge-Disjoint Paths. IPPS (1996)
Nader H. Bshouty, Sally A. Goldman, H. David Mathias, Subhash Suri, Hisao Tamaki
Noise-Tolerant Distribution-Free Learning of General Geometric Concepts. STOC (1996)
Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama
Greedily Finding a Dense Subgraph. SWAT (1996)
Pankaj K. Agarwal, Prabhakar Raghavan, Hisao Tamaki
Motion planning for a steering-constrained robot through moderate obstacles. STOC (1995)
Hisao Tamaki, Takeshi Tokuyama
How to Cut Pseudo-Parabolas into Segments. SCG (1995)
Alan P. Sprague, Hisao Tamaki
Routings for Involutions of a Hypercube. Discret. Appl. Math. 48 (2) (1994)
Christos H. Papadimitriou, Prabhakar Raghavan, Madhu Sudan, Hisao Tamaki
Motion Planning on a Graph (Extended Abstract) FOCS (1994)
Hisao Tamaki
Construction of the Mesh and the Torus Tolerating a Large Number of Faults. SPAA (1994)
Anna R. Karlin, Greg Nelson, Hisao Tamaki
On the fault tolerance of the butterfly. STOC (1994)
Kazuo Iwano, Prabhakar Raghavan, Hisao Tamaki
The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection. ISAAC (1994)
Amotz Bar-Noy, Prabhakar Raghavan, Baruch Schieber, Hisao Tamaki
Fast Deflection Routing for Packets and Worms (Extended Summary). PODC (1993)
Hisao Tamaki
Robust Bounded-Degree Networks with Small Diameters. SPAA (1992)
Hisao Tamaki
Efficient Self-Embedding of Butterfly Networks with Random Faults FOCS (1992)
Taisuke Sato, Hisao Tamaki
Existential Continuation. New Gener. Comput. 6 (4) (1989)
Taisuke Sato, Hisao Tamaki
First Order Compiler: A Deterministic Logic Program Synthesis Algorithm. J. Symb. Comput. 8 (6) (1989)
Hisao Tamaki
Stream-Based Compilation of Ground I/O PROLOG into Committed-Choice Languages. ICLP (1987)
Hisao Tamaki, Taisuke Sato
OLD Resolution with Tabulation. ICLP (1986)
Hisao Tamaki
A Distributed Unification Scheme for Systolic Logic Programs. ICPP (1985)
Hisao Tamaki, Taisuke Sato
Unfold/Fold Transformation of Logic Programs. ICLP (1984)
Hisao Tamaki
Semantics of a Logic Programming Language with a Reducibility Predicate. SLP (1984)
Taisuke Sato, Hisao Tamaki
Enumeration of Success Patterns in Logic Programs. Theor. Comput. Sci. 34 (1984)
Taisuke Sato, Hisao Tamaki
Transformational Logic Program Synthesis. FGCS (1984)
Hisao Tamaki, Taisuke Sato
Program Transformation Through Meta-shifting. New Gener. Comput. 1 (1) (1983)
Taisuke Sato, Hisao Tamaki
Enumeration of Success Patterns in Logic Programs. ICALP (1983)