The following pages link to Yoshio Okamoto (Q304266):
Displaying 50 items.
- Extended formulations for sparsity matroids (Q304267) (← links)
- The geodesic diameter of polygonal domains (Q368771) (← links)
- The complexity of the stamp folding problem (Q391214) (← links)
- Querying two boundary points for shortest paths in a polygonal domain (Q419498) (← links)
- Vertex angle and crossing angle resolution of leveled tree drawings (Q456065) (← links)
- Efficient stabilization of cooperative matching games (Q526875) (← links)
- Computing the \(L_1\) geodesic diameter and center of a polygonal domain (Q527444) (← links)
- A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets (Q612909) (← links)
- A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization (Q631100) (← links)
- The affine representation theorem for abstract convex geometries (Q705549) (← links)
- Exact algorithms for the max-min dispersion problem (Q777304) (← links)
- Rectilinear link diameter and radius in a rectilinear polygonal domain (Q827313) (← links)
- Algorithms for gerrymandering over graphs (Q831130) (← 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)
- Fair cost allocations under conflicts - a game-theoretic point of view - (Q924627) (← links)
- Local topology of the free complex of a two-dimensional generalized convex shelling (Q932635) (← links)
- Counting the number of independent sets in chordal graphs (Q935840) (← links)
- On listing, sampling, and counting the chordal graphs with edge constraints (Q974754) (← links)
- The Holt-Klee condition for oriented matroids (Q1041605) (← links)
- Untangling a planar graph (Q1042455) (← links)
- A greedy algorithm for convex geometries (Q1410695) (← links)
- The forbidden minor characterization of line-search antimatroids of rooted digraphs (Q1410699) (← links)
- Submodularity of some classes of the combinatorial optimization games (Q1423711) (← links)
- Computing the geodesic centers of a polygonal domain (Q1622342) (← links)
- Computational complexity of robot arm simulation problems (Q1670998) (← links)
- Minimum-cost \(b\)-edge dominating sets on trees (Q1755793) (← links)
- Some properties of the core on convex geometries (Q1812289) (← links)
- Traveling salesman games with the Monge property (Q1827808) (← links)
- Algorithmic enumeration of surrounding polygons (Q1983143) (← links)
- A parameterized view to the robust recoverable base problem of matroids under structural uncertainty (Q2157911) (← links)
- Variants of the segment number of a graph (Q2206875) (← links)
- A 4.31-approximation for the geometric unique coverage problem on unit disks (Q2250456) (← links)
- Area bounds of rectilinear polygons realized by angle sequences (Q2331216) (← links)
- Swapping labeled tokens on graphs (Q2347003) (← links)
- Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time (Q2349742) (← links)
- Free edge lengths in plane graphs (Q2354683) (← links)
- Matroid representation of clique complexes (Q2381814) (← links)
- Reconfiguration of maximum weight \(b\)-matchings in a graph (Q2412417) (← links)
- Reconfiguration of maximum-weight \(b\)-matchings in a graph (Q2420651) (← links)
- Drawing (complete) binary tanglegrams (Q2428677) (← links)
- Approximating the path-distance-width for AT-free graphs and graphs in related classes (Q2442209) (← links)
- Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs (Q2457021) (← links)
- Submodular reassignment problem for reallocating agents to tasks with synergy effects (Q2673247) (← links)
- A greedy algorithm for convex geometry (Q2742684) (← links)
- A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares (Q2904540) (← links)
- Minimum-Cost $$b$$-Edge Dominating Sets on Trees (Q2942628) (← links)
- Sequentially Swapping Colored Tokens on Graphs (Q2980931) (← links)
- Matroid Representation of Clique Complexes (Q3082927) (← links)
- Dominating Set Counting in Graph Classes (Q3087935) (← links)
