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 Parameterized Complexity of Conflict-Free Matchings and Paths Agrawal, Akanksha et al. 2019
4 Path Contraction Faster Than 2^n Agrawal, Akanksha et al. 2019
5 Conflict Free Feedback Vertex Set: A Parameterized Dichotomy Agrawal, Akanksha et al. 2018
6 Erdös-Pósa Property of Obstructions to Interval Graphs Agrawal, Akanksha et al. 2018
7 On the Parameterized Complexity of Contraction to Generalization of Trees Agrawal, Akanksha et al. 2018
8 On the Parameterized Complexity of Simultaneous Deletion Problems Agrawal, Akanksha et al. 2018
9 Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems Agrawal, Akanksha et al. 2018
10 Fine-Grained Complexity of Rainbow Coloring and its Variants Agrawal, Akanksha 2017
Current Page :
Number of result pages: 2
Number of documents: 16


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