Vladimir Gurvich 个人学术档案

引用次数

	总计	2019 年至今
引用	4565	1237
h 指数	32	15
i10 指数	117	39

360

180

270

199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202413 14 12 9 23 13 15 31 40 83 37 111 107 94 99 129 135 269 212 196 171 163 173 203 169 172 200 266 191 214 201 188 346 92

开放获取的出版物数量

查看全部

13 篇文章

2 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Endre BorosDistinguished Professor, MSIS Department, Rutgers University在 rutgers.edu 的电子邮件经过验证
Martin MilaničUniversity of Primorska, Koper, Slovenia在 upr.si 的电子邮件经过验证
Nhan Bao HoLa Trobe在 latrobe.edu.au 的电子邮件经过验证
Gabor RudolfKoc University在 ku.edu.tr 的电子邮件经过验证
VyalyiФИЦ ИУ РАН在 hse.ru 的电子邮件经过验证
Alexander KoganRutgers Business School在 rutgers.edu 的电子邮件经过验证
Leonid LibkinProfessor of Computer Science, University of Edinburgh在 inf.ed.ac.uk 的电子邮件经过验证
Jernej VičičUniversity of Primorska, FAMNIT and Research Centre of the Slovenian Academy of Sciences and Arts在 upr.si 的电子邮件经过验证
Thomas Dueholm HansenFormer Associate professor, University of Copenhagen在 di.ku.dk 的电子邮件经过验证
Bodo MantheyAssociate Professor, University of Twente在 utwente.nl 的电子邮件经过验证
Stephane GaubertDirecteur de recherche, INRIA and CMAP, Ecole polytechnique在 inria.fr 的电子邮件经过验证
Hans Raj TiwaryCharles University, Prague在 kam.mff.cuni.cz 的电子邮件经过验证
Martin GolumbicProfessor of Computer Science, University of Haifa在 cs.haifa.ac.il 的电子邮件经过验证
Urban LarssonAssociate Professor, IEOR, IIT Bombay在 iitb.ac.in 的电子邮件经过验证
Stefan HougardyProfessor of Mathematics, University of Bonn在 or.uni-bonn.de 的电子邮件经过验证
Dávid PappAssociate Professor of Mathematics, North Carolina State University在 ncsu.edu 的电子邮件经过验证
Sergei SchreiderRutgers Business School, Rutgers University在 rutgers.edu 的电子邮件经过验证
Peter Bro MiltersenFormer Professor of Computer Science at Aarhus University在 cs.au.dk 的电子邮件经过验证
Gleb KoshevoyIITP RAN在 cemi.rssi.ru 的电子邮件经过验证
Amr ElmasryProfessor, Egypt University of Informatics and Alexandria University在 eui.edu.eg 的电子邮件经过验证

关注

Vladimir Gurvich

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

在 hse.ru 的电子邮件经过验证

Games graphs Boolean functions algorithms and complexity


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
Generating all vertices of a polyhedron is hard L Khachiyan, E Boros, K Borys, V Gurvich, K Elbassioni Twentieth Anniversary Volume: Discrete & Computational Geometry, 1-17, 2009	248	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	196	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	181	1999
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	138	2008
Perfect graphs, kernels, and cores of cooperative games E Boros, V Gurvich Discrete mathematics 306 (19-20), 2336-2354, 2006	124	2006
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	122	2002
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	96	2005
Dual subimplicants of positive Boolean functions E Boros, V Gurvich, PL Hammer Optimization Methods and Software 10 (2), 147-156, 1998	89	1998
Perfect graphs are kernel solvable E Boros, V Gurvich Discrete Mathematics 159 (1-3), 35-55, 1996	87	1996
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	81	2002
Repetition-free boolean functions VA Gurvich Uspekhi Matematicheskikh Nauk 32 (1), 183-184, 1977	80	1977
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	76	2000
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	73	2006
Equilibrium in pure strategies VA Gurvich Doklady Akademii Nauk 303 (4), 789-793, 1988	70	1988
Stable matchings in three-sided systems with cyclic preferences E Boros, V Gurvich, S Jaslar, D Krasner Discrete Mathematics 289 (1-3), 1-10, 2004	68	2004
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	64	2004
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	64	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	57	1995
On theory of multistep games VA Gurvich USSR Computational Mathematics and Mathematical Physics 13 (6), 143-161, 1973	55	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, 211-221, 2003	49	2003

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用