Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVladimir Gurvich
Vladimir A. Gurvich
Person information
- affiliation: National Research University, Higher School of Economics (HSE), Moscow, Russia
- affiliation: Rutgers University, Rutgers Center for Operations Research (RUTCOR), NJ, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2024
[j99]Vladimir Gurvich, Mariya Naumova
:
Lexicographically maximal edges of dual hypergraphs and Nash-solvability of tight game forms. Ann. Math. Artif. Intell. 92(1): 49-57 (2024)- [j98]Vladimir Gurvich, Mariya Naumova:
On Nash-solvability of n-person graphical games under Markov and a-priori realizations. Ann. Oper. Res. 336(3): 1905-1927 (2024) - [j97]Endre Boros, Ondrej Cepek, Vladimir Gurvich, Kazuhisa Makino:
Recognizing distributed approval voting forms and correspondences. Ann. Oper. Res. 336(3): 2091-2110 (2024) - 2023
- [j96]Vladimir Gurvich, Mariya Naumova:
Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles. Discret. Appl. Math. 340: 53-68 (2023) - 2022
- [j95]Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanic, Mary Servatius:
Avoidable vertices and edges in graphs: Existence, characterization, and applications. Discret. Appl. Math. 309: 285-300 (2022) - [j94]Vladimir Gurvich:
Metric and ultrametric inequalities for directed graphs. Discret. Appl. Math. 314: 93-104 (2022) - [j93]Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi:
Shifting paths to avoidable ones. J. Graph Theory 100(1): 69-83 (2022) - 2021
- [j92]Vladimir Gurvich, Mikhail N. Vyalyi:
On Computational Hardness of Multidimensional Subtraction Games. Algorithms 14(3): 71 (2021) - [j91]Vladimir Gurvich:
Balanced flows for transshipment problems. Discret. Appl. Math. 305: 214-220 (2021) - [j90]Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino:
On the Sprague-Grundy function of extensions of proper Nim. Int. J. Game Theory 50(3): 635-654 (2021) - [j89]Vladimir Gurvich, Mariya Naumova:
Logical Contradictions in the One-Way ANOVA and Tukey-Kramer Multiple Comparisons Tests with More Than Two Groups of Observations. Symmetry 13(8): 1387 (2021) - 2020
- [j88]Endre Boros, Vladimir Gurvich, Martin Milanic:
Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs. J. Graph Theory 94(3): 364-397 (2020) - 2019
- [j87]Endre Boros, Vladimir Gurvich, Martin Milanic:
Decomposing 1-Sperner Hypergraphs. Electron. J. Comb. 26(3): 3 (2019) - [j86]Endre Boros, Ondrej Cepek, Vladimir Gurvich:
Separable discrete functions: Recognition and sufficient conditions. Discret. Math. 342(5): 1275-1292 (2019) - [j85]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions. Inf. Comput. 267: 74-95 (2019) - [j84]Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino, Peter Mursic:
Sprague-Grundy function of symmetric hypergraphs. J. Comb. Theory, Ser. A 165: 176-186 (2019) - [j83]Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino, Peter Mursic:
Sprague-Grundy function of matroids and related hypergraphs. Theor. Comput. Sci. 799: 40-58 (2019) - 2018
- [j82]Endre Boros, Khaled M. Elbassioni, Mahmoud Fouz, Vladimir Gurvich, Kazuhisa Makino, Bodo Manthey:
Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions. Algorithmica 80(11): 3132-3157 (2018) - [j81]Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino, Peter Mursic:
On the Sprague-Grundyfunction of Exact k-Nim. Discret. Appl. Math. 239: 1-14 (2018) - [j80]Endre Boros, Vladimir Gurvich, Martin Milanic, Vladimir Oudalov, Jernej Vicic:
A three-person deterministic graphical game without Nash equilibria. Discret. Appl. Math. 243: 21-38 (2018) - [j79]Vladimir Gurvich, Nhan Bao Ho:
On tame, pet, domestic, and miserable impartial games. Discret. Appl. Math. 243: 54-72 (2018) - [j78]Vladimir Gurvich, Gleb A. Koshevoy:
Monotone bargaining is Nash-solvable. Discret. Appl. Math. 250: 1-15 (2018) - [j77]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A Potential Reduction Algorithm for Two-Person Zero-Sum Mean Payoff Stochastic Games. Dyn. Games Appl. 8(1): 22-41 (2018) - [j76]Vladimir Gurvich:
Backward induction in presence of cycles. J. Log. Comput. 28(7): 1635-1646 (2018) - 2017
- [j75]Endre Boros, Vladimir Gurvich, Martin Milanic:
On equistable, split, CIS, and related classes of graphs. Discret. Appl. Math. 216: 47-66 (2017) - [j74]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A nested family of \(\varvec{k}\) -total effective rewards for positional games. Int. J. Game Theory 46(1): 263-293 (2017) - [j73]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A convex programming-based algorithm for mean payoff stochastic games with perfect information. Optim. Lett. 11(8): 1499-1512 (2017) - 2016
- [j72]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Vladimir Oudalov:
Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden \(2 \times 2\) subgames. Int. J. Game Theory 45(4): 1111-1131 (2016) - 2015
- [j71]Endre Boros, Vladimir Gurvich:
Sandwich problem for Π- and Δ-free multigraphs and its applications to positional games. Discret. Math. 338(12): 2421-2436 (2015) - 2014
- [j70]Vladimir Gurvich, Vladimir Oudalov:
On Nash-solvability in pure stationary strategies of the deterministic n-person games with perfect information and mean or total effective cost. Discret. Appl. Math. 167: 131-143 (2014) - [j69]Endre Boros, Vladimir Gurvich, Martin Milanic:
On CIS circulants. Discret. Math. 318: 78-95 (2014) - [j68]Andrey Gol'berg, Vladimir Gurvich, Diogo Vieira Andrade, Konrad Borys, Gábor Rudolf:
Combinatorial games modeling seki in GO. Discret. Math. 329: 19-32 (2014) - 2013
- [j67]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
On Canonical Forms for Zero-Sum Stochastic Mean Payoff Games. Dyn. Games Appl. 3(2): 128-161 (2013) - [j66]Endre Boros, Vladimir Gurvich, Vladimir Oudalov:
A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron-Frobenius theory. Int. J. Game Theory 42(4): 891-915 (2013) - [j65]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness. Oper. Res. Lett. 41(4): 357-362 (2013) - 2012
- [j64]Vladimir Gurvich:
Further generalizations of the Wythoff game and the minimum excludant. Discret. Appl. Math. 160(7-8): 941-947 (2012) - [j63]Vladimir Gurvich, Mikhail N. Vyalyi:
Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs. Discret. Appl. Math. 160(12): 1742-1756 (2012) - [j62]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games. Discret. Math. 312(4): 772-788 (2012) - [j61]Endre Boros, Ondrej Cepek, Vladimir Gurvich:
Total tightness implies Nash-solvability for three-person game forms. Discret. Math. 312(8): 1436-1443 (2012) - 2011
- [j60]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Hans Raj Tiwary:
The negative cycles polyhedron and hardness of checking some polyhedral properties. Ann. Oper. Res. 188(1): 63-76 (2011) - [j59]Vladimir Gurvich:
On exact blockers and anti-blockers, Δ-conjecture, and related problems. Discret. Appl. Math. 159(5): 311-321 (2011) - [j58]Endre Boros, Vladimir Gurvich, Kazuhisa Makino, Wei Shao:
Nash-solvable two-person symmetric cycle game forms. Discret. Appl. Math. 159(15): 1461-1487 (2011) - 2010
- [j57]Daniel Andersson, Vladimir Gurvich, Thomas Dueholm Hansen:
On acyclicity of games with cycles. Discret. Appl. Math. 158(10): 1049-1063 (2010) - [j56]Vladimir Gurvich:
Metric and ultrametric spaces of resistances. Discret. Appl. Math. 158(14): 1496-1505 (2010) - [j55]Diogo Vieira Andrade, Endre Boros, Vladimir Gurvich:
Not complementary connected and not CIS d-graphs form weakly monotone families. Discret. Math. 310(5): 1089-1096 (2010) - [j54]Endre Boros, Vladimir Gurvich, Kazuhisa Makino, Dávid Papp:
Acyclic, or totally tight, two-person game forms: Characterization and main properties. Discret. Math. 310(6-7): 1135-1151 (2010) - [j53]Jack Edmonds, Stéphane Gaubert, Vladimir Gurvich:
Sperner Oiks. Electron. Notes Discret. Math. 36: 1273-1280 (2010) - [j52]Jack Edmonds, Stéphane Gaubert, Vladimir Gurvich:
Scarf Oiks. Electron. Notes Discret. Math. 36: 1281-1288 (2010) - [j51]Endre Boros, Vladimir Gurvich, Igor E. Zverovich:
Friendship Two-Graphs. Graphs Comb. 26(5): 617-628 (2010) - [j50]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
On effectivity functions of game forms. Games Econ. Behav. 68(2): 512-531 (2010) - 2009
- [j49]Endre Boros, Vladimir Gurvich, Igor E. Zverovich:
On split and almost CIS-graphs. Australas. J Comb. 43: 163-180 (2009) - [j48]Vladimir Gurvich, Igor E. Zverovich:
Neighborhood hypergraphs of digraphs and some matrix permutation problems. Discret. Appl. Math. 157(13): 2836-2845 (2009) - [j47]Vladimir Gurvich:
Decomposing complete edge-chromatic graphs and hypergraphs. Revisited. Discret. Appl. Math. 157(14): 3069-3085 (2009) - [j46]Endre Boros, Vladimir Gurvich:
Vertex- and edge-minimal and locally minimal graphs. Discret. Math. 309(12): 3853-3865 (2009) - [j45]Endre Boros, Vladimir Gurvich, Kazuhisa Makino:
Minimal and locally minimal games and game forms. Discret. Math. 309(13): 4456-4468 (2009) - 2008
- [j44]Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich:
On Enumerating Minimal Dicuts and Strongly Connected Subgraphs. Algorithmica 50(1): 159-172 (2008) - [j43]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) - [j42]Vladimir Gurvich:
Recalling Leo. Discret. Appl. Math. 156(11): 1957-1960 (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]Endre Boros, Vladimir Gurvich:
Scientific contributions of Leo Khachiyan (a short overview). Discret. Appl. Math. 156(11): 2232-2240 (2008) - [j39]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) - [j38]Vladimir Gurvich:
On cyclically orientable graphs. Discret. Math. 308(1): 129-135 (2008) - [j37]Endre Boros, Konrad Borys, Vladimir Gurvich, Gábor Rudolf:
Generating 3-vertex connected spanning subgraphs. Discret. Math. 308(24): 6285-6297 (2008) - [j36]Vladimir Gurvich:
War and peace in veto voting. Eur. J. Oper. Res. 185(1): 438-443 (2008) - [j35]Endre Boros, Vladimir Gurvich, Igor E. Zverovich:
Neighborhood hypergraphs of bipartite graphs. J. Graph Theory 58(1): 69-95 (2008) - [j34]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
- [j33]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) - [j32]Vladimir Gurvich:
On the misere version of game Euclid and miserable games. Discret. Math. 307(9-10): 1199-1204 (2007) - [j31]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) - [j30]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) - [j29]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) - [j28]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
- [j27]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) - [j26]Endre Boros, Vladimir Gurvich:
Perfect graphs, kernels, and cores of cooperative games. Discret. Math. 306(19-20): 2336-2354 (2006) - [j25]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich:
Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms. J. Graph Theory 53(3): 209-232 (2006) - 2005
- [j24]Endre Boros, Vladimir Gurvich, Ying Liu:
Comparison of Convex Hulls and Box Hulls. Ars Comb. 77 (2005) - [j23]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
- [j22]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) - [j21]Endre Boros, Vladimir Gurvich, Roy Meshulam:
Difference graphs. Discret. Math. 276(1-3): 59-64 (2004) - [j20]Endre Boros, Vladimir Gurvich, Steven Jaslar, Daniel Krasner:
Stable matchings in three-sided systems with cyclic preferences. Discret. Math. 289(1-3): 1-10 (2004) - 2003
- [j19]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) - [j18]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) - [j17]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) - [j16]Endre Boros, Vladimir Gurvich:
On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles. Math. Soc. Sci. 46(2): 207-241 (2003) - 2002
- [j15]Vladimir A. Gurvich, Li Sheng:
Camel sequences and quadratic residues. Discret. Appl. Math. 124(1-3): 73-89 (2002) - [j14]Endre Boros, Vladimir Gurvich, Stefan Hougardy:
Recursive generation of partitionable graphs. J. Graph Theory 41(4): 259-285 (2002) - [j13]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan:
Generating dual-bounded hypergraphs. Optim. Methods Softw. 17(5): 749-781 (2002) - [j12]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) - 2000
- [j11]Endre Boros, Vladimir Gurvich:
Stable effectivity functions and perfect graphs. Math. Soc. Sci. 39(2): 175-194 (2000) - [j10]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) - [j9]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
- [j8]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) - 1998
- [j7]A. Apartsin, E. Ferapontova, Vladimir Gurvich:
A circular graph - counterexample to the Duchet kernel conjecture. Discret. Math. 178(1-3): 229-231 (1998) - [j6]Endre Boros, Vladimir Gurvich:
A corrected version of the Duchet kernel conjecture. Discret. Math. 179(1-3): 231-233 (1998) - [j5]Gábor Bacsó, Endre Boros, Vladimir Gurvich, Frédéric Maffray, Myriam Preissmann:
On minimal imperfect graphs with circular symmetry. J. Graph Theory 29(4): 209-225 (1998) - 1997
- [j4]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) - 1996
- [j3]Endre Boros, Vladimir Gurvich:
Perfect graphs are kernel solvable. Discret. Math. 159(1-3): 35-55 (1996) - 1995
- [j2]Endre Boros, Vladimir Gurvich, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan:
Decomposability of Partially Defined Boolean Functions. Discret. Appl. Math. 62(1-3): 51-75 (1995) - [j1]Leonid Libkin, Vladimir Gurvich:
Trees as semilattices. Discret. Math. 145(1-3): 321-327 (1995)
Conference and Workshop Papers
- 2020
- [c30]Vladimir Gurvich, Mikhail N. Vyalyi:
Computational Hardness of Multidimensional Subtraction Games. CSR 2020: 237-249 - 2019
- [c29]Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanic, Mary Servatius:
Avoidable Vertices and Edges in Graphs. WADS 2019: 126-139 - 2018
- [c28]Vladimir Gurvich:
Complexity of Generation. CSR 2018: 1-14 - 2015
- [c27]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
Markov Decision Processes and Stochastic Games with Total Effective Payoff. STACS 2015: 103-115 - 2014
- [c26]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games. COCOA 2014: 694-709 - 2013
- [c25]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and a Few Random Positions. ICALP (1) 2013: 220-231 - 2011
- [c24]Endre Boros, Khaled M. Elbassioni, Mahmoud Fouz, Vladimir Gurvich, Kazuhisa Makino, Bodo Manthey:
Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes. ICALP (1) 2011: 147-158 - 2010
- [c23]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information. IPCO 2010: 341-354 - 2009
- [c22]Daniel Andersson, Vladimir Gurvich, Thomas Dueholm Hansen:
On Acyclicity of Games with Cycles. AAIM 2009: 15-28 - 2008
- [c21]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Vladimir Oudalov:
A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames. CSR 2008: 99-109 - 2007
- [c20]Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Gábor Rudolf:
Generating Minimal k-Vertex Connected Spanning Subgraphs. COCOON 2007: 222-231 - 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]Khaled M. Elbassioni, Amr Elmasry, Vladimir Gurvich:
A stronger version of Bárány's theorem in the plane. CCCG 2004: 4-6 - [c12]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich:
Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems. ESA 2004: 122-133 - [c11]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan:
Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems. IPCO 2004: 152-162 - [c10]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan:
Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections. LATIN 2004: 488-498 - [c9]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino:
Generating Paths and Cuts in Multi-pole (Di)graphs. MFCS 2004: 298-309 - [c8]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan:
An Efficient Implementation of a Joint Generation Algorithm. WEA 2004: 114-128 - 2003
- [c7]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 - [c6]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 - [c5]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan:
Algorithms for Enumerating Circuits in Matroids. ISAAC 2003: 485-494 - 2002
- [c4]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan:
Matroid Intersections, Polymatroid Inequalities, and Related Problems. MFCS 2002: 143-154 - [c3]Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino:
On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets. STACS 2002: 133-141 - 2001
- [c2]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
- [c1]Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino:
Generating Partial and Multiple Transversals of a Hypergraph. ICALP 2000: 588-599
Informal and Other Publications
- 2024
- [i27]Vladimir Gurvich, Matjaz Krnc, Mikhail N. Vyalyi:
Growing Trees and Amoebas' Replications. CoRR abs/2401.07484 (2024) - 2023
- [i26]Endre Boros, Vladimir Gurvich, Martin Milanic, Yushi Uno:
Dually conformal hypergraphs. CoRR abs/2309.00098 (2023) - [i25]Endre Boros, Vladimir Gurvich, Kazuhisa Makino, Michael N. Vyalyi:
Computing Remoteness Functions of Moore, Wythoff, and Euclid's games. CoRR abs/2311.02685 (2023) - [i24]Vladimir Gurvich, Artem Parfenov, Michael N. Vyalyi:
Experimental Study of the Game Exact Nim(5, 2). CoRR abs/2311.18772 (2023) - 2022
- [i23]Endre Boros, Paolo Giulio Franciosa, Vladimir Gurvich, Michael N. Vyalyi:
Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies. CoRR abs/2202.11554 (2022) - [i22]Vladimir Gurvich, Mariya Naumova:
On Nash-Solvability of Finite Two-Person Tight Vector Game Forms. CoRR abs/2204.10241 (2022) - [i21]Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi:
Avoidability beyond paths. CoRR abs/2208.12803 (2022) - 2021
- [i20]Vladimir Gurvich, Mariya Naumova:
On Nash-solvability of n-person graphical games under Markov's and a priori realizations. CoRR abs/2104.07542 (2021) - [i19]Vladimir Gurvich, Mariya Naumova:
Polynomial algorithms computing two lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles. CoRR abs/2108.05469 (2021) - [i18]Vladimir Gurvich:
On Nash-solvability of finite n-person deterministic graphical games; Catch 22. CoRR abs/2111.06278 (2021) - [i17]Vladimir Gurvich:
On Nash-solvability of finite n-person shortest path games; bi-shortest path conjecture. CoRR abs/2111.07177 (2021) - 2020
- [i16]Vladimir Gurvich, Michael N. Vyalyi:
Computational Hardness of Multidimensional Subtraction Games. CoRR abs/2001.03962 (2020) - [i15]Endre Boros, Vladimir Gurvich, Martin Milanic, Jernej Vicic:
On the degree sequences of dual graphs on surfaces. CoRR abs/2008.00573 (2020) - [i14]Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi:
Shifting paths to avoidable ones. CoRR abs/2008.01128 (2020) - 2019
- [i13]Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanic, Mary Servatius:
Avoidable Vertices and Edges in Graphs. CoRR abs/1907.12078 (2019) - 2018
- [i12]Endre Boros, Vladimir Gurvich, Martin Milanic:
Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs. CoRR abs/1805.03405 (2018) - 2017
- [i11]Vladimir Gurvich, Gleb A. Koshevoy:
Monotone bargaining is Nash-solvable. CoRR abs/1711.00940 (2017) - 2016
- [i10]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A Convex Programming-based Algorithm for Mean Payoff Stochastic Games with Perfect Information. CoRR abs/1610.06681 (2016) - [i9]Endre Boros, Vladimir Gurvich, Martin Milanic, Vladimir Oudalov, Jernej Vicic:
A three-person chess-like game without Nash equilibria. CoRR abs/1610.07701 (2016) - 2015
- [i8]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and Few Random Positions. CoRR abs/1508.03431 (2015) - [i7]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A Potential Reduction Algorithm for Two-person Zero-sum Mean Payoff Stochastic Games. CoRR abs/1508.03455 (2015) - [i6]Endre Boros, Vladimir Gurvich, Martin Milanic:
1-Sperner hypergraphs. CoRR abs/1510.02438 (2015) - 2014
- [i5]Vladimir Gurvich, Vladimir Oudalov:
A four-person chess-like game without Nash equilibria in pure stationary strategies. CoRR abs/1411.0349 (2014) - [i4]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
Nested Family of Cyclic Games with $k$-total Effective Rewards. CoRR abs/1412.6072 (2014) - 2013
- [i3]Endre Boros, Vladimir Gurvich, Martin Milanic:
On CIS Circulants. CoRR abs/1302.3498 (2013) - 2008
- [i2]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Hans Raj Tiwary:
Characterization of the vertices and extreme directions of the negative cycle polyhedron and harness of generating vertices of $0/1$-polyhedra. CoRR abs/0801.3790 (2008) - [i1]Vladimir Gurvich, Peter Bro Miltersen:
On the computational complexity of solving stochastic mean-payoff games. CoRR abs/0812.0486 (2008)
Coauthor Index
[j97] [j90] [j88] [j87] [j86] [j85] [j84] [j83] [j82] [j81] [j80] [j77] [j75] [j74] [j73] [j72] [j71] [j69] [j67] [j66] [j65] [j62] [j61] [j60] [j58] [j55] [j54] [j51] [j50] [j49] [j46] [j45] [j44] [j43] [j41] [j40] [j39] [j37] [j35] [j34] [j33] [j31] [j30] [j29] [j28] [j27] [j26] [j25] [j24] [j23] [j22] [j21] [j20] [j19] [j18] [j17] [j16] [j14] [j13] [j12] [j11] [j10] [j9] [j6] [j5] [j3] [j2] [c27] [c26] [c25] [c24] [c23] [c21] [c20] [c18] [c17] [c16] [c15] [c14] [c12] [c11] [c10] [c9] [c8] [c7] [c6] [c5] [c4] [c3] [c2] [c1] [i26] [i25] [i23] [i15] [i12] [i10] [i9] [i8] [i7] [i6] [i4] [i3] [i2]
[j85] [j82] [j77] [j74] [j73] [j72] [j67] [j65] [j62] [j60] [j50] [j44] [j43] [j41] [j39] [j34] [j33] [j31] [j30] [j29] [j28] [j27] [j25] [j23] [j18] [j17] [j13] [j12] [j10] [c27] [c26] [c25] [c24] [c23] [c21] [c20] [c18] [c17] [c16] [c15] [c14] [c13] [c12] [c11] [c10] [c9] [c8] [c7] [c6] [c5] [c4] [c2] [i10] [i8] [i7] [i4] [i2]
Leonid Khachiyan
aka: Leonid G. Khachiyan
aka: Leonid G. Khachiyan
Mikhail N. Vyalyi
aka: Michael N. Vyalyi
aka: Michael N. Vyalyi
a service of 
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-05-24 22:28 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:
