| Exact crossing number parameterized by vertex cover P Hliněný, A Sankaran International Symposium on Graph Drawing and Network Visualization, 307-319, 2019 | 16 | 2019 |
| A generalization of the Łoś–Tarski preservation theorem A Sankaran, B Adsul, S Chakraborty Annals of Pure and Applied Logic 167 (3), 189-210, 2016 | 11* | 2016 |
| Extension preservation in the finite and prefix classes of first order logic A Dawar, A Sankaran arXiv preprint arXiv:2007.05459, 2020 | 9 | 2020 |
| Preservation under substructures modulo bounded cores A Sankaran, B Adsul, V Madan, P Kamath, S Chakraborty International Workshop on Logic, Language, Information, and Computation, 291-305, 2012 | 8 | 2012 |
| A generalization of the Łoś-Tarski preservation theorem over classes of finite structures A Sankaran, B Adsul, S Chakraborty Mathematical Foundations of Computer Science 2014: 39th International …, 2014 | 5 | 2014 |
| A Finitary Analogue of the Downward L\" owenheim-Skolem Property A Sankaran arXiv preprint arXiv:1705.04493, 2017 | 3 | 2017 |
| On Semantic Generalizations of the Bernays-Sch\" onfinkel-Ramsey Class with Finite or Co-finite Spectra A Sankaran, S Chakraborty arXiv preprint arXiv:1002.4334, 2010 | 3 | 2010 |
| MSO undecidability for hereditary classes of unbounded clique-width A Dawar, A Sankaran European Journal of Combinatorics, 103700, 2023 | 2 | 2023 |
| MSO Undecidability for some Hereditary Classes of Unbounded Clique-Width A Dawar, A Sankaran arXiv e-prints, arXiv: 2011.02894, 2020 | 2 | 2020 |
| Revisiting the generalized Łoś-Tarski theorem A Sankaran Indian Conference on Logic and Its Applications, 76-88, 2019 | 2 | 2019 |
| Using preservation theorems for inexpressibility results in first order logic A Sankaran, N Limaye, A Sundararaman, S Chakraborty Technical report, IIT Bombay, 2012. URL http://www. cfdvs. iitb. ac. in …, 2012 | 2 | 2012 |
| Reachability analysis in graph transformation systems A Sankaran Technical report, Dept. of Computer Science and Engineering, IIT Bombay …, 2007 | 2 | 2007 |
| 29th EACSL Annual Conference on Computer Science Logic (CSL 2021) B Klin, A Mahboubi, S Schmitz, L Westrick, S Abramsky, RS Barbosa, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2021 | 1 | 2021 |
| Clique-width of point configurations O Cagirici, P Hliněný, F Pokrývka, A Sankaran Springer, Lecture Notes in Computer Science, 2020 | 1 | 2020 |
| Program Verification using Small Models N Gupta, P Kodavade, S Kumar, A Sankaran, A Shenoy, R Venkatesh | | 2023 |
| Feferman–Vaught decompositions for prefix classes of first order logic A Sankaran Journal of Logic, Language and Information 32 (1), 147-174, 2023 | | 2023 |
| Pseudo-finiteness of arbitrary graphs of bounded shrub-depth A Sankaran arXiv preprint arXiv:2202.06308, 2022 | | 2022 |
| Clique-Width of Point Configurations A Sankaran Graph-Theoretic Concepts in Computer Science: 46th International Workshop …, 2020 | | 2020 |
| Some classical model theoretic aspects of bounded shrub-depth classes A Sankaran arXiv preprint arXiv:2010.05799, 2020 | | 2020 |
| Revisiting the generalized {\L} o\'s-Tarski theorem A Sankaran arXiv preprint arXiv:1811.06459, 2018 | | 2018 |
