Leonid Khachiyan

Publication Activity (10 Years)

Years Active: 1990-2008
Publications (10 Years): 0

Publications

Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Gábor Rudolf, Jihui Zhao
On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction. Theory Comput. Syst. 43 (2) (2008)
Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich
Generating All Vertices of a Polyhedron Is Hard. Discret. Comput. Geom. 39 (1-3) (2008)
Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions. Discret. Appl. Math. 156 (11) (2008)
Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
On Enumerating Minimal Dicuts and Strongly Connected Subgraphs. Algorithmica 50 (1) (2008)
Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
Generating Cut Conjunctions in Graphs and Related Problems. Algorithmica 51 (3) (2008)
Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
Enumerating disjunctions and conjunctions of paths and cuts in reliability theory. Discret. Appl. Math. 155 (2) (2007)
Leonid Khachiyan, Endre Boros, Vladimir Gurvich, Khaled M. Elbassioni
Computing Many Maximal Independent Sets for Hypergraphs in Parallel. Parallel Process. Lett. 17 (2) (2007)
Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs. Theor. Comput. Sci. 382 (2) (2007)
Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data. Theor. Comput. Sci. 379 (3) (2007)
Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
A global parallel algorithm for the hypergraph transversal problem. Inf. Process. Lett. 101 (4) (2007)
Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
Enumerating Spanning and Connected Subsets in Graphs and Matroids. ESA (2006)
Leonid Khachiyan, Vladimir Gurvich, Jihui Zhao
Extending Dijkstra's Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction. CSR (2006)
Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich
Generating all vertices of a polyhedron is hard. SODA (2006)
Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation. Discret. Appl. Math. 154 (16) (2006)
Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs. ISAAC (2005)
Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
A New Algorithm for the Hypergraph Transversal Problem. COCOON (2005)
Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
Generating All Minimal Integral Solutions to Monotone and, or-Systems of Linear, Transversal and Polymatroid Inequalities. MFCS (2005)
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems. IPCO (2004)
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
Generating Paths and Cuts in Multi-pole (Di)graphs. MFCS (2004)
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections. LATIN (2004)
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
An Efficient Implementation of a Joint Generation Algorithm. WEA (2004)
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
Dual-bounded generating problems: weighted transversals of a hypergraph. Discret. Appl. Math. 142 (1-3) (2004)
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
An Intersection Inequality for Discrete Distributions and Related Generation Problems. ICALP (2003)
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
An inequality for polymatroid functions and its applications. Discret. Appl. Math. 131 (2) (2003)
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
Algorithms for Enumerating Circuits in Matroids. ISAAC (2003)
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices. Math. Program. 98 (1-3) (2003)
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
On Maximal Frequent and Minimal Infrequent Sets in Binary Matrices. Ann. Math. Artif. Intell. 39 (3) (2003)
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals. ESA (2003)
Tomasz Imielinski, Leonid Khachiyan, Amin Abdulghani
Cubegrades: Generalizing Association Rules. Data Min. Knowl. Discov. 6 (3) (2002)
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
Generating dual-bounded hypergraphs. Optim. Methods Softw. 17 (5) (2002)
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
Matroid Intersections, Polymatroid Inequalities, and Related Problems. MFCS (2002)
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities. SIAM J. Comput. 31 (5) (2002)
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets. STACS (2002)
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities. ICALP (2001)
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
Generating Partial and Multiple Transversals of a Hypergraph. ICALP (2000)
Leonid Khachiyan, Lorant Porkolab
Integer Optimization on Convex Semialgebraic Sets. Discret. Comput. Geom. 23 (2) (2000)
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension. Parallel Process. Lett. 10 (4) (2000)
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph. SIAM J. Comput. 30 (6) (2000)
Vladimir Gurvich, Leonid Khachiyan
On Generating the Irredundant Conjunctive and Disjunctive Normal Forms of Monotone Boolean Functions. Discret. Appl. Math. (1999)
Lorant Porkolab, Leonid Khachiyan
On the Complexity of Semidefinite Programs. J. Glob. Optim. 10 (4) (1997)
Leonid Khachiyan, Lorant Porkolab
Computing Integral Points in Convex Semi-algebraic Sets. FOCS (1997)
Bahman Kalantari, Leonid Khachiyan, Ali Shokoufandeh
On the Complexity of Matrix Balancing. SIAM J. Matrix Anal. Appl. 18 (2) (1997)
Vladimir Gurvich, Leonid Khachiyan
On the frequency of the most frequently occurring variable in dual monotone DNFs. Discret. Math. 169 (1-3) (1997)
Michael L. Fredman, Leonid Khachiyan
On the Complexity of Dualization of Monotone Disjunctive Normal Forms. J. Algorithms 21 (3) (1996)
Leonid Khachiyan
On the Complexity of Approximating Extremal Determinants in Matrices. J. Complex. 11 (1) (1995)
Bahman Kalantari, Leonid Khachiyan
On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms. Oper. Res. Lett. 14 (5) (1993)
Leonid Khachiyan, Michael J. Todd
On the complexity of approximating the maximal inscribed ellipsoid for a polytope. Math. Program. 61 (1993)
Celina Imielinska, Bahman Kalantari, Leonid Khachiyan
A greedy heuristic for a minimum-weight forest problem. Oper. Res. Lett. 14 (2) (1993)
Alain Darte, Leonid Khachiyan, Yves Robert
Linear scheduling is close to optimality. ASAP (1992)
Leonid Khachiyan, Bahman Kalantari
Diagonal Matrix Scaling and Linear Programming. SIAM J. Optim. 2 (4) (1992)
Alain Darte, Leonid Khachiyan, Yves Robert
Linear Scheduling Is Nearly Optimal. Parallel Process. Lett. 1 (1991)
Leonid Khachiyan
An Inequality for the Volume of Inscribed Ellipsoids. Discret. Comput. Geom. 5 (1990)