( en | de | ru )

 

Disambiguation of "Verbitsky, Oleg"

Author of the publication

copydeleteadd this publication to your clipboard
Untangling planar graphs from a specified vertex position - Hard cases.

, , , , and . Discret. Appl. Math., 159 (8): 789-799 (2011)

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.

Diego José Olego

Yaroslavskyy Oleg

Oleg Nivievskyi

Oleg Kashin

Oleg Kovalev

 

Other publications of authors with the same name

On collinear sets in straight line drawings, and . CoRR, (2008)The first order definability of graphs: Upper bounds for quantifier depth., , and . Discret. Appl. Math., 154 (17): 2511-2529 (2006)Fermat's Spiral and the Line Between Yin and Yang., , and . Am. Math. Mon., 117 (9): 786-800 (2010)Descriptive complexity of finite structures: Saving the quantifier rank., and . J. Symb. Log., 70 (2): 419-450 (2005)On the Weisfeiler-Leman dimension of fractional packing., , , and . Inf. Comput., (2022)On Collinear Sets in Straight-Line Drawings., and . WG, volume 6986 of Lecture Notes in Computer Science, page 295-306. Springer, (2011)Testing Graph Isomorphism in Parallel by Playing a Game., and . ICALP (1), volume 4051 of Lecture Notes in Computer Science, page 3-14. Springer, (2006)On a Hierarchy of Spectral Invariants for Graphs., , , and . STACS, volume 289 of LIPIcs, page 6:1-6:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Towards the Parallel Repetition Conjecture.. Theor. Comput. Sci., 157 (2): 277-282 (1996)On the obfuscation complexity of planar graphs.. Theor. Comput. Sci., 396 (1-3): 294-300 (2008)