The following pages link to Yuni Iwamasa (Q1631627):
Displaying 24 items.
- On a general framework for network representability in discrete optimization (Q1631628) (← links)
- Discrete convexity in joint winner property (Q1662162) (← links)
- The quadratic M-convexity testing problem (Q1701120) (← links)
- A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with \(2\times 2\) submatrices (Q2061866) (← links)
- A combinatorial algorithm for computing the rank of a generic partitioned matrix with \(2 \times 2\) submatrices (Q2089763) (← links)
- Reconstructing phylogenetic trees from multipartite quartet systems (Q2149097) (← links)
- Reconfiguring (non-spanning) arborescences (Q2680989) (← links)
- Reconfiguring directed trees in a digraph (Q2695298) (← links)
- On $k$-Submodular Relaxation (Q2820856) (← links)
- On a General Framework for Network Representability in Discrete Optimization (Q2835692) (← links)
- Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection. (Q3304138) (← links)
- A Tractable Class of Binary VCSPs via M-Convex Intersection (Q4972691) (← links)
- A Combinatorial Algorithm for Computing the Rank of a Generic Partitioned Matrix with 2 $$\times $$ 2 Submatrices (Q5041746) (← links)
- (Q5091050) (← links)
- Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications (Q5918605) (← links)
- Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications (Q5918723) (← links)
- A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with \(2 \times 2\) submatrices (Q6120836) (← links)
- Characterizations of the set of integer points in an integral bisubmodular polyhedron (Q6197722) (← links)
- On the sizes of BDDs and ZDDs representing matroids (Q6531691) (← links)
- Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams (Q6575130) (← links)
- Independent set reconfiguration on directed graphs (Q6584061) (← links)
- Algorithms for coloring reconfiguration under recolorability digraphs (Q6602420) (← links)
- Reconfiguration of colorings in triangulations of the sphere (Q6620535) (← links)
- Rerouting planar curves and disjoint paths (Q6638084) (← links)