A Three-Valued Interpretation of Negation in Feature Structure Descriptions. - Anuj Dawar; K. Vijay-Shanker (ACL, 1989)

An Interpretation of Negation in Feature Structure Descriptions. - Anuj Dawar; K. Vijay-Shanker (Comput. Linguistics, 1990)

First Order Logic, Fixed Point Logic and Linear Order. - Anuj Dawar; Steven Lindell; Scott Weinstein (CSL, 1995)

Implicit Definability and Infinitary Logic in Finite Model Theory. - Anuj Dawar; Lauri Hella; Phokion G. Kolaitis (ICALP, 1995)

Generalized Quantifiers and 0-1 Laws - Anuj Dawar; Erich Grädel (LICS, 1995)

Types and Indiscernibles in Finite Models. - Anuj Dawar (Logic Colloquium, 1995)

The expressive Power of Finitely Many Generalized Quantifiers. - Anuj Dawar; Lauri Hella (Inf. Comput., 1995)

Generalized Quantifiers and Logical Reducibilities. - Anuj Dawar (J. Log. Comput., 1995)

Infinitary Logic and Inductive Definability over Finite Structures - Anuj Dawar; Steven Lindell; Scott Weinstein (Inf. Comput., 1995)

Ordering Finite Variable Types with Generalized Quantifiers. - Anuj Dawar; Lauri Hella; Anil Seth (LICS, 1998)

A Restricted Second Order Logic for Finite Structures. - Anuj Dawar (Inf. Comput., 1998)

Elementary Properties of the Finite Ranks. - Anuj Dawar; Kees Doets; Steven Lindell; Scott Weinstein (Math. Log. Q., 1998)

Capturing Relativized Complexity Classes without Order. - Anuj Dawar; Georg Gottlob; Lauri Hella (Math. Log. Q., 1998)

Fixed point logics. - Anuj Dawar; Yuri Gurevich (Bull. Symb. Log., 2002)

A Fixed-Point Logic with Symmetric Choice. - Anuj Dawar; David Richerby (CSL, 2003)

Foreword. - Anuj Dawar (ICC@LICS, 2003)

Guest editorial. - Anuj Dawar; Daniel Leivant (Inf. Comput., 2003)

Fixed-point Logics with Nondeterministic Choice. - Anuj Dawar; David Richerby (J. Log. Comput., 2003)

Adjunct Elimination Through Games in Static Ambient Logic. - Anuj Dawar; Philippa Gardner; Giorgio Ghelli (FSTTCS, 2004)

On the Bisimulation Invariant Fragment of Monadic S1 in the Finite. - Anuj Dawar; David Janin (FSTTCS, 2004)

Inflationary fixed points in modal logic. - Anuj Dawar; Erich Grädel; Stephan Kreutzer (ACM Trans. Comput. Log., 2004)

How Many First-order Variables are Needed on Finite Ordered Structures? - Anuj Dawar (We Will Show Them! (1), 2005)

Complexity Bounds for Regular Games. - Paul Hunter 001; Anuj Dawar (MFCS, 2005)

Choiceless Polynomial Time, Counting and the Cai-Fürer-Immerman Graphs: (Extended Abstract). - Anuj Dawar; David Richerby; Benjamin Rossman (WoLLIC, 2005)

Approximation Schemes for First-Order Definable Optimisation Problems. - Anuj Dawar; Martin Grohe; Stephan Kreutzer; Nicole Schweikardt (LICS, 2006)

DAG-Width and Parity Games. - Dietmar Berwanger; Anuj Dawar; Paul Hunter 001; Stephan Kreutzer (STACS, 2006)

On preservation under homomorphisms and unions of conjunctive queries. - Albert Atserias; Anuj Dawar; Phokion G. Kolaitis (J. ACM, 2006)

Backtracking games and inflationary fixed points. - Anuj Dawar; Erich Grädel; Stephan Kreutzer (Theor. Comput. Sci., 2006)

Model-Checking First-Order Logic: Automata and Locality. - Anuj Dawar (CSL, 2007)

The Power of Counting Logics on Restricted Classes of Finite Structures. - Anuj Dawar; David Richerby (CSL, 2007)

Model Theory Makes Formulas Large. - Anuj Dawar; Martin Grohe; Stephan Kreutzer; Nicole Schweikardt (ICALP, 2007)

Locally Excluding a Minor. - Anuj Dawar; Martin Grohe; Stephan Kreutzer (LICS, 2007)

Finite Model Theory on Tame Classes of Structures. - Anuj Dawar (MFCS, 2007)

Expressiveness and complexity of graph logic. - Anuj Dawar; Philippa Gardner; Giorgio Ghelli (Inf. Comput., 2007)

The monadic theory of finite representations of infinite words. - Anuj Dawar; David Janin (Inf. Process. Lett., 2007)

Generalising automaticity to modal properties of finite structures. - Anuj Dawar; Stephan Kreutzer (Theor. Comput. Sci., 2007)

The Descriptive Complexity of Parity Games. - Anuj Dawar; Erich Grädel (CSL, 2008)

On Datalog vs. LFP. - Anuj Dawar; Stephan Kreutzer (ICALP (2), 2008)

On the Descriptive Complexity of Linear Algebra. - Anuj Dawar (WoLLIC, 2008)

Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs. - Anuj Dawar; David Richerby; Benjamin Rossman (Ann. Pure Appl. Log., 2008)

Preservation under Extensions on Well-Behaved Finite Structures. - Albert Atserias; Anuj Dawar; Martin Grohe (SIAM J. Comput., 2008)

Separating Graph Logic from MSO. - Timos Antonopoulos; Anuj Dawar (FoSSaCS, 2009)

Structure and Specification as Sources of Complexity. - Anuj Dawar (FSTTCS, 2009)

Domination Problems in Nowhere-Dense Classes. - Anuj Dawar; Stephan Kreutzer (FSTTCS, 2009)

Logics with Rank Operators. - Anuj Dawar; Martin Grohe; Bjarki Holm; Bastian Laubner (LICS, 2009)

Parameterized Complexity Classes under Logical Reductions. - Anuj Dawar; Yuguo He (MFCS, 2009)

Modal characterisation theorems over special classes of frames. - Anuj Dawar; Martin Otto 001 (Ann. Pure Appl. Log., 2009)

Domination Problems in Nowhere-Dense Classes of Graphs - Anuj Dawar; Stephan Kreutzer (CoRR, 2009)

Parameterized Complexity of First-Order Logic. - Stephan Kreutzer; Anuj Dawar (Electron. Colloquium Comput. Complex., 2009)

Affine systems of equations and counting infinitary logic. - Albert Atserias; Andrei A. Bulatov; Anuj Dawar (Theor. Comput. Sci., 2009)

On Complete Problems, Relativizations and Logics for Complexity Classes. - Anuj Dawar (Fields of Logic and Computation, 2010)

The Complexity of Satisfaction on Sparse Graphs. - Anuj Dawar (IPEC, 2010)

Properties of Almost All Graphs and Generalized Quantifiers. - Anuj Dawar; Erich Grädel (Fundam. Informaticae, 2010)

Homomorphism preservation on quasi-wide classes. - Anuj Dawar (J. Comput. Syst. Sci., 2010)

The Ackermann Award 2012. - Thierry Coquand; Anuj Dawar; Damian Niwinski (CSL, 2012)

On Tractable Parameterizations of Graph Isomorphism. - Adam Bouland; Anuj Dawar; Eryk Kopczynski (IPEC, 2012)

Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers. - Albert Atserias; Anuj Dawar (Electron. Colloquium Comput. Complex., 2012)

The dag-width of directed graphs. - Dietmar Berwanger; Anuj Dawar; Paul Hunter 001; Stephan Kreutzer; Jan Obdrzálek (J. Comb. Theory B, 2012)

The Ackermann Award 2013. - Anuj Dawar; Thomas A. Henzinger; Damian Niwinski (CSL, 2013)

Maximum Matching and Linear Programming in Fixed-Point Logic with Counting. - Matthew Anderson; Anuj Dawar; Bjarki Holm (LICS, 2013)

Definability of linear equation systems over groups and rings - Anuj Dawar; Erich Grädel; Bjarki Holm; Eryk Kopczynski; Wied Pakusa (Log. Methods Comput. Sci., 2013)

The Ackermann award 2014. - Anuj Dawar (CSL-LICS, 2014)

Turing Centenary Conference: How the World Computes. - S. Barry Cooper; Anuj Dawar; Martin Hyland; Benedikt Löwe (Ann. Pure Appl. Log., 2014)

Editor's foreword: WoLLIC 2010. - Anuj Dawar; Ruy J. G. B. de Queiroz (J. Comput. Syst. Sci., 2014)

Capturing MSO with One Quantifier. - Anuj Dawar; Luc Segoufin (Fields of Logic and Computation II, 2015)

The Ackermann Award 2015. - Anuj Dawar; Dexter Kozen; Simona Ronchi Della Rocca (CSL, 2015)

A Definability Dichotomy for Finite Valued CSPs. - Anuj Dawar; Pengming Wang 001 (CSL, 2015)

On Symmetric and Choiceless Computation. - Anuj Dawar (TTCS, 2015)

The Graph Isomorphism Problem (Dagstuhl Seminar 15511). - László Babai; Anuj Dawar; Pascal Schweitzer; Jacobo Torán (Dagstuhl Reports, 2015)

Solving Linear Programs without Breaking Abstractions. - Matthew Anderson; Anuj Dawar; Bjarki Holm (J. ACM, 2015)

The nature and power of fixed-point logic with counting. - Anuj Dawar (ACM SIGLOG News, 2015)

The Ackermann Award 2016. - Thierry Coquand; Anuj Dawar (CSL, 2016)

Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree. - Jannis Bulian; Anuj Dawar (Algorithmica, 2016)

Lasserre Lower Bounds and Definability of Semidefinite Programming. - Anuj Dawar; Pengming Wang 001 (CoRR, 2016)

Report on The Graph Isomorphism Problem. - Anuj Dawar (Bull. EATCS, 2016)

The Ackermann Award 2017. - Anuj Dawar; Daniel Leivant (CSL, 2017)

The pebbling comonad in Finite Model Theory. - Samson Abramsky; Anuj Dawar; Pengming Wang 001 (LICS, 2017)

Definability of semidefinite programming and lasserre lower bounds for CSPs. - Anuj Dawar; Pengming Wang 001 (LICS, 2017)

Definability of summation problems for Abelian groups and semigroups. - Faried Abu Zaid; Anuj Dawar; Erich Grädel; Wied Pakusa (LICS, 2017)

Fixed-Parameter Tractable Distances to Sparse Graph Classes. - Jannis Bulian; Anuj Dawar (Algorithmica, 2017)

Finite and Algorithmic Model Theory (Dagstuhl Seminar 17361). - Anuj Dawar; Erich Grädel; Phokion G. Kolaitis; Thomas Schwentick (Dagstuhl Reports, 2017)

Pebble Games and Cospectral Graphs. - Anuj Dawar; Simone Severini; Octavio Zapata (Electron. Notes Discret. Math., 2017)

Pebble Games with Algebraic Rules. - Anuj Dawar; Bjarki Holm (Fundam. Informaticae, 2017)

Bounded degree and planar spectra. - Anuj Dawar; Eryk Kopczynski (Log. Methods Comput. Sci., 2017)

On Symmetric Circuits and Fixed-Point Logics. - Matthew Anderson; Anuj Dawar (Theory Comput. Syst., 2017)

Decidable Fragments of the Simple Theory of Types with Infinity and NF. - Anuj Dawar; Thomas Forster; Zachiri McKenzie (Notre Dame J. Formal Log., 2017)

Approximations of Isomorphism and Logics with Linear-Algebraic Operators. - Anuj Dawar; Erich Grädel; Wied Pakusa (ICALP, 2019)

Descriptive complexity of graph spectra. - Anuj Dawar; Simone Severini; Octavio Zapata (Ann. Pure Appl. Log., 2019)

Generalizations of k-Weisfeiler-Leman partitions and related graph invariants. - Anuj Dawar; Danny Vagnozzi (CoRR, 2019)

Constructing Hard Examples for Graph Isomorphism. - Anuj Dawar; Kashif Khan (J. Graph Algorithms Appl., 2019)

Logical properties of random graphs from small addable classes. - Anuj Dawar; Eryk Kopczynski (Log. Methods Comput. Sci., 2019)

Definable inapproximability: new challenges for duplicator. - Albert Atserias; Anuj Dawar (J. Log. Comput., 2019)

Relativization of Gurevich's Conjectures. - Anatole Dahan; Anuj Dawar (Fields of Logic and Computation III, 2020)

Convergence and Nonconvergence Laws for Random Expansions of Product Structures. - Anuj Dawar; Erich Grädel; Matthias Hoelzel (Fields of Logic and Computation III, 2020)

Symmetric Computation (Invited Talk). - Anuj Dawar (CSL, 2020)

Symmetric Arithmetic Circuits. - Anuj Dawar; Gregory Wilsenach (ICALP, 2020)

MSO Undecidability for some Hereditary Classes of Unbounded Clique-Width. - Anuj Dawar; Abhisekh Sankaran (CoRR, 2020)

Extension Preservation in the Finite and Prefix Classes of First Order Logic. - Anuj Dawar; Abhisekh Sankaran (CSL, 2021)

Lovász-Type Theorems and Game Comonads. - Anuj Dawar; Tomas Jakl; Luca Reggio (LICS, 2021)

On the Relative Power of Linear Algebraic Approximations of Graph Isomorphism. - Anuj Dawar; Danny Vagnozzi (MFCS, 2021)

On the relative power of algebraic approximations of graph isomorphism. - Anuj Dawar; Danny Vagnozzi (CoRR, 2021)

On the Power of Symmetric Linear Programs. - Albert Atserias; Anuj Dawar; Joanna Ochremiak (J. ACM, 2021)

Lower Bounds for Symmetric Circuits for the Determinant. - Anuj Dawar; Gregory Wilsenach (ITCS, 2022)

Separating LREC from LFP. - Anuj Dawar; Felipe Ferreira Santos (LICS, 2022)

Descriptive complexity of the generalized spectra of graphs. - Aida Abiad; Anuj Dawar; Octavio Zapata (CoRR, 2022)

Symmetric Circuits for Rank Logic. - Anuj Dawar; Gregory Wilsenach (ACM Trans. Comput. Log., 2022)

Monadic NIP in Monotone Classes of Relational Structures. - Samuel Braunfeld; Anuj Dawar; Ioannis Eleftheriadis; Aris Papadopoulos (ICALP, 2023)

Descriptive complexity of controllable graphs. - Aida Abiad; Anuj Dawar; Octavio Zapata (LAGOS, 2023)

Limitations of the invertible-map equivalences. - Anuj Dawar; Erich Grädel; Moritz Lichter (J. Log. Comput., 2023)

Quantifiers Closed Under Partial Polymorphisms. - Anuj Dawar; Lauri Hella (CSL, 2024)

Limits of Symmetric Computation (Invited Talk). - Anuj Dawar (ICALP, 2024)

Preservation Theorems on Sparse Classes Revisited. - Anuj Dawar; Ioannis Eleftheriadis (MFCS, 2024)

Homomorphism Counts to Trees. - Anuj Dawar (CoRR, 2024)

Corrigendum to "Homomorphism preservation on quasi-wide classes" [J. Comput. Syst. Sci. 76 (5) (2010) 324-332]. - Anuj Dawar (J. Comput. Syst. Sci., 2024)

Game Comonads & Generalised Quantifiers. - Adam Ó Conghaile; Anuj Dawar (Log. Methods Comput. Sci., 2024)

A Logic for P: Are we Nearly There Yet? - Anuj Dawar; Benedikt Pago (ACM SIGLOG News, 2024)

International Colloquium on Automata, Languages and Programming (ICALP 2020). - Anuj Dawar (Theory Comput. Syst., 2024)

Undefinability of Approximation of 2-To-2 Games. - Anuj Dawar; Bálint Molnár (CSL, 2025)

Symmetric Proofs in the Ideal Proof System. - Anuj Dawar; Erich Grädel; Leon Kullmann; Benedikt Pago (MFCS, 2025)

MSO undecidability for hereditary classes of unbounded clique-width. - Anuj Dawar; Abhisekh Sankaran (Eur. J. Comb., 2025)

Symmetric Algebraic Circuits and Homomorphism Polynomials. - Anuj Dawar; Benedikt Pago; Tim Seppelt (CoRR, 2025)