Vladimir Gurvich

Publications

670

Citations

H-Index

1987

Active since

Affiliations

Rutgers, The State University of New Jersey(Current)

Max Planck Society

Max Planck Institute for Informatics

The University of Osaka

Hungarian Academy of Sciences

Vladimir Gurvich is an author at Rutgers, The State University of New Jersey specializing in discrete mathematics, combinatorial optimization, and graph theory.

ORCID

Top concepts

EngineeringDiscrete MathematicsGraph TheoryCombinatorial OptimizationMathematical ProgrammingMechanism DesignComputational ComplexityBusinessGame TheoryNetwork Science

Publications per year

1987–2017

Publications

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

Leonid Khachiyan, Endre Boros, Konrad Borys et al. · Theory of Computing Systems · 2007 · 106 citations · Full text

Perfect graphs, kernels, and cores of cooperative games

Endre Boros, Vladimir Gurvich · Discrete Mathematics · 2006 · 75 citations

Cooperative Games, Network Science, Graph Theory +10

On the Complexity of Some Enumeration Problems for Matroids

Leonid Khachiyan, Endre Boros, Khaled Elbassioni et al. · SIAM Journal on Discrete Mathematics · 2005 · 68 citations

Mathematical Programming, Polymatroid Inequalities, Enumeration Problems +14

Stable matchings in three-sided systems with cyclic preferences

Endre Boros, Vladimir Gurvich, Steven Jaslar et al. · Discrete Mathematics · 2004 · 42 citations

Mathematical Programming, Engineering, Social Matching +8

Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs

Vladimir Gurvich, M. Vyalyi · Discrete Applied Mathematics · 2012 · 41 citations

Directed Graph, Graph Theory, Algebraic Graph Theory +3

Rows per page

1–5 of 27