The following pages link to Yota Otachi (Q284349):
Displaying 50 items.
- Finding a chain graph in a bipartite permutation graph (Q284350) (← links)
- Ferrers dimension of grid intersection graphs (Q344841) (← links)
- Thin strip graphs (Q344860) (← links)
- Random generation and enumeration of bipartite permutation graphs (Q414425) (← links)
- Efficient enumeration of ordered trees with \(k\) leaves (Q441889) (← links)
- Subgraph isomorphism in graph classes (Q456655) (← links)
- Linear-time algorithm for sliding tokens on trees (Q496016) (← links)
- Extending partial representations of proper and unit interval graphs (Q524367) (← links)
- Bandwidth and pathwidth of three-dimensional grids (Q534058) (← links)
- Spanning tree congestion of \(k\)-outerplanar graphs (Q536232) (← links)
- The carving-width of generalized hypercubes (Q710586) (← links)
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← links)
- Lower bounds for treewidth of product graphs (Q741743) (← links)
- Efficient algorithms for network localization using cores of underlying graphs (Q742409) (← links)
- Base-object location problems for base-monotone regions (Q744059) (← links)
- Exact algorithms for the max-min dispersion problem (Q777304) (← links)
- Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs (Q896655) (← links)
- On the treewidth of toroidal grids (Q897618) (← links)
- A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares (Q902421) (← links)
- Security number of grid-like graphs (Q967295) (← links)
- An improved algorithm for the longest induced path problem on \(k\)-chordal graphs (Q1005252) (← links)
- On spanning tree congestion of graphs (Q1043936) (← links)
- Safe sets in graphs: graph classes and structural parameters (Q1631677) (← links)
- Computational complexity of robot arm simulation problems (Q1670998) (← links)
- A faster parameterized algorithm for pseudoforest deletion (Q1693129) (← links)
- Induced minor free graphs: isomorphism and clique-width (Q1702118) (← links)
- On the classes of interval graphs of limited nesting and count of lengths (Q1739103) (← links)
- Swapping colored tokens on graphs (Q1749531) (← links)
- Parameterized complexity of the spanning tree congestion problem (Q1759686) (← links)
- Vertex deletion problems on chordal graphs (Q1786595) (← links)
- Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph (Q1985603) (← links)
- Space-efficient algorithms for longest increasing subsequence (Q1987516) (← links)
- Alliances in graphs of bounded clique-width (Q2030439) (← links)
- Token sliding on split graphs (Q2048202) (← links)
- Parameterized complexity of \((A,\ell)\)-path packing (Q2118381) (← links)
- An improved deterministic parameterized algorithm for cactus vertex deletion (Q2135634) (← links)
- Reconfiguration of regular induced subgraphs (Q2154077) (← links)
- Parameterized complexity of graph burning (Q2161013) (← links)
- Parameterized orientable deletion (Q2182093) (← links)
- Symmetric assembly puzzles are hard, beyond a few pieces (Q2206733) (← links)
- On the security number of the Cartesian product of graphs (Q2231753) (← links)
- Low-congestion shortcut and graph parameters (Q2241301) (← links)
- A 4.31-approximation for the geometric unique coverage problem on unit disks (Q2250456) (← links)
- Parameterized complexity of safe set (Q2294039) (← links)
- A lower bound on opaque sets (Q2330035) (← links)
- Extending partial representations of subclasses of chordal graphs (Q2344737) (← links)
- Extending partial representations of interval graphs (Q2408095) (← links)
- Efficient enumeration of maximal \(k\)-degenerate subgraphs in a chordal graph (Q2412406) (← links)
- A lower bound for the vertex boundary-width of complete \(k\)-ary trees (Q2427498) (← links)
- Approximating the path-distance-width for AT-free graphs and graphs in related classes (Q2442209) (← links)
