Decomposability of Partially Defined Boolean Functions. - Endre Boros; Vladimir Gurvich; Peter L. Hammer; Toshihide Ibaraki; Alexander Kogan (Discret. Appl. Math., 1995)

Trees as semilattices. - Leonid Libkin; Vladimir Gurvich (Discret. Math., 1995)

Perfect graphs are kernel solvable. - Endre Boros; Vladimir Gurvich (Discret. Math., 1996)

On the frequency of the most frequently occurring variable in dual monotone DNFs. - Vladimir Gurvich; Leonid Khachiyan (Discret. Math., 1997)

A circular graph - counterexample to the Duchet kernel conjecture. - A. Apartsin; E. Ferapontova; Vladimir Gurvich (Discret. Math., 1998)

A corrected version of the Duchet kernel conjecture. - Endre Boros; Vladimir Gurvich (Discret. Math., 1998)

On minimal imperfect graphs with circular symmetry. - Gábor Bacsó; Endre Boros; Vladimir Gurvich; Frédéric Maffray; Myriam Preissmann (J. Graph Theory, 1998)

On Generating the Irredundant Conjunctive and Disjunctive Normal Forms of Monotone Boolean Functions. - Vladimir Gurvich; Leonid Khachiyan (Discret. Appl. Math., 1999)

Generating Partial and Multiple Transversals of a Hypergraph. - Endre Boros; Vladimir Gurvich; Leonid Khachiyan; Kazuhisa Makino (ICALP, 2000)

Stable effectivity functions and perfect graphs. - Endre Boros; Vladimir Gurvich (Math. Soc. Sci., 2000)

An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Leonid Khachiyan (Parallel Process. Lett., 2000)

Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph. - Endre Boros; Vladimir Gurvich; Leonid Khachiyan; Kazuhisa Makino (SIAM J. Comput., 2000)

On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Leonid Khachiyan; Kazuhisa Makino (ICALP, 2001)

Matroid Intersections, Polymatroid Inequalities, and Related Problems. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Leonid Khachiyan (MFCS, 2002)

On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets. - Endre Boros; Vladimir Gurvich; Leonid Khachiyan; Kazuhisa Makino (STACS, 2002)

Camel sequences and quadratic residues. - Vladimir A. Gurvich; Li Sheng 001 (Discret. Appl. Math., 2002)

Recursive generation of partitionable graphs. - Endre Boros; Vladimir Gurvich; Stefan Hougardy (J. Graph Theory, 2002)

Generating dual-bounded hypergraphs. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Leonid Khachiyan (Optim. Methods Softw., 2002)

Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Leonid Khachiyan; Kazuhisa Makino (SIAM J. Comput., 2002)

An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Leonid Khachiyan (ESA, 2003)

An Intersection Inequality for Discrete Distributions and Related Generation Problems. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Leonid Khachiyan; Kazuhisa Makino (ICALP, 2003)

Algorithms for Enumerating Circuits in Matroids. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Leonid Khachiyan (ISAAC, 2003)

On Maximal Frequent and Minimal Infrequent Sets in Binary Matrices. - Endre Boros; Vladimir Gurvich; Leonid Khachiyan; Kazuhisa Makino (Ann. Math. Artif. Intell., 2003)

An inequality for polymatroid functions and its applications. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Leonid Khachiyan (Discret. Appl. Math., 2003)

Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Leonid Khachiyan (Math. Program., 2003)

On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles. - Endre Boros; Vladimir Gurvich (Math. Soc. Sci., 2003)

A stronger version of Bárány's theorem in the plane. - Khaled M. Elbassioni; Amr Elmasry; Vladimir Gurvich (CCCG, 2004)

Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich (ESA, 2004)

Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Leonid Khachiyan (IPCO, 2004)

Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Leonid Khachiyan (LATIN, 2004)

Generating Paths and Cuts in Multi-pole (Di)graphs. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Leonid Khachiyan; Kazuhisa Makino (MFCS, 2004)

An Efficient Implementation of a Joint Generation Algorithm. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Leonid Khachiyan (WEA, 2004)

Dual-bounded generating problems: weighted transversals of a hypergraph. - Endre Boros; Vladimir Gurvich; Leonid Khachiyan; Kazuhisa Makino (Discret. Appl. Math., 2004)

Stable matchings in three-sided systems with cyclic preferences. - Endre Boros; Vladimir Gurvich; Steven Jaslar; Daniel Krasner (Discret. Math., 2004)

Difference graphs. - Endre Boros; Vladimir Gurvich; Roy Meshulam (Discret. Math., 2004)

A New Algorithm for the Hypergraph Transversal Problem. - Leonid Khachiyan; Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich (COCOON, 2005)

Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs. - Leonid Khachiyan; Endre Boros; Konrad Borys; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (ISAAC, 2005)

Generating All Minimal Integral Solutions to Monotone and, or-Systems of Linear, Transversal and Polymatroid Inequalities. - Leonid Khachiyan; Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich (MFCS, 2005)

Comparison of Convex Hulls and Box Hulls. - Endre Boros; Vladimir Gurvich; Ying Liu (Ars Comb., 2005)

On the Complexity of Some Enumeration Problems for Matroids. - Leonid G. Khachiyan; Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (SIAM J. Discret. Math., 2005)

Extending Dijkstra's Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction. - Leonid Khachiyan; Vladimir Gurvich; Jihui Zhao (CSR, 2006)

Enumerating Spanning and Connected Subsets in Graphs and Matroids. - Leonid Khachiyan; Endre Boros; Konrad Borys; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (ESA, 2006)

An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation. - Leonid Khachiyan; Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich (Discret. Appl. Math., 2006)

Perfect graphs, kernels, and cores of cooperative games. - Endre Boros; Vladimir Gurvich (Discret. Math., 2006)

Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich (J. Graph Theory, 2006)

Generating Minimal k-Vertex Connected Spanning Subgraphs. - Endre Boros; Konrad Borys; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino; Gábor Rudolf (COCOON, 2007)

Enumerating disjunctions and conjunctions of paths and cuts in reliability theory. - Leonid Khachiyan; Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (Discret. Appl. Math., 2007)

On the misere version of game Euclid and miserable games. - Vladimir Gurvich (Discret. Math., 2007)

A global parallel algorithm for the hypergraph transversal problem. - Leonid Khachiyan; Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich (Inf. Process. Lett., 2007)

Computing Many Maximal Independent Sets for Hypergraphs in Parallel. - Leonid Khachiyan; Endre Boros; Vladimir Gurvich; Khaled M. Elbassioni (Parallel Process. Lett., 2007)

On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs. - Leonid Khachiyan; Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich (Theor. Comput. Sci., 2007)

Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data. - Leonid Khachiyan; Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (Theor. Comput. Sci., 2007)

A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino; Vladimir Oudalov (CSR, 2008)

Generating Cut Conjunctions in Graphs and Related Problems. - Leonid Khachiyan; Endre Boros; Konrad Borys; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (Algorithmica, 2008)

On Enumerating Minimal Dicuts and Strongly Connected Subgraphs. - Leonid Khachiyan; Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich (Algorithmica, 2008)

Characterization of the vertices and extreme directions of the negative cycle polyhedron and harness of generating vertices of $0/1$-polyhedra - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Hans Raj Tiwary (CoRR, 2008)

On the computational complexity of solving stochastic mean-payoff games - Vladimir Gurvich; Peter Bro Miltersen (CoRR, 2008)

Scientific contributions of Leo Khachiyan (a short overview). - Endre Boros; Vladimir Gurvich (Discret. Appl. Math., 2008)

Recalling Leo. - Vladimir Gurvich (Discret. Appl. Math., 2008)

Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions. - Leonid Khachiyan; Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich (Discret. Appl. Math., 2008)

Generating All Vertices of a Polyhedron Is Hard. - Leonid Khachiyan; Endre Boros; Konrad Borys; Khaled M. Elbassioni; Vladimir Gurvich (Discret. Comput. Geom., 2008)

Generating 3-vertex connected spanning subgraphs. - Endre Boros; Konrad Borys; Vladimir Gurvich; Gábor Rudolf (Discret. Math., 2008)

On cyclically orientable graphs. - Vladimir Gurvich (Discret. Math., 2008)

War and peace in veto voting. - Vladimir Gurvich (Eur. J. Oper. Res., 2008)

Neighborhood hypergraphs of bipartite graphs. - Endre Boros; Vladimir Gurvich; Igor E. Zverovich (J. Graph Theory, 2008)

On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction. - Leonid Khachiyan; Endre Boros; Konrad Borys; Khaled M. Elbassioni; Vladimir Gurvich; Gábor Rudolf; Jihui Zhao (Theory Comput. Syst., 2008)

On split and almost CIS-graphs. - Endre Boros; Vladimir Gurvich; Igor E. Zverovich (Australas. J Comb., 2009)

Decomposing complete edge-chromatic graphs and hypergraphs. Revisited. - Vladimir Gurvich (Discret. Appl. Math., 2009)

Neighborhood hypergraphs of digraphs and some matrix permutation problems. - Vladimir Gurvich; Igor E. Zverovich (Discret. Appl. Math., 2009)

Vertex- and edge-minimal and locally minimal graphs. - Endre Boros; Vladimir Gurvich (Discret. Math., 2009)

Minimal and locally minimal games and game forms. - Endre Boros; Vladimir Gurvich; Kazuhisa Makino (Discret. Math., 2009)

A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (IPCO, 2010)

On acyclicity of games with cycles. - Daniel Andersson; Vladimir Gurvich; Thomas Dueholm Hansen (Discret. Appl. Math., 2010)

Metric and ultrametric spaces of resistances. - Vladimir Gurvich (Discret. Appl. Math., 2010)

Not complementary connected and not CIS d-graphs form weakly monotone families. - Diogo Vieira Andrade; Endre Boros; Vladimir Gurvich (Discret. Math., 2010)

Acyclic, or totally tight, two-person game forms: Characterization and main properties. - Endre Boros; Vladimir Gurvich; Kazuhisa Makino; Dávid Papp (Discret. Math., 2010)

Sperner Oiks. - Jack Edmonds 001; Stéphane Gaubert; Vladimir Gurvich (Electron. Notes Discret. Math., 2010)

Scarf Oiks. - Jack Edmonds 001; Stéphane Gaubert; Vladimir Gurvich (Electron. Notes Discret. Math., 2010)

Friendship Two-Graphs. - Endre Boros; Vladimir Gurvich; Igor E. Zverovich (Graphs Comb., 2010)

On effectivity functions of game forms. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (Games Econ. Behav., 2010)

Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes. - Endre Boros; Khaled M. Elbassioni; Mahmoud Fouz; Vladimir Gurvich; Kazuhisa Makino; Bodo Manthey (ICALP (1), 2011)

The negative cycles polyhedron and hardness of checking some polyhedral properties. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Hans Raj Tiwary (Ann. Oper. Res., 2011)

Nash-solvable two-person symmetric cycle game forms. - Endre Boros; Vladimir Gurvich; Kazuhisa Makino; Wei Shao (Discret. Appl. Math., 2011)

On exact blockers and anti-blockers, Δ-conjecture, and related problems. - Vladimir Gurvich (Discret. Appl. Math., 2011)

Further generalizations of the Wythoff game and the minimum excludant. - Vladimir Gurvich (Discret. Appl. Math., 2012)

Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs. - Vladimir Gurvich; Mikhail N. Vyalyi (Discret. Appl. Math., 2012)

Total tightness implies Nash-solvability for three-person game forms. - Endre Boros; Ondrej Cepek; Vladimir Gurvich (Discret. Math., 2012)

On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (Discret. Math., 2012)

On Canonical Forms for Zero-Sum Stochastic Mean Payoff Games. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (Dyn. Games Appl., 2013)

A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron-Frobenius theory. - Endre Boros; Vladimir Gurvich; Vladimir Oudalov (Int. J. Game Theory, 2013)

On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (Oper. Res. Lett., 2013)

A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (COCOA, 2014)

Nested Family of Cyclic Games with $k$-total Effective Rewards. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (CoRR, 2014)

A four-person chess-like game without Nash equilibria in pure stationary strategies. - Vladimir Gurvich; Vladimir Oudalov (CoRR, 2014)

On Nash-solvability in pure stationary strategies of the deterministic n-person games with perfect information and mean or total effective cost. - Vladimir Gurvich; Vladimir Oudalov (Discret. Appl. Math., 2014)

On CIS circulants. - Endre Boros; Vladimir Gurvich; Martin Milanic (Discret. Math., 2014)

Combinatorial games modeling seki in GO. - Andrey Gol'berg; Vladimir Gurvich; Diogo Vieira Andrade; Konrad Borys; Gábor Rudolf (Discret. Math., 2014)

Markov Decision Processes and Stochastic Games with Total Effective Payoff. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (STACS, 2015)

1-Sperner hypergraphs. - Endre Boros; Vladimir Gurvich; Martin Milanic (CoRR, 2015)

Sandwich problem for Π- and Δ-free multigraphs and its applications to positional games. - Endre Boros; Vladimir Gurvich (Discret. Math., 2015)

A three-person chess-like game without Nash equilibria. - Endre Boros; Vladimir Gurvich; Martin Milanic; Vladimir Oudalov; Jernej Vicic (CoRR, 2016)

Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden (2 times 2 ) subgames. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino; Vladimir Oudalov (Int. J. Game Theory, 2016)

On equistable, split, CIS, and related classes of graphs. - Endre Boros; Vladimir Gurvich; Martin Milanic (Discret. Appl. Math., 2017)

A nested family of ( varvec{k} ) -total effective rewards for positional games. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (Int. J. Game Theory, 2017)

A convex programming-based algorithm for mean payoff stochastic games with perfect information. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (Optim. Lett., 2017)

Complexity of Generation. - Vladimir Gurvich (CSR, 2018)

Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions. - Endre Boros; Khaled M. Elbassioni; Mahmoud Fouz; Vladimir Gurvich; Kazuhisa Makino; Bodo Manthey (Algorithmica, 2018)

On the Sprague-Grundyfunction of Exact k-Nim. - Endre Boros; Vladimir Gurvich; Nhan Bao Ho; Kazuhisa Makino; Peter Mursic (Discret. Appl. Math., 2018)

A three-person deterministic graphical game without Nash equilibria. - Endre Boros; Vladimir Gurvich; Martin Milanic; Vladimir Oudalov; Jernej Vicic (Discret. Appl. Math., 2018)

On tame, pet, domestic, and miserable impartial games. - Vladimir Gurvich; Nhan Bao Ho (Discret. Appl. Math., 2018)

Monotone bargaining is Nash-solvable. - Vladimir Gurvich; Gleb A. Koshevoy (Discret. Appl. Math., 2018)

A Potential Reduction Algorithm for Two-Person Zero-Sum Mean Payoff Stochastic Games. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (Dyn. Games Appl., 2018)

Backward induction in presence of cycles. - Vladimir Gurvich (J. Log. Comput., 2018)

Avoidable Vertices and Edges in Graphs. - Jesse Beisegel; Maria Chudnovsky; Vladimir Gurvich; Martin Milanic; Mary Servatius (WADS, 2019)

Decomposing 1-Sperner Hypergraphs. - Endre Boros; Vladimir Gurvich; Martin Milanic (Electron. J. Comb., 2019)

Separable discrete functions: Recognition and sufficient conditions. - Endre Boros; Ondrej Cepek; Vladimir Gurvich (Discret. Math., 2019)

A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (Inf. Comput., 2019)

Sprague-Grundy function of symmetric hypergraphs. - Endre Boros; Vladimir Gurvich; Nhan Bao Ho; Kazuhisa Makino; Peter Mursic (J. Comb. Theory A, 2019)

Sprague-Grundy function of matroids and related hypergraphs. - Endre Boros; Vladimir Gurvich; Nhan Bao Ho; Kazuhisa Makino; Peter Mursic (Theor. Comput. Sci., 2019)

On the degree sequences of dual graphs on surfaces. - Endre Boros; Vladimir Gurvich; Martin Milanic; Jernej Vicic (CoRR, 2020)

Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs. - Endre Boros; Vladimir Gurvich; Martin Milanic (J. Graph Theory, 2020)

Non realizable degree sequences of dual graphs on surfaces. - Vladimir Gurvich; Endre Boros; Martin Milanic; Jernej Vicic (Zenodo, 2020)

Non realizable degree sequences of dual graphs on surfaces. - Vladimir Gurvich; Endre Boros; Martin Milanic; Jernej Vicic (Zenodo, 2020)

On Computational Hardness of Multidimensional Subtraction Games. - Vladimir Gurvich; Mikhail N. Vyalyi (Algorithms, 2021)

On Nash-solvability of n-person graphical games under Markov's and a priori realizations. - Vladimir Gurvich; Mariya Naumova (CoRR, 2021)

Polynomial algorithms computing two lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles. - Vladimir Gurvich; Mariya Naumova (CoRR, 2021)

On Nash-solvability of finite n-person deterministic graphical games; Catch 22. - Vladimir Gurvich (CoRR, 2021)

On Nash-solvability of finite n-person shortest path games; bi-shortest path conjecture. - Vladimir Gurvich (CoRR, 2021)

Balanced flows for transshipment problems. - Vladimir Gurvich (Discret. Appl. Math., 2021)

On the Sprague-Grundy function of extensions of proper Nim. - Endre Boros; Vladimir Gurvich; Nhan Bao Ho; Kazuhisa Makino (Int. J. Game Theory, 2021)

Logical Contradictions in the One-Way ANOVA and Tukey-Kramer Multiple Comparisons Tests with More Than Two Groups of Observations. - Vladimir Gurvich; Mariya Naumova (Symmetry, 2021)

On Nash-Solvability of Finite Two-Person Tight Vector Game Forms. - Vladimir Gurvich; Mariya Naumova (CoRR, 2022)

Avoidable vertices and edges in graphs: Existence, characterization, and applications. - Jesse Beisegel; Maria Chudnovsky; Vladimir Gurvich; Martin Milanic; Mary Servatius (Discret. Appl. Math., 2022)

Metric and ultrametric inequalities for directed graphs. - Vladimir Gurvich (Discret. Appl. Math., 2022)

Shifting paths to avoidable ones. - Vladimir Gurvich; Matjaz Krnc; Martin Milanic; Mikhail N. Vyalyi (J. Graph Theory, 2022)

Computer-assisted verification of confining two-rooted graphs with certain cages. - Vladimir Gurvich; Matjaz Krnc; Martin Milanic; Mikhail N. Vyalyi (Zenodo, 2022)

Dually conformal hypergraphs. - Endre Boros; Vladimir Gurvich; Martin Milanic; Yushi Uno (CoRR, 2023)

Experimental Study of the Game Exact Nim(5, 2). - Vladimir Gurvich; Artem Parfenov; Michael N. Vyalyi (CoRR, 2023)

Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles. - Vladimir Gurvich; Mariya Naumova (Discret. Appl. Math., 2023)

Growing Trees and Amoebas' Replications. - Vladimir Gurvich; Matjaz Krnc; Mikhail N. Vyalyi (CoRR, 2024)

On Minimal Transversals of Maximal Cliques in Graphs. - Endre Boros; Vladimir Gurvich; Martin Milanic; Dmitry Tikhanovsky; Yushi Uno (CoRR, 2024)

Two-person positive shortest path games have Nash equlibria in pure stationary strategies. - Endre Boros; Khaled Elbassioni; Vladimir Gurvich; Mikhail N. Vyalyi (CoRR, 2024)

Screw discrete dynamical systems and their applications to exact slow NIM. - Vladimir Gurvich; Mariya Naumova (Discret. Appl. Math., 2024)

On Remoteness Functions of k-NIM with k + 1 Piles in Normal and in Misère Versions. - Vladimir Gurvich; Vladislav Maximchuk; Georgy Miheenkov; Mariya Naumova (Games, 2024)

Lexicographically maximal edges of dual hypergraphs and Nash-solvability of tight game forms. - Vladimir Gurvich; Mariya Naumova (Ann. Math. Artif. Intell., 2024)

Recognizing distributed approval voting forms and correspondences. - Endre Boros; Ondrej Cepek; Vladimir Gurvich; Kazuhisa Makino (Ann. Oper. Res., 2024)

On Nash-solvability of n-person graphical games under Markov and a-priori realizations. - Vladimir Gurvich; Mariya Naumova (Ann. Oper. Res., 2024)

Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies. - Endre Boros; Paolo Giulio Franciosa; Vladimir Gurvich; Mikhail N. Vyalyi (Int. J. Game Theory, 2024)

Impartial games with decreasing Sprague-Grundy function and their hypergraph compound. - Endre Boros; Vladimir Gurvich; Nhan Bao Ho; Kazuhisa Makino; Peter Mursic (Int. J. Game Theory, 2024)

Computing remoteness functions of Moore, Wythoff, and Euclid's games. - Endre Boros; Vladimir Gurvich; Kazuhisa Makino; Michael N. Vyalyi (Int. J. Game Theory, 2024)

Avoidability Beyond Paths. - Vladimir Gurvich; Matjaz Krnc; Martin Milanic; Mikhail N. Vyalyi (Electron. J. Comb., 2025)

On Nash Equilibria in Play-Once and Terminal Deterministic Graphical Games. - Endre Boros; Vladimir Gurvich; Kazuhisa Makino (CoRR, 2025)

Conformality of minimal transversals of maximal cliques. - Endre Boros; Vladimir Gurvich; Martin Milanic; Dmitry Tikhanovsky; Yushi Uno (Discret. Math., 2026)