Leonid Khachiyan

Leonid G. Khachiyan

	2009
r1		Leonid Khachiyan: Fourier-Motzkin Elimination Method. Encyclopedia of Optimization 2009: 1074-1077
	2008
j32		Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich: On Enumerating Minimal Dicuts and Strongly Connected Subgraphs. Algorithmica 50(1): 159-172 (2008)
j31		Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino: Generating Cut Conjunctions in Graphs and Related Problems. Algorithmica 51(3): 239-263 (2008)
j30		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. Discrete Applied Mathematics 156(11): 2020-2034 (2008)
j29		Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich: Generating All Vertices of a Polyhedron Is Hard. Discrete & Computational Geometry 39(1-3): 174-190 (2008)
j28		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): 204-233 (2008)
	2007
j27		Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino: Enumerating disjunctions and conjunctions of paths and cuts in reliability theory. Discrete Applied Mathematics 155(2): 137-149 (2007)
j26		Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich: A global parallel algorithm for the hypergraph transversal problem. Inf. Process. Lett. 101(4): 148-155 (2007)
j25		Leonid Khachiyan, Endre Boros, Vladimir Gurvich, Khaled M. Elbassioni: Computing Many Maximal Independent Sets for Hypergraphs in Parallel. Parallel Processing Letters 17(2): 141-152 (2007)
j24		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): 361-376 (2007)
j23		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): 139-150 (2007)
	2006
j22		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. Discrete Applied Mathematics 154(16): 2350-2372 (2006)
c18		Leonid Khachiyan, Vladimir Gurvich, Jihui Zhao: Extending Dijkstra's Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction. CSR 2006: 221-234
c17		Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino: Enumerating Spanning and Connected Subsets in Graphs and Matroids. ESA 2006: 444-455
c16		Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich: Generating all vertices of a polyhedron is hard. SODA 2006: 758-765
	2005
j21		Leonid G. Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino: On the Complexity of Some Enumeration Problems for Matroids. SIAM J. Discrete Math. 19(4): 966-984 (2005)
c15		Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich: A New Algorithm for the Hypergraph Transversal Problem. COCOON 2005: 767-776
c14		Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino: Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs. ISAAC 2005: 156-165
c13		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: 556-567
	2004
j20		Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino: Dual-bounded generating problems: weighted transversals of a hypergraph. Discrete Applied Mathematics 142(1-3): 1-15 (2004)
c12		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems. IPCO 2004: 152-162
c11		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections. LATIN 2004: 488-498
c10		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino: Generating Paths and Cuts in Multi-pole (Di)graphs. MFCS 2004: 298-309
c9		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: An Efficient Implementation of a Joint Generation Algorithm. WEA 2004: 114-128
	2003
j19		Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino: On Maximal Frequent and Minimal Infrequent Sets in Binary Matrices. Ann. Math. Artif. Intell. 39(3): 211-221 (2003)
j18		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: An inequality for polymatroid functions and its applications. Discrete Applied Mathematics 131(2): 255-281 (2003)
j17		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): 355-368 (2003)
c8		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals. ESA 2003: 556-567
c7		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino: An Intersection Inequality for Discrete Distributions and Related Generation Problems. ICALP 2003: 543-555
c6		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: Algorithms for Enumerating Circuits in Matroids. ISAAC 2003: 485-494
	2002
j16		Tomasz Imielinski, Leonid Khachiyan, Amin Abdulghani: Cubegrades: Generalizing Association Rules. Data Min. Knowl. Discov. 6(3): 219-257 (2002)
j15		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): 1624-1643 (2002)
c5		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: Matroid Intersections, Polymatroid Inequalities, and Related Problems. MFCS 2002: 143-154
c4		Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino: On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets. STACS 2002: 133-141
	2001
j14		Michael D. Grigoriadis, Leonid G. Khachiyan, Lorant Porkolab, J. Villavicencio: Approximate Max-Min Resource Sharing for Structured Concave Optimization. SIAM Journal on Optimization 11(4): 1081-1091 (2001)
c3		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: 92-103
	2000
j13		Leonid Khachiyan, Lorant Porkolab: Integer Optimization on Convex Semialgebraic Sets. Discrete & Computational Geometry 23(2): 207-224 (2000)
j12		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 Processing Letters 10(4): 253-266 (2000)
j11		Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino: Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph. SIAM J. Comput. 30(6): 2036-2050 (2000)
c2		Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino: Generating Partial and Multiple Transversals of a Hypergraph. ICALP 2000: 588-599
	1999
j10		Vladimir Gurvich, Leonid Khachiyan: On Generating the Irredundant Conjunctive and Disjunctive Normal Forms of Monotone Boolean Functions. Discrete Applied Mathematics 96-97: 363-373 (1999)
j9		Z. Huang, Leonid G. Khachiyan, Christopher (Krzysztof) Sikorski: Approximating Fixed Points of Weakly Contracting Mappings. J. Complexity 15(2): 200-213 (1999)
	1997
j8		Vladimir Gurvich, Leonid Khachiyan: On the frequency of the most frequently occurring variable in dual monotone DNFs. Discrete Mathematics 169(1-3): 245-248 (1997)
c1		Leonid Khachiyan, Lorant Porkolab: Computing Integral Points in Convex Semi-algebraic Sets. FOCS 1997: 162-171
	1996
j7		Michael L. Fredman, Leonid Khachiyan: On the Complexity of Dualization of Monotone Disjunctive Normal Forms. J. Algorithms 21(3): 618-628 (1996)
j6		Michael D. Grigoriadis, Leonid G. Khachiyan: Approximate minimum-cost multicommodity flows in Õ(epsilon-2KNM) time. Math. Program. 75: 477-482 (1996)
	1995
j5		Leonid Khachiyan: On the Complexity of Approximating Extremal Determinants in Matrices. J. Complexity 11(1): 138-153 (1995)
j4		Michael D. Grigoriadis, Leonid G. Khachiyan: An exponential-function reduction method for block-angular convex programs. Networks 26(2): 59-68 (1995)
	1993
j3		Leonid Khachiyan, Michael J. Todd: On the complexity of approximating the maximal inscribed ellipsoid for a polytope. Math. Program. 61: 137-159 (1993)
	1991
j2		Alain Darte, Leonid Khachiyan, Yves Robert: Linear Scheduling Is Nearly Optimal. Parallel Processing Letters 1: 73-81 (1991)
	1990
j1		Leonid Khachiyan: An Inequality for the Volume of Inscribed Ellipsoids. Discrete & Computational Geometry 5: 219-222 (1990)

Coauthor Index

Colors in the list of coauthors

Last update Sun May 26 10:13:01 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page