Anuj Dawar

ORCID

Publication Activity (10 Years)

Years Active: 1989-2024
Publications (10 Years): 72

Top Venues

Publications

Anuj Dawar
Homomorphism Counts to Trees. CoRR (2024)
Anuj Dawar, Ioannis Eleftheriadis
Preservation Theorems on Sparse Classes Revisited. MFCS (2024)
Anuj Dawar
Limits of Symmetric Computation (Invited Talk). ICALP (2024)
Anuj Dawar, Ioannis Eleftheriadis
Preservation theorems on sparse classes revisited. CoRR (2024)
Anuj Dawar
Corrigendum to "Homomorphism preservation on quasi-wide classes" [J. Comput. Syst. Sci. 76 (5) (2010) 324-332]. J. Comput. Syst. Sci. 145 (2024)
Adam Ó Conghaile, Anuj Dawar
Game Comonads & Generalised Quantifiers. Log. Methods Comput. Sci. 20 (3) (2024)
Anuj Dawar, Lauri Hella
Quantifiers Closed Under Partial Polymorphisms. CSL (2024)
Anuj Dawar, Benedikt Pago
A Logic for P: Are we Nearly There Yet? ACM SIGLOG News 11 (2) (2024)
Aida Abiad, Anuj Dawar, Octavio Zapata
Descriptive complexity of controllable graphs. CoRR (2023)
Anuj Dawar, Lauri Hella
Quantifiers closed under partial polymorphisms. CoRR (2023)
Aida Abiad, Anuj Dawar, Octavio Zapata
Descriptive complexity of controllable graphs. LAGOS (2023)
Samuel Braunfeld, Anuj Dawar, Ioannis Eleftheriadis, Aris Papadopoulos
Monadic NIP in Monotone Classes of Relational Structures. ICALP (2023)
Samuel Braunfeld, Anuj Dawar, Ioannis Eleftheriadis, Aris Papadopoulos
Monadic NIP in monotone classes of relational structures. CoRR (2023)
Anuj Dawar, Erich Grädel, Moritz Lichter
Limitations of the invertible-map equivalences. J. Log. Comput. 33 (5) (2023)
Anuj Dawar, Felipe Ferreira Santos
Separating LREC from LFP. LICS (2022)
Anuj Dawar, Gregory Wilsenach
Symmetric Circuits for Rank Logic. ACM Trans. Comput. Log. 23 (1) (2022)
Aida Abiad, Anuj Dawar, Octavio Zapata
Descriptive complexity of the generalized spectra of graphs. CoRR (2022)
Anuj Dawar, Gregory Wilsenach
Lower Bounds for Symmetric Circuits for the Determinant. ITCS (2022)
Anuj Dawar, Abhisekh Sankaran
MSO Undecidability for Hereditary Classes of Unbounded Clique Width. CSL (2022)
Anuj Dawar, Danny Vagnozzi
On the relative power of algebraic approximations of graph isomorphism. CoRR (2021)
Albert Atserias, Anuj Dawar, Joanna Ochremiak
On the Power of Symmetric Linear Programs. J. ACM 68 (4) (2021)
Anuj Dawar, Abhisekh Sankaran
Extension Preservation in the Finite and Prefix Classes of First Order Logic. CSL (2021)
Anuj Dawar, Felipe Ferreira Santos
Separating LREC from LFP. CoRR (2021)
Anuj Dawar, Gregory Wilsenach
Lower Bounds for Symmetric Circuits for the Determinant. CoRR (2021)
Adam Ó Conghaile, Anuj Dawar
Game Comonads & Generalised Quantifiers. CSL (2021)
Anuj Dawar, Danny Vagnozzi
On the Relative Power of Linear Algebraic Approximations of Graph Isomorphism. MFCS (2021)
Anuj Dawar, Tomás Jakl, Luca Reggio
Lovász-Type Theorems and Game Comonads. LICS (2021)
Anuj Dawar, Erich Grädel, Moritz Lichter
Limitations of the Invertible-Map Equivalences. CoRR (2021)
Anuj Dawar, Tomás Jakl, Luca Reggio
Lovász-Type Theorems and Game Comonads. CoRR (2021)
Anatole Dahan, Anuj Dawar
Relativization of Gurevich's Conjectures. CoRR (2020)
Anuj Dawar, Gregory Wilsenach
Symmetric Arithmetic Circuits. CoRR (2020)
Anatole Dahan, Anuj Dawar
Relativization of Gurevich's Conjectures. Fields of Logic and Computation III (2020)
Anuj Dawar
Symmetric Computation (Invited Talk). CSL (2020)
Anuj Dawar, Abhisekh Sankaran
MSO Undecidability for some Hereditary Classes of Unbounded Clique-Width. CoRR (2020)
Anuj Dawar, Gregory Wilsenach
Symmetric Arithmetic Circuits. ICALP (2020)
Anuj Dawar, Erich Grädel, Matthias Hoelzel
Convergence and Nonconvergence Laws for Random Expansions of Product Structures. Fields of Logic and Computation III (2020)
Adam Ó Conghaile, Anuj Dawar
Game Comonads & Generalised Quantifiers. CoRR (2020)
Anuj Dawar, Abhisekh Sankaran
Extension Preservation in the Finite and Prefix Classes of First Order Logic. CoRR (2020)
Anuj Dawar, Eryk Kopczynski
Logical properties of random graphs from small addable classes. Log. Methods Comput. Sci. 15 (3) (2019)
Anuj Dawar, Erich Grädel, Wied Pakusa
Approximations of Isomorphism and Logics with Linear-Algebraic Operators. CoRR (2019)
Albert Atserias, Anuj Dawar
Definable inapproximability: new challenges for duplicator. J. Log. Comput. 29 (8) (2019)
Anuj Dawar, Danny Vagnozzi
Generalizations of k-Weisfeiler-Leman partitions and related graph invariants. CoRR (2019)
Albert Atserias, Anuj Dawar, Joanna Ochremiak
On the Power of Symmetric Linear Programs. CoRR (2019)
Anuj Dawar, Kashif Khan
Constructing Hard Examples for Graph Isomorphism. J. Graph Algorithms Appl. 23 (2) (2019)
Anuj Dawar, Simone Severini, Octavio Zapata
Descriptive complexity of graph spectra. Ann. Pure Appl. Log. 170 (9) (2019)
Anuj Dawar, Erich Grädel, Wied Pakusa
Approximations of Isomorphism and Logics with Linear-Algebraic Operators. ICALP (2019)
Albert Atserias, Anuj Dawar, Joanna Ochremiak
On the Power of Symmetric Linear Programs. LICS (2019)
Albert Atserias, Anuj Dawar
Definable Inapproximability: New Challenges for Duplicator. CSL (2018)
Anuj Dawar, Gregory Wilsenach
Symmetric Circuits for Rank Logic. CoRR (2018)
Anuj Dawar, Kashif Khan
Constructing Hard Examples for Graph Isomorphism. CoRR (2018)
Albert Atserias, Anuj Dawar
Definable Inapproximability: New Challenges for Duplicator. CoRR (2018)
Anuj Dawar, Gregory Wilsenach
Symmetric Circuits for Rank Logic. CSL (2018)
Anuj Dawar, Daniel Leivant
The Ackermann Award 2017. CSL (2017)
Matthew Anderson, Anuj Dawar
On Symmetric Circuits and Fixed-Point Logics. Theory Comput. Syst. 60 (3) (2017)
Anuj Dawar, Thomas Forster, Zachiri McKenzie
Decidable Fragments of the Simple Theory of Types with Infinity and NF. Notre Dame J. Formal Log. 58 (3) (2017)
Faried Abu Zaid, Anuj Dawar, Erich Grädel, Wied Pakusa
Definability of summation problems for Abelian groups and semigroups. LICS (2017)
Anuj Dawar, Simone Severini, Octavio Zapata
Pebble Games and Cospectral Graphs. Electron. Notes Discret. Math. 61 (2017)
Anuj Dawar, Eryk Kopczynski
Logical properties of random graphs from small addable classes. CoRR (2017)
Anuj Dawar, Bjarki Holm
Pebble Games with Algebraic Rules. Fundam. Informaticae 150 (3-4) (2017)
Anuj Dawar, Pengming Wang
Definability of semidefinite programming and lasserre lower bounds for CSPs. LICS (2017)
Jannis Bulian, Anuj Dawar
Fixed-Parameter Tractable Distances to Sparse Graph Classes. Algorithmica 79 (1) (2017)
Samson Abramsky, Anuj Dawar, Pengming Wang
The pebbling comonad in finite model theory. CoRR (2017)
Samson Abramsky, Anuj Dawar, Pengming Wang
The pebbling comonad in Finite Model Theory. LICS (2017)
Anuj Dawar, Erich Grädel, Phokion G. Kolaitis, Thomas Schwentick
Finite and Algorithmic Model Theory (Dagstuhl Seminar 17361). Dagstuhl Reports 7 (9) (2017)
Anuj Dawar, Eryk Kopczynski
Bounded degree and planar spectra. Log. Methods Comput. Sci. 13 (4) (2017)
Anuj Dawar
Report on The Graph Isomorphism Problem. Bull. EATCS 118 (2016)
Jannis Bulian, Anuj Dawar
Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree. Algorithmica 75 (2) (2016)
Anuj Dawar, Simone Severini, Octavio Zapata
Descriptive Complexity of Graph Spectra. WoLLIC (2016)
Anuj Dawar, Simone Severini, Octavio Zapata
Descriptive complexity of graph spectra. CoRR (2016)
Anuj Dawar, Pengming Wang
Lasserre Lower Bounds and Definability of Semidefinite Programming. CoRR (2016)
Thierry Coquand, Anuj Dawar
The Ackermann Award 2016. CSL (2016)
Anuj Dawar, Eryk Kopczynski
Bounded degree and planar spectra. CoRR (2016)
Anuj Dawar, Pengming Wang
A Definability Dichotomy for Finite Valued CSPs. CSL (2015)
Anuj Dawar, Luc Segoufin
Capturing MSO with One Quantifier. Fields of Logic and Computation II (2015)
László Babai, Anuj Dawar, Pascal Schweitzer, Jacobo Torán
The Graph Isomorphism Problem (Dagstuhl Seminar 15511). Dagstuhl Reports 5 (12) (2015)
Anuj Dawar, Pengming Wang
A Definability Dichotomy for Finite Valued CSPs. CoRR (2015)
Matthew Anderson, Anuj Dawar, Bjarki Holm
Solving Linear Programs without Breaking Abstractions. J. ACM 62 (6) (2015)
Anuj Dawar, Dexter Kozen, Simona Ronchi Della Rocca
The Ackermann Award 2015. CSL (2015)
Jannis Bulian, Anuj Dawar
Fixed-parameter Tractable Distances to Sparse Graph Classes. IPEC (2015)
Anuj Dawar
The nature and power of fixed-point logic with counting. ACM SIGLOG News 2 (1) (2015)
Jannis Bulian, Anuj Dawar
Fixed-parameter Tractable Distances to Sparse Graph Classes. CoRR (2015)
Anuj Dawar
On Symmetric and Choiceless Computation. TTCS (2015)
Albert Atserias, Anuj Dawar
Degree lower bounds of tower-type for approximating formulas with parity quantifiers. ACM Trans. Comput. Log. 15 (1) (2014)
Matthew Anderson, Anuj Dawar
On Symmetric Circuits and Fixed-Point Logics. STACS (2014)
Anuj Dawar, Ruy J. G. B. de Queiroz
Editor's foreword: WoLLIC 2010. J. Comput. Syst. Sci. 80 (2) (2014)
Anuj Dawar
The Ackermann award 2014. CSL-LICS (2014)
Jannis Bulian, Anuj Dawar
Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree. IPEC (2014)
Jannis Bulian, Anuj Dawar
Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree. CoRR (2014)
Matthew Anderson, Anuj Dawar
On Symmetric Circuits and Fixed-Point Logics. CoRR (2014)
S. Barry Cooper, Anuj Dawar, Martin Hyland, Benedikt Löwe
Turing Centenary Conference: How the World Computes. Ann. Pure Appl. Log. 165 (9) (2014)
Matthew Anderson, Anuj Dawar, Bjarki Holm
Maximum Matching and Linear Programming in Fixed-Point Logic with Counting CoRR (2013)
Anuj Dawar, Thomas A. Henzinger, Damian Niwinski
The Ackermann Award 2013. CSL (2013)
Matthew Anderson, Anuj Dawar, Bjarki Holm
Maximum Matching and Linear Programming in Fixed-Point Logic with Counting. LICS (2013)
Anuj Dawar, Erich Grädel, Bjarki Holm, Eryk Kopczynski, Wied Pakusa
Definability of linear equation systems over groups and rings Log. Methods Comput. Sci. 9 (4) (2013)
Albert Atserias, Anuj Dawar
Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers. Electron. Colloquium Comput. Complex. 19 (2012)
Albert Atserias, Anuj Dawar
Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers. ICALP (2) (2012)
Anuj Dawar, Erich Grädel, Bjarki Holm, Eryk Kopczynski, Wied Pakusa
Definability of linear equation systems over groups and rings. CSL (2012)
Thierry Coquand, Anuj Dawar, Damian Niwinski
The Ackermann Award 2012. CSL (2012)
Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer, Jan Obdrzálek
The dag-width of directed graphs. J. Comb. Theory, Ser. B 102 (4) (2012)
Anuj Dawar, Bjarki Holm
Pebble games with algebraic rules CoRR (2012)

Anuj Dawar.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Anuj Dawar