Anuj Dawar

Matthew Anderson, Anuj Dawar, Bjarki Holm: Maximum Matching and Linear Programming in Fixed-Point Logic with Counting. CoRR abs/1304.6870 (2013)

Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer, Jan Obdrzálek: The dag-width of directed graphs. J. Comb. Theory, Ser. B 102(4): 900-923 (2012)

Thierry Coquand, Anuj Dawar, Damian Niwinski: The Ackermann Award 2012. CSL 2012: 1-5

Anuj Dawar, Erich Grädel, Bjarki Holm, Eryk Kopczynski, Wied Pakusa: Definability of linear equation systems over groups and rings. CSL 2012: 213-227

Albert Atserias, Anuj Dawar: Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers. ICALP (2) 2012: 67-78

Anuj Dawar, Bjarki Holm: Pebble Games with Algebraic Rules. ICALP (2) 2012: 251-262

Adam Bouland, Anuj Dawar, Eryk Kopczynski: On Tractable Parameterizations of Graph Isomorphism. IPEC 2012: 218-230

S. Barry Cooper, Anuj Dawar, Benedikt Löwe (Eds.): How the World Computes - Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012. Proceedings. Lecture Notes in Computer Science 7318, Springer 2012, isbn 978-3-642-30869-7

Anuj Dawar, Erich Grädel, Bjarki Holm, Eryk Kopczynski, Wied Pakusa: Definability of linear equation systems over groups and rings. CoRR abs/1204.3022 (2012)

Anuj Dawar, Bjarki Holm: Pebble games with algebraic rules. CoRR abs/1205.0913 (2012)

Albert Atserias, Anuj Dawar: Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers. Electronic Colloquium on Computational Complexity (ECCC) 19: 15 (2012)

Anuj Dawar, Erich Grädel: Properties of Almost All Graphs and Generalized Quantifiers. Fundam. Inform. 98(4): 351-372 (2010)

Anuj Dawar: Homomorphism preservation on quasi-wide classes. J. Comput. Syst. Sci. 76(5): 324-332 (2010)

Anuj Dawar: On Complete Problems, Relativizations and Logics for Complexity Classes. Fields of Logic and Computation 2010: 201-207

Anuj Dawar: The Complexity of Satisfaction on Sparse Graphs. IPEC 2010: 1-2

Anuj Dawar, Helmut Veith (Eds.): Computer Science Logic, 24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010. Proceedings. Lecture Notes in Computer Science 6247, Springer 2010, isbn 978-3-642-15204-7

Anuj Dawar, Ruy J. G. B. de Queiroz (Eds.): Logic, Language, Information and Computation, 17th International Workshop, WoLLIC 2010, Brasilia, Brazil, July 6-9, 2010. Proceedings. Lecture Notes in Computer Science 6188, Springer 2010, isbn 978-3-642-13823-2

Anuj Dawar, Martin Otto: Modal characterisation theorems over special classes of frames. Ann. Pure Appl. Logic 161(1): 1-42 (2009)

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

Timos Antonopoulos, Anuj Dawar: Separating Graph Logic from MSO. FOSSACS 2009: 63-77

Anuj Dawar, Stephan Kreutzer: Domination Problems in Nowhere-Dense Classes. FSTTCS 2009: 157-168

Anuj Dawar: Structure and Specification as Sources of Complexity. FSTTCS 2009: 407-416

Anuj Dawar, Martin Grohe, Bjarki Holm, Bastian Laubner: Logics with Rank Operators. LICS 2009: 113-122

Anuj Dawar, Yuguo He: Parameterized Complexity Classes under Logical Reductions. MFCS 2009: 258-269

Anuj Dawar, Stephan Kreutzer: Domination Problems in Nowhere-Dense Classes of Graphs. CoRR abs/0907.4283 (2009)

Stephan Kreutzer, Anuj Dawar: Parameterized Complexity of First-Order Logic. Electronic Colloquium on Computational Complexity (ECCC) 16: 131 (2009)

Anuj Dawar, David Richerby, Benjamin Rossman: Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs. Ann. Pure Appl. Logic 152(1-3): 31-50 (2008)

Albert Atserias, Anuj Dawar, Martin Grohe: Preservation under Extensions on Well-Behaved Finite Structures. SIAM J. Comput. 38(4): 1364-1381 (2008)

Anuj Dawar, Erich Grädel: The Descriptive Complexity of Parity Games. CSL 2008: 354-368

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

Anuj Dawar: On the Descriptive Complexity of Linear Algebra. WoLLIC 2008: 17-25

Anuj Dawar: Homomorphism Preservation on Quasi-Wide Classes. CoRR abs/0811.4497 (2008)

Anuj Dawar, Philippa Gardner, Giorgio Ghelli: Expressiveness and complexity of graph logic. Inf. Comput. 205(3): 263-310 (2007)

Anuj Dawar, David Janin: The monadic theory of finite representations of infinite words. Inf. Process. Lett. 103(3): 94-101 (2007)

Anuj Dawar, Stephan Kreutzer: Generalising automaticity to modal properties of finite structures. Theor. Comput. Sci. 379(1-2): 266-285 (2007)

Anuj Dawar: Model-Checking First-Order Logic: Automata and Locality. CSL 2007: 6

Anuj Dawar, David Richerby: The Power of Counting Logics on Restricted Classes of Finite Structures. CSL 2007: 84-98

Albert Atserias, Andrei A. Bulatov, Anuj Dawar: Affine Systems of Equations and Counting Infinitary Logic. ICALP 2007: 558-570

Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt: Model Theory Makes Formulas Large. ICALP 2007: 913-924

Anuj Dawar, Martin Grohe, Stephan Kreutzer: Locally Excluding a Minor. LICS 2007: 270-279

Anuj Dawar: Finite Model Theory on Tame Classes of Structures. MFCS 2007: 2-12

Anuj Dawar, David Richerby, Benjamin Rossman: Choiceless Polynomial Time, Counting and the Cai-Fürer-Immerman Graphs: (Extended Abstract). Electr. Notes Theor. Comput. Sci. 143: 13-26 (2006)

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

Anuj Dawar, Erich Grädel, Stephan Kreutzer: Backtracking games and inflationary fixed points. Theor. Comput. Sci. 350(2-3): 174-187 (2006)

Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt: Approximation Schemes for First-Order Definable Optimisation Problems. LICS 2006: 411-420

Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer: DAG-Width and Parity Games. STACS 2006: 524-536

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

Albert Atserias, Anuj Dawar, Martin Grohe: Preservation Under Extensions on Well-Behaved Finite Structures. ICALP 2005: 1437-1449

Anuj Dawar, Martin Otto: Modal Characterisation Theorems over Special Classes of Frames. LICS 2005: 21-30

Paul Hunter, Anuj Dawar: Complexity Bounds for Regular Games. MFCS 2005: 495-506

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

Anuj Dawar, Philippa Gardner, Giorgio Ghelli: Adjunct Elimination Through Games in Static Ambient Logic. FSTTCS 2004: 211-223

Anuj Dawar, David Janin: On the Bisimulation Invariant Fragment of Monadic S1 in the Finite. FSTTCS 2004: 224-236

Anuj Dawar, Erich Grädel, Stephan Kreutzer: Backtracking Games and Inflationary Fixed Points. ICALP 2004: 420-432

Albert Atserias, Anuj Dawar, Phokion G. Kolaitis: On Preservation under Homomorphisms and Unions of Conjunctive Queries. PODS 2004: 319-329

Anuj Dawar: Foreword. Electr. Notes Theor. Comput. Sci. 90: 1 (2003)

Anuj Dawar, Daniel Leivant: Guest editorial. Inf. Comput. 183(1): 1 (2003)

Anuj Dawar, David Richerby: Fixed-point Logics with Nondeterministic Choice. J. Log. Comput. 13(4): 503-530 (2003)

Anuj Dawar, David Richerby: A Fixed-Point Logic with Symmetric Choice. CSL 2003: 169-182

Anuj Dawar, Yuri Gurevich: Fixed point logics. Bulletin of Symbolic Logic 8(1): 65-88 (2002)

Anuj Dawar, Stephan Kreutzer: Generalising Automaticity to Modal Properties of Finite Structures. FSTTCS 2002: 109-120

Anuj Dawar, Erich Grädel, Stephan Kreutzer: Inflationary Fixed Points in Modal Logic. CSL 2001: 277-291

Anuj Dawar: A Restricted Second Order Logic for Finite Structures. Inf. Comput. 143(2): 154-174 (1998)

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

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

Anuj Dawar, Lauri Hella, Anil Seth: Ordering Finite Variable Types with Generalized Quantifiers. LICS 1998: 28-43

Anuj Dawar, Steven Lindell, Scott Weinstein: Infinitary Logic and Inductive Definability over Finite Structures. Inf. Comput. 119(2): 160-175 (1995)

Anuj Dawar, Lauri Hella: The expressive Power of Finitely Many Generalized Quantifiers. Inf. Comput. 123(2): 172-184 (1995)

Anuj Dawar: Generalized Quantifiers and Logical Reducibilities. J. Log. Comput. 5(2): 213-226 (1995)

Anuj Dawar, Steven Lindell, Scott Weinstein: First Order Logic, Fixed Point Logic and Linear Order. CSL 1995: 161-177

Anuj Dawar, Lauri Hella, Phokion G. Kolaitis: Implicit Definability and Infinitary Logic in Finite Model Theory. ICALP 1995: 624-635

Anuj Dawar, Erich Grädel: Generalized Quantifiers and 0-1 Laws. LICS 1995: 54-64

Anuj Dawar: A Restricted Second Order Logic for Finite Structures. LCC 1994: 393-413

Anuj Dawar, Lauri Hella: The Expressive Power of Finitely Many Generalized Quantifiers. LICS 1994: 20-29

Anuj Dawar, K. Vijay-Shanker: An Interpretation of Negation in Feature Structure Descriptions. Computational Linguistics 16(1): 11-21 (1990)

Anuj Dawar, K. Vijay-Shanker: A Three-Valued Interpretation of Negation in Feature Structure Descriptions. ACL 1989: 18-24