Leonid Khachiyan

发表

Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs

Vladimir Gurvich, Konrad Borys, Khaled M. Elbassioni, 2005, ISAAC.

Cubegrades: Generalizing Association Rules

Leonid Khachiyan, Tomasz Imielinski, Amin Abdulghani, 2002, Data Mining and Knowledge Discovery.

On the complexity of approximating the maximal inscribed ellipsoid for a polytope

Leonid Khachiyan, Michael J. Todd, L. Khachiyan, 1993, Math. Program..

Linear Scheduling Is Nearly Optimal

Yves Robert, Leonid Khachiyan, Alain Darte, 1991, Parallel Process. Lett..

Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2007, Theor. Comput. Sci..

On the Complexity of Dualization of Monotone Disjunctive Normal Forms

Leonid Khachiyan, Michael L. Fredman, L. Khachiyan, 1996, J. Algorithms.

Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2004, IPCO.

An inequality for the volume of inscribed ellipsoids

Leonid Khachiyan, 1990, Discret. Comput. Geom..

A sublinear-time randomized approximation algorithm for matrix games

Leonid Khachiyan, Michael D. Grigoriadis, L. Khachiyan, 1995, Oper. Res. Lett..

Approximate minimum-cost multicommodity flows in $$\tilde O$$ (ɛ−2KNM) timetime

Leonid Khachiyan, Michael D. Grigoriadis, 1996, Math. Program..

Generating Paths and Cuts in Multi-pole (Di)graphs

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2004, MFCS.

On Enumerating Minimal Dicuts and Strongly Connected Subgraphs

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2007, Algorithmica.

On Maximal Frequent and Minimal Infrequent Sets in Binary Matrices

Vladimir Gurvich, Endre Boros, Leonid Khachiyan, 2003, Annals of Mathematics and Artificial Intelligence.

Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints

Leonid Khachiyan, Michael D. Grigoriadis, L. Khachiyan, 1994, SIAM J. Optim..

Approximating Fixed Points of Weakly Contracting Mappings

Leonid Khachiyan, Z. Huang, Christopher A. Sikorski, 1999, J. Complex..

An Efficient Implementation of a Joint Generation Algorithm

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2004, WEA.

Coordination Complexity of Parallel Price-Directive Decomposition

Leonid Khachiyan, Michael D. Grigoriadis, L. Khachiyan, 1996, Math. Oper. Res..

A global parallel algorithm for the hypergraph transversal problem

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2007, Inf. Process. Lett..

Approximate minimum-cost multicommodity flows in

Leonid Khachiyan, Michael D. Grigoriadis, 1996 .

On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets

Vladimir Gurvich, Endre Boros, Leonid Khachiyan, 2002, STACS.

Diagonal Matrix Scaling and Linear Programming

Leonid Khachiyan, Bahman Kalantari, L. Khachiyan, 1992, SIAM J. Optim..

On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2007, Theor. Comput. Sci..

Generating dual-bounded hypergraphs

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2002, Optim. Methods Softw..

An inequality for polymatroid functions and its applications

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2003, Discret. Appl. Math..

A New Algorithm for the Hypergraph Transversal Problem

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2005, COCOON.

Fourier-Motzkin Elimination Method

Leonid Khachiyan, 2009, Encyclopedia of Optimization.

An Intersection Inequality for Discrete Distributions and Related Generation Problems

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2003, ICALP.

Extending Dijkstra's Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction

Vladimir Gurvich, Leonid Khachiyan, Jihui Zhao, 2006, CSR.

On the Complexity of Approximating Extremal Determinants in Matrices

Leonid Khachiyan, L. Khachiyan, 1995, J. Complex..

An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2003, ESA.

Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2002, SIAM J. Comput..

On the Complexity of Some Enumeration Problems for Matroids

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2005, SIAM J. Discret. Math..

An exponential-function reduction method for block-angular convex programs

Leonid Khachiyan, Michael D. Grigoriadis, L. Khachiyan, 1995, Networks.

Integer Optimization on Convex Semialgebraic Sets

Leonid Khachiyan, Lorant Porkolab, L. Khachiyan, 2000, Discret. Comput. Geom..

Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2008, Discret. Appl. Math..

Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2004, LATIN.

Dual-bounded generating problems: weighted transversals of a hypergraph

Vladimir Gurvich, Endre Boros, Leonid Khachiyan, 2004, Discret. Appl. Math..

Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph

Vladimir Gurvich, Endre Boros, Leonid Khachiyan, 2001, SIAM J. Comput..

On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms

Leonid Khachiyan, Bahman Kalantari, L. Khachiyan, 1993, Oper. Res. Lett..

Algorithms for Enumerating Circuits in Matroids

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2003, ISAAC.

Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2003, Math. Program..

On the Complexity of Semidefinite Programs

Leonid Khachiyan, Lorant Porkolab, L. Khachiyan, 1997, J. Glob. Optim..

Generating Partial and Multiple Transversals of a Hypergraph

Vladimir Gurvich, Endre Boros, Leonid Khachiyan, 2000, ICALP.

A greedy heuristic for a minimum-weight forest problem

Leonid Khachiyan, Bahman Kalantari, Celina Imielinska, 1993, Oper. Res. Lett..

Approximate Max-Min Resource Sharing for Structured Concave Optimization

Leonid Khachiyan, Michael D. Grigoriadis, Lorant Porkolab, 2000, SIAM J. Optim..

An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2000, Parallel Process. Lett..

Enumerating Spanning and Connected Subsets in Graphs and Matroids

Vladimir Gurvich, Konrad Borys, Khaled M. Elbassioni, 2006, ESA.

On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction

Vladimir Gurvich, Konrad Borys, Gábor Rudolf, 2008, Theory of Computing Systems.

On the frequency of the most frequently occurring variable in dual monotone DNFs

Vladimir Gurvich, Leonid Khachiyan, 1997, Discret. Math..

Generating Cut Conjunctions in Graphs and Related Problems

Vladimir Gurvich, Konrad Borys, Khaled M. Elbassioni, 2007, Algorithmica.

Rounding of Polytopes in the Real Number Model of Computation

Leonid Khachiyan, L. Khachiyan, 1996, Math. Oper. Res..

Matroid Intersections, Polymatroid Inequalities, and Related Problems

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2002, MFCS.

Computing integral points in convex semi-algebraic sets

Leonid Khachiyan, Lorant Porkolab, L. Khachiyan, 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

Generating All Minimal Integral Solutions to Monotone and, or-Systems of Linear, Transversal and Polymatroid Inequalities

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2005, MFCS.

An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2006, Discret. Appl. Math..

Enumerating disjunctions and conjunctions of paths and cuts in reliability theory

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2007, Discret. Appl. Math..

Computing Many Maximal Independent Sets for Hypergraphs in Parallel

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2007, Parallel Process. Lett..

Generating All Vertices of a Polyhedron Is Hard

Vladimir Gurvich, Konrad Borys, Khaled M. Elbassioni, 2006, SODA '06.

On Generating the Irredundant Conjunctive and Disjunctive Normal Forms of Monotone Boolean Functions

Vladimir Gurvich, Leonid Khachiyan, L. Khachiyan, 1999, Discret. Appl. Math..

On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2001, ICALP.

in Graphs and Related Problems

Vladimir Gurvich, Konrad Borys, Endre Boros, 2007 .

Transversal Hypergraphs and Families of Polyhedral Cones

Leonid Khachiyan, 2001 .

Diagonal matrix scaling is NP-hard

Leonid Khachiyan, L. Khachiyan, 1996 .

Dual-Bounded Hypergraphs: A Survey∗

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2002 .

Enumerating Spanning and Connected Subsets in Graphs and Matroids

Vladimir Gurvich, Konrad Borys, Khaled M. Elbassioni, 2007 .

On the complexity of real and integer semidefinite programming

Leonid Khachiyan, Lorant Porkolab, 1997 .

Generating all vertices of a polyhedron is hard

Vladimir Gurvich, Konrad Borys, Khaled M. Elbassioni, 2006, SODA 2006.