Vladimir Gurvich
Vladimir Gurvich
RBS and RUTCOR, Rutgers University; Higher School of Economics, Moscow, Professor
Подтвержден адрес электронной почты в домене hse.ru
Название
Процитировано
Процитировано
Год
Generating all vertices of a polyhedron is hard
L Khachiyan, E Boros, K Borys, V Gurvich, K Elbassioni
Twentieth Anniversary Volume:, 1-17, 2009
1972009
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
1681988
On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
V Gurvich, L Khachiyan
Discrete Applied Mathematics 96, 363-373, 1999
1601999
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
1132002
Perfect graphs, kernels, and cores of cooperative games
E Boros, V Gurvich
Discrete mathematics 306 (19-20), 2336-2354, 2006
982006
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
952008
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
772002
Dual subimplicants of positive Boolean functions
E Boros, V Gurvich, PL Hammer
Optimization Methods and Software 10 (2), 147-156, 1998
761998
Perfect graphs are kernel solvable
E Boros, V Gurvich
Discrete Mathematics 159 (1-3), 35-55, 1996
761996
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
732005
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
702000
Repetition-free boolean functions
VA Gurvich
Uspekhi Matematicheskikh Nauk 32 (1), 183-184, 1977
681977
Equilibrium in pure strategies
VA Gurvich
Doklady Akademii Nauk 303 (4), 789-793, 1988
611988
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
602006
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
592004
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
572001
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
501995
On theory of multistep games
VA Gurvich
USSR Computational Mathematics and Mathematical Physics 13 (6), 143-161, 1973
471973
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
442003
Criteria for repetition-freeness of functions in the algebra of logic
V Gurvich
Soviet Math. Dokl 43 (3), 721-726, 1991
421991
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20