46 citations · 100 across the 13 of their papers we have counts for
13 papers
On the Complexity of Polytopes in
Komei Fukuda, May Szedlak
In this paper we consider polytopes given by systems of inequalities in variables, where every inequality has at most two variables with nonzero coefficient. We denote this…
Redundancies in Linear Systems with two Variables per Inequality
Komei Fukuda, May Szedlak
The problem of detecting and removing redundant constraints is fundamental in optimization. We focus on the case of linear programs (LPs), given by variables with inequalit…
Combinatorial Redundancy Detection
Komei Fukuda, Bernd Gärtner, May Szedlák
The problem of detecting and removing redundant constraints is fundamental in optimization. We focus on the case of linear programs (LPs) in dictionary form, given by equality…
Complete enumeration of small realizable oriented matroids
Komei Fukuda, Hiroyuki Miyata, Sonoko Moriyama
Enumeration of all combinatorial types of point configurations and polytopes is a fundamental problem in combinatorial geometry. Although many studies have been done, most of them…
Combinatorial Characterizations of K-matrices
Jan Foniok, Komei Fukuda, Lorenz Klaus
We present a number of combinatorial characterizations of K-matrices. This extends a theorem of Fiedler and Ptak on linear-algebraic characterizations of K-matrices to the setting…
An output-sensitive algorithm for multi-parametric LCPs with sufficient matrices
Sebastiano Columbano, Komei Fukuda, Colin Jones
This paper considers the multi-parametric linear complementarity problem (pLCP) with sufficient matrices. The main result is an algorithm to find a polyhedral decomposition of the…