Παρακολούθηση
Akanksha Agrawal
Akanksha Agrawal
Indian Institute of Technology Madras
Η διεύθυνση ηλεκτρονικού ταχυδρομείου έχει επαληθευτεί στον τομέα cse.iitm.ac.in - Αρχική σελίδα
Τίτλος
Παρατίθεται από
Παρατίθεται από
Έτος
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
372017
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
372017
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
362015
Simultaneous Feedback Edge Set: A Parameterized Perspective
A Agrawal, F Panolan, S Saurabh, M Zehavi
International Symposium on Algorithms and Computation 64, 5:1--5:13, 2016
292016
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
262017
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
252018
On the parameterized complexity of happy vertex coloring
A Agrawal
International Workshop on Combinatorial Algorithms, 103-115, 2017
232017
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
222019
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
192022
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
192021
Parameterized complexity of conflict-free matchings and paths
A Agrawal, P Jain, L Kanesh, S Saurabh
Algorithmica 82 (7), 1939-1965, 2020
142020
On the parameterized complexity of clique elimination distance
A Agrawal, MS Ramanujan
15th International Symposium on Parameterized and Exact Computation (IPEC 2020), 2020
142020
On the parameterized complexity of contraction to generalization of trees
A Agarwal, S Saurabh, P Tale
Theory of Computing Systems 63, 587-614, 2019
142019
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
Discrete & Computational Geometry 71 (2), 358-398, 2024
132024
Paths to trees and cacti
A Agrawal, L Kanesh, S Saurabh, P Tale
Theoretical Computer Science 860, 98-116, 2021
132021
Clustering what matters: optimal approximation for clustering with outliers
A Agrawal, T Inamdar, S Saurabh, J Xue
Journal of Artificial Intelligence Research 78, 143-166, 2023
112023
Split contraction: The untold story
A Agrawal, D Lokshtanov, S Saurabh, M Zehavi
ACM Transactions on Computation Theory (TOCT) 11 (3), 1-22, 2019
112019
Connecting the dots (with minimum crossings)
A Agrawal, G Guspiel, J Madathil, S Saurabh, M Zehavi
Dagstuhl Publishing, 2019
112019
Preparation of ex-situ Mixed Sintered Biphasic Calcium Phosphate Ceramics from Its Co-Precipitated Precursors and Their Characterization
R Sarkar, A Agrawal, R Ghosh
Transactions of the Indian Ceramic Society 78 (2), 101-107, 2019
102019
Δεν είναι δυνατή η εκτέλεση της ενέργειας από το σύστημα αυτή τη στιγμή. Προσπαθήστε ξανά αργότερα.
Άρθρα 1–20