No. Title Author Year
1 Conflict Free Feedback Vertex Set: A Parameterized Dichotomy Agrawal, Akanksha et al. 2018
2 Erdös-Pósa Property of Obstructions to Interval Graphs Agrawal, Akanksha et al. 2018
3 On the Parameterized Complexity of Contraction to Generalization of Trees Agrawal, Akanksha et al. 2018
4 On the Parameterized Complexity of Simultaneous Deletion Problems Agrawal, Akanksha et al. 2018
5 Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems Agrawal, Akanksha et al. 2018
6 Fine-Grained Complexity of Rainbow Coloring and its Variants Agrawal, Akanksha 2017
7 Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set Agrawal, Akanksha et al. 2017
8 Split Contraction: The Untold Story Agrawal, Akanksha et al. 2017
9 Kernelization of Cycle Packing with Relaxed Disjointness Constraints Agrawal, Akanksha et al. 2016
10 Kernels for Deletion to Classes of Acyclic Digraphs Agrawal, Akanksha et al. 2016
Current Page :
Number of result pages: 2
Number of documents: 12


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI