An inequality for the volume of inscribed ellipsoids
Discrete & Computational Geometry
Cyclic games and an algorithm to find minimax cycle means in directed graphs
USSR Computational Mathematics and Mathematical Physics
On the complexity of approximating the maximal inscribed ellipsoid for a polytope
Mathematical Programming: Series A and B
On the complexity of approximating extremal determinants in matrices
Journal of Complexity
Rounding of polytopes in the real number model of computation
Mathematics of Operations Research
Coordination complexity of parallel price-directive decomposition
Mathematics of Operations Research
On the complexity of dualization of monotone disjunctive normal forms
Journal of Algorithms
Approximate minimum-cost multicommodity flows in O˜(&egr;-2KNM) time
Mathematical Programming: Series A and B
On the Complexity of Matrix Balancing
SIAM Journal on Matrix Analysis and Applications
On the frequency of the most frequently occurring variable in dual monotone DNFs
Discrete Mathematics
Approximating fixed points of weakly contracting mappings
Journal of Complexity
On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
SIAM Journal on Computing
Approximate Max-Min Resource Sharing for Structured Concave Optimization
SIAM Journal on Optimization
An Interior Point Method for Bordered Block-Diagonal Linear Programs
SIAM Journal on Optimization
Cubegrades: Generalizing Association Rules
Data Mining and Knowledge Discovery
On the Complexity of Semidefinite Programs
Journal of Global Optimization
Matroid Intersections, Polymatroid Inequalities, and Related Problems
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Computing integral points in convex semi-algebraic sets
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
On Maximal Frequent and Minimal Infrequent Sets in Binary Matrices
Annals of Mathematics and Artificial Intelligence
An inequality for polymatroid functions and its applications
Discrete Applied Mathematics - Submodularity
Generating all vertices of a polyhedron is hard
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On the Complexity of Some Enumeration Problems for Matroids
SIAM Journal on Discrete Mathematics
Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
Discrete Applied Mathematics
A global parallel algorithm for the hypergraph transversal problem
Information Processing Letters
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Enumerating spanning and connected subsets in graphs and matroids
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Theoretical Computer Science
Generating All Vertices of a Polyhedron Is Hard
Discrete & Computational Geometry
On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
Theory of Computing Systems
An intersection inequality for discrete distributions and related generation problems
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Extending Dijkstra's algorithm to maximize the shortest path by node-wise limited arc interdiction
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
A new algorithm for the hypergraph transversal problem
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Generating cut conjunctions and bridge avoiding extensions in graphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
A greedy heuristic for a minimum-weight forest problem
Operations Research Letters
On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms
Operations Research Letters
A sublinear-time randomized approximation algorithm for matrix games
Operations Research Letters
Generating minimal k-vertex connected spanning subgraphs
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
| Hi-index | 0.04 |
On April 29, 2005, Leo Khachiyan passed away with tragic suddenness in the middle of his scientific career. He became famous for his polynomial time algorithm for linear programming (LP)[L. Khachiyan, A polynomial algorithm in linear programming, Soviet Math. Doklady 20 (1) (1979) 191-194; L. Khachiyan, Polynomial algorithms for linear programming, USSR Comp. Math. and Math. Phys. 20 (2) (1980) 51-68]. However, he contributed fundamentally to several other areas, as well. In this introductory paper, we would like to recall briefly his main contributions, and provide a complete (up to our best knowledge) list of his publications.