Author pages are created from data sourced from our academic publisher partnerships and public sources.

Publications Influence

Share This Author

Cyclic games and an algorithm to find minimax cycle means in directed graphs

- V. Gurvich, A. Karzanov, L. G. Khachivan
- Mathematics
- 1 April 1990

Abstract An algorithm is described that finds optimal stationary strategies in dynamic two-person conflicts with perfect information, deterministic transitions, finite sets of positions, and… Expand

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

- V. Gurvich, L. Khachiyan
- Mathematics, Computer Science
- Discret. Appl. Math.
- 15 October 1999

TLDR

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

- L. Khachiyan, E. Boros, +4 authors Jihui Zhao
- Computer Science, Mathematics
- Theory of Computing Systems
- 7 April 2008

TLDR

Generating All Vertices of a Polyhedron Is Hard

- L. Khachiyan, E. Boros, K. Borys, Khaled M. Elbassioni, V. Gurvich
- Computer Science, Mathematics
- SODA '06
- 4 March 2008

TLDR

Perfect graphs are kernel solvable

- E. Boros, V. Gurvich
- Computer Science, Mathematics
- Discret. Math.
- 1 November 1996

TLDR

Dual subimplicants of positive Boolean functions

- E. Boros, V. Gurvich, P. Hammer
- Mathematics
- 1998

Given a positive Boolean function fand a subset δ of its variables, we give a combinatorial condition characterizing the existence of a prime implicant Dˆof the Boolean dual f d of f having the… Expand

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

- L. Khachiyan, E. Boros, Khaled M. Elbassioni, V. Gurvich
- Computer Science, Mathematics
- Discret. Appl. Math.
- 1 November 2006

TLDR

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

- E. Boros, Khaled M. Elbassioni, V. Gurvich, L. Khachiyan
- Computer Science, Mathematics
- Parallel Process. Lett.
- 1 December 2000

We show that for hypergraphs of bounded edge size, the problem of extending a given list of maximal independent sets is NC-reducible to the computation of an arbitrary maximal independent set for an… Expand

Stable matchings in three-sided systems with cyclic preferences

- E. Boros, V. Gurvich, S. Jaslar, Daniel Krasner
- Computer Science, Mathematics
- Discret. Math.
- 1 December 2004

TLDR

On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets

- E. Boros, V. Gurvich, L. Khachiyan, K. Makino
- Computer Science, Mathematics
- STACS
- 14 March 2002

TLDR

...

1

2

3

4

5

...