◍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 2020Show all

2 papers · 1 filter

math.CO2020

The Weisfeiler-Leman Algorithm and Recognition of Graph Properties

Frank Fuhlbrück, Johannes Köbler, Ilia Ponomarenko +1

The k-dimensional Weisfeiler-Leman algorithm (k-WL) is a very useful combinatorial tool in graph isomorphism testing. We address the applicability of k-WL to recognition of g…

cs.CC2020

Local WL Invariance and Hidden Shades of Regularity

Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky

The k-dimensional Weisfeiler-Leman algorithm is a powerful tool in graph isomorphism testing. For an input graph G, the algorithm determines a canonical coloring of s-tuples…

◍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.