Spremljaj
Akanksha Agrawal
Akanksha Agrawal
Indian Institute of Technology Madras
Preverjeni e-poštni naslov na cse.iitm.ac.in - Domača stran
Naslov
Navedeno
Navedeno
Leto
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
322018
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
322017
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
322017
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: 12th Latin American Symposium, Ensenada …, 2016
292016
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
292015
Polylogarithmic approximation algorithms for weighted-ℱ-deletion problems
A Agrawal, D Lokshtanov, P Misra, S Saurabh, M Zehavi
ACM Transactions on Algorithms (TALG) 16 (4), 1-38, 2020
252020
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
252018
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
242018
On the parameterized complexity of happy vertex coloring
A Agrawal
International Workshop on Combinatorial Algorithms, 103-115, 2017
222017
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
222017
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
202019
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
172021
On the parameterized complexity of contraction to generalization of trees
A Agarwal, S Saurabh, P Tale
Theory of Computing Systems 63, 587-614, 2019
152019
Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent∗
A Agrawal, L Kanesh, D Lokshtanov, F Panolan, MS Ramanujan, ...
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
142022
Split contraction: The untold story
A Agrawal, D Lokshtanov, S Saurabh, M Zehavi
34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), 2017
142017
The parameterized complexity of guarding almost convex polygons
A Agrawal, KVK Knudsen, D Lokshtanov, S Saurabh, M Zehavi
arXiv preprint arXiv:2003.07793, 2020
112020
Paths to trees and cacti
A Agrawal, L Kanesh, S Saurabh, P Tale
Theoretical Computer Science 860, 98-116, 2021
102021
Parameterized complexity of conflict-free matchings and paths
A Agrawal, P Jain, L Kanesh, S Saurabh
Algorithmica 82 (7), 1939-1965, 2020
92020
On the parameterized complexity of clique elimination distance
A Agrawal, MS Ramanujan
15th International Symposium on Parameterized and Exact Computation (IPEC 2020), 2020
92020
Split contraction: The untold story
A Agrawal, D Lokshtanov, S Saurabh, M Zehavi
ACM Transactions on Computation Theory (TOCT) 11 (3), 1-22, 2019
92019
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20