The following pages link to Oleg Verbitsky (Q259080):
Displayed 20 items.
- Drawing graphs on few lines and few planes (Q5132649) (← links)
- Tight Bounds on the Asymptotic Descriptive Complexity of Subgraph Isomorphism (Q5222874) (← links)
- REMARKS ON A QUERY-BASED VARIANT OF THE PARALLEL REPETITION THEOREM (Q5249275) (← links)
- On the Computational Complexity of the Forcing Chromatic Number (Q5454241) (← links)
- (Q5487253) (← links)
- STACS 2005 (Q5710673) (← links)
- Descriptive complexity of finite structures: Saving the quantifier rank (Q5718668) (← links)
- Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm (Q5874317) (← links)
- On the Weisfeiler-Leman dimension of fractional packing (Q5896136) (← links)
- On the Weisfeiler-Leman dimension of fractional packing (Q5918531) (← links)
- On Weisfeiler-Leman invariance: subgraph counts and related graph properties (Q5918849) (← links)
- On Weisfeiler-Leman invariance: subgraph counts and related graph properties (Q5919354) (← links)
- The descriptive complexity of subgraph isomorphism without numerics (Q5919541) (← links)
- The Weisfeiler-Leman algorithm and recognition of graph properties (Q5925529) (← links)
- The Weisfeiler-Leman algorithm and recognition of graph properties (Q5925678) (← links)
- On anti-stochastic properties of unlabeled graphs (Q6039431) (← links)
- The Complexity of Drawing Graphs on Few Lines and Few Planes (Q6075709) (← links)
- How Much Work Does It Take To Straighten a Plane Graph Out? (Q6206270) (← links)
- The Weisfeiler-Leman Algorithm and Recognition of Graph Properties (Q6340948) (← links)
- On the logical complexity of convex polygon dissections (Q6477562) (← links)