Anuj Dawar
Impact in
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Formal Methods in Verification
- semigroups and automata theory
- Advanced Algebra and Logic
- Computability, Logic, AI Algorithms
Papers in
-
- Advanced Graph Theory Research 25
- Complexity and Algorithms in Graphs 23
- Formal Methods in Verification 18
- semigroups and automata theory 15
- Computability, Logic, AI Algorithms 12
- Advanced Algebra and Logic 7
- Co-authors
- Stephan KreutzerMartin GroheAlbert AtseriasScott WeinsteinMartin OttoPhokion G. KolaitisErich GrädelAndreǐ A. Bulatov
- Journals
- Annals of Pure and Applied Logic (4 papers)Information and Computation (4 papers)Journal of Logic and Computation (3 papers)Theoretical Computer Science (3 papers)Algorithmica (2 papers)
- Partner nations
- United KingdomGermanyUnited States
In The Last Decade
Anuj Dawar
62 papers receiving 630 citations
Peers
Comparison fields: 5 of 39
- Computational Theory and Mathematics 591
- Discrete Mathematics and Combinatorics 62
- Artificial Intelligence 327
- Geometry and Topology 59
- Computer Networks and Communications 119
Countries citing papers authored by Anuj Dawar
This map shows the geographic impact of Anuj Dawar's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Anuj Dawar with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Anuj Dawar more than expected).
Fields of papers citing papers by Anuj Dawar
This network shows the impact of papers produced by Anuj Dawar. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Anuj Dawar. The network helps show where Anuj Dawar may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Anuj Dawar, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2024 | 3 | |
| 2 | 2021 | 4 | |
| 3 | 2019 | 2 | |
| 4 | 2017 | 1 | |
| 5 | 2017 | 3 | |
| 6 | 2012 | 4 | |
| 7 | Summary of an ethnographic study of the third mini-polymath project | 2012 | 3 |
| 8 | 2012 | 30 | |
| 9 | Computer science logic : 24th international workshop, CSL 2010, 19th annual conference of the EACSL, Brno, Czech Republic, August 23 - 27, 2010, proceedings | 2010 | 2 |
| 10 | Parameterized Complexity of First-Order Logic. | 2009 | 7 |
| 11 | 2009 | 14 | |
| 12 | 2009 | 33 | |
| 13 | 2008 | 11 | |
| 14 | 2007 | 14 | |
| 15 | 2007 | 1 | |
| 16 | 2006 | 4 | |
| 17 | 2005 | 2 | |
| 18 | Adjunct Elimination Through Games in Static Ambient Logic | 2004 | 0 |
| 19 | 2002 | 1 | |
| 20 | 1998 | 25 |
About Anuj Dawar
Anuj Dawar is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Artificial Intelligence, Geometry and Topology and Computer Networks and Communications, having authored 68 papers that have together received 697 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (25 papers), Complexity and Algorithms in Graphs (23 papers), Logic, Reasoning, and Knowledge (21 papers), Formal Methods in Verification (18 papers), semigroups and automata theory (15 papers), Logic, programming, and type systems (13 papers), Computability, Logic, AI Algorithms (12 papers) and Advanced Algebra and Logic (7 papers). The work is most often cited by research in Computational Theory and Mathematics (591 citations), Discrete Mathematics and Combinatorics (62 citations), Artificial Intelligence (327 citations), Geometry and Topology (59 citations) and Computer Networks and Communications (119 citations). Anuj Dawar has collaborated with scholars based in United Kingdom, Germany and United States. Frequent co-authors include Stephan Kreutzer, Martin Grohe, Albert Atserias, Scott Weinstein, Martin Otto, Phokion G. Kolaitis, Erich Grädel, Andreǐ A. Bulatov, K. Vijay‐Shanker and Lauri Hella. Their work appears in journals such as Annals of Pure and Applied Logic, Information and Computation, Journal of Logic and Computation, Theoretical Computer Science and Algorithmica.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.