Hisao Tamaki

Orcid: 0000-0001-7566-8505

According to our database1, Hisao Tamaki authored at least 71 papers between 1983 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
A Contraction-Recursive Algorithm for Treewidth.
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

2022
Heuristic Computation of Exact Treewidth.
Proceedings of the 20th International Symposium on Experimental Algorithms, 2022

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

2020
Experimental Analysis of Treewidth.
Proceedings of the Treewidth, Kernels, and Algorithms, 2020

2019
Parameterized Graph Algorithms & Data Reduction: Theory Meets Practice (NII Shonan Meeting 144).
NII Shonan Meet. Rep., 2019

Positive-instance driven dynamic programming for treewidth.
J. Comb. Optim., 2019

A heuristic use of dynamic programming to upperbound treewidth.
CoRR, 2019

Computing Treewidth via Exact and Heuristic Lists of Minimal Separators.
Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

2017
An Improved Fixed-Parameter Algorithm for One-Page Crossing Minimization.
Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

2016
A faster fixed parameter algorithm for two-layer crossing minimization.
Inf. Process. Lett., 2016

Finalizing tentative matches from truncated preference lists.
CoRR, 2016

Computing Directed Pathwidth in O(1.89<sup>n</sup>) Time.
Algorithmica, 2016

Treedepth Parameterized by Vertex Cover Number.
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

2015
A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization.
Algorithmica, 2015

On the Pathwidth of Almost Semicomplete Digraphs.
Proceedings of the Algorithms - ESA 2015, 2015

2014
A linear edge kernel for two-layer crossing minimization.
Theor. Comput. Sci., 2014

Search Space Reduction through Commitments in Pathwidth Computation: An Experimental Study.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

2013
Route-Enabling Graph Orientation Problems.
Algorithmica, 2013

2012
Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size.
Algorithmica, 2012

Computing Directed Pathwidth in O(1.89 n ) Time.
Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012

Tracesheets - Spreadsheets of Program Executions as a Common Ground between Learners and Instructors.
Proceedings of the CSEDU 2012, 2012

2011
Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in O(n<sup>1+ϵ</sup>) time.
Theor. Comput. Sci., 2011

A Polynomial Time Algorithm for Bounded Directed Pathwidth.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

2010
<i>k</i>-cyclic Orientations of Graphs.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

MAX/C on Sakai - A Web-based C-Programming Course.
Proceedings of the CSEDU 2010 - Proceedings of the Second International Conference on Computer Supported Education, Valencia, Spain, April 7-10, 2010, 2010

2009
Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in <i>O</i>(<i>n</i><sup>1 + ε</sup>) Time.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008
Optimal branch-decomposition of planar graphs in <i>O</i>(<i>n</i><sup>3</sup>) Time.
ACM Trans. Algorithms, 2008

Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs.
Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, 2008

2007
Voronoi Diagram with Respect to Criteria on Vision Information.
Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering, 2007

2006
Matching Algorithms Are Fast in Sparse Random Graphs.
Theory Comput. Syst., 2006

Angular Voronoi Diagram with Applications.
Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering, 2006

2005
On the probability of rendezvous in graphs.
Random Struct. Algorithms, 2005

2004
The structure and number of global roundings of a graph.
Theor. Comput. Sci., 2004

On Geometric Structure of Global Roundings for Graphs and Range Spaces.
Proceedings of the Algorithm Theory, 2004

2003
Spanning Trees Crossing Few Barriers.
Discret. Comput. Geom., 2003

A Linear Time Heuristic for the Branch-Decomposition of Planar Graphs.
Proceedings of the Algorithms, 2003

2002
Parametric Polymatroid Optimization and Its Geometric Applications.
Int. J. Comput. Geom. Appl., 2002

2001
Efficient randomized routing algorithms on the two-dimensional mesh of buses.
Theor. Comput. Sci., 2001

2000
Latent Semantic Indexing: A Probabilistic Analysis.
J. Comput. Syst. Sci., 2000

Greedily Finding a Dense Subgraph.
J. Algorithms, 2000

Multicolor routing in the undirected hypercube.
Discret. Appl. Math., 2000

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

Noise-Tolerant Distribution-Free Learning of General Geometric Concepts.
J. ACM, 1998

How to Cut Pseudoparabolas into Segments.
Discret. Comput. Geom., 1998

Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets.
Discret. Comput. Geom., 1998

Algorithms for the Maxium Subarray Problem Based on Matrix Multiplication.
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Convertibility among Grid Filling Curves.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

1997
Routing a Permutation in the Hypercube by Two Sets of Edge Disjoint Paths.
J. Parallel Distributed Comput., 1997

Covering Points in the Plane by <i>k</i>-Tours: Towards a Polynomial Time Approximation Scheme for General <i>k</i>.
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

A Characterization of Planar Graphs by Pseudo-Line Arrangements.
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

Multi-Color Routing in the Undirected Hypercube.
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

1996
Construction of the Mesh and the Torus Tolerating a Large Number of Faults.
J. Comput. Syst. Sci., 1996

1995
Motion planning for a steering-constrained robot through moderate obstacles.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

How to Cut Pseudo-Parabolas into Segments.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994
Routings for Involutions of a Hypercube.
Discret. Appl. Math., 1994

On the fault tolerance of the butterfly.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Motion Planning on a Graph (Extended Abstract)
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993
Structural robustness of the butterfly and related networks against random faults.
PhD thesis, 1993

Fast Deflection Routing for Packets and Worms (Extended Summary).
Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, 1993

1992
Robust Bounded-Degree Networks with Small Diameters.
Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992

1989
Existential Continuation.
New Gener. Comput., 1989

First Order Compiler: A Deterministic Logic Program Synthesis Algorithm.
J. Symb. Comput., 1989

1987
Stream-Based Compilation of Ground I/O PROLOG into Committed-Choice Languages.
Proceedings of the Logic Programming, 1987

1986
OLD Resolution with Tabulation.
Proceedings of the Third International Conference on Logic Programming, 1986

1985
A Distributed Unification Scheme for Systolic Logic Programs.
Proceedings of the International Conference on Parallel Processing, 1985

1984
Enumeration of Success Patterns in Logic Programs.
Theor. Comput. Sci., 1984

Semantics of a Logic Programming Language with a Reducibility Predicate.
Proceedings of the 1984 International Symposium on Logic Programming, 1984

Unfold/Fold Transformation of Logic Programs.
Proceedings of the Second International Logic Programming Conference, 1984

Transformational Logic Program Synthesis.
Proceedings of the International Conference on Fifth Generation Computer Systems, 1984

1983
Program Transformation Through Meta-shifting.
New Gener. Comput., 1983


  Loading...