The following pages link to Ryuhei Uehara (Q286972):
Displaying 50 items.
- Collapse of PP with a semi-random source to BPP (Q286973) (← links)
- Parallel approximation algorithms for maximum weighted matching in general graphs (Q294847) (← links)
- Ferrers dimension of grid intersection graphs (Q344841) (← links)
- UNO is hard, even for a single player (Q389942) (← links)
- The complexity of the stamp folding problem (Q391214) (← links)
- Random generation and enumeration of bipartite permutation graphs (Q414425) (← links)
- Faster computation of the Robinson-Foulds distance between phylogenetic networks (Q454925) (← links)
- Linear-time algorithm for sliding tokens on trees (Q496016) (← links)
- Reconstruction of interval graphs (Q604467) (← links)
- Scale free properties of random \(k\)-trees (Q626908) (← links)
- On the complexity of reconfiguration problems (Q631762) (← links)
- Algorithmic folding complexity (Q659709) (← links)
- Enumeration of the perfect sequences of a chordal graph (Q708216) (← links)
- Base-object location problems for base-monotone regions (Q744059) (← links)
- Exact algorithms for the max-min dispersion problem (Q777304) (← links)
- Efficient enumeration of non-isomorphic Ptolemaic graphs (Q782198) (← links)
- Tree spanners for bipartite graphs and probe interval graphs (Q868437) (← links)
- Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs (Q896655) (← links)
- A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares (Q902421) (← links)
- Counting the number of independent sets in chordal graphs (Q935840) (← links)
- Efficient enumeration of all ladder lotteries and its application (Q964388) (← links)
- Laminar structure of ptolemaic graphs with applications (Q1028126) (← links)
- Scale free interval graphs (Q1035692) (← links)
- Fast RNC and NC algorithms for maximal path sets (Q1285573) (← links)
- Efficient simulations by a biased coin (Q1352086) (← links)
- Bumpy pyramid folding (Q1615921) (← links)
- Complexity of the maximum \(k\)-path vertex cover problem (Q1641128) (← links)
- Computational complexity of robot arm simulation problems (Q1670998) (← links)
- Any monotone function is realized by interlocked polygons (Q1736502) (← links)
- Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
- Swapping colored tokens on graphs (Q1749531) (← links)
- Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs (Q1765527) (← links)
- Route-enabling graph orientation problems (Q1939659) (← links)
- Coverage with \(k\)-transmitters in the presence of obstacles (Q1944388) (← links)
- Algorithmic enumeration of surrounding polygons (Q1983143) (← links)
- Developing a tetramonohedron with minimum cut length (Q2088883) (← links)
- Ununfoldable polyhedra with \(6\) vertices or \(6\) faces (Q2123289) (← links)
- Efficient segment folding is hard (Q2123292) (← links)
- Parameterized complexity of independent set reconfiguration problems (Q2192091) (← links)
- Symmetric assembly puzzles are hard, beyond a few pieces (Q2206733) (← links)
- Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs (Q2232254) (← links)
- Cyclic shift problems on graphs (Q2232257) (← links)
- A 4.31-approximation for the geometric unique coverage problem on unit disks (Q2250456) (← links)
- Reconfiguring undirected paths (Q2285101) (← links)
- Shortest reconfiguration sequence for sliding tokens on spiders (Q2294056) (← links)
- Max-Min 3-Dispersion problems (Q2300048) (← links)
- Efficient algorithm for box folding (Q2327528) (← links)
- Linear structure of bipartite permutation graphs and the longest path problem (Q2379947) (← links)
- Common developments of three incongruent boxes of area 30 (Q2398819) (← links)
- Complexity of tiling a polygon with trominoes or bars (Q2411829) (← links)
