No. Title Author Year
1 Connecting the Dots (with Minimum Crossings) Agrawal, Akanksha et al. 2019
2 Exploring the Kernelization Borders for Hitting Cycles Agrawal, Akanksha et al. 2019
3 Conflict Free Feedback Vertex Set: A Parameterized Dichotomy Agrawal, Akanksha et al. 2018
4 Erdös-Pósa Property of Obstructions to Interval Graphs Agrawal, Akanksha et al. 2018
5 On the Parameterized Complexity of Contraction to Generalization of Trees Agrawal, Akanksha et al. 2018
6 On the Parameterized Complexity of Simultaneous Deletion Problems Agrawal, Akanksha et al. 2018
7 Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems Agrawal, Akanksha et al. 2018
8 Fine-Grained Complexity of Rainbow Coloring and its Variants Agrawal, Akanksha 2017
9 Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set Agrawal, Akanksha et al. 2017
10 Split Contraction: The Untold Story Agrawal, Akanksha et al. 2017
Current Page :
Number of result pages: 2
Number of documents: 14


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