dblp.uni-trier.dewww.uni-trier.de

Leonid Khachiyan

Leonid G. Khachiyan

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2009
48EELeonid Khachiyan: Fourier-Motzkin Elimination Method. Encyclopedia of Optimization 2009: 1074-1077
2008
47EELeonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich: On Enumerating Minimal Dicuts and Strongly Connected Subgraphs. Algorithmica 50(1): 159-172 (2008)
46EELeonid 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)
45EELeonid 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)
44EELeonid 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)
43EELeonid 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
42EELeonid 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)
41EELeonid 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)
40EELeonid 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)
39EELeonid 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)
38EELeonid 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
37EELeonid Khachiyan, Vladimir Gurvich, Jihui Zhao: Extending Dijkstra's Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction. CSR 2006: 221-234
36EELeonid 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
35EELeonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich: Generating all vertices of a polyhedron is hard. SODA 2006: 758-765
34EELeonid 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)
2005
33EELeonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich: A New Algorithm for the Hypergraph Transversal Problem. COCOON 2005: 767-776
32EELeonid 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
31EELeonid 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
30EELeonid 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)
2004
29EEEndre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems. IPCO 2004: 152-162
28EEEndre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections. LATIN 2004: 488-498
27EEEndre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino: Generating Paths and Cuts in Multi-pole (Di)graphs. MFCS 2004: 298-309
26EEEndre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: An Efficient Implementation of a Joint Generation Algorithm. WEA 2004: 114-128
25EEEndre 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)
2003
24EEEndre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals. ESA 2003: 556-567
23EEEndre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino: An Intersection Inequality for Discrete Distributions and Related Generation Problems. ICALP 2003: 543-555
22EEEndre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: Algorithms for Enumerating Circuits in Matroids. ISAAC 2003: 485-494
21 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)
20EEEndre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: An inequality for polymatroid functions and its applications. Discrete Applied Mathematics 131(2): 255-281 (2003)
2002
19EEEndre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: Matroid Intersections, Polymatroid Inequalities, and Related Problems. MFCS 2002: 143-154
18EEEndre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino: On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets. STACS 2002: 133-141
17 Tomasz Imielinski, Leonid Khachiyan, Amin Abdulghani: Cubegrades: Generalizing Association Rules. Data Min. Knowl. Discov. 6(3): 219-257 (2002)
16EEEndre 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)
2001
15EEEndre 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
14EEEndre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino: Generating Partial and Multiple Transversals of a Hypergraph. ICALP 2000: 588-599
13EELeonid Khachiyan, Lorant Porkolab: Integer Optimization on Convex Semialgebraic Sets. Discrete & Computational Geometry 23(2): 207-224 (2000)
12 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)
11EEEndre 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)
1999
10EEVladimir Gurvich, Leonid Khachiyan: On Generating the Irredundant Conjunctive and Disjunctive Normal Forms of Monotone Boolean Functions. Discrete Applied Mathematics 96-97: 363-373 (1999)
9EEZ. Huang, Leonid G. Khachiyan, Christopher (Krzysztof) Sikorski: Approximating Fixed Points of Weakly Contracting Mappings. J. Complexity 15(2): 200-213 (1999)
1997
8EELeonid Khachiyan, Lorant Porkolab: Computing Integral Points in Convex Semi-algebraic Sets. FOCS 1997: 162-171
7EEVladimir Gurvich, Leonid Khachiyan: On the frequency of the most frequently occurring variable in dual monotone DNFs. Discrete Mathematics 169(1-3): 245-248 (1997)
1996
6 Michael L. Fredman, Leonid Khachiyan: On the Complexity of Dualization of Monotone Disjunctive Normal Forms. J. Algorithms 21(3): 618-628 (1996)
5 Michael D. Grigoriadis, Leonid G. Khachiyan: Approximate minimum-cost multicommodity flows in Õ(epsilon-2KNM) time. Math. Program. 75: 477-482 (1996)
1995
4EELeonid Khachiyan: On the Complexity of Approximating Extremal Determinants in Matrices. J. Complexity 11(1): 138-153 (1995)
1993
3 Leonid Khachiyan, Michael J. Todd: On the complexity of approximating the maximal inscribed ellipsoid for a polytope. Math. Program. 61: 137-159 (1993)
1991
2 Alain Darte, Leonid Khachiyan, Yves Robert: Linear Scheduling Is Nearly Optimal. Parallel Processing Letters 1: 73-81 (1991)
1990
1 Leonid Khachiyan: An Inequality for the Volume of Inscribed Ellipsoids. Discrete & Computational Geometry 5: 219-222 (1990)

Coauthor Index

1Amin Abdulghani [17]
2Endre Boros [11] [12] [14] [15] [16] [18] [19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [31] [32] [33] [34] [35] [36] [38] [39] [40] [41] [42] [43] [44] [45] [46] [47]
3Konrad Borys [32] [35] [36] [43] [45] [46]
4Alain Darte [2]
5Khaled M. Elbassioni [12] [15] [16] [19] [20] [22] [23] [24] [26] [27] [28] [29] [30] [31] [32] [33] [34] [35] [36] [38] [39] [40] [41] [42] [43] [44] [45] [46] [47]
6Michael L. Fredman [6]
7Michael D. Grigoriadis [5]
8Vladimir Gurvich [7] [10] [11] [12] [14] [15] [16] [18] [19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [31] [32] [33] [34] [35] [36] [37] [38] [39] [40] [41] [42] [43] [44] [45] [46] [47]
9Z. Huang [9]
10Tomasz Imielinski [17]
11Kazuhisa Makino [11] [14] [15] [16] [18] [21] [23] [25] [27] [30] [32] [36] [39] [42] [46]
12Lorant Porkolab [8] [13]
13Yves Robert [2]
14Gábor Rudolf [43]
15Christopher A. Sikorski (Christopher (Krzysztof) Sikorski, Krzysztof A. Sikorski) [9]
16Michael J. Todd [3]
17Jihui Zhao [37] [43]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)