Leonid Khachiyan

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