Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLeonid Khachiyan
Person information
- affiliation: Rutgers University, USA
- award (1982): Fulkerson Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2008
[j43]Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni
, Vladimir Gurvich:
On Enumerating Minimal Dicuts and Strongly Connected Subgraphs. Algorithmica 50(1): 159-172 (2008)- [j42]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) - [j41]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. Discret. Appl. Math. 156(11): 2020-2034 (2008) - [j40]Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich:
Generating All Vertices of a Polyhedron Is Hard. Discret. Comput. Geom. 39(1-3): 174-190 (2008) - [j39]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
- [j38]Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
Enumerating disjunctions and conjunctions of paths and cuts in reliability theory. Discret. Appl. Math. 155(2): 137-149 (2007) - [j37]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) - [j36]Leonid Khachiyan, Endre Boros, Vladimir Gurvich, Khaled M. Elbassioni:
Computing Many Maximal Independent Sets for Hypergraphs in Parallel. Parallel Process. Lett. 17(2): 141-152 (2007) - [j35]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) - [j34]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
- [j33]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. Discret. Appl. Math. 154(16): 2350-2372 (2006) - 2005
- [j32]Leonid G. Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
On the Complexity of Some Enumeration Problems for Matroids. SIAM J. Discret. Math. 19(4): 966-984 (2005) - 2004
- [j31]Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino:
Dual-bounded generating problems: weighted transversals of a hypergraph. Discret. Appl. Math. 142(1-3): 1-15 (2004) - 2003
- [j30]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) - [j29]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan:
An inequality for polymatroid functions and its applications. Discret. Appl. Math. 131(2): 255-281 (2003) - [j28]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) - 2002
- [j27]Tomasz Imielinski, Leonid Khachiyan, Amin Abdulghani:
Cubegrades: Generalizing Association Rules. Data Min. Knowl. Discov. 6(3): 219-257 (2002) - [j26]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan:
Generating dual-bounded hypergraphs. Optim. Methods Softw. 17(5): 749-781 (2002) - [j25]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) - 2001
- [j24]Michael D. Grigoriadis, Leonid G. Khachiyan, Lorant Porkolab, J. Villavicencio:
Approximate Max-Min Resource Sharing for Structured Concave Optimization. SIAM J. Optim. 11(4): 1081-1091 (2001) - 2000
- [j23]Leonid Khachiyan, Lorant Porkolab:
Integer Optimization on Convex Semialgebraic Sets. Discret. Comput. Geom. 23(2): 207-224 (2000) - [j22]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 Process. Lett. 10(4): 253-266 (2000) - [j21]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) - 1999
- [j20]Vladimir Gurvich, Leonid Khachiyan:
On Generating the Irredundant Conjunctive and Disjunctive Normal Forms of Monotone Boolean Functions. Discret. Appl. Math. 96-97: 363-373 (1999) - [j19]Z. Huang, Leonid G. Khachiyan, Christopher (Krzysztof) Sikorski:
Approximating Fixed Points of Weakly Contracting Mappings. J. Complex. 15(2): 200-213 (1999) - 1997
- [j18]Vladimir Gurvich, Leonid Khachiyan:
On the frequency of the most frequently occurring variable in dual monotone DNFs. Discret. Math. 169(1-3): 245-248 (1997) - [j17]Lorant Porkolab, Leonid Khachiyan:
On the Complexity of Semidefinite Programs. J. Glob. Optim. 10(4): 351-365 (1997) - [j16]Bahman Kalantari, Leonid Khachiyan, Ali Shokoufandeh:
On the Complexity of Matrix Balancing. SIAM J. Matrix Anal. Appl. 18(2): 450-463 (1997) - 1996
- [j15]Michael L. Fredman, Leonid Khachiyan:
On the Complexity of Dualization of Monotone Disjunctive Normal Forms. J. Algorithms 21(3): 618-628 (1996) - [j14]Leonid G. Khachiyan:
Rounding of Polytopes in the Real Number Model of Computation. Math. Oper. Res. 21(2): 307-320 (1996) - [j13]Michael D. Grigoriadis, Leonid G. Khachiyan:
Coordination Complexity of Parallel Price-Directive Decomposition. Math. Oper. Res. 21(2): 321-340 (1996) - [j12]Michael D. Grigoriadis, Leonid G. Khachiyan:
Approximate minimum-cost multicommodity flows in Õ(epsilon-2KNM) time. Math. Program. 75: 477-482 (1996) - [j11]Michael D. Grigoriadis, Leonid G. Khachiyan:
An Interior Point Method for Bordered Block-Diagonal Linear Programs. SIAM J. Optim. 6(4): 913-932 (1996) - 1995
- [j10]Leonid Khachiyan:
On the Complexity of Approximating Extremal Determinants in Matrices. J. Complex. 11(1): 138-153 (1995) - [j9]Michael D. Grigoriadis, Leonid G. Khachiyan:
An exponential-function reduction method for block-angular convex programs. Networks 26(2): 59-68 (1995) - [j8]Michael D. Grigoriadis, Leonid G. Khachiyan:
A sublinear-time randomized approximation algorithm for matrix games. Oper. Res. Lett. 18(2): 53-58 (1995) - 1994
- [j7]Michael D. Grigoriadis, Leonid G. Khachiyan:
Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints. SIAM J. Optim. 4(1): 86-107 (1994) - 1993
- [j6]Leonid Khachiyan, Michael J. Todd:
On the complexity of approximating the maximal inscribed ellipsoid for a polytope. Math. Program. 61: 137-159 (1993) - [j5]Celina Imielinska, Bahman Kalantari, Leonid Khachiyan:
A greedy heuristic for a minimum-weight forest problem. Oper. Res. Lett. 14(2): 65-71 (1993) - [j4]Bahman Kalantari, Leonid Khachiyan:
On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms. Oper. Res. Lett. 14(5): 237-244 (1993) - 1992
- [j3]Leonid Khachiyan, Bahman Kalantari:
Diagonal Matrix Scaling and Linear Programming. SIAM J. Optim. 2(4): 668-672 (1992) - 1991
- [j2]Alain Darte, Leonid Khachiyan, Yves Robert:
Linear Scheduling Is Nearly Optimal. Parallel Process. Lett. 1: 73-81 (1991) - 1990
- [j1]Leonid Khachiyan:
An Inequality for the Volume of Inscribed Ellipsoids. Discret. Comput. Geom. 5: 219-222 (1990)
Conference and Workshop Papers
- 2006
- [c19]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 - [c18]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 - [c17]Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich:
Generating all vertices of a polyhedron is hard. SODA 2006: 758-765 - 2005
- [c16]Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich:
A New Algorithm for the Hypergraph Transversal Problem. COCOON 2005: 767-776 - [c15]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 - [c14]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
- [c13]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan:
Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems. IPCO 2004: 152-162 - [c12]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan:
Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections. LATIN 2004: 488-498 - [c11]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino:
Generating Paths and Cuts in Multi-pole (Di)graphs. MFCS 2004: 298-309 - [c10]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan:
An Efficient Implementation of a Joint Generation Algorithm. WEA 2004: 114-128 - 2003
- [c9]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 - [c8]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 - [c7]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan:
Algorithms for Enumerating Circuits in Matroids. ISAAC 2003: 485-494 - 2002
- [c6]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan:
Matroid Intersections, Polymatroid Inequalities, and Related Problems. MFCS 2002: 143-154 - [c5]Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino:
On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets. STACS 2002: 133-141 - 2001
- [c4]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
- [c3]Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino:
Generating Partial and Multiple Transversals of a Hypergraph. ICALP 2000: 588-599 - 1997
- [c2]Leonid Khachiyan, Lorant Porkolab:
Computing Integral Points in Convex Semi-algebraic Sets. FOCS 1997: 162-171 - 1992
- [c1]Alain Darte, Leonid Khachiyan, Yves Robert:
Linear scheduling is close to optimality. ASAP 1992: 37-46
Reference Works
- 2009
- [r1]Leonid Khachiyan:
Fourier-Motzkin Elimination Method. Encyclopedia of Optimization 2009: 1074-1077
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 02:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
