The following pages link to Hisao Tamaki (Q284333):
Displaying 50 items.
- (Q198585) (redirect page) (← links)
- A faster fixed parameter algorithm for two-layer crossing minimization (Q284334) (← links)
- Computing directed pathwidth in \(O(1.89^n)\) time (Q300464) (← links)
- A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization (Q494803) (← links)
- Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time (Q553343) (← links)
- Construction of the mesh and the torus tolerating a large number of faults (Q676440) (← links)
- A linear edge kernel for two-layer crossing minimization (Q744090) (← links)
- First order compiler: A deterministic logic program synthesis algorithm (Q908686) (← links)
- Voronoi diagrams with respect to criteria on vision information (Q946853) (← links)
- Existential continuation (Q1115643) (← links)
- Routings for involutions of a hypercube (Q1315464) (← links)
- Enumeration of success patterns in logic programs (Q1348532) (← links)
- Routing a permutation in the hypercube by two sets of edge disjoint paths (Q1373868) (← links)
- How to cut pseudoparabolas into segments (Q1380780) (← links)
- A characterization of planar graphs by pseudo-line arrangements (Q1400888) (← links)
- A heuristic for Dijkstra's algorithm with many targets and its use in weighted matching algorithms (Q1402219) (← links)
- Spanning trees crossing few barriers (Q1422228) (← links)
- Latent semantic indexing: A probabilistic analysis (Q1591153) (← links)
- The structure and number of global roundings of a graph (Q1884844) (← links)
- Improved bounds on the planar branchwidth with respect to the largest grid minor size (Q1934314) (← links)
- Route-enabling graph orientation problems (Q1939659) (← links)
- Multicolor routing in the undirected hypercube (Q1971219) (← links)
- Positive-instance driven dynamic programming for treewidth (Q2424727) (← links)
- Matching algorithms are fast in sparse random graphs (Q2432523) (← links)
- Algorithms for the Maximum Subarray Problem Based on Matrix Multiplication. (Q2725500) (← links)
- On the fault tolerance of the butterfly (Q2817602) (← links)
- A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization (Q2912885) (← links)
- k-cyclic Orientations of Graphs (Q3060762) (← links)
- Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size (Q3060763) (← links)
- The Structure and Number of Global Roundings of a Graph (Q3082920) (← links)
- A Polynomial Time Algorithm for Bounded Directed Pathwidth (Q3104788) (← links)
- Noise-tolerant distribution-free learning of general geometric concepts (Q3158523) (← links)
- On the Pathwidth of Almost Semicomplete Digraphs (Q3452843) (← links)
- Route-Enabling Graph Orientation Problems (Q3652228) (← links)
- Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n 1 + ε ) Time (Q3652285) (← links)
- (Q3691053) (← links)
- (Q3746920) (← links)
- (Q3830520) (← links)
- (Q4218425) (← links)
- (Q4228465) (← links)
- Efficient self-embedding of butterfly networks with random faults (Q4230378) (← links)
- (Q4234081) (← links)
- (Q4250212) (← links)
- (Q4252328) (← links)
- (Q4370205) (← links)
- Efficient Self-Embedding of Butterfly Networks with Random Faults (Q4388889) (← links)
- (Q4525681) (← links)
- (Q4526992) (← links)
- Treedepth Parameterized by Vertex Cover Number. (Q4634401) (← links)
- On the probability of rendezvous in graphs (Q4680409) (← links)
