Komei Fukuda

Affiliations:
  • ETH Zurich, Switzerland


According to our database1, Komei Fukuda authored at least 56 papers between 1989 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2018
Combinatorial redundancy detection.
Ann. Oper. Res., 2018

2017
On the Complexity of Polytopes in LI(2).
CoRR, 2017

2016
Redundancies in Linear Systems with two Variables per Inequality.
CoRR, 2016

2015
Combinatorial geometries: Matroids, oriented matroids and applications. Special issue in memory of Michel Las Vergnas.
Eur. J. Comb., 2015

2013
Complete Enumeration of Small Realizable Oriented Matroids.
Discret. Comput. Geom., 2013

2010
A linear equation for Minkowski sums of polytopes relatively in general position.
Eur. J. Comb., 2010

2009
The Holt-Klee condition for oriented matroids.
Eur. J. Comb., 2009

Pivoting in Linear Complementarity: Two Polynomial-Time Cases.
Discret. Comput. Geom., 2009

Every non-Euclidean oriented matroid admits a biquadratic final polynomial.
Comb., 2009

2008
Multiple-symbol differential detection based on combinatorial geometry.
IEEE Trans. Commun., 2008

Exact algorithms and software in optimization and polyhedral computation.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

2007
Computing Gröbner fans.
Math. Comput., 2007

The generic Gröbner walk.
J. Symb. Comput., 2007

f-Vectors of Minkowski Additions of Convex Polytopes.
Discret. Comput. Geom., 2007

2006
New polynomial-time algorithms for Camion bases.
Discret. Math., 2006

2005
Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm.
Eur. J. Oper. Res., 2005

Computing faces up to k dimensions of a Minkowski Sum of Polytopes.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004
From the zonotope construction to the Minkowski addition of convex polytopes.
J. Symb. Comput., 2004

The criss-cross method can take Omega(n<sup>d</sup>) pivots.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

Lexico-smallest Representations, Duality and Matching Polyhedra.
Proceedings of the CTW04 Workshop on Graphs and Combinatorial Optimization, 2004

2003
An Adaptive Algorithm for Vector Partitioning.
J. Glob. Optim., 2003

Primal-dual algorithms for data depth.
Proceedings of the Data Depth: Robust Multivariate Analysis, 2003

Debugging Distributed Computations by Reverse Search.
Proceedings of the 21st IASTED International Multi-Conference on Applied Informatics (AI 2003), 2003

2002
Generation of Oriented Matroids - A Graph Theoretical Approach.
Discret. Comput. Geom., 2002

On the Face Lattice of the Metric Polytope.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

2001
Notes on acyclic orientations and the shelling lemma.
Theor. Comput. Sci., 2001

A polynomial case of unconstrained zero-one quadratic optimization.
Math. Program., 2001

Cocircuit Graphs and Efficient Orientation Reconstruction in Oriented Matroids.
Eur. J. Comb., 2001

Extended convex hull.
Comput. Geom., 2001

Convexity recognition of the union of polyhedra.
Comput. Geom., 2001

Complete combinatorial generation of small point configurations and hyperplane arrangements.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000
Combinatorics of Polytopes - Preface.
Eur. J. Comb., 2000

On the Cocircuit Graph of an Oriented Matroid.
Discret. Comput. Geom., 2000

On the Skeleton of the Metric Polytope.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

1999
Optimization over k-set Polytopes and Efficient k-set Enumeration.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

1998
Primal - Dual Methods for Vertex and Facet Enumeration.
Discret. Comput. Geom., 1998

EP Theorems and Linear Complementarity Problems.
Discret. Appl. Math., 1998

1997
Criss-cross methods: A fresh view on pivot algorithms.
Math. Program., 1997

Analysis of Backtrack Algorithms for Listing All Vertices and All Faces of a Convex Polyhedron.
Comput. Geom., 1997

Primal-Dual Methods for Vertex and Facet Enumeration (Preliminary Version).
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996
Reverse Search for Enumeration.
Discret. Appl. Math., 1996

1995
Finding All Common Bases in Two Matroids.
Discret. Appl. Math., 1995

Preface.
Discret. Appl. Math., 1995

Double Description Method Revisited.
Proceedings of the Combinatorics and Computer Science, 1995

On Skeletons, Diameters and Volumes of Metric Polyhedra.
Proceedings of the Combinatorics and Computer Science, 1995

1994
On extremal behaviors of Murty's least index method.
Math. Program., 1994

Combinatorial Face Enumeration in Convex Polytopes.
Comput. Geom., 1994

1993
Oriented Matroids and Combinatorial Manifolds.
Eur. J. Comb., 1993

Antipodal graphs and oriented matroids.
Discret. Math., 1993

The inequicut cone.
Discret. Math., 1993

1992
Finding all minimum-cost perfect matchings in Bipartite graphs.
Networks, 1992

A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra.
Discret. Comput. Geom., 1992

1991
Clutters and matroids.
Discret. Math., 1991

Bounding the number of k-faces in arrangements of hyperplanes.
Discret. Appl. Math., 1991

Combinatorial face enumeration in arrangements and oriented matroids.
Discret. Appl. Math., 1991

1989
Characterizations of *-families.
J. Comb. Theory B, 1989


  Loading...