Leonid Khachiyan

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

2008

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

[BibT_eX]

[DOI]

Theory Comput. Syst., 2008

Generating All Vertices of a Polyhedron Is Hard.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2008

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

On Enumerating Minimal Dicuts and Strongly Connected Subgraphs.

[BibT_eX]

[DOI]

Algorithmica, 2008

Generating Cut Conjunctions in Graphs and Related Problems.

[BibT_eX]

[DOI]

Algorithmica, 2008

2007

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Computing Many Maximal Independent Sets for Hypergraphs in Parallel.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2007

A global parallel algorithm for the hypergraph transversal problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

Enumerating disjunctions and conjunctions of paths and cuts in reliability theory.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

2006

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

Enumerating Spanning and Connected Subsets in Graphs and Matroids.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2006

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

[BibT_eX]

[DOI]

Vladimir Gurvich

Jihui Zhao

Proceedings of the Computer Science, 2006

2005

On the Complexity of Some Enumeration Problems for Matroids.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2005

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

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

A New Algorithm for the Hypergraph Transversal Problem.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

Dual-bounded generating problems: weighted transversals of a hypergraph.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

An Efficient Implementation of a Joint Generation Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

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

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2004

2003

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

[BibT_eX]

[DOI]

Math. Program., 2003

An inequality for polymatroid functions and its applications.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

On Maximal Frequent and Minimal Infrequent Sets in Binary Matrices.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2003

Algorithms for Enumerating Circuits in Matroids.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

An Intersection Inequality for Discrete Distributions and Related Generation Problems.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

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

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2003

2002

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

[BibT_eX]

[DOI]

SIAM J. Comput., 2002

Generating dual-bounded hypergraphs.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2002

Cubegrades: Generalizing Association Rules.

[BibT_eX]

[DOI]

Tomasz Imielinski

Amin Abdulghani

Data Min. Knowl. Discov., 2002

On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets.

[BibT_eX]

[DOI]

Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

Matroid Intersections, Polymatroid Inequalities, and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

2001

Approximate Max-Min Resource Sharing for Structured Concave Optimization.

[BibT_eX]

[DOI]

J. Villavicencio

SIAM J. Optim., 2001

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

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000

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

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

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

[BibT_eX]

[DOI]

Parallel Process. Lett., 2000

Integer Optimization on Convex Semialgebraic Sets.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2000

Generating Partial and Multiple Transversals of a Hypergraph.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999

Approximating Fixed Points of Weakly Contracting Mappings.

[BibT_eX]

[DOI]

Z. Huang

Christopher (Krzysztof) Sikorski

J. Complex., 1999

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

[BibT_eX]

[DOI]

Vladimir Gurvich

Discret. Appl. Math., 1999

1997

On the Complexity of Matrix Balancing.

[BibT_eX]

[DOI]

Ali Shokoufandeh

SIAM J. Matrix Anal. Appl., April, 1997

On the Complexity of Semidefinite Programs.

[BibT_eX]

[DOI]

J. Glob. Optim., 1997

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

[BibT_eX]

[DOI]

Vladimir Gurvich

Discret. Math., 1997

Computing Integral Points in Convex Semi-algebraic Sets.

[BibT_eX]

[DOI]

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1996

An Interior Point Method for Bordered Block-Diagonal Linear Programs.

[BibT_eX]

[DOI]

SIAM J. Optim., 1996

Approximate minimum-cost multicommodity flows in Õ(epsilon<sup>-2</sup>KNM) time.

[BibT_eX]

[DOI]

Math. Program., 1996

Rounding of Polytopes in the Real Number Model of Computation.

[BibT_eX]

[DOI]

Math. Oper. Res., 1996

Coordination Complexity of Parallel Price-Directive Decomposition.

[BibT_eX]

[DOI]

Math. Oper. Res., 1996

On the Complexity of Dualization of Monotone Disjunctive Normal Forms.

[BibT_eX]

[DOI]

Michael L. Fredman

J. Algorithms, 1996

1995

A sublinear-time randomized approximation algorithm for matrix games.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1995

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

[BibT_eX]

[DOI]

Networks, 1995

On the Complexity of Approximating Extremal Determinants in Matrices.

[BibT_eX]

[DOI]

J. Complex., 1995

1994

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

[BibT_eX]

[DOI]

SIAM J. Optim., 1994

1993

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

[BibT_eX]

[DOI]

Oper. Res. Lett., 1993

A greedy heuristic for a minimum-weight forest problem.

[BibT_eX]

[DOI]

Celina Imielinska

Oper. Res. Lett., 1993

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

[BibT_eX]

[DOI]

Michael J. Todd

Math. Program., 1993

1992

Diagonal Matrix Scaling and Linear Programming.

[BibT_eX]

[DOI]

SIAM J. Optim., 1992

Linear scheduling is close to optimality.

[BibT_eX]

[DOI]

Alain Darte

Yves Robert

Proceedings of the Application Specific Array Processors, 1992

1991

Linear Scheduling Is Nearly Optimal.

[BibT_eX]

[DOI]

Alain Darte

Yves Robert

Parallel Process. Lett., 1991

1990

An Inequality for the Volume of Inscribed Ellipsoids.

[BibT_eX]

[DOI]