( en | de | ru )

 

Disambiguation of "Verbitsky, Oleg"

Author of the publication

copydeleteadd this publication to your clipboard
On Collinear Sets in Straight-Line Drawings.

, and . WG, volume 6986 of Lecture Notes in Computer Science, page 295-306. Springer, (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 Lewitzki

Oleg Smirnow

Oleg Balachov

 

Other publications of authors with the same name

Canonization of a Random Graph by Two Matrix-Vector Multiplications., and . ESA, volume 274 of LIPIcs, page 100:1-100:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)On Anti-stochastic Properties of Unlabeled Graphs., , , and . WG, volume 13453 of Lecture Notes in Computer Science, page 300-312. Springer, (2022)Arthur-Merlin Games in Boolean Decision Trees., , , and . CCC, page 58-67. IEEE Computer Society, (1998)Canonization of a Random Circulant Graph by Counting Walks., and . WALCOM, volume 14549 of Lecture Notes in Computer Science, page 319-334. Springer, (2024)On collinear sets in straight line drawings, and . CoRR, (2008)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)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)Canonization of a random circulant graph by counting walks., and . CoRR, (2023)Tight Bounds on the Asymptotic Descriptive Complexity of Subgraph Isomorphism., and . CoRR, (2018)