The following pages link to Komei Fukuda (Q202636):
Displaying 50 items.
- (Q223961) (redirect page) (← links)
- (Q583219) (redirect page) (← links)
- Characterizations of *-families (Q583220) (← links)
- (Q588504) (redirect page) (← links)
- Combinatorial characterizations of \(K\)-matrices (Q609481) (← links)
- Every non-Euclidean oriented matroid admits a biquadratic final polynomial (Q624213) (← links)
- A theorem on the average number of subfaces in arrangements and oriented matroids (Q685218) (← links)
- Antipodal graphs and oriented matroids (Q686471) (← links)
- The inequicut cone (Q688255) (← links)
- New polynomial-time algorithms for Camion bases (Q856883) (← links)
- A linear equation for Minkowski sums of polytopes relatively in general position (Q966166) (← links)
- The Holt-Klee condition for oriented matroids (Q1041605) (← links)
- Combinatorial face enumeration in arrangements and oriented matroids (Q1175785) (← links)
- Bounding the number of \(k\)-faces in arrangements of hyperplanes (Q1175787) (← links)
- Clutters and matroids (Q1176744) (← links)
- On the finiteness of the criss-cross method (Q1176822) (← links)
- A basis enumeration algorithm for linear systems with geometric applications (Q1180318) (← links)
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra (Q1199131) (← links)
- Oriented matroids and combinatorial manifolds (Q1209285) (← links)
- Isolating points by lines in the plane (Q1266482) (← links)
- Primal-dual methods for vertex and facet enumeration (Q1272960) (← links)
- On extremal behaviors of Murty's least index method (Q1332313) (← links)
- Combinatorial face enumeration in convex polytopes (Q1334609) (← links)
- McMullen's conditions and some lower bounds for general convex polytopes (Q1337108) (← links)
- (Q1349277) (redirect page) (← links)
- Generation of oriented matroids --- a graph theoretical approach (Q1349279) (← links)
- Criss-cross methods: A fresh view on pivot algorithms (Q1365063) (← links)
- EP theorems and linear complementarity problems (Q1392569) (← links)
- On the cocircuit graph of an oriented matroid (Q1580748) (← links)
- Combinatorial redundancy detection (Q1657399) (← links)
- A case when the union of polytopes is convex (Q1774983) (← links)
- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm (Q1779531) (← links)
- The parallel search bench ZRAM and its applications (Q1808187) (← links)
- An adaptive algorithm for vector partitioning (Q1810893) (← links)
- Finding all common bases in two matroids (Q1842654) (← links)
- Reverse search for enumeration (Q1917258) (← links)
- Complete enumeration of small realizable oriented matroids (Q1943649) (← links)
- \(f\)-vectors of Minkowski additions of convex polytopes (Q2369928) (← links)
- Pivoting in linear complementarity: Two polynomial-time cases (Q2391195) (← links)
- The generic Gröbner walk (Q2457423) (← links)
- Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron. (Q2482881) (← links)
- From the zonotope construction to the Minkowski addition of convex polytopes (Q2643562) (← links)
- (Q2707294) (← links)
- (Q3024756) (← links)
- (Q3211359) (← links)
- Computing Gröbner fans (Q3592702) (← links)
- An output-sensitive algorithm for multi-parametric LCPs with sufficient matrices (Q3622256) (← links)
- (Q3789578) (← links)
- A DUAL INTERIOR PRIMAL SIMPLEX METHOD FOR LINEAR PROGRAMMING METHOD (Q3807876) (← links)
- The Existence of a Short Sequence of Admissible Pivots to an Optimal Basis in LP and LCP (Q3842984) (← links)
