papers
Publications (16)
cs.DS2014
Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree
Jannis Bulian, Anuj Dawar
cs.DS2009
Domination Problems in Nowhere-Dense Classes of Graphs
Anuj Dawar, Stephan Kreutzer
cs.CC2014
On the dynamic width of the 3-colorability problem
Albert Atserias, Anuj Dawar, Oleg Verbitsky
cs.CC2014
On Symmetric Circuits and Fixed-Point Logics
Matthew Anderson, Anuj Dawar
cs.LO2013
Definability of linear equation systems over groups and rings
Anuj Dawar, Eryk Kopczynski, Bjarki Holm +2
cs.LO2009
Homomorphism Preservation on Quasi-Wide Classes
Anuj Dawar
cs.CC2019
Constructing Hard Examples for Graph Isomorphism
Anuj Dawar, Kashif Khan
cs.DS2015
Fixed-parameter Tractable Distances to Sparse Graph Classes
Jannis Bulian, Anuj Dawar
cs.LO2019
On the Power of Symmetric Linear Programs
Albert Atserias, Anuj Dawar, Joanna Ochremiak
cs.LO2017
The pebbling comonad in finite model theory
Samson Abramsky, Anuj Dawar, Pengming Wang
cs.LO2016
Descriptive complexity of graph spectra
Anuj Dawar, Simone Severini, Octavio Zapata
cs.LO2013
Maximum Matching and Linear Programming in Fixed-Point Logic with Counting
Matthew Anderson, Anuj Dawar, Bjarki Holm
math.LO2014
Decidable fragments of the Simple Theory of Types with Infinity and NF
Anuj Dawar, Thomas Forster, Zachiri McKenzie
cs.LO2015
A Definability Dichotomy for Finite Valued CSPs
Anuj Dawar, Pengming Wang
cs.LO2012
Pebble games with algebraic rules
Anuj Dawar, Bjarki Holm
cs.LO2016
Lasserre Lower Bounds and Definability of Semidefinite Programming
Anuj Dawar, Pengming Wang