( en | de | ru )

 

Disambiguation of "Verbitsky, Oleg"

Author of the publication

copydeleteadd this publication to your clipboard
The first order definability of graphs: Upper bounds for quantifier depth.

, , and . Discret. Appl. Math., 154 (17): 2511-2529 (2006)

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.

Yaroslavskyy Oleg

Diego José Olego

Oleg Nivievskyi

Oleg Kashin

Oleg Kovalev

 

Other publications of authors with the same name

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)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)On collinear sets in straight line drawings, and . CoRR, (2008)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)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 Collinear Sets in Straight-Line Drawings., and . WG, volume 6986 of Lecture Notes in Computer Science, page 295-306. Springer, (2011)First-Order Definability of Trees and Sparse Random Graphs., , , , , , and . Comb. Probab. Comput., 16 (3): 375-400 (2007)Towards the Parallel Repetition Conjecture.. Theor. Comput. Sci., 157 (2): 277-282 (1996)