pith. sign in

Oleg Verbitsky

Identifiers

  • name variant Oleg Verbitsky 0.60 · backfill

Papers (34)

  1. On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties cs.DM · 2018 · author #4
  2. Tight Bounds on the Asymptotic Descriptive Complexity of Subgraph Isomorphism cs.CC · 2018 · author #1
  3. The Descriptive Complexity of Subgraph Isomorphism without Numerics cs.CC · 2016 · author #1
  4. Drawing Graphs on Few Lines and Few Planes cs.CG · 2016 · author #5
  5. Graph Isomorphism, Color Refinement, and Compactness cs.CC · 2015 · author #4
  6. Universal covers, color refinement, and two-variable counting logic: Lower bounds for the depth cs.LO · 2014 · author #2
  7. On the Isomorphism Problem for Helly Circular-Arc Graphs cs.CC · 2014 · author #3
  8. On the dynamic width of the 3-colorability problem cs.CC · 2013 · author #3
  9. Circular-arc hypergraphs: Rigidity via Connectedness cs.DM · 2013 · author #3
  10. On the speed of constraint propagation and the time complexity of arc consistency testing cs.LO · 2013 · author #2
  11. Bounds for the quantifier depth in finite-variable logics: Alternation hierarchy cs.LO · 2012 · author #3
  12. Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Log-Space cs.CC · 2012 · author #3
  13. Logical complexity of graphs: a survey math.CO · 2010 · author #2
  14. Fermat's spiral and the line between Yin and Yang math.CO · 2009 · author #2
  15. On collinear sets in straight line drawings cs.CG · 2008 · author #2
  16. Untangling planar graphs from a specified vertex position - Hard cases cs.DM · 2008 · author #5
  17. Zero-Knowledge Proofs of the Conjugacy for Permutation Groups cs.CC · 2008 · author #1
  18. On the Double Coset Membership Problem for Permutation Groups cs.CC · 2008 · author #1
  19. How Much Work Does It Take To Straighten a Plane Graph Out? math.CO · 2007 · author #3
  20. On the Obfuscation Complexity of Planar Graphs cs.DM · 2007 · author #1
  21. From Invariants to Canonization in Parallel cs.CC · 2006 · author #2
  22. On the logical complexity of convex polygon dissections math.CO · 2006 · author #3
  23. Planar Graphs: Logical Complexity and Parallel Isomorphism Tests cs.CC · 2006 · author #1
  24. Testing Graph Isomorphism in Parallel by Playing a Game cs.CC · 2006 · author #2
  25. First Order Definability of Trees and Sparse Random Graphs math.CO · 2005 · author #7
  26. On the Computational Complexity of the Forcing Chromatic Number cs.CC · 2004 · author #3
  27. Definitions with no quantifier alternation math.LO · 2004 · author #3
  28. On the Lengths of Symmetry Breaking-Preserving Games on Graphs math.CO · 2004 · author #3
  29. The First Order Definability of Graphs with Separators via the Ehrenfeucht Game math.CO · 2004 · author #1
  30. Succinct Definitions in the First Order Theory of Graphs math.LO · 2004 · author #3
  31. How Complex are Random Graphs in First Order Logic? math.CO · 2004 · author #4
  32. The First Order Definability of Graphs: Upper Bounds for Quantifier Rank math.CO · 2003 · author #3
  33. Descriptive Complexity of Finite Structures: Saving the Quantifier Rank math.LO · 2003 · author #2
  34. A Symmetric Strategy in Graph Avoidance Games cs.DM · 2001 · author #3

Mentions

  • 1202.4406 #3 · backfill · confidence 0.70 Oleg Verbitsky
  • 1003.4865 #2 · backfill · confidence 0.70 Oleg Verbitsky
  • 0902.1556 #2 · backfill · confidence 0.70 Oleg Verbitsky
  • 0806.0253 #2 · backfill · confidence 0.70 Oleg Verbitsky
  • 0803.0858 #5 · backfill · confidence 0.70 Oleg Verbitsky
  • 0801.4917 #1 · backfill · confidence 0.70 Oleg Verbitsky
  • 0801.4911 #1 · backfill · confidence 0.70 Oleg Verbitsky
  • 0707.3373 #3 · backfill · confidence 0.70 Oleg Verbitsky
  • 0705.3748 #1 · backfill · confidence 0.70 Oleg Verbitsky

Frequent Coauthors