BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × France
1 × Japan
2 × Italy
Collaborated with:
A.Krebs M.Grohe M.Zhukovskii C.Berkholz J.Köbler S.Kuhnert B.Laubner
Talks about:
isomorph (2) variabl (2) logic (2) graph (2) depth (2) bound (2) represent (1) hierarchi (1) subgraph (1) quantifi (1)

Person: Oleg Verbitsky

DBLP DBLP: Verbitsky:Oleg

Contributed to:

LICS 20152015
CSL 20132013
ICALP (1) 20102010
ICALP (1) 20062006
CSL 20172017

Wrote 5 papers:

LICS-2015-KrebsV #bound #logic #refinement
Universal Covers, Color Refinement, and Two-Variable Counting Logic: Lower Bounds for the Depth (AK, OV), pp. 689–700.
CSL-2013-BerkholzKV #bound #logic #quantifier
Bounds for the quantifier depth in finite-variable logics: Alternation hierarchy (CB, AK, OV), pp. 61–80.
ICALP-v1-2010-KoblerKLV #canonical #graph #representation
Interval Graphs: Canonical Representation in Logspace (JK, SK, BL, OV), pp. 384–395.
ICALP-v1-2006-GroheV #game studies #graph #morphism #parallel #testing
Testing Graph Isomorphism in Parallel by Playing a Game (MG, OV), pp. 3–14.
CSL-2017-VerbitskyZ #complexity #first-order #morphism #on the
On the First-Order Complexity of Induced Subgraph Isomorphism (OV, MZ), p. 16.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.