The following pages link to Toshiki Saitoh (Q344840):
Displayed 42 items.
- Ferrers dimension of grid intersection graphs (Q344841) (← links)
- The complexity of the stamp folding problem (Q391214) (← links)
- Random generation and enumeration of bipartite permutation graphs (Q414425) (← links)
- Subgraph isomorphism in graph classes (Q456655) (← links)
- Extending partial representations of proper and unit interval graphs (Q524367) (← links)
- Reconstruction of interval graphs (Q604467) (← links)
- Exact algorithms for the max-min dispersion problem (Q777304) (← links)
- Complexity of the maximum \(k\)-path vertex cover problem (Q1641128) (← links)
- Computational complexity of robot arm simulation problems (Q1670998) (← links)
- Finding all solutions and instances of Numberlink and Slitherlink by ZDDs (Q1736507) (← links)
- Swapping colored tokens on graphs (Q1749531) (← links)
- Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound (Q2030442) (← links)
- Path cover problems with length cost (Q2154120) (← links)
- Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes (Q2232241) (← links)
- Max-Min 3-Dispersion problems (Q2300048) (← links)
- Extending partial representations of subclasses of chordal graphs (Q2344737) (← links)
- Swapping labeled tokens on graphs (Q2347003) (← links)
- Extending partial representations of interval graphs (Q2408095) (← links)
- Approximating the path-distance-width for AT-free graphs and graphs in related classes (Q2442209) (← links)
- Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals (Q2980919) (← links)
- Sequentially Swapping Colored Tokens on Graphs (Q2980931) (← links)
- The Time Complexity of the Token Swapping Problem and Its Parallel Variants (Q2980932) (← links)
- Bipartite Permutation Graphs Are Reconstructible (Q3066471) (← links)
- Approximability of the Path-Distance-Width for AT-free Graphs (Q3104783) (← links)
- BIPARTITE PERMUTATION GRAPHS ARE RECONSTRUCTIBLE (Q3166750) (← links)
- Reconstruction Algorithm for Permutation Graphs (Q3404435) (← links)
- Competitive Diffusion on Weighted Graphs (Q3449840) (← links)
- Swapping Colored Tokens on Graphs (Q3449858) (← links)
- Random Generation and Enumeration of Proper Interval Graphs (Q3605496) (← links)
- Random Generation and Enumeration of Bipartite Permutation Graphs (Q3652296) (← links)
- Sequentially Swapping Colored Tokens on Graphs (Q4622769) (← links)
- The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant (Q4622770) (← links)
- Extending Partial Representations of Subclasses of Chordal Graphs (Q4909561) (← links)
- Complexity of the Stamp Folding Problem (Q5199159) (← links)
- Reconstruction of Interval Graphs (Q5323055) (← links)
- Intersection Dimension of Bipartite Graphs (Q5410653) (← links)
- Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs (Q5915637) (← links)
- Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs (Q5919325) (← links)
- Sorting balls and water: equivalence and computational complexity (Q6050130) (← links)
- Path cover problems with length cost (Q6069927) (← links)
- Overlapping edge unfoldings for Archimedean solids and (anti)prisms (Q6091143) (← links)
- Efficient non-isomorphic graph enumeration algorithms for subclasses of perfect graphs (Q6091158) (← links)