The following pages link to Shin-ichi Tanigawa (Q262308):
Displaying 50 items.
- Gain-sparsity and symmetry-forced rigidity in the plane (Q262309) (← links)
- Packing non-zero \(A\)-paths via matroid matching (Q317424) (← links)
- Unique low rank completability of partially filled matrices (Q326825) (← links)
- Linking rigid bodies symmetrically (Q404454) (← links)
- Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits (Q442349) (← links)
- (Q529004) (redirect page) (← links)
- A structural characterization for certifying Robinsonian matrices (Q529005) (← links)
- A proof of the molecular conjecture (Q540449) (← links)
- A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets (Q612909) (← links)
- Exact algorithms for the bottleneck Steiner tree problem (Q652535) (← links)
- A rooted-forest partition with uniform vertex demand (Q695323) (← links)
- On the edge crossing properties of Euclidean minimum weight Laman graphs (Q902420) (← links)
- Generic global rigidity of body-hinge frameworks (Q905896) (← links)
- Enumerating constrained non-crossing minimally rigid frameworks (Q946684) (← links)
- Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees (Q967420) (← links)
- On packing spanning arborescences with matroid constraint (Q1689956) (← links)
- Count matroids of group-labeled graphs (Q1715073) (← links)
- Point-hyperplane frameworks, slider joints, and rigidity preserving transformations (Q1719573) (← links)
- Cut sparsifiers for balanced digraphs (Q1757778) (← links)
- Polynomial combinatorial algorithms for skew-bisubmodular function minimization (Q1785196) (← links)
- Globally rigid powers of graphs (Q2131861) (← links)
- Minimizing submodular functions on diamonds via generalized fractional matroid matchings (Q2171023) (← links)
- Perfect elimination orderings for symmetric matrices (Q2174877) (← links)
- Packing of arborescences with matroid constraints via matroid intersection (Q2188242) (← links)
- Global rigidity of periodic graphs under fixed-lattice representations (Q2221925) (← links)
- Online graph exploration algorithms for cycles and trees by multiple searchers (Q2251142) (← links)
- Generalized skew bisubmodularity: a characterization and a min-max theorem (Q2339806) (← links)
- Sufficient conditions for the global rigidity of graphs (Q2347845) (← links)
- Testing the supermodular-cut condition (Q2350909) (← links)
- Enumerating non-crossing minimally rigid frameworks (Q2373440) (← links)
- On reachability mixed arborescence packing (Q2419578) (← links)
- Global rigidity of triangulations with braces (Q2421558) (← links)
- Vertex splitting, coincident realisations, and global rigidity of braced triangulations (Q2679602) (← links)
- Characterizing the universal rigidity of generic tensegrities (Q2689816) (← links)
- Constant-Time Algorithms for Sparsity Matroids (Q2843275) (← links)
- On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs (Q2872069) (← links)
- Periodic body-and-bar frameworks (Q2874596) (← links)
- A Rooted-Forest Partition with Uniform Vertex Demand (Q3404442) (← links)
- Matroids of gain graphs in applied discrete geometry (Q3450280) (← links)
- Periodic Body-and-Bar Frameworks (Q3453567) (← links)
- Geometric Spanner of Objects under L 1 Distance (Q3511351) (← links)
- Enumerating Non-crossing Minimally Rigid Frameworks (Q3591318) (← links)
- Enumerating Constrained Non-crossing Geometric Spanning Trees (Q3608849) (← links)
- Exact Algorithms for the Bottleneck Steiner Tree Problem (Q3652188) (← links)
- On the Infinitesimal Rigidity of Bar-and-Slider Frameworks (Q3652240) (← links)
- Rigidity of Frameworks on Expanding Spheres (Q4555047) (← links)
- (Q4556058) (← links)
- (Q4556059) (← links)
- Improved Approximation Algorithms for <i>k</i>-Submodular Function Maximization (Q4575607) (← links)
- Generic Rigidity Matroids with Dilworth Truncations (Q4899068) (← links)
