Leonid Khachiyan
According to our database^{1},
Leonid Khachiyan
authored at least 61 papers
between 1990 and 2009.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on zbmath.org
On csauthors.net:
Bibliography
2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
2008
Theory Comput. Syst., 2008
Discret. Comput. Geom., 2008
Generating all minimal integral solutions to ANDOR systems of monotone inequalities: Conjunctions are simpler than disjunctions.
Discret. Appl. Math., 2008
Algorithmica, 2008
Algorithmica, 2008
2007
Dualbounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data.
Theor. Comput. Sci., 2007
On the dualization of hypergraphs with bounded edgeintersections and other related classes of hypergraphs.
Theor. Comput. Sci., 2007
Parallel Process. Lett., 2007
Inf. Process. Lett., 2007
Enumerating disjunctions and conjunctions of paths and cuts in reliability theory.
Discret. Appl. Math., 2007
2006
An efficient implementation of a quasipolynomial algorithm for generating hypergraph transversals and its application in joint generation.
Discret. Appl. Math., 2006
Proceedings of the Algorithms, 2006
Extending Dijkstra's Algorithm to Maximize the Shortest Path by NodeWise Limited Arc Interdiction.
Proceedings of the Computer Science, 2006
2005
SIAM J. Discret. Math., 2005
Generating All Minimal Integral Solutions to Monotone and, orSystems of Linear, Transversal and Polymatroid Inequalities.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005
2004
Discret. Appl. Math., 2004
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004
Generating Maximal Independent Sets for Hypergraphs with Bounded EdgeIntersections.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004
Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004
2003
Extending the BalasYu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices.
Math. Program., 2003
Discret. Appl. Math., 2003
Ann. Math. Artif. Intell., 2003
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003
An Intersection Inequality for Discrete Distributions and Related Generation Problems.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003
An Efficient Implementation of a Quasipolynomial Algorithm for Generating Hypergraph Transversals.
Proceedings of the Algorithms, 2003
2002
DualBounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities.
SIAM J. Comput., 2002
Optim. Methods Softw., 2002
Data Min. Knowl. Discov., 2002
Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002
2001
SIAM J. Optim., 2001
On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001
2000
DualBounded Generating Problems: Partial and Multiple Transversals of a Hypergraph.
SIAM J. Comput., 2000
An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension.
Parallel Process. Lett., 2000
Discret. Comput. Geom., 2000
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000
1999
J. Complex., 1999
On Generating the Irredundant Conjunctive and Disjunctive Normal Forms of Monotone Boolean Functions.
Discret. Appl. Math., 1999
1997
J. Glob. Optim., 1997
Discret. Math., 1997
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997
1996
SIAM J. Optim., 1996
Math. Program., 1996
Math. Oper. Res., 1996
Math. Oper. Res., 1996
J. Algorithms, 1996
1995
Oper. Res. Lett., 1995
Networks, 1995
J. Complex., 1995
1994
Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints.
SIAM J. Optim., 1994
1993
On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms.
Oper. Res. Lett., 1993
Oper. Res. Lett., 1993
On the complexity of approximating the maximal inscribed ellipsoid for a polytope.
Math. Program., 1993
1992
SIAM J. Optim., 1992
Proceedings of the Application Specific Array Processors, 1992
1991
Parallel Process. Lett., 1991
1990
Discret. Comput. Geom., 1990