The SCEAS System
| |||||||

## Search the dblp DataBase
Vladimir Gurvich:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Khaled M. Elbassioni, Amr Elmasry, Vladimir Gurvich
**A stronger version of Bárány's theorem in the plane.**[Citation Graph (0, 0)][DBLP] CCCG, 2004, pp:4-6 [Conf] - Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
**A New Algorithm for the Hypergraph Transversal Problem.**[Citation Graph (0, 0)][DBLP] COCOON, 2005, pp:767-776 [Conf] - Leonid Khachiyan, Vladimir Gurvich, Jihui Zhao
**Extending Dijkstra's Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction.**[Citation Graph (0, 0)][DBLP] CSR, 2006, pp:221-234 [Conf] - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
**Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems.**[Citation Graph (0, 0)][DBLP] ESA, 2004, pp:122-133 [Conf] - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
**An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals.**[Citation Graph (0, 0)][DBLP] ESA, 2003, pp:556-567 [Conf] - Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
**Enumerating Spanning and Connected Subsets in Graphs and Matroids.**[Citation Graph (0, 0)][DBLP] ESA, 2006, pp:444-455 [Conf] - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
**On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities.**[Citation Graph (0, 0)][DBLP] ICALP, 2001, pp:92-103 [Conf] - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
**An Intersection Inequality for Discrete Distributions and Related Generation Problems.**[Citation Graph (0, 0)][DBLP] ICALP, 2003, pp:543-555 [Conf] - Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
**Generating Partial and Multiple Transversals of a Hypergraph.**[Citation Graph (0, 0)][DBLP] ICALP, 2000, pp:588-599 [Conf] - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
**Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems.**[Citation Graph (0, 0)][DBLP] IPCO, 2004, pp:152-162 [Conf] - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
**Algorithms for Enumerating Circuits in Matroids.**[Citation Graph (0, 0)][DBLP] ISAAC, 2003, pp:485-494 [Conf] - Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
**Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs.**[Citation Graph (0, 0)][DBLP] ISAAC, 2005, pp:156-165 [Conf] - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
**Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections.**[Citation Graph (0, 0)][DBLP] LATIN, 2004, pp:488-498 [Conf] - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
**Matroid Intersections, Polymatroid Inequalities, and Related Problems.**[Citation Graph (0, 0)][DBLP] MFCS, 2002, pp:143-154 [Conf] - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
**Generating Paths and Cuts in Multi-pole (Di)graphs.**[Citation Graph (0, 0)][DBLP] MFCS, 2004, pp:298-309 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] MFCS, 2005, pp:556-567 [Conf] - Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich
**Generating all vertices of a polyhedron is hard.**[Citation Graph (0, 0)][DBLP] SODA, 2006, pp:758-765 [Conf] - Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
**On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets.**[Citation Graph (0, 0)][DBLP] STACS, 2002, pp:133-141 [Conf] - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
**An Efficient Implementation of a Joint Generation Algorithm.**[Citation Graph (0, 0)][DBLP] WEA, 2004, pp:114-128 [Conf] - Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
**On Maximal Frequent and Minimal Infrequent Sets in Binary Matrices.**[Citation Graph (0, 0)][DBLP] Ann. Math. Artif. Intell., 2003, v:39, n:3, pp:211-221 [Journal] - Endre Boros, Vladimir Gurvich, Ying Liu
**Comparison of Convex Hulls and Box Hulls.**[Citation Graph (0, 0)][DBLP] Ars Comb., 2005, v:77, n:, pp:- [Journal] - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
**An inequality for polymatroid functions and its applications.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:131, n:2, pp:255-281 [Journal] - Endre Boros, Vladimir Gurvich, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan
**Decomposability of Partially Defined Boolean Functions.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1995, v:62, n:1-3, pp:51-75 [Journal] - Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
**Dual-bounded generating problems: weighted transversals of a hypergraph.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2004, v:142, n:1-3, pp:1-15 [Journal] - Vladimir Gurvich, Leonid Khachiyan
**On Generating the Irredundant Conjunctive and Disjunctive Normal Forms of Monotone Boolean Functions.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1999, v:96, n:, pp:363-373 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2006, v:154, n:16, pp:2350-2372 [Journal] - Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
**Enumerating disjunctions and conjunctions of paths and cuts in reliability theory.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:2, pp:137-149 [Journal] - Endre Boros, Vladimir Gurvich, Steven Jaslar, Daniel Krasner
**Stable matchings in three-sided systems with cyclic preferences.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:289, n:1-3, pp:1-10 [Journal] - Endre Boros, Vladimir Gurvich, Roy Meshulam
**Difference graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:276, n:1-3, pp:59-64 [Journal] - Endre Boros, Vladimir Gurvich
**Perfect graphs, kernels, and cores of cooperative games.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2006, v:306, n:19-20, pp:2336-2354 [Journal] - Vladimir Gurvich
**On the misere version of game Euclid and miserable games.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2007, v:307, n:9-10, pp:1199-1204 [Journal] - Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
**A global parallel algorithm for the hypergraph transversal problem.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:101, n:4, pp:148-155 [Journal] - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
**An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension.**[Citation Graph (0, 0)][DBLP] Parallel Processing Letters, 2000, v:10, n:4, pp:253-266 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2002, v:31, n:5, pp:1624-1643 [Journal] - Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
**Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2000, v:30, n:6, pp:2036-2050 [Journal] - Leonid G. Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
**On the Complexity of Some Enumeration Problems for Matroids.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2005, v:19, n:4, pp:966-984 [Journal] - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
**Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms.**[Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2006, v:53, n:3, pp:209-232 [Journal] - Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Gábor Rudolf
**Generating Minimal k-Vertex Connected Spanning Subgraphs.**[Citation Graph (0, 0)][DBLP] COCOON, 2007, pp:222-231 [Conf] - A. Apartsin, E. Ferapontova, Vladimir Gurvich
**A circular graph - counterexample to the Duchet kernel conjecture.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1998, v:178, n:1-3, pp:229-231 [Journal] - Endre Boros, Vladimir Gurvich
**A corrected version of the Duchet kernel conjecture.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1998, v:179, n:1-3, pp:231-233 [Journal] - Vladimir Gurvich, Leonid Khachiyan
**On the frequency of the most frequently occurring variable in dual monotone DNFs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:169, n:1-3, pp:245-248 [Journal] - Leonid Libkin, Vladimir Gurvich
**Trees as semilattices.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1995, v:145, n:1-3, pp:321-327 [Journal] - Endre Boros, Vladimir Gurvich
**Perfect graphs are kernel solvable.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:159, n:1-3, pp:35-55 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:379, n:3, pp:361-376 [Journal] - Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
**On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:382, n:2, pp:139-150 [Journal] **On Acyclicity of Games with Cycles.**[Citation Graph (, )][DBLP]**A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames.**[Citation Graph (, )][DBLP]**A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information.**[Citation Graph (, )][DBLP]**On Enumerating Minimal Dicuts and Strongly Connected Subgraphs.**[Citation Graph (, )][DBLP]**Generating Cut Conjunctions in Graphs and Related Problems.**[Citation Graph (, )][DBLP]**Characterization of the vertices and extreme directions of the negative cycle polyhedron and harness of generating vertices of $0/1$-polyhedra**[Citation Graph (, )][DBLP]**On the computational complexity of solving stochastic mean-payoff games**[Citation Graph (, )][DBLP]**Recalling Leo.**[Citation Graph (, )][DBLP]**Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions.**[Citation Graph (, )][DBLP]**Scientific contributions of Leo Khachiyan (a short overview).**[Citation Graph (, )][DBLP]**Neighborhood hypergraphs of digraphs and some matrix permutation problems.**[Citation Graph (, )][DBLP]**Decomposing complete edge-chromatic graphs and hypergraphs. Revisited.**[Citation Graph (, )][DBLP]**On acyclicity of games with cycles.**[Citation Graph (, )][DBLP]**Metric and ultrametric spaces of resistances.**[Citation Graph (, )][DBLP]**Generating All Vertices of a Polyhedron Is Hard.**[Citation Graph (, )][DBLP]**On cyclically orientable graphs.**[Citation Graph (, )][DBLP]**Generating 3-vertex connected spanning subgraphs.**[Citation Graph (, )][DBLP]**Vertex- and edge-minimal and locally minimal graphs.**[Citation Graph (, )][DBLP]**Minimal and locally minimal games and game forms.**[Citation Graph (, )][DBLP]**Not complementary connected and not CIS d-graphs form weakly monotone families.**[Citation Graph (, )][DBLP]**Acyclic, or totally tight, two-person game forms: Characterization and main properties.**[Citation Graph (, )][DBLP]
Search in 0.006secs, Finished in 0.010secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |