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 Classification of Deletion to List Matrix-Partition for Low-Order Matrices Agrawal, Akanksha et al. 2019
4 Parameterized Complexity of Conflict-Free Matchings and Paths Agrawal, Akanksha et al. 2019
5 Parameterized Streaming Algorithms for Min-Ones d-SAT Agrawal, Akanksha et al. 2019
6 Path Contraction Faster Than 2^n Agrawal, Akanksha et al. 2019
7 Conflict Free Feedback Vertex Set: A Parameterized Dichotomy Agrawal, Akanksha et al. 2018
8 Erdös-Pósa Property of Obstructions to Interval Graphs Agrawal, Akanksha et al. 2018
9 On the Parameterized Complexity of Contraction to Generalization of Trees Agrawal, Akanksha et al. 2018
10 On the Parameterized Complexity of Simultaneous Deletion Problems Agrawal, Akanksha et al. 2018
11 Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems Agrawal, Akanksha et al. 2018
12 Fine-Grained Complexity of Rainbow Coloring and its Variants Agrawal, Akanksha 2017
13 Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set Agrawal, Akanksha et al. 2017
14 Split Contraction: The Untold Story Agrawal, Akanksha et al. 2017
15 Kernelization of Cycle Packing with Relaxed Disjointness Constraints Agrawal, Akanksha et al. 2016
16 Kernels for Deletion to Classes of Acyclic Digraphs Agrawal, Akanksha et al. 2016
17 Simultaneous Feedback Edge Set: A Parameterized Perspective Agrawal, Akanksha et al. 2016
18 Simultaneous Feedback Vertex Set: A Parameterized Perspective Agrawal, Akanksha et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 18


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