The following pages link to Vladimir A. Gurvich (Q923675):
Displaying 50 items.
- (Q344828) (redirect page) (← links)
- On equistable, split, CIS, and related classes of graphs (Q344829) (← links)
- On canonical forms for zero-sum stochastic mean payoff games (Q367425) (← links)
- A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron-Frobenius theory (Q378342) (← links)
- On CIS circulants (Q394314) (← links)
- Total tightness implies Nash-solvability for three-person game forms (Q408181) (← links)
- On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games (Q409428) (← links)
- Further generalizations of the Wythoff game and the minimum excludant (Q423891) (← links)
- Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs (Q444440) (← links)
- Chess-like games may have no uniform Nash equilibria even in mixed strategies (Q457857) (← links)
- A nested family of \(k\)-total effective rewards for positional games (Q521891) (← links)
- Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden \(2 \times 2\) subgames (Q524983) (← links)
- Friendship two-graphs (Q604993) (← links)
- On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems (Q628313) (← links)
- Nash-solvable two-person symmetric cycle game forms (Q642972) (← links)
- The negative cycles polyhedron and hardness of checking some polyhedral properties (Q646701) (← links)
- On acyclicity of games with cycles (Q708338) (← links)
- Quasilinear set functions and absolute definite matrices (Q750324) (← links)
- A global parallel algorithm for the hypergraph transversal problem (Q845919) (← links)
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation (Q860396) (← links)
- Enumerating disjunctions and conjunctions of paths and cuts in reliability theory (Q867855) (← links)
- On the misere version of game Euclid and miserable games (Q870986) (← links)
- Absolutely determined matrices (Q923677) (← links)
- On short paths interdiction problems: Total and node-wise limited interdiction (Q929289) (← links)
- Generating cut conjunctions in graphs and related problems (Q930604) (← links)
- Recalling Leo (Q943830) (← links)
- Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions (Q943838) (← links)
- Scientific contributions of Leo Khachiyan (a short overview) (Q944704) (← links)
- Acyclic, or totally tight, two-person game forms: characterization and main properties (Q966009) (← links)
- Not complementary connected and not CIS \(d\)-graphs form weakly monotone families (Q966046) (← links)
- Neighborhood hypergraphs of digraphs and some matrix permutation problems (Q967325) (← links)
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited (Q967361) (← links)
- Generating 3-vertex connected spanning subgraphs (Q998366) (← links)
- Vertex- and edge-minimal and locally minimal graphs (Q1043552) (← links)
- Minimal and locally minimal games and game forms (Q1043974) (← links)
- Perfect graphs are kernel solvable (Q1126176) (← links)
- Coalitional equilibrium situations in metagames (Q1152312) (← links)
- (Q1277474) (redirect page) (← links)
- Stable families of coalitions and normal hypergraphs (Q1277475) (← links)
- On the frequency of the most frequently occurring variable in dual monotone DNFs (Q1357747) (← links)
- Extremal sequences with forbidden sums (Q1363994) (← links)
- A corrected version of the Duchet kernel conjecture (Q1377724) (← links)
- A circular graph---counterexample to the Duchet kernel conjecture (Q1377838) (← links)
- On maximal frequent and minimal infrequent sets in binary matrices (Q1404408) (← links)
- An inequality for polymatroid functions and its applications. (Q1410680) (← links)
- On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles. (Q1414826) (← links)
- Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices (Q1424303) (← links)
- (Q1595502) (redirect page) (← links)
- Dual cores and effectivity functions (Q1595503) (← links)
- Criteria of nonemptiness of dual cores (Q1595509) (← links)
