| On the Weisfeiler-Leman dimension of fractional packing | 0 | 0.34 | 2022 |
| The Weifeiler-Leman Algorithm and Recognition of Graph Properties | 0 | 0.34 | 2021 |
| Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm. | 0 | 0.34 | 2020 |
| On the Weisfeiler-Leman Dimension of Fractional Packing. | 0 | 0.34 | 2020 |
| Tight Bounds on the Asymptotic Descriptive Complexity of Subgraph Isomorphism. | 0 | 0.34 | 2018 |
| Circular-arc hypergraphs: Rigidity via Connectedness. | 0 | 0.34 | 2017 |
| The Descriptive Complexity of Subgraph Isomorphism Without Numerics. | 1 | 0.39 | 2017 |
| ON THE FIRST-ORDER COMPLEXITY OF INDUCED SUBGRAPH ISOMORPHISM | 1 | 0.41 | 2017 |
| The Complexity of Drawing Graphs on Few Lines and Few Planes. | 4 | 0.44 | 2017 |
| Drawing Graphs On Few Lines And Few Planes | 4 | 0.46 | 2016 |
| The Descriptive Complexity of Subgraph Isomorphism in the Absence of Order. | 0 | 0.34 | 2016 |
| Universal Covers, Color Refinement, and Two-Variable Counting Logic: Lower Bounds for the Depth | 4 | 0.41 | 2015 |
| On the isomorphism problem for Helly circular-arc graphs. | 1 | 0.35 | 2014 |
| Helly Circular-Arc Graph Isomorphism Is in Logspace. | 6 | 0.49 | 2013 |
| On the speed of constraint propagation and the time complexity of arc consistency testing | 2 | 0.40 | 2013 |
| On the dynamic width of the 3-colorability problem. | 0 | 0.34 | 2013 |
| Bounds for the Quantifier Depth in Finite-Variable Logics: Alternation Hierarchy | 1 | 0.35 | 2013 |
| Around and Beyond the Isomorphism Problem for Interval Graphs. | 0 | 0.34 | 2012 |
| Bounds for the quantifier depth in two-variable logic | 0 | 0.34 | 2012 |
| Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Logspace. | 3 | 0.40 | 2012 |
| On collinear sets in straight-line drawings | 7 | 0.52 | 2011 |
| Interval graphs: canonical representation in logspace | 7 | 0.49 | 2010 |
| Fermat's spiral and the line between Yin and Yang | 0 | 0.34 | 2010 |
| Logical complexity of graphs: a survey | 8 | 0.54 | 2010 |
| On the obfuscation complexity of planar graphs | 9 | 0.97 | 2008 |
| Obfuscated Drawings of Planar Graphs | 4 | 0.57 | 2008 |
| On the Double Coset Membership Problem for Permutation Groups | 0 | 0.34 | 2008 |
| Zero-Knowledge Proofs of the Conjugacy for Permutation Groups | 0 | 0.34 | 2008 |
| Planar graphs: logical complexity and parallel isomorphism tests | 8 | 0.52 | 2007 |
| On the Computational Complexity of the Forcing Chromatic Number | 4 | 0.59 | 2007 |
| Decomposable graphs and definitions with no quantifier alternation | 3 | 0.41 | 2007 |
| First-Order Definability of Trees and Sparse Random Graphs | 2 | 0.39 | 2007 |
| Succinct definitions in the first order theory of graphs | 9 | 1.12 | 2006 |
| The first order definability of graphs: upper bounds for quantifier depth | 8 | 0.72 | 2006 |
| Testing graph isomorphism in parallel by playing a game | 26 | 0.93 | 2006 |
| How complex are random graphs in first order logic? | 9 | 0.77 | 2005 |
| The first order definability of graphs with separators via the Ehrenfeucht game | 6 | 0.54 | 2005 |
| Descriptive complexity of finite structures: Saving the quantifier rank | 6 | 0.86 | 2005 |
| Error Reduction by Parallel Repetition - A Negative Result | 26 | 2.60 | 2002 |
| Remarks on a Query-Based Variant of the Parallel Repetition Theorem | 0 | 0.34 | 2001 |
| A Symmetric Strategy in Graph Avoidance Games | 3 | 0.68 | 2001 |
| Arthur-Merlin games in Boolean decision trees | 2 | 0.36 | 1999 |
| The Parallel Repetition Conjecture for Trees is True | 3 | 1.18 | 1995 |
| On the Hardness of Approximating Some Optimization Problems That Are Supposedly Easier Than MAX CLIQUE | 0 | 0.34 | 1995 |
| Towards the parallel repetition conjecture | 14 | 3.57 | 1994 |
