Vladimir Gurvich

168 papers A* 4A 5B 9C 2Misc 6Journal 138Unranked 4
YearRankTypeTitle / Venue / Authors
2026 J jnl
Conformality of minimal transversals of maximal cliques.
Discret. Math.
Endre Boros, Vladimir Gurvich, Martin Milanic, Dmitry Tikhanovsky, Yushi Uno
2026 J jnl
More on discrete convexity.
Discret. Appl. Math.
Vladimir Gurvich, Mariya Naumova
2025 J jnl
Avoidability Beyond Paths.
Electron. J. Comb.
Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi
2025 J jnl
Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem.
J. Graph Theory
Endre Boros, Vladimir Gurvich, Martin Milanic, Yushi Uno
2025 J jnl
Markov decision processes and stochastic games with total effective payoff.
Ann. Oper. Res.
Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2025 J jnl
On Nash Equilibria in Play-Once and Terminal Deterministic Graphical Games.
CoRR
Endre Boros, Vladimir Gurvich, Kazuhisa Makino
2024 J jnl
Computing remoteness functions of Moore, Wythoff, and Euclid's games.
Int. J. Game Theory
Endre Boros, Vladimir Gurvich, Kazuhisa Makino, Michael N. Vyalyi
2024 J jnl
Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies.
Int. J. Game Theory
Endre Boros, Paolo Giulio Franciosa, Vladimir Gurvich, Mikhail N. Vyalyi
2024 J jnl
Growing Trees and Amoebas' Replications.
CoRR
Vladimir Gurvich, Matjaz Krnc, Mikhail N. Vyalyi
2024 J jnl
Impartial games with decreasing Sprague-Grundy function and their hypergraph compound.
Int. J. Game Theory
Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino, Peter Mursic
2024 J jnl
Lexicographically maximal edges of dual hypergraphs and Nash-solvability of tight game forms.
Ann. Math. Artif. Intell.
Vladimir Gurvich, Mariya Naumova
2024 J jnl
On Minimal Transversals of Maximal Cliques in Graphs.
CoRR
Endre Boros, Vladimir Gurvich, Martin Milanic, Dmitry Tikhanovsky, Yushi Uno
2024 J jnl
On Nash-solvability of n-person graphical games under Markov and a-priori realizations.
Ann. Oper. Res.
Vladimir Gurvich, Mariya Naumova
2024 J jnl
On Remoteness Functions of k-NIM with k + 1 Piles in Normal and in Misère Versions.
Games
Vladimir Gurvich, Vladislav Maximchuk, Georgy Miheenkov, Mariya Naumova
2024 J jnl
Recognizing distributed approval voting forms and correspondences.
Ann. Oper. Res.
Endre Boros, Ondrej Cepek, Vladimir Gurvich, Kazuhisa Makino
2024 J jnl
Screw discrete dynamical systems and their applications to exact slow NIM.
Discret. Appl. Math.
Vladimir Gurvich, Mariya Naumova
2024 J jnl
Two-person positive shortest path games have Nash equlibria in pure stationary strategies.
CoRR
Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Mikhail N. Vyalyi
2023 J jnl
Computing Remoteness Functions of Moore, Wythoff, and Euclid's games.
CoRR
Endre Boros, Vladimir Gurvich, Kazuhisa Makino, Michael N. Vyalyi
2023 J jnl
Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles.
Discret. Appl. Math.
Vladimir Gurvich, Mariya Naumova
2023 J jnl
Dually conformal hypergraphs.
CoRR
Endre Boros, Vladimir Gurvich, Martin Milanic, Yushi Uno
2023 J jnl
Experimental Study of the Game Exact Nim(5, 2).
CoRR
Vladimir Gurvich, Artem Parfenov, Michael N. Vyalyi
2022 J jnl
Avoidability beyond paths.
CoRR
Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi
2022 J jnl
Avoidable vertices and edges in graphs: Existence, characterization, and applications.
Discret. Appl. Math.
Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanic, Mary Servatius
2022 J jnl
Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies.
CoRR
Endre Boros, Paolo Giulio Franciosa, Vladimir Gurvich, Michael N. Vyalyi
2022 J jnl
Metric and ultrametric inequalities for directed graphs.
Discret. Appl. Math.
Vladimir Gurvich
2022 J jnl
On Nash-Solvability of Finite Two-Person Tight Vector Game Forms.
CoRR
Vladimir Gurvich, Mariya Naumova
2022 J jnl
Shifting paths to avoidable ones.
J. Graph Theory
Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi
2021 J jnl
Balanced flows for transshipment problems.
Discret. Appl. Math.
Vladimir Gurvich
2021 J jnl
Logical Contradictions in the One-Way ANOVA and Tukey-Kramer Multiple Comparisons Tests with More Than Two Groups of Observations.
Symmetry
Vladimir Gurvich, Mariya Naumova
2021 J jnl
On Computational Hardness of Multidimensional Subtraction Games.
Algorithms
Vladimir Gurvich, Mikhail N. Vyalyi
2021 J jnl
On Nash-solvability of finite n-person deterministic graphical games; Catch 22.
CoRR
Vladimir Gurvich
2021 J jnl
On Nash-solvability of finite n-person shortest path games; bi-shortest path conjecture.
CoRR
Vladimir Gurvich
2021 J jnl
On Nash-solvability of n-person graphical games under Markov's and a priori realizations.
CoRR
Vladimir Gurvich, Mariya Naumova
2021 J jnl
On the Sprague-Grundy function of extensions of proper Nim.
Int. J. Game Theory
Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino
2021 J jnl
Polynomial algorithms computing two lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles.
CoRR
Vladimir Gurvich, Mariya Naumova
2020 J jnl
Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs.
J. Graph Theory
Endre Boros, Vladimir Gurvich, Martin Milanic
2020 Misc conf
Computational Hardness of Multidimensional Subtraction Games.
CSR
Vladimir Gurvich, Mikhail N. Vyalyi
2020 J jnl
Computational Hardness of Multidimensional Subtraction Games.
CoRR
Vladimir Gurvich, Michael N. Vyalyi
2020 J jnl
On the degree sequences of dual graphs on surfaces.
CoRR
Endre Boros, Vladimir Gurvich, Martin Milanic, Jernej Vicic
2020 J jnl
Shifting paths to avoidable ones.
CoRR
Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi
2019 J jnl
A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions.
Inf. Comput.
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2019 B conf
Avoidable Vertices and Edges in Graphs.
WADS
Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanic, Mary Servatius
2019 J jnl
Avoidable Vertices and Edges in Graphs.
CoRR
Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanic, Mary Servatius
2019 J jnl
Decomposing 1-Sperner Hypergraphs.
Electron. J. Comb.
Endre Boros, Vladimir Gurvich, Martin Milanic
2019 J jnl
Separable discrete functions: Recognition and sufficient conditions.
Discret. Math.
Endre Boros, Ondrej Cepek, Vladimir Gurvich
2019 J jnl
Sprague-Grundy function of matroids and related hypergraphs.
Theor. Comput. Sci.
Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino, Peter Mursic
2019 J jnl
Sprague-Grundy function of symmetric hypergraphs.
J. Comb. Theory A
Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino, Peter Mursic
2018 J jnl
A Potential Reduction Algorithm for Two-Person Zero-Sum Mean Payoff Stochastic Games.
Dyn. Games Appl.
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2018 J jnl
A three-person deterministic graphical game without Nash equilibria.
Discret. Appl. Math.
Endre Boros, Vladimir Gurvich, Martin Milanic, Vladimir Oudalov, Jernej Vicic
2018 J jnl
Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions.
Algorithmica
Endre Boros, Khaled M. Elbassioni, Mahmoud Fouz, Vladimir Gurvich, Kazuhisa Makino, Bodo Manthey
2018 J jnl
Backward induction in presence of cycles.
J. Log. Comput.
Vladimir Gurvich
2018 J jnl
Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs.
CoRR
Endre Boros, Vladimir Gurvich, Martin Milanic
2018 Misc conf
Complexity of Generation.
CSR
Vladimir Gurvich
2018 J jnl
Monotone bargaining is Nash-solvable.
Discret. Appl. Math.
Vladimir Gurvich, Gleb A. Koshevoy
2018 J jnl
On tame, pet, domestic, and miserable impartial games.
Discret. Appl. Math.
Vladimir Gurvich, Nhan Bao Ho
2018 J jnl
On the Sprague-Grundyfunction of Exact k-Nim.
Discret. Appl. Math.
Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino, Peter Mursic
2017 J jnl
A convex programming-based algorithm for mean payoff stochastic games with perfect information.
Optim. Lett.
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2017 J jnl
A nested family of \(\varvec{k}\) -total effective rewards for positional games.
Int. J. Game Theory
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2017 J jnl
Monotone bargaining is Nash-solvable.
CoRR
Vladimir Gurvich, Gleb A. Koshevoy
2017 J jnl
On equistable, split, CIS, and related classes of graphs.
Discret. Appl. Math.
Endre Boros, Vladimir Gurvich, Martin Milanic
2016 J jnl
A Convex Programming-based Algorithm for Mean Payoff Stochastic Games with Perfect Information.
CoRR
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2016 J jnl
A three-person chess-like game without Nash equilibria.
CoRR
Endre Boros, Vladimir Gurvich, Martin Milanic, Vladimir Oudalov, Jernej Vicic
2016 J jnl
Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden \(2 \times 2\) subgames.
Int. J. Game Theory
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Vladimir Oudalov
2015 J jnl
1-Sperner hypergraphs.
CoRR
Endre Boros, Vladimir Gurvich, Martin Milanic
2015 J jnl
A Potential Reduction Algorithm for Two-person Zero-sum Mean Payoff Stochastic Games.
CoRR
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2015 J jnl
A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and Few Random Positions.
CoRR
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2015 A conf
Markov Decision Processes and Stochastic Games with Total Effective Payoff.
STACS
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2015 J jnl
Sandwich problem for Π- and Δ-free multigraphs and its applications to positional games.
Discret. Math.
Endre Boros, Vladimir Gurvich
2014 C conf
A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games.
COCOA
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2014 J jnl
A four-person chess-like game without Nash equilibria in pure stationary strategies.
CoRR
Vladimir Gurvich, Vladimir Oudalov
2014 J jnl
Combinatorial games modeling seki in GO.
Discret. Math.
Andrey Gol'berg, Vladimir Gurvich, Diogo Vieira Andrade, Konrad Borys, Gábor Rudolf
2014 J jnl
Nested Family of Cyclic Games with $k$-total Effective Rewards.
CoRR
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2014 J jnl
On CIS circulants.
Discret. Math.
Endre Boros, Vladimir Gurvich, Martin Milanic
2014 J jnl
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.
Vladimir Gurvich, Vladimir Oudalov
2013 — conf
A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and a Few Random Positions.
ICALP (1)
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2013 J jnl
A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron-Frobenius theory.
Int. J. Game Theory
Endre Boros, Vladimir Gurvich, Vladimir Oudalov
2013 J jnl
On CIS Circulants
CoRR
Endre Boros, Vladimir Gurvich, Martin Milanic
2013 J jnl
On Canonical Forms for Zero-Sum Stochastic Mean Payoff Games.
Dyn. Games Appl.
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2013 J jnl
On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness.
Oper. Res. Lett.
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2012 J jnl
Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs.
Discret. Appl. Math.
Vladimir Gurvich, Mikhail N. Vyalyi
2012 J jnl
Further generalizations of the Wythoff game and the minimum excludant.
Discret. Appl. Math.
Vladimir Gurvich
2012 J jnl
On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games.
Discret. Math.
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2012 J jnl
Total tightness implies Nash-solvability for three-person game forms.
Discret. Math.
Endre Boros, Ondrej Cepek, Vladimir Gurvich
2011 J jnl
Nash-solvable two-person symmetric cycle game forms.
Discret. Appl. Math.
Endre Boros, Vladimir Gurvich, Kazuhisa Makino, Wei Shao
2011 J jnl
On exact blockers and anti-blockers, Δ-conjecture, and related problems.
Discret. Appl. Math.
Vladimir Gurvich
2011 — conf
Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes.
ICALP (1)
Endre Boros, Khaled M. Elbassioni, Mahmoud Fouz, Vladimir Gurvich, Kazuhisa Makino, Bodo Manthey
2011 J jnl
The negative cycles polyhedron and hardness of checking some polyhedral properties.
Ann. Oper. Res.
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Hans Raj Tiwary
2010 B conf
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information.
IPCO
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2010 J jnl
Acyclic, or totally tight, two-person game forms: Characterization and main properties.
Discret. Math.
Endre Boros, Vladimir Gurvich, Kazuhisa Makino, Dávid Papp
2010 J jnl
Friendship Two-Graphs.
Graphs Comb.
Endre Boros, Vladimir Gurvich, Igor E. Zverovich
2010 J jnl
Metric and ultrametric spaces of resistances.
Discret. Appl. Math.
Vladimir Gurvich
2010 J jnl
Not complementary connected and not CIS d-graphs form weakly monotone families.
Discret. Math.
Diogo Vieira Andrade, Endre Boros, Vladimir Gurvich
2010 J jnl
On acyclicity of games with cycles.
Discret. Appl. Math.
Daniel Andersson, Vladimir Gurvich, Thomas Dueholm Hansen
2010 J jnl
On effectivity functions of game forms.
Games Econ. Behav.
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2010 J jnl
Scarf Oiks.
Electron. Notes Discret. Math.
Jack Edmonds, Stéphane Gaubert, Vladimir Gurvich
2010 J jnl
Sperner Oiks.
Electron. Notes Discret. Math.
Jack Edmonds, Stéphane Gaubert, Vladimir Gurvich
2009 J jnl
Decomposing complete edge-chromatic graphs and hypergraphs. Revisited.
Discret. Appl. Math.
Vladimir Gurvich
2009 J jnl
Minimal and locally minimal games and game forms.
Discret. Math.
Endre Boros, Vladimir Gurvich, Kazuhisa Makino
2009 J jnl
Neighborhood hypergraphs of digraphs and some matrix permutation problems.
Discret. Appl. Math.
Vladimir Gurvich, Igor E. Zverovich
2009 C conf
On Acyclicity of Games with Cycles.
AAIM
Daniel Andersson, Vladimir Gurvich, Thomas Dueholm Hansen
2009 J jnl
On split and almost CIS-graphs.
Australas. J Comb.
Endre Boros, Vladimir Gurvich, Igor E. Zverovich
2009 J jnl
Vertex- and edge-minimal and locally minimal graphs.
Discret. Math.
Endre Boros, Vladimir Gurvich
2008 Misc conf
A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames.
CSR
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Vladimir Oudalov
2008 J jnl
Characterization of the vertices and extreme directions of the negative cycle polyhedron and harness of generating vertices of $0/1$-polyhedra
CoRR
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Hans Raj Tiwary
2008 J jnl
Generating 3-vertex connected spanning subgraphs.
Discret. Math.
Endre Boros, Konrad Borys, Vladimir Gurvich, Gábor Rudolf
2008 J jnl
Generating All Vertices of a Polyhedron Is Hard.
Discret. Comput. Geom.
Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich
2008 J jnl
Generating Cut Conjunctions in Graphs and Related Problems.
Algorithmica
Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2008 J jnl
Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions.
Discret. Appl. Math.
Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
2008 J jnl
Neighborhood hypergraphs of bipartite graphs.
J. Graph Theory
Endre Boros, Vladimir Gurvich, Igor E. Zverovich
2008 J jnl
On Enumerating Minimal Dicuts and Strongly Connected Subgraphs.
Algorithmica
Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
2008 J jnl
On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction.
Theory Comput. Syst.
Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Gábor Rudolf, Jihui Zhao
2008 J jnl
On cyclically orientable graphs.
Discret. Math.
Vladimir Gurvich
2008 J jnl
On the computational complexity of solving stochastic mean-payoff games
CoRR
Vladimir Gurvich, Peter Bro Miltersen
2008 J jnl
Recalling Leo.
Discret. Appl. Math.
Vladimir Gurvich
2008 J jnl
Scientific contributions of Leo Khachiyan (a short overview).
Discret. Appl. Math.
Endre Boros, Vladimir Gurvich
2008 J jnl
War and peace in veto voting.
Eur. J. Oper. Res.
Vladimir Gurvich
2007 J jnl
A global parallel algorithm for the hypergraph transversal problem.
Inf. Process. Lett.
Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
2007 J jnl
Computing Many Maximal Independent Sets for Hypergraphs in Parallel.
Parallel Process. Lett.
Leonid Khachiyan, Endre Boros, Vladimir Gurvich, Khaled M. Elbassioni
2007 J jnl
Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data.
Theor. Comput. Sci.
Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2007 J jnl
Enumerating disjunctions and conjunctions of paths and cuts in reliability theory.
Discret. Appl. Math.
Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2007 Misc conf
Generating Minimal k-Vertex Connected Spanning Subgraphs.
COCOON
Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Gábor Rudolf
2007 J jnl
On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs.
Theor. Comput. Sci.
Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
2007 J jnl
On the misere version of game Euclid and miserable games.
Discret. Math.
Vladimir Gurvich
2006 J jnl
An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation.
Discret. Appl. Math.
Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
2006 A conf
Enumerating Spanning and Connected Subsets in Graphs and Matroids.
ESA
Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2006 Misc conf
Extending Dijkstra's Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction.
CSR
Leonid Khachiyan, Vladimir Gurvich, Jihui Zhao
2006 A* conf
Generating all vertices of a polyhedron is hard.
SODA
Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich
2006 J jnl
Perfect graphs, kernels, and cores of cooperative games.
Discret. Math.
Endre Boros, Vladimir Gurvich
2006 J jnl
Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms.
J. Graph Theory
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
2005 Misc conf
A New Algorithm for the Hypergraph Transversal Problem.
COCOON
Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
2005 J jnl
Comparison of Convex Hulls and Box Hulls.
Ars Comb.
Endre Boros, Vladimir Gurvich, Ying Liu
2005 B conf
Generating All Minimal Integral Solutions to Monotone and, or-Systems of Linear, Transversal and Polymatroid Inequalities.
MFCS
Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
2005 B conf
Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs.
ISAAC
Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2005 J jnl
On the Complexity of Some Enumeration Problems for Matroids.
SIAM J. Discret. Math.
Leonid G. Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2004 — conf
A stronger version of Bárány's theorem in the plane.
CCCG
Khaled M. Elbassioni, Amr Elmasry, Vladimir Gurvich
2004 A conf
Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems.
ESA
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
2004 — conf
An Efficient Implementation of a Joint Generation Algorithm.
WEA
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
2004 J jnl
Difference graphs.
Discret. Math.
Endre Boros, Vladimir Gurvich, Roy Meshulam
2004 J jnl
Dual-bounded generating problems: weighted transversals of a hypergraph.
Discret. Appl. Math.
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
2004 B conf
Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems.
IPCO
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
2004 B conf
Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections.
LATIN
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
2004 B conf
Generating Paths and Cuts in Multi-pole (Di)graphs.
MFCS
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
2004 J jnl
Stable matchings in three-sided systems with cyclic preferences.
Discret. Math.
Endre Boros, Vladimir Gurvich, Steven Jaslar, Daniel Krasner
2003 B conf
Algorithms for Enumerating Circuits in Matroids.
ISAAC
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
2003 A conf
An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals.
ESA
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
2003 A* conf
An Intersection Inequality for Discrete Distributions and Related Generation Problems.
ICALP
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
2003 J jnl
An inequality for polymatroid functions and its applications.
Discret. Appl. Math.
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
2003 J jnl
Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices.
Math. Program.
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
2003 J jnl
On Maximal Frequent and Minimal Infrequent Sets in Binary Matrices.
Ann. Math. Artif. Intell.
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
2003 J jnl
On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
Math. Soc. Sci.
Endre Boros, Vladimir Gurvich
2002 J jnl
Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities.
SIAM J. Comput.
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
2002 J jnl
Generating dual-bounded hypergraphs.
Optim. Methods Softw.
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
2002 B conf
Matroid Intersections, Polymatroid Inequalities, and Related Problems.
MFCS
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
2002 A conf
On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets.
STACS
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
2002 J jnl
Recursive generation of partitionable graphs.
J. Graph Theory
Endre Boros, Vladimir Gurvich, Stefan Hougardy
2001 A* conf
On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities.
ICALP
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
2000 J jnl
An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension.
Parallel Process. Lett.
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
2000 J jnl
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph.
SIAM J. Comput.
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
2000 A* conf
Generating Partial and Multiple Transversals of a Hypergraph.
ICALP
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
2000 J jnl
Stable effectivity functions and perfect graphs.
Math. Soc. Sci.
Endre Boros, Vladimir Gurvich
1999 J jnl
On Generating the Irredundant Conjunctive and Disjunctive Normal Forms of Monotone Boolean Functions.
Discret. Appl. Math.
Vladimir Gurvich, Leonid Khachiyan
1998 J jnl
A circular graph - counterexample to the Duchet kernel conjecture.
Discret. Math.
A. Apartsin, E. Ferapontova, Vladimir Gurvich
1998 J jnl
A corrected version of the Duchet kernel conjecture.
Discret. Math.
Endre Boros, Vladimir Gurvich
1998 J jnl
On minimal imperfect graphs with circular symmetry.
J. Graph Theory
Gábor Bacsó, Endre Boros, Vladimir Gurvich, Frédéric Maffray, Myriam Preissmann
1997 J jnl
On the frequency of the most frequently occurring variable in dual monotone DNFs.
Discret. Math.
Vladimir Gurvich, Leonid Khachiyan
1996 J jnl
Perfect graphs are kernel solvable.
Discret. Math.
Endre Boros, Vladimir Gurvich
1995 J jnl
Decomposability of Partially Defined Boolean Functions.
Discret. Appl. Math.
Endre Boros, Vladimir Gurvich, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan
1995 J jnl
Trees as semilattices.
Discret. Math.
Leonid Libkin, Vladimir Gurvich