Leonid Khachiyan
Affiliations: | Rutgers University, New Brunswick, New Brunswick, NJ, United States |
Area:
Computer ScienceGoogle:
"Leonid Khachiyan"
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Khachiyan L, Boros E, Elbassioni K, et al. (2008) Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions Discrete Applied Mathematics. 156: 2020-2034 |
Khachiyan L, Boros E, Borys K, et al. (2008) Generating cut conjunctions in graphs and related problems Algorithmica (New York). 51: 239-263 |
Khachiyan L, Boros E, Elbassioni K, et al. (2008) On enumerating minimal dicuts and strongly connected subgraphs Algorithmica (New York). 50: 159-172 |
Khachiyan L, Boros E, Borys K, et al. (2008) On short paths interdiction problems: Total and node-wise limited interdiction Theory of Computing Systems. 43: 204-233 |
Khachiyan L, Boros E, Borys K, et al. (2007) ENUMERATING SPANNING AND CONNECTED SUBSETS IN GRAPHS AND MATROIDS( |
Khachiyan L, Boros E, Gurvich V, et al. (2007) Computing many maximal independent sets for hypergraphs in parallel Parallel Processing Letters. 17: 141-152 |
Khachiyan L, Boros E, Elbassioni K, et al. (2007) On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs Theoretical Computer Science. 382: 139-150 |
Khachiyan L, Boros E, Elbassioni K, et al. (2007) Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data Theoretical Computer Science. 379: 361-376 |
Khachiyan L, Boros E, Elbassioni K, et al. (2007) A global parallel algorithm for the hypergraph transversal problem Information Processing Letters. 101: 148-155 |
Khachiyan L, Boros E, Elbassioni K, et al. (2007) Enumerating disjunctions and conjunctions of paths and cuts in reliability theory Discrete Applied Mathematics. 155: 137-149 |