Follow
Akanksha Agrawal
Title
Cited by
Cited by
Year
Feedback vertex set inspired kernel for chordal vertex deletion
A Agrawal, D Lokshtanov, P Misra, S Saurabh, M Zehavi
ACM Transactions on Algorithms (TALG) 15 (1), 1-28, 2018
262018
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion
A Agrawal, D Lokshtanov, P Misra, S Saurabh, M Zehavi
https://arxiv.org/abs/1707.04917, 2017
262017
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion
A Agrawal, D Lokshtanov, P Misra, S Saurabh, M Zehavi
Symposium on Discrete Algorithms, 1383, 2017
262017
A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion
A Agrawal, S Kolay, D Lokshtanov, S Saurabh
LATIN 2016: theoretical informatics, 1-13, 2016
222016
A faster FPT Algorithm and a smaller Kernel for Block Graph Vertex Deletion
A Agrawal, S Kolay, D Lokshtanov, S Saurabh
https://arxiv.org/abs/1510.08154, 2015
222015
Simultaneous feedback vertex set: A parameterized perspective
A Agrawal, D Lokshtanov, AE Mouawad, S Saurabh
ACM Transactions on Computation Theory (TOCT) 10 (4), 1-25, 2018
212018
Simultaneous feedback vertex set: A parameterized perspective
A Agrawal, D Lokshtanov, AE Mouawad, S Saurabh
ACM Transactions on Computation Theory (TOCT) 10 (4), 1-25, 2018
202018
Polylogarithmic approximation algorithms for weighted-F-deletion problems
A Agrawal, D Lokshtanov, P Misra, S Saurabh, M Zehavi
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018
202018
Improved algorithms and combinatorial bounds for independent feedback vertex set
A Agrawal, S Gupta, S Saurabh, R Sharma
11th International Symposium on Parameterized and Exact Computation (IPEC 2016), 2017
202017
On the parameterized complexity of happy vertex coloring
A Agrawal
International Workshop on Combinatorial Algorithms, 103-115, 2017
182017
Interval vertex deletion admits a polynomial kernel
A Agrawal, P Misra, S Saurabh, M Zehavi
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
162019
An FPT algorithm for elimination distance to bounded degree graphs
A Agrawal, L Kanesh, F Panolan, MS Ramanujan, S Saurabh
38th International Symposium on Theoretical Aspects of Computer Science …, 2021
122021
Split contraction: The untold story
A Agrawal, D Lokshtanov, S Saurabh, M Zehavi
34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), 2017
122017
On the parameterized complexity of contraction to generalization of trees
A Agarwal, S Saurabh, P Tale
Theory of Computing Systems 63 (3), 587-614, 2019
112019
The parameterized complexity of guarding almost convex polygons
A Agrawal, KVK Knudsen, D Lokshtanov, S Saurabh, M Zehavi
arXiv preprint arXiv:2003.07793, 2020
102020
Paths to trees and cacti
A Agrawal, L Kanesh, S Saurabh, P Tale
Theoretical Computer Science 860, 98-116, 2021
92021
Kernels for deletion to classes of acyclic digraphs
A Agrawal, S Saurabh, R Sharma, M Zehavi
Journal of Computer and System Sciences 92, 9-21, 2018
82018
Fine-grained complexity of rainbow coloring and its variants
A Agrawal
42nd International Symposium on Mathematical Foundations of Computer Science …, 2017
72017
On the parameterized complexity of clique elimination distance
A Agrawal, MS Ramanujan
15th International Symposium on Parameterized and Exact Computation (IPEC 2020), 2020
62020
Split contraction: The untold story
A Agrawal, D Lokshtanov, S Saurabh, M Zehavi
ACM Transactions on Computation Theory (TOCT) 11 (3), 1-22, 2019
62019
The system can't perform the operation now. Try again later.
Articles 1–20