The following pages link to Takashi Horiyama (Q744057):
Displaying 47 items.
- Base-object location problems for base-monotone regions (Q744059) (← links)
- Exact algorithms for the max-min dispersion problem (Q777304) (← links)
- Implicit enumeration of topological-minor-embeddings and its application to planar subgraph enumeration (Q782183) (← links)
- How to collect balls moving in the Euclidean plane (Q860383) (← links)
- Density condensation of Boolean formulas (Q860385) (← links)
- Translation among CNFs, characteristic models and ordered binary decision diagrams (Q1007523) (← links)
- Finding essential attributes from binary data (Q1404409) (← links)
- Ordered binary decision diagrams as knowledge-bases (Q1605409) (← links)
- Computational complexity of robot arm simulation problems (Q1670998) (← links)
- Swapping colored tokens on graphs (Q1749531) (← links)
- Reasoning with ordered binary decision diagrams (Q1878409) (← links)
- Algorithmic enumeration of surrounding polygons (Q1983143) (← links)
- Efficient segment folding is hard (Q2123292) (← links)
- Optimal reconfiguration of optimal ladder lotteries (Q2227490) (← links)
- Max-Min 3-Dispersion problems (Q2300048) (← links)
- Efficient algorithm for box folding (Q2327528) (← links)
- Common developments of three incongruent boxes of area 30 (Q2398819) (← links)
- Complexity of tiling a polygon with trominoes or bars (Q2411829) (← links)
- Longest common subsequence in sublinear space (Q2656347) (← links)
- (Q2743798) (← links)
- Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid (Q2790157) (← links)
- (Q2845529) (← links)
- The Number of Different Unfoldings of Polyhedra (Q2872127) (← links)
- Common Developments of Three Incongruent Boxes of Area 30 (Q2948470) (← links)
- Continuous Folding of Regular Dodecahedra (Q2958092) (← links)
- Box Pleating is Hard (Q2958099) (← links)
- Generating All Patterns of Graph Partitions Within a Disparity Bound (Q2980904) (← links)
- Sequentially Swapping Colored Tokens on Graphs (Q2980931) (← links)
- Generation of Polyiamonds for p6 Tiling by the Reverse Search (Q3098073) (← links)
- Swapping Colored Tokens on Graphs (Q3449858) (← links)
- (Q4472485) (← links)
- (Q4474092) (← links)
- (Q4505388) (← links)
- (Q4511219) (← links)
- Sequentially Swapping Colored Tokens on Graphs (Q4622769) (← links)
- Base Location Problems for Base-Monotone Regions (Q4914435) (← links)
- (Q5098805) (← links)
- Rigid foldability is NP-hard (Q5120145) (← links)
- Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid (Q5176592) (← links)
- Efficient Algorithm for Box Folding (Q5216283) (← links)
- Convex Configurations on Nana-kin-san Puzzle (Q5282818) (← links)
- Theory and Applications of Satisfiability Testing (Q5325851) (← links)
- Finite-State Online Algorithms and Their Automated Competitive Analysis (Q5459103) (← links)
- Finding top-\(k\) longest palindromes in substrings (Q6057835) (← links)
- Efficient folding algorithms for convex polyhedra (Q6142354) (← links)
- RePair Grammars are the Smallest Grammars for Fibonacci Words (Q6391366) (← links)
- Fast enumeration of all cost-bounded solutions for combinatorial problems using ZDDs (Q6648288) (← links)
