The following pages link to Oleg Verbitsky (Q259080):
Displaying 50 items.
- On the isomorphism problem for Helly circular-arc graphs (Q259081) (← links)
- Solving the canonical representation and star system problems for proper circular-arc graphs in logspace (Q350727) (← links)
- Circular-arc hypergraphs: rigidity via connectedness (Q516817) (← links)
- Untangling planar graphs from a specified vertex position-Hard cases (Q534342) (← links)
- The first order definability of graphs: Upper bounds for quantifier depth (Q860411) (← links)
- On the obfuscation complexity of planar graphs (Q924163) (← links)
- Towards the parallel repetition conjecture (Q1351513) (← links)
- Error reduction by parallel repetition - a negative result (Q1397480) (← links)
- (Q1885001) (redirect page) (← links)
- On the lengths of symmetry breaking-preserving games on graphs (Q1885002) (← links)
- Arthur-Merlin games in Boolean decision trees (Q1961380) (← links)
- Local WL invariance and hidden shades of regularity (Q2235273) (← links)
- Succinct definitions in the first order theory of graphs (Q2368907) (← links)
- The complexity of drawing graphs on few lines and few planes (Q2405289) (← links)
- On the speed of constraint propagation and the time complexity of arc consistency testing (Q2409578) (← links)
- Graph isomorphism, color refinement, and compactness (Q2410688) (← links)
- Decomposable graphs and definitions with no quantifier alternation (Q2461780) (← links)
- The first order definability of graphs with separators via the Ehrenfeucht game (Q2570131) (← links)
- On the Speed of Constraint Propagation and the Time Complexity of Arc Consistency Testing (Q2849906) (← links)
- Helly Circular-Arc Graph Isomorphism Is in Logspace (Q2849949) (← links)
- On Tinhofer’s Linear Programming Approach to Isomorphism Testing (Q2946374) (← links)
- Bounds for the Quantifier Depth in Finite-Variable Logics (Q2946761) (← links)
- On the Power of Color Refinement (Q2947892) (← links)
- Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Logspace (Q2957515) (← links)
- (Q2958513) (← links)
- Drawing Graphs on Few Lines and Few Planes (Q2961513) (← links)
- Fermat’s Spiral and the Line Between Yin and Yang (Q3061287) (← links)
- On Collinear Sets in Straight-Line Drawings (Q3104785) (← links)
- Interval Graphs: Canonical Representations in Logspace (Q3115868) (← links)
- Logical complexity of graphs: a survey (Q3118383) (← links)
- (Q3121527) (← links)
- First-Order Definability of Trees and Sparse Random Graphs (Q3438138) (← links)
- From Invariants to Canonization in Parallel (Q3503640) (← links)
- (Q3576654) (← links)
- Interval Graphs: Canonical Representation in Logspace (Q3587393) (← links)
- Planar Graphs: Logical Complexity and Parallel Isomorphism Tests (Q3590975) (← links)
- (Q3607789) (← links)
- Testing Graph Isomorphism in Parallel by Playing a Game (Q3613744) (← links)
- (Q4258571) (← links)
- (Q4407715) (← links)
- (Q4455756) (← links)
- (Q4500965) (← links)
- (Q4584888) (← links)
- Universal Covers, Color Refinement, and Two-Variable Counting Logic: Lower Bounds for the Depth (Q4635847) (← links)
- How complex are random graphs in first order logic? (Q4667860) (← links)
- (Q4676817) (← links)
- On the Hardness of Approximating Some Optimization Problems That Are Supposedly Easier Than MAX CLIQUE (Q4852431) (← links)
- (Q4936140) (← links)
- Identifiability of Graphs with Small Color Classes by the Weisfeiler--Leman Algorithm (Q5009334) (← links)
- On the First-Order Complexity of Induced Subgraph Isomorphism (Q5111210) (← links)