Vladimir Gurvich

	2009
63		Daniel Andersson, Vladimir Gurvich, Thomas Dueholm Hansen: On Acyclicity of Games with Cycles. AAIM 2009: 15-28
62		Vladimir Gurvich, Igor E. Zverovich: Neighborhood hypergraphs of digraphs and some matrix permutation problems. Discrete Applied Mathematics 157(13): 2836-2845 (2009)
61		Vladimir Gurvich: Decomposing complete edge-chromatic graphs and hypergraphs. Revisited. Discrete Applied Mathematics 157(14): 3069-3085 (2009)
	2008
60		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Vladimir Oudalov: A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames. CSR 2008: 99-109
59		Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich: On Enumerating Minimal Dicuts and Strongly Connected Subgraphs. Algorithmica 50(1): 159-172 (2008)
58		Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino: Generating Cut Conjunctions in Graphs and Related Problems. Algorithmica 51(3): 239-263 (2008)
57		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Hans Raj Tiwary: Characterization of the vertices and extreme directions of the negative cycle polyhedron and harness of generating vertices of $0/1$-polyhedra CoRR abs/0801.3790: (2008)
56		Vladimir Gurvich, Peter Bro Miltersen: On the computational complexity of solving stochastic mean-payoff games CoRR abs/0812.0486: (2008)
55		Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich: Generating All Vertices of a Polyhedron Is Hard. Discrete & Computational Geometry 39(1-3): 174-190 (2008)
54		Vladimir Gurvich: Recalling Leo. Discrete Applied Mathematics 156(11): 1957-1960 (2008)
53		Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich: Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions. Discrete Applied Mathematics 156(11): 2020-2034 (2008)
52		Endre Boros, Vladimir Gurvich: Scientific contributions of Leo Khachiyan (a short overview). Discrete Applied Mathematics 156(11): 2232-2240 (2008)
51		Vladimir Gurvich: On cyclically orientable graphs. Discrete Mathematics 308(1): 129-135 (2008)
50		Endre Boros, Konrad Borys, Vladimir Gurvich, Gábor Rudolf: Generating 3-vertex connected spanning subgraphs. Discrete Mathematics 308(24): 6285-6297 (2008)
49		Vladimir Gurvich: War and peace in veto voting. European Journal of Operational Research 185(1): 438-443 (2008)
48		Endre Boros, Vladimir Gurvich, Igor E. Zverovich: Neighborhood hypergraphs of bipartite graphs. Journal of Graph Theory 58(1): 69-95 (2008)
47		Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Gábor Rudolf, Jihui Zhao: On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction. Theory Comput. Syst. 43(2): 204-233 (2008)
	2007
46		Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Gábor Rudolf: Generating Minimal k-Vertex Connected Spanning Subgraphs. COCOON 2007: 222-231
45		Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino: Enumerating disjunctions and conjunctions of paths and cuts in reliability theory. Discrete Applied Mathematics 155(2): 137-149 (2007)
44		Vladimir Gurvich: On the misere version of game Euclid and miserable games. Discrete Mathematics 307(9-10): 1199-1204 (2007)
43		Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich: A global parallel algorithm for the hypergraph transversal problem. Inf. Process. Lett. 101(4): 148-155 (2007)
42		Leonid Khachiyan, Endre Boros, Vladimir Gurvich, Khaled M. Elbassioni: Computing Many Maximal Independent Sets for Hypergraphs in Parallel. Parallel Processing Letters 17(2): 141-152 (2007)
41		Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino: Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data. Theor. Comput. Sci. 379(3): 361-376 (2007)
40		Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich: On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs. Theor. Comput. Sci. 382(2): 139-150 (2007)
	2006
39		Leonid Khachiyan, Vladimir Gurvich, Jihui Zhao: Extending Dijkstra's Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction. CSR 2006: 221-234
38		Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino: Enumerating Spanning and Connected Subsets in Graphs and Matroids. ESA 2006: 444-455
37		Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich: Generating all vertices of a polyhedron is hard. SODA 2006: 758-765
36		Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich: An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation. Discrete Applied Mathematics 154(16): 2350-2372 (2006)
35		Endre Boros, Vladimir Gurvich: Perfect graphs, kernels, and cores of cooperative games. Discrete Mathematics 306(19-20): 2336-2354 (2006)
34		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich: Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms. Journal of Graph Theory 53(3): 209-232 (2006)
	2005
33		Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich: A New Algorithm for the Hypergraph Transversal Problem. COCOON 2005: 767-776
32		Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino: Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs. ISAAC 2005: 156-165
31		Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich: Generating All Minimal Integral Solutions to Monotone and, or-Systems of Linear, Transversal and Polymatroid Inequalities. MFCS 2005: 556-567
30		Endre Boros, Vladimir Gurvich, Ying Liu: Comparison of Convex Hulls and Box Hulls. Ars Comb. 77: (2005)
29		Leonid G. Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino: On the Complexity of Some Enumeration Problems for Matroids. SIAM J. Discrete Math. 19(4): 966-984 (2005)
	2004
28		Khaled M. Elbassioni, Amr Elmasry, Vladimir Gurvich: A stronger version of Bárány's theorem in the plane. CCCG 2004: 4-6
27		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich: Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems. ESA 2004: 122-133
26		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems. IPCO 2004: 152-162
25		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections. LATIN 2004: 488-498
24		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino: Generating Paths and Cuts in Multi-pole (Di)graphs. MFCS 2004: 298-309
23		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: An Efficient Implementation of a Joint Generation Algorithm. WEA 2004: 114-128
22		Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino: Dual-bounded generating problems: weighted transversals of a hypergraph. Discrete Applied Mathematics 142(1-3): 1-15 (2004)
21		Endre Boros, Vladimir Gurvich, Roy Meshulam: Difference graphs. Discrete Mathematics 276(1-3): 59-64 (2004)
20		Endre Boros, Vladimir Gurvich, Steven Jaslar, Daniel Krasner: Stable matchings in three-sided systems with cyclic preferences. Discrete Mathematics 289(1-3): 1-10 (2004)
	2003
19		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals. ESA 2003: 556-567
18		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino: An Intersection Inequality for Discrete Distributions and Related Generation Problems. ICALP 2003: 543-555
17		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: Algorithms for Enumerating Circuits in Matroids. ISAAC 2003: 485-494
16		Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino: On Maximal Frequent and Minimal Infrequent Sets in Binary Matrices. Ann. Math. Artif. Intell. 39(3): 211-221 (2003)
15		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: An inequality for polymatroid functions and its applications. Discrete Applied Mathematics 131(2): 255-281 (2003)
	2002
14		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: Matroid Intersections, Polymatroid Inequalities, and Related Problems. MFCS 2002: 143-154
13		Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino: On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets. STACS 2002: 133-141
12		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino: Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities. SIAM J. Comput. 31(5): 1624-1643 (2002)
	2001
11		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino: On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities. ICALP 2001: 92-103
	2000
10		Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino: Generating Partial and Multiple Transversals of a Hypergraph. ICALP 2000: 588-599
9		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension. Parallel Processing Letters 10(4): 253-266 (2000)
8		Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino: Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph. SIAM J. Comput. 30(6): 2036-2050 (2000)
	1999
7		Vladimir Gurvich, Leonid Khachiyan: On Generating the Irredundant Conjunctive and Disjunctive Normal Forms of Monotone Boolean Functions. Discrete Applied Mathematics 96-97: 363-373 (1999)
	1998
6		A. Apartsin, E. Ferapontova, Vladimir Gurvich: A circular graph - counterexample to the Duchet kernel conjecture. Discrete Mathematics 178(1-3): 229-231 (1998)
5		Endre Boros, Vladimir Gurvich: A corrected version of the Duchet kernel conjecture. Discrete Mathematics 179(1-3): 231-233 (1998)
	1997
4		Vladimir Gurvich, Leonid Khachiyan: On the frequency of the most frequently occurring variable in dual monotone DNFs. Discrete Mathematics 169(1-3): 245-248 (1997)
	1996
3		Endre Boros, Vladimir Gurvich: Perfect graphs are kernel solvable. Discrete Mathematics 159(1-3): 35-55 (1996)
	1995
2		Endre Boros, Vladimir Gurvich, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan: Decomposability of Partially Defined Boolean Functions. Discrete Applied Mathematics 62(1-3): 51-75 (1995)
1		Leonid Libkin, Vladimir Gurvich: Trees as semilattices. Discrete Mathematics 145(1-3): 321-327 (1995)

Coauthor Index

1	Daniel Andersson	[63]
2	A. Apartsin	[6]
3	Endre Boros	[2] [3] [5] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25] [26] [27] [29] [30] [31] [32] [33] [34] [35] [36] [37] [38] [40] [41] [42] [43] [45] [46] [47] [48] [50] [52] [53] [55] [57] [58] [59] [60]
4	Konrad Borys	[32] [37] [38] [46] [47] [50] [55] [58]
5	Khaled M. Elbassioni	[9] [11] [12] [14] [15] [17] [18] [19] [23] [24] [25] [26] [27] [28] [29] [31] [32] [33] [34] [36] [37] [38] [40] [41] [42] [43] [45] [46] [47] [53] [55] [57] [58] [59] [60]
6	Amr Elmasry	[28]
7	E. Ferapontova	[6]
8	Peter L. Hammer	[2]
9	Thomas Dueholm Hansen	[63]
10	Toshihide Ibaraki	[2]
11	Steven Jaslar	[20]
12	Leonid Khachiyan (Leonid G. Khachiyan)	[4] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [22] [23] [24] [25] [26] [29] [31] [32] [33] [36] [37] [38] [39] [40] [41] [42] [43] [45] [47] [53] [55] [58] [59]
13	Alexander Kogan	[2]
14	Daniel Krasner	[20]
15	Leonid Libkin	[1]
16	Ying Liu	[30]
17	Kazuhisa Makino	[8] [10] [11] [12] [13] [16] [18] [22] [24] [29] [32] [38] [41] [45] [46] [58] [60]
18	Roy Meshulam	[21]
19	Peter Bro Miltersen	[56]
20	Vladimir Oudalov	[60]
21	Gábor Rudolf	[46] [47] [50]
22	Hans Raj Tiwary	[57]
23	Jihui Zhao	[39] [47]
24	Igor E. Zverovich	[48] [62]

Colors in the list of coauthors