Vladimir Gurvich

Cited by

	All	Since 2015
Citations	3766	1257
h-index	30	17
i10-index	102	42

280

140

210

199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202011 13 10 12 6 24 10 17 34 39 79 45 104 113 98 96 125 130 266 221 194 172 170 172 193 185 178 217 274 194 200

Co-authors

Endre BorosDistinguished Professor, MSIS Department, Rutgers UniversityVerified email at rutgers.edu
Gabor RudolfKoc UniversityVerified email at ku.edu.tr
Martin MilaničUniversity of Primorska, Koper, SloveniaVerified email at upr.si
Nhan Bao HoLa TrobeVerified email at latrobe.edu.au
Alexander KoganRutgers Business SchoolVerified email at rutgers.edu
Leonid LibkinProfessor of Computer Science, University of EdinburghVerified email at inf.ed.ac.uk
VyalyiФИЦ ИУ РАНVerified email at hse.ru
Thomas Dueholm HansenFormer Associate professor, University of CopenhagenVerified email at di.ku.dk
Bodo MantheyAssociate Professor, University of TwenteVerified email at utwente.nl
Stephane GaubertDirecteur de recherche, INRIA and CMAP, Ecole polytechniqueVerified email at inria.fr
Hans Raj TiwaryCharles University, PragueVerified email at kam.mff.cuni.cz
Jernej VičičUniversity of Primorska, FAMNIT and Research Centre of the Slovenian Academy of Sciences and ArtsVerified email at upr.si
David M. BojeProfessor, Aalborg UniversityVerified email at id.aau.dk
Martin GolumbicProfessor of Computer Science, University of HaifaVerified email at cs.haifa.ac.il
Sergei SchreiderRutgers Business School, Rutgers UniversityVerified email at rutgers.edu
Stefan HougardyProfessor of Mathematics, University of BonnVerified email at or.uni-bonn.de
Dávid PappAssociate Professor of Mathematics, North Carolina State UniversityVerified email at ncsu.edu
Urban LarssonResearch fellow, National University of SingaporeVerified email at technion.ac.il
Alexander(Sasha) ApartsinTel-Aviv UniversityVerified email at tau.ac.il
Peter Bro MiltersenFormer Professor of Computer Science at Aarhus UniversityVerified email at cs.au.dk

Vladimir Gurvich

RBS and RUTCOR, Rutgers University; Higher School of Economics, Moscow, Professor

Verified email at hse.ru

Games graphs Boolean functions algorithms and complexity


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Generating all vertices of a polyhedron is hard L Khachiyan, E Boros, K Borys, V Gurvich, K Elbassioni Twentieth Anniversary Volume:, 1-17, 2009	198	2009
Cyclic games and an algorithm to find minimax cycle means in directed graphs VA Gurvich, AV Karzanov, LG Khachivan USSR Computational Mathematics and Mathematical Physics 28 (5), 85-91, 1988	169	1988
On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions V Gurvich, L Khachiyan Discrete Applied Mathematics 96, 363-373, 1999	160	1999
On the complexity of generating maximal frequent and minimal infrequent sets E Boros, V Gurvich, L Khachiyan, K Makino Annual Symposium on Theoretical Aspects of Computer Science, 133-141, 2002	113	2002
On short paths interdiction problems: Total and node-wise limited interdiction L Khachiyan, E Boros, K Borys, K Elbassioni, V Gurvich, G Rudolf, J Zhao Theory of Computing Systems 43 (2), 204-233, 2008	102	2008
Perfect graphs, kernels, and cores of cooperative games E Boros, V Gurvich Discrete mathematics 306 (19-20), 2336-2354, 2006	98	2006
Dual-bounded generating problems: All minimal integer solutions for a monotone system of linear inequalities E Boros, K Elbassioni, V Gurvich, L Khachiyan, K Makino SIAM Journal on Computing 31 (5), 1624-1643, 2002	78	2002
Dual subimplicants of positive Boolean functions E Boros, V Gurvich, PL Hammer Optimization Methods and Software 10 (2), 147-156, 1998	77	1998
Perfect graphs are kernel solvable E Boros, V Gurvich Discrete Mathematics 159 (1-3), 35-55, 1996	76	1996
On the complexity of some enumeration problems for matroids L Khachiyan, E Boros, K Elbassioni, V Gurvich, K Makino SIAM Journal on Discrete Mathematics 19 (4), 966-984, 2005	75	2005
An efficient incremental algorithm for generating all maximal independent sets in hypergraphs of bounded dimension E Boros, V Gurvich, K Elbassioni, L Khachiyan Parallel Processing Letters 10 (04), 253-266, 2000	71	2000
Repetition-free boolean functions VA Gurvich Uspekhi Matematicheskikh Nauk 32 (1), 183-184, 1977	68	1977
Equilibrium in pure strategies VA Gurvich Doklady Akademii Nauk 303 (4), 789-793, 1988	63	1988
Generating maximal independent sets for hypergraphs with bounded edge-intersections E Boros, K Elbassioni, V Gurvich, L Khachiyan Latin American Symposium on Theoretical Informatics, 488-498, 2004	62	2004
An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation L Khachiyan, E Boros, K Elbassioni, V Gurvich Discrete Applied Mathematics 154 (16), 2350-2372, 2006	60	2006
Dual-bounded generating problems: partial and multiple transversals of a hypergraph E Boros, V Gurvich, L Khachiyan, K Makino SIAM Journal on Computing 30 (6), 2036-2050, 2001	57	2001
Decomposability of partially defined Boolean functions E Boros, V Gurvich, PL Hammer, T Ibaraki, A Kogan Discrete Applied Mathematics 62 (1-3), 51-75, 1995	50	1995
On theory of multistep games VA Gurvich USSR Computational Mathematics and Mathematical Physics 13 (6), 143-161, 1973	47	1973
On maximal frequent and minimal infrequent sets in binary matrices E Boros, V Gurvich, L Khachiyan, K Makino Annals of Mathematics and Artificial Intelligence 39 (3), 211-221, 2003	44	2003
Organizational change and global standardization: Solutions to standards and norms overwhelming organizations DM Boje Routledge, 2015	43*	2015

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors