The following pages link to Anuj Dawar (Q309796):
Displaying 50 items.
- Graph isomorphism parameterized by elimination distance to bounded degree (Q309797) (← links)
- The dag-width of directed graphs (Q444380) (← links)
- Modal characterisation theorems over special classes of frames (Q732052) (← links)
- Backtracking games and inflationary fixed points (Q817842) (← links)
- Expressiveness and complexity of graph logic (Q870359) (← links)
- Homomorphism preservation on quasi-wide classes (Q980940) (← links)
- Affine systems of equations and counting infinitary logic (Q1014638) (← links)
- A restricted second order logic for finite structures (Q1271559) (← links)
- Pebble games and cospectral graphs (Q1689933) (← links)
- Infinitary logic and inductive definability over finite structures (Q1893734) (← links)
- The expressive power of finitely many generalized quantifiers (Q1908344) (← links)
- Decidable fragments of the simple theory of types with infinity and NF (Q2013397) (← links)
- Generalizations of \(k\)-dimensional Weisfeiler-Leman stabilization (Q2211259) (← links)
- Descriptive complexity of graph spectra (Q2273011) (← links)
- Generalising automaticity to modal properties of finite structures (Q2373714) (← links)
- The monadic theory of finite representations of infinite words (Q2379951) (← links)
- Fixed-parameter tractable distances to sparse graph classes (Q2408199) (← links)
- Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs (Q2478545) (← links)
- On Symmetric and Choiceless Computation (Q2798017) (← links)
- Definability of linear equation systems over groups and rings (Q2865066) (← links)
- Domination problems in nowhere-dense classes of graphs (Q2920123) (← links)
- Structure and specification as sources of complexity (Q2920148) (← links)
- Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree (Q2946014) (← links)
- Capturing MSO with One Quantifier (Q2947170) (← links)
- The Ackermann Award 2013 (Q2958505) (← links)
- (Q3000099) (← links)
- (Q3007256) (← links)
- Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers (Q3167000) (← links)
- Pebble Games with Algebraic Rules (Q3167016) (← links)
- (Q3172124) (← links)
- Parameterized Complexity Classes under Logical Reductions (Q3182930) (← links)
- Preservation under Extensions on Well-Behaved Finite Structures (Q3395035) (← links)
- On the Descriptive Complexity of Linear Algebra (Q3511442) (← links)
- On Datalog vs. LFP (Q3519499) (← links)
- Finite Model Theory on Tame Classes of Structures (Q3525551) (← links)
- The Descriptive Complexity of Parity Games (Q3540190) (← links)
- On preservation under homomorphisms and unions of conjunctive queries (Q3546314) (← links)
- Properties of Almost All Graphs and Generalized Quantifiers (Q3561218) (← links)
- On Complete Problems, Relativizations and Logics for Complexity Classes (Q3586004) (← links)
- Model-Checking First-Order Logic: Automata and Locality (Q3608400) (← links)
- The Power of Counting Logics on Restricted Classes of Finite Structures (Q3608406) (← links)
- Separating Graph Logic from MSO (Q3617721) (← links)
- Elementary Properties of the Finite Ranks (Q4210837) (← links)
- (Q4249221) (← links)
- Capturing Relativized Complexity Classes without Order (Q4379631) (← links)
- (Q4381409) (← links)
- Fixed-point Logics with Nondeterministic Choice (Q4434612) (← links)
- Fixed Point Logics (Q4532728) (← links)
- Bounded degree and planar spectra (Q4596783) (← links)
- Implicit definability and infinitary logic in finite model theory (Q4645216) (← links)
