next up previous
Next: About this document ... Up: listfk1 Previous: listfk1

Bibliography

1
K. Allemand, K. Fukuda, Th. M. Liebling, and A. Prodon.
The unconstrained quadratic zero one programming.
NSF project in progress, Swiss Federal Institute of Technology, Lausanne, 1998.

2
K. Allemand, K. Fukuda, Th. M. Liebling, and E. Steiner.
A polynomial case of unconstrained zero-one quadratic optimization.
Tech. Report, Swiss Federal Institute of Technology, Lausanne, 2000.
presented at the 17th International Symposium on Mathematica Programming, Atlanta, submitted to Mathematical Programming.

3
K. Allemand, K. Fukuda, Th. M. Liebling, and E. Steiner.
A polynomial case of unconstrained zero-one quadratic optimization.
Mathematical Programming, Ser. A, 91:49-52, 2001.

4
A. Andrzejak and K. Fukuda.
Optimization over k-set polytopes and efficient k-set enumeration.
In Proc. 6th International Workshop on Algorithms And Data Structures (WADS'99), LNCS 1663, pages 1-12. Springer-Verlag, 1999.

5
D. Avis and K. Fukuda.
A basis enumeration algorithm for linear systems with geometric applications.
Applied Mathematics Letters, 4(5):39-42, 1991.

6
D. Avis and K. Fukuda.
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra.
In Proc. 7th Annu. ACM Sympos. Comput. Geom., pages 98-104, 1991.

7
D. Avis and K. Fukuda.
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra.
Discrete Comput. Geom., 8:295-313, 1992.

8
D. Avis and K. Fukuda.
Reverse search for enumeration.
Tech. Report No. 92-5, Graduate School of Systems Management, University of Tsukuba, Tokyo, Japan, 1992.

9
D. Avis and K. Fukuda.
Reverse search for enumeration.
Discrete Applied Mathematics, 65:21-46, 1996.

Physical Review B, 49(1):1-7, 1994.
pdf file available from http://burgaz.mit.edu/papers/date.html.

20
R. Cordovil and K. Fukuda.
Oriented matroids and combinatorial manifolds.
Europ. J. Combinatorics, 14:9-15, 1993.

21
R. Cordovil, K. Fukuda, and A. Guedes de Oliveira.
On the cocircuit graph of an oriented matroid.
unpublished report, 1991.

22
R. Cordovil, K. Fukuda, and A. Guedes de Oliveira.
On the cocircuit graph of an oriented matroid.
Discrete Comput. Geom., 24:257-265, 2000.

23
R. Cordovil, K. Fukuda, and M.L. Moreira.
Clutters and matroids.
Discrete Mathematics, 89:161-171, 1991.

24
I.P.F. Da Silva and K. Fukuda.
Isolating points by lines in the plane.
J. Geom., 62(1-2):48-65, 1998.

25
A. Deza, M. Deza, and K. Fukuda.
On skeletons, diameters and volumes of metric polyhedra.
In M. Deza, R. Euler, and I. Manoussakis, editors, Combinatorics and Computer Science, volume 1120 of Lecture Notes in Computer Science, pages 112-128. Springer-Verlag, 1996.

26
A. Deza and K. Fukuda.
McMullen's conditions and some lower bounds for general convex polytopes.
Geometriae Dedicata, 53:165-173, 1994.

27
A. Deza, K. Fukuda, D. Pasechnik, and M. Sato.
Generating vertices with symmetries.
In Proc. 5th Workshop on Algorithms and Computation, Tokyo, pages 1-8, 2000.

28
A. Deza, K. Fukuda, D. Pasechnik, and M. Sato.
On the skeleton of the metric polytope.
Technical report b-367, Dept. of Math. and Comp. Sci., Tokyo Institute of Technology, 2000.
to appear in Lecture Notes in Computer Science.

29
A. Deza, K. Fukuda, D. Pasechnik, and M. Sato.
On the skeleton of the metric polytope.
In J. Akiyama, M. Kano, and M. Urabe, editors, Lecture Notes in Computer Science, volume 2098, pages 125-136. Springer-Verlag, 2001.

30
A. Deza, K. Fukuda, and V. Rosta.
Wagner's theorem and combinatorial enumeration of $3$-polytopes.
Surikaisekikenkyusho Kokyuroku, (872):30-34, 1994.
Computational geometry and discrete geometry (Japanese) (Kyoto, 1993).

31
M. Deza and K. Fukuda.
On bouquets of matroids and orientations.
In Kokyuroku, volume 587, pages 110-129. Research Institute for Mathematical Sciences, Kyoto University, 1986.

32
M. Deza and K. Fukuda.
Loops of clutters.
In D.K. Ray-Chaudhuri, editor, Coding Theory and Design Theory, Part I Coding Theory, volume 20 of The IMA Volumes in Mathematics and Its Applications, pages 72-101. Springer-Verlag, 1990.

33
M. Deza, K. Fukuda, and M. Laurent.
The inequicut cone.
Discrete Mathematics, 119:21-48, 1993.

34
J.-A. Ferrez, K. Fukuda, and Th. M. Liebling.
Parallel implementation of graph diameter algorithms.
Preprint, EPFL, 1997.

35
J.-A. Ferrez, K. Fukuda, and Th. M. Liebling.
Parallel computation of the diameter of a graph.
In J. Schaeffer, editor, High Performance Computing Systems and Applications, pages 283-296. Kluwer Academic Publishers, 1998.

36
J.-A. Ferrez, K. Fukuda, and Th. M. Liebling.
Parallel implementation of graph diameter algorithms.
EPFL Supercomputing Review, (10), November 1998.

37
J.A. Ferrez, K. Fukuda, and Th. M. Liebling.
Cuts, zonotopes and arrangements.
Preprint, Swiss Federal Institute of Technology, Lausanne, 2001.

38
L. Finschi and K. Fukuda.
Complete combinatorial generation of small point configurations and hyperplane arrangements.
In Proceedings of the 13th Canadian Conference on Computational Geometry, 2001.

39
L. Finschi and K. Fukuda.
Complete combinatorial generation of small point configurations and hyperplane arrangements.
Preprint, ETH Zurich, 2001.
Submitted.

40
L. Finschi and K. Fukuda.
Generation of oriented matroids - a graph theoretical approach.
Discrete Comput. Geom., 2001.
to appear. ps file available from ftp://ftp.ifor.math.ethz.ch/pub/fukuda/reports/GenerationOfOMs001031.ps.gz.

41
L. Finschi, K. Fukuda, and H.-J. Lüthi.
Towards a unified framework for randomized pivoting algorithms in linear programming.
In P. Kall and H.-J. Lüthi, editors, Operations Research Proceedings 1998, pages 113-122, 1999.
ps file available from ftp://ftp.ifor.math.ethz.ch/pub/fukuda/reports/randsimp9810.ps.gz.

42
K. Fukuda.
Komei Fukuda's Homepage, Department of Mathematics, Swiss Federal Institute of Technology, Lausanne and Zurich, Switzerland.
http://www.ifor.math.ethz.ch/~fukuda/fukuda.html.

43
K. Fukuda.
Abstract polytopes and the linear complementarity problem.
M.Sc. thesis, Keio Univ., Yokohama, Japan, 1976.

44
K. Fukuda.
Oriented matroid programming.
Ph.D. thesis, Univ. of Waterloo, Waterloo, Canada, 1982.

45
K. Fukuda.
An efficient pivot algorithm for finding all edges and vertices of convex polytopes: 3-dimensional case.
Research Report B-131, Dept. of Information Sciences, Tokyo Institute of Technology, Tokyo, Japan, 1983.

46
K. Fukuda.
Lecture notes: combinatorics of mathematical programming and polyhedral geometry.
1983.

47
K. Fukuda.
An efficient pivot algorithm for finding all edges and vertices of convex polytopes: Shelling algorithm.
Research Report B-146, Dept. of Information Sciences, Tokyo Institute of Technology, Tokyo, Japan, 1984.

48
K. Fukuda.
Oriented matroids and linear programming (in Japanese).
In Proceedings of the 15th Symposium of the Operations Research Society of Japan, pages 8-14, 1986.

49
K. Fukuda.
Oriented matroids and linear programming (in Japanese).
Communications of the Operations Research Society of Japan, (1):5-13, 1987.

50
K. Fukuda.
cdd.c : C-implementation of the double description method for computing all vertices and extremal rays of a convex polyhedron given by a system of linear inequalities.
Department of Mathematics, Swiss Federal Institute of Technology, Lausanne, Switzerland, 1993.
program available from http://www.ifor.math.ethz.ch/~fukuda/fukuda.html.

51
K. Fukuda.
Reverse search with applications (in Japanese).
In S. Fujishige, editor, Discrete Structures and Algorithms II, pages 47-78. Kindaikagaku-sha, 1993.

52
K. Fukuda.
cdd+ reference manual.
Institute for Operations Research, Swiss Federal Institute of Technology, Zurich, Switzerland, 1995.
program available from http://www.ifor.math.ethz.ch/~fukuda/fukuda.html.

53
K. Fukuda.
Lecture notes: A constructive approach to polyhedral geometry and mathematical programming.
Institute for Operations Research, ETH, Zurich, Switzerland, 1995.

54
K. Fukuda.
Complexity of enumeration - evaluating the hardness of listing objects.
presented at ETH Zurich, May 1996, also at International Symposium on Math. Programming 1997, 1996.
see WWW page http://www.ifor.math.ethz.ch/~fukuda/fukuda.html.

55
K. Fukuda.
cdd/cdd+ reference manual, Version 061/Version 0.75.
Institute for Operations Research, Swiss Federal Institute of Technology, Lausanne and Zurich, Switzerland, December 1997.
program available from http://www.ifor.math.ethz.ch/~fukuda/fukuda.html.

56
K. Fukuda.
cdd/cdd+ reference manual, Version 061a/Version 0.75a.
Institute for Operations Research, Swiss Federal Institute of Technology, Lausanne and Zurich, Switzerland, 1998.
program available from http://www.ifor.math.ethz.ch/~fukuda/cdd_home/cdd.html.

57
K. Fukuda.
Polyhedral computation FAQ, 1998.
Both html and ps versions available from http://www.ifor.math.ethz.ch/~fukuda/fukuda.html.

58
K. Fukuda.
cdd/cdd+ reference manual, Version 061a/Version 0.76a.
Institute for Operations Research, Swiss Federal Institute of Technology, Lausanne and Zurich, Switzerland, 1999.
program available from http://www.ifor.math.ethz.ch/~fukuda/cdd_home/cdd.html.

59
K. Fukuda.
cddlib reference manual, cddlib Version 085.
Swiss Federal Institute of Technology, Lausanne and Zurich, Switzerland, 1999.
program available from http://www.ifor.math.ethz.ch/~fukuda/cdd_home/cdd.html.

60
K. Fukuda.
Lecture notes: Computational combinatorics.
Technical report, Department of Mathematics, Swiss Federal Institute of Technology, Zurich, 1999.
ps file available from ftp://ftp.ifor.math.ethz.ch/pub/fukuda/sources/cc99note.ps.gz.

61
K. Fukuda.
Lecture notes: Optimization techniques, linear and combinatorial optimization.
Technical report, Department of Mathematics, Swiss Federal Institute of Technology, Zurich, 1999.
ps file available from ftp://ftp.ifor.math.ethz.ch/pub/fukuda/sources/a99note.ps.gz.

62
K. Fukuda.
cddlib reference manual, cddlib Version 091.
Swiss Federal Institute of Technology, Lausanne and Zurich, Switzerland, 2000.
program available from http://www.ifor.math.ethz.ch/~fukuda/cdd_home/cdd.html.

63
K. Fukuda.
Lecture notes: A constructive approach to polyhedral geometry and mathematical programming.
Institute for Mathematical Research, ETH, Zurich, Switzerland, 2000.
ps file available as ftp://ftp.ifor.math.ethz.ch/pub/fukuda/sources/ethzom00.ps.gz.

64
K. Fukuda.
Lecture notes: Optimization techniques, linear and combinatorial optimization.
Technical report, Department of Mathematics, Swiss Federal Institute of Technology, Zurich, 2000.
ps file available from ftp://ftp.ifor.math.ethz.ch/pub/fukuda/sources/a00note.ps.gz.

65
K. Fukuda.
Polyhedral computation FAQ, 2000.
First version in 1998, both html and ps versions available from http://www.ifor.math.ethz.ch/~fukuda/fukuda.html.

66
K. Fukuda.
cddlib reference manual, cddlib Version 092a.
McGill University, Montreal, Canada, 2001.
program available from http://www.cs.mcgill.ca/~fukuda/software/cdd_home/cdd.html.

67
K. Fukuda.
Combinatorics of convex polytopes (in Japanese).
Surikagaku, (442):46-55, April 2000.

68
K. Fukuda and K. Handa.
Perturbation of oriented matroids and acycloids.
Research Reports on Information Sciences B-172, Tokyo Institute of Technology, 1985.

69
K. Fukuda and K. Handa.
Antipodal graphs and oriented matroids.
Discrete Mathematics, 111:245-256, 1993.

70
K. Fukuda, Th. M. Liebling, and C. Lütolf.
Extended convex hull.
In D. Bremner, editor, Proceedings of the 12th Canadian Conference on Computational Geometry, pages 57-63, 2000.

71
K. Fukuda, Th. M. Liebling, and C. Lütolf.
Extended convex hull.
Computational Geometry, 20:13-23, 2001.

72
K. Fukuda, Th. M. Liebling, and F. Margot.
Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron.
Technical report, Department of Mathematics, Swiss Federal Institute of Technology, Lausanne, Switzerland, 1994.
to appear in Computational Geometry.

73
K. Fukuda, Th. M. Liebling, and F. Margot.
Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron.
Computational Geometry, 8:1-12, 1997.
ps file available from ftp://ftp.ifor.math.ethz.ch/pub/fukuda/reports/optvert9610.ps.gz.

74
K. Fukuda, Th. M. Liebling, and S. Picozzi.
Computating facet adjacencies in linear inequality systems.
Research report, ETP Lausanne, 2001.
in preparation.

75
K. Fukuda, H.-J. Lüthi, and M. Namiki.
The existence of a short sequence of admissible pivots to an optimal basis in LP and LCP.
Technical report, IFOR, ETH Zentrum, Zurich, Switzerland, 1996.
to appear in ITOR, ps file available from ftp://ftp.ifor.math.ethz.ch/pub/fukuda/reports/shortpath970314.ps.gz.

76
K. Fukuda, H.-J. Lüthi, and M. Namiki.
The existence of a short sequence of admissible pivots to an optimal basis in LP and LCP.
Int. Trans. Opl. Res., 4:273-284, 1997.

77
K. Fukuda and T. Matsui.
Elementary inductive proofs for linear programming.
In Kokyuroku, volume 680. Research Institute for Mathematical Sciences, Kyoto University, 1989.

78
K. Fukuda and T. Matsui.
On the finiteness of the criss-cross method.
European Journal of Operational Research, 52:119-124, 1991.

79
K. Fukuda and T. Matsui.
Finding all minimum cost perfect matchings in bipartite graphs.
Networks, 22:461-468, 1992.

80
K. Fukuda and T. Matsui.
Finding all the perfect matchings in bipartite graphs.
Appl. Math. Lett., 7(1):15-18, 1994.

81
K. Fukuda, T. Matsui, and Y. Matsui.
A catalog of enumeration algorithms.
Project (in progress), ROSO, Department of Mathematics, EPFL, 1996.
WWW page at http://dmawww.epfl.ch/roso.mosaic/kf/enum/enum.html.

82
K. Fukuda and I. Mizukoshi.
Mathematica package: Vertex enumeration for convex polyhedra and hyperplane arrangementss.
Technical Report Version 0.41 Beta, Graduate School of Systems Management, University of Tsukuba, Tokyo, Japan, 1991.
available via anonymous ftp from cs.sunysb.edu (directory pub/Combinatorica) and from MathSource (Wolfram Research).

83
K. Fukuda and M. Namiki.
On extremal behaviors of murty's least index method.
Mathematical Programming, 64:365-370, 1994.

84
K. Fukuda and M. Namiki.
Finding all common bases in two matroids.
Discrete Applied Mathematics, 56:231-243, 1995.

85
K. Fukuda, M. Namiki, and A. Tamura.
EP theorems and linear complementarity problems.
Working paper, Dept. of Social and International Relations, University of Tokyo, Tokyo, Japan, 1995.

86
K. Fukuda, M. Namiki, and A. Tamura.
EP theorems and linear complementarity problems.
Discrete Applied Mathematics, 84:107-119, 1998.

87
K. Fukuda, S. Onn, and V. Rosta.
An adaptive algorithm for vector partitioning.
Technical report, IFOR, Swiss Federal Institute of Technology, Zurich, Switzerland, 2001.
Submitted.

88
K. Fukuda and A. Prodon.
Double description method revisited.
Technical report, Department of Mathematics, Swiss Federal Institute of Technology, Lausanne, Switzerland, 1995.

89
K. Fukuda and A. Prodon.
Double description method revisited.
In M. Deza, R. Euler, and I. Manoussakis, editors, Combinatorics and Computer Science, volume 1120 of Lecture Notes in Computer Science, pages 91-111. Springer-Verlag, 1996.
ps file available from ftp://ftp.ifor.math.ethz.ch/pub/fukuda/reports/ddrev960315.ps.gz.

90
K. Fukuda, A. Prodon, and T. Sakuma.
Notes on acyclic orientations and the shelling lemma.
Theoretical Computer Science, 263:9-16, 2001.
ps file available from ftp://ftp.ifor.math.ethz.ch/pub/fukuda/reports/acyclic980112.ps.gz.

91
K. Fukuda and V. Rosta.
Mathematica package for face enumeration.
Graduate School of Systems Management, University of Tsukuba, Tokyo, Japan, 1992.
distributed as a supplementary package to VertexEnum package, available via anonymous ftp from cs.sunysb.edu (directory pub/Combinatorica) and from MathSource (Wolfram Research).

92
K. Fukuda and V. Rosta.
Combinatorial face enumeration in convex polytopes.
Computational Geometry, 4:191-198, 1994.

93
K. Fukuda, S. Saito, and A. Tamura.
Combinatorial face enumeration in arrangements and oriented matroids.
Discrete Applied Mathematics, 31:141-149, 1991.

94
K. Fukuda, S. Saito, A. Tamura, and T. Tokuyama.
Bounding the number of k-faces in arrangements of hyperplanes.
Discrete Applied Mathematics, 31:151-165, 1991.

95
K. Fukuda and S. Sakai.
Visualization of the complex network of Japanese corporate ties.
Project in progress, GSSM, University of Tsukuba, Tokyo, 1994.

96
K. Fukuda and Y. Sawatani.
General line shelling of convex polytopes.
Research Reports on Information Sciences B-???, Tokyo Institute of Technology, 1987.

97
K. Fukuda and A. Tamura.
Local deformation and orientation transformation in oriented matroids.
Arts Combinatoria, 25A:243-258, 1988.

98
K. Fukuda and A. Tamura.
Local deformation and orientation transformation in oriented matroids II.
Research Report B-212, Dept. of Information Sciences, Tokyo Institute of Technology, Tokyo, Japan, 1988.

99
K. Fukuda and A. Tamura.
Characterizations of *-families.
J. Combin. Theory Ser. B, 47:107-110, 1989.

100
K. Fukuda and A. Tamura.
Dualities in signed vector systems.
Portugaliae Mathematica, 47:151-165, 1990.

101
K. Fukuda, A. Tamura, and T. Tokuyama.
A theorem on the average number of subfaces in arrangements and oriented matroids.
Geometricae Dedicata, 47:129-142, 1993.

102
K. Fukuda and T. Terlaky.
Linear complementarity and oriented matroids.
Journal of the Operations Research Society of Japan, 35:45-61, 1992.

103
K. Fukuda and T. Terlaky.
Criss-cross methods: A fresh view on pivot algorithms.
Mathematical Programming, 79:369-395, 1997.

104
K. Fukuda and T. Terlaky.
On the existence of a short admissible pivot sequence for feasibility and linear optimization problems.
Technical report, Swiss Federal Institute of Technology, Switzerland, 1999.
ps file available from ftp://ftp.ifor.math.ethz.ch/pub/fukuda/reports/short000214.ps.gz.

105
K. Fukuda and T. Terlaky.
On the existence of a short admissible pivot sequence for feasibility and linear optimization problems.
Pure Mathematics and Applications, Mathematics of Optimization, 10(4):431-447, 2000.

106
A. Marzetta, J. Nievergelt, and K. Fukuda.
Parallelization of reverse search algorithms.
Project (in progress), ETH Zurich, October 1995.
ps file available from ftp://ftp.ifor.math.ethz.ch/pub/fukuda/reports.

107
M. Namiki and K. Fukuda.
UnfoldPolytope: A Mathematica package for unfolding general convex polytopes, 1992.
available from http://www.ifor.math.ethz.ch/~fukuda/fukuda.html.

108
A. Tamura, H. Takehara, K. Fukuda, S. Fujishige, and M. Kojima.
A dual interior point primal simplex method for linear programming.
Journal of the Operations Research Society of Japan, 31:413-430, 1988.



Komei Fukuda 2001-12-28