( en | de | ru )

 

Disambiguation of "Gurvich, Vladimir"

Author of the publication

copydeleteadd this publication to your clipboard
Generating Minimal k-Vertex Connected Spanning Subgraphs.

, , , , , and . COCOON, volume 4598 of Lecture Notes in Computer Science, page 222-231. Springer, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Vladimir Milutinovi

Vladimir Spokoiny

Vladimir Borisov

Vladimir Bondarev

Vladimir Zonine

 

Other publications of authors with the same name

A Convex Programming-based Algorithm for Mean Payoff Stochastic Games with Perfect Information., , , and . CoRR, (2016)Nested Family of Cyclic Games with $k$-total Effective Rewards., , , and . CoRR, (2014)Shifting paths to avoidable ones., , , and . CoRR, (2020)On the degree sequences of dual graphs on surfaces., , , and . CoRR, (2020)Stable effectivity functions and perfect graphs., and . Math. Soc. Sci., 39 (2): 175-194 (2000)An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension., , , and . Parallel Process. Lett., 10 (4): 253-266 (2000)Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data., , , , and . Theor. Comput. Sci., 379 (3): 361-376 (2007)Decomposing 1-Sperner Hypergraphs., , and . Electron. J. Comb., 26 (3): 3 (2019)A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and a Few Random Positions., , , and . ICALP (1), volume 7965 of Lecture Notes in Computer Science, page 220-231. Springer, (2013)Nash-solvable two-person symmetric cycle game forms., , , and . Discret. Appl. Math., 159 (15): 1461-1487 (2011)