◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

O. Verbitsky

30 papers hereh-index 19987 citations78 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author4
  • first author4
  • middle author2
  • last author19

Across the 29 of 30 papers where every author was matched, so the position is known.

fields
  • cs.CC14
  • math.CO8
  • cs.DM4
  • math.LO3
  • cs.LO1

identity via Semantic Scholar / OpenAlex

activity
20012024
most citedHow Much Work Does It Take To Straighten a Plane Graph Out?

3 citations · 6 across the 21 of their papers we have counts for

collaborators
Showing 2015Show all

1 paper · 1 filter

cs.CC2015★ 1 cited

Graph Isomorphism, Color Refinement, and Compactness

V. Arvind, Johannes Köbler, Gaurav Rattan +1

Color refinement is a classical technique used to show that two given graphs G and H are non-isomorphic; it is very efficient, although it does not succeed on all graphs. We call a…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.