Exact crossing number parameterized by vertex cover P Hliněný, A Sankaran International Symposium on Graph Drawing and Network Visualization, 307-319, 2019 | 18 | 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 | 13* | 2016 |

Extension preservation in the finite and prefix classes of first order logic A Dawar, A Sankaran arXiv preprint arXiv:2007.05459, 2020 | 10 | 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 | 9 | 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 | 6 | 2014 |

MSO undecidability for hereditary classes of unbounded clique-width A Dawar, A Sankaran European Journal of Combinatorics, 103700, 2023 | 3 | 2023 |

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 some Hereditary Classes of Unbounded Clique-Width. A Dawar, A Sankaran CoRR, abs/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, 2012. URL: http://www. cfdvs. iitb. ac. in/reports/index. php, 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 C Baier, J Goubault-Larrecq | 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 |

26th EACSL Annual Conference on Computer Science Logic (CSL 2017) A Dawar, D Leivant, PG Kolaitis, L Kovács, S Kreutzer, M Mahajan, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2017 | 1 | 2017 |

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 |

Clique-width of point configurations O Çağırıcı, P Hliněný, F Pokrývka, A Sankaran Journal of Combinatorial Theory, Series B 158, 43-73, 2023 | | 2023 |

Pseudo-finiteness of arbitrary graphs of bounded shrub-depth A Sankaran arXiv preprint arXiv:2202.06308, 2022 | | 2022 |

Some classical model theoretic aspects of bounded shrub-depth classes A Sankaran arXiv preprint arXiv:2010.05799, 2020 | | 2020 |