( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Quantifiers Closed Under Partial Polymorphisms.

, и . CSL, том 288 из LIPIcs, стр. 23:1-23:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Anuj Dawar

Heider Dawar

Anuj Pathania

Anuj Rawat

Parwiz Dawarpanah

 

Другие публикации лиц с тем же именем

Bounded degree and planar spectra., и . CoRR, (2016)Separating Graph Logic from MSO., и . FoSSaCS, том 5504 из Lecture Notes in Computer Science, стр. 63-77. Springer, (2009)Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers., и . ICALP (2), том 7392 из Lecture Notes in Computer Science, стр. 67-78. Springer, (2012)The Complexity of Satisfaction on Sparse Graphs.. IPEC, том 6478 из Lecture Notes in Computer Science, стр. 1-2. Springer, (2010)Parameterized Complexity Classes under Logical Reductions., и . MFCS, том 5734 из Lecture Notes in Computer Science, стр. 258-269. Springer, (2009)On the Bisimulation Invariant Fragment of Monadic S1 in the Finite., и . FSTTCS, том 3328 из Lecture Notes in Computer Science, стр. 224-236. Springer, (2004)Fixed-parameter Tractable Distances to Sparse Graph Classes., и . IPEC, том 43 из LIPIcs, стр. 236-247. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Constructing Hard Examples for Graph Isomorphism., и . J. Graph Algorithms Appl., 23 (2): 293-316 (2019)Logical properties of random graphs from small addable classes., и . Log. Methods Comput. Sci., (2019)Symmetric Arithmetic Circuits., и . ICALP, том 168 из LIPIcs, стр. 36:1-36:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)