Accepted To Appear In Journals

1. Bidimensionality and Kernels (with F. Fomin, D. Lokshtanov and D. M. Thilikos). To appear in SIAM Journal on Computing. [A short version of the paper appeared in SODA 10.]
2. Subexponential algorithms for rectilinear Steiner tree and arborescence problems (with F. V. Fomin, S. Kolay, D. Lokshtanov and F. Panolan). To appear in ACM Transactions on Algorithms. [A short version of the paper appeared in SocG 16.]
3. Approximation Schemes for Low-Rank Binary Matrix Approximation Problems (with F. V. Fomin, P. A. Golovach, D. Lokshtanov, and F. Panolan). To appear in ACM Transactions on Algorithms.
4. Quadratic Vertex Kernel for Rainbow Matching (with S. Gupta, S. Roy and M. Zehavi). To appear in Algorithmica.
5. Balanced Judicious Bipartition is FPT (with D. Lokshtanov, R. Sharma and M. Zehavi). To appear in SIAM Journal on Discrete Mathematics. [A short version of the paper appeared in FSTTCS 17.]
6. Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule? (with N. Misra and F. Panolan). [A short version of the paper appeared in MFCS 13.]

2019

1. Minimum bisection is fixed parameter tractable (with M. Cygan, D. Lokshtanov, M. Plipczuck and M. Plipczuck). SIAM J. Comput. 48(2):417-450 (2019). [A short version of the paper appeared in STOC 14.]
2. Spanning Circuits in Regular Matroids (with F. V. Fomin, P. A. Golovach and D. Lokshtanov). ACM Trans. Algorithms 15(4): 52:1-52:38 (2019). [A short version of the paper appeared in SODA 17]
3. Exact Algorithms via Monotone Local Search (with F. V. Fomin, S. Gaspers and D.Lokshtanov). Journal of the ACM (JACM) Volume 66 Issue 2, Article No. 8, (2019). [A short version of the paper appeared in STOC 16.]
4. Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs (with F. V. Fomin, D. Lokshtanov, F. Panolan and M. Zehavi). Discrete Comput Geom (2019). https://doi.org/10.1007/s00454-018-00054-x [A short version of the paper appeared in ICALP 17.]
5. Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems (with F. Fomin, T. Le, D. Lokshtanov, S. Thomasse and M. Zehavi). ACM Trans. Algorithms 15(1): 13:1-13:44 (2019) [A short version of the paper appeared in SODA 18.]
6. Cliquewidth III: Hamiltonian Cycle and the Odd Case of Graph Coloring (with F. Fomin, P. Golovach, D. Lokshtanov, and M. Zehavi). ACM Trans. Algorithms 15(1): 9:1-9:27 (2019). [A short version of the paper appeared in SODA 18.]
7. Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion (with A. Agrawal, D. Lokshtanov, P. Misra and M. Zehavi). ACM Trans. Algorithms 15(1): 11:1-11:28 (2019). [A short version of the paper appeared in SODA 17.]
8. Parameterized Algorithms for L IST K-C YCLE (with F. Panolan and M. Zehavi). Algo rithmica 81(3): 1267-1287 (2019).
9. Parammeterized Compleity of finding maximum q-colorable subgraph on Perfect Graphs (with N. Misra, F. Panolan, A. Rai and V. Raman). Algorithmica 81(1): 26-46 (2019). [A short version of the paper appeared in WG 13.]
10. Ranked Vertex Cover as a Natural Problem for Algebraic Compression (with M. S. Meesum, F. Panolan and M. Zehavi). SIAM J. Discrete Math. 33(3): 1277-1296 (2019).
11. Parameterized Algorithms and Kernels for Rainbow Matching (with S. Gupta, S. Roy, and M. Zehavi). Algorithmica 81(4): 1684-1698 (2019). [A short version of the paper appeared in MFCS 17.]
12. Split Contraction: The Untold Story (with A. Agrawal, D. Lokshtanov and M. Zehavi). ACM Transactions on Computation Theory (TOCT) 11(3): 18:1-18:22 (2019). [A short version of the paper appeared in STACS 17.]
13. Communication Complexity of Pairs of Graph Families with Application (with S. Kolay and F. Panolan). ACM Transactions on Computation Theory (TOCT) 11(2): 11:1-11:28. [A short version of the paper appeared in MFCS 17.]
14. Parameterized single-exponential time polynomial space algorithm for Steiner Tree (with F. V. Fomin, P. Kaski, D. Lokshtanov and F. Panolan). SIAM J. Discrete Math. 33(1): 327-345 (2019). A[A short version of the paper appeared in ICALP 15.]
15. On the Parameterized Complexity of Contraction to Generalization of Trees (with A. Agrawal and P. Tale). Theory Comput. Syst. 63(3): 587-614 (2019). [A short version of the paper appeared in IPEC 17.]
16. The parametrized complexity landscape of finding 2-partitions of digraphs (with Jo- ergen Bang-Jensen, Kristine V.K. Knudsen; and M. Zehavi). Theor. Comput. Sci. 795: 108-114 (2019).
17. Stability in Barter Exchange Markets (with S. Gupta, F. Panolan and M. Zehavi). Autonomous Agents and Multi-Agent Systems 33(5): 518-539 (2019). [A short version of the paper appeared in AAMAS 18.]
18. Editing to Connected f -Degree Graph (with F. V. Fomin, P. Golovach and F. Panolan). SIAM J. Discrete Math. 33(2): 795-836 (2019). [A short version of the paper appeared in In the proceedings of STACS 16.]

2018

1. Simultaneous Feedback Vertex Set: A Parameterized Perspective (with A. Agrawal, D. Lokshtanov, and A. Mouawad). ACM Transactions on Computation Theory (TOCT) 10(4): 18:1-18:25 (2018). [A short version of the paper appeared in STACS 16.]
2. Long directed (s, t)-path: FPT algorithm (with F. V. Fomin, D. Lokshtanov, F. Panolan, and M. Zehavi). Inf. Process. Lett. 140: 8-12 (2018).
3. Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs (with P. Ashok, A. Dudeja and S. Kolay). SIAM J. Discrete Math. 32(2):1189-1208 (2018).
4. Matrix Rigidity: Matrix Theory from the Viewpoint of Parameterized Complexity (with F. Fomin, D. Lokshtanov, M. S. Mohammad, and M. Zehavi). SIAM J. Discrete Math.32(2): 966-985 (2018). [A short version of the paper appeared in STACS 17.]
5. Fully polynomial-time parameterized computations for graphs and matrices of low treewidth (with F. V. Fomin, D. Lokshtanov, M. Pilipczuk, and M. Wrochna). ACM Trans. Algorithms 14(3): 34:1-34:45 (2018). [A short version of the paper appeared in SODA 17.]
6. Kernelization of Cycle Packing with Relaxed Disjointness Constraints (with A. Agrawal,D. Lokshtanov, D. Majumdar and A. E. Mouawad). SIAM J. Discrete Math. 32(3):1619-1643 (2018). [A short version of the paper appeared in ICALP 16.]
7. Rank Reduction of Directed Graphs by Vertex and Edge Deletions (with S. M. Meesum). Algorithmica 80(10): 2757-2776 (2018). [A short version of the paper appeared in LATIN 16.]
8. (k, n − k)-Max-Cut: An $O^\star(2^p)$-Time Algorithm and a Polynomial Kernel (with M. Zehavi). In the proceedings of LATIN ’16, (Springer Verlag, LNCS 9644), 686-699 (2016). Algorithmica 80(12): 3844-3860 (2018). [A short version of the paper appeared in LATIN 16.]
9. Finding Even Subgraphs Even Faster (with P. Goyal, P. Misra , F. Panolan, and G. Philip). J. Comput. Syst. Sci. 97: 1-13 (2018). [A short version of the paper appeared in FSTTCS 15.]
10. Kernels for structural parameterizations of V ERTEX C OVER – case of small degree modulators (with D. Majumdar and V. Raman). Theory Comput. Syst. 62(8): 1910-1951 (2018). [A short version of the paper appeared in IPEC 15.]
11. Deterministic Truncation of Linear Matroids (with with D. Lokshtanov, P. Misra and F. Panolan). ACM Trans. Algorithms 14(2): 14:1-14:20 (2018). [A short version of the paper appeared in ICALP 15.]
12. On the Kernelization Complexity of String Problems (with M. Basavaraju, F. Panolan, A. Rai and M. S. Ramanujan). Theor. Comput. Sci. 708: 18-33 (2018). [A short version of the paper appeared in COCOON 14.]
13. Generalized pseudoforest deletion: Algorithms and uniform kernel (with G. Philip and A. Rai). SIAM J. Discrete Math. 32(2): 882-901 (2018). [A short version of the paper appeared in MFCS 15.]
14. Slightly Superexponential Parameterized Problems (with D. Lokshtanov and D. Marx). SIAM J. Comput. 47(3): 675-702 (2018). [A short version of the paper appeared in SODA 11.]
15. Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal (with D. Lokshtanov and D. Marx). ACM Trans. Algorithms 14(2): 13:1-13:30 (2018). [A short version of the paper appeared in SODA 11.]
16. Reconfiguration on sparse graphs (with D. Lokshtanov, A. E. Mouawad, F. Panolan and M. S. Ramanujan). J. Comput. Syst. Sci. 95: 122-131 (2018). [A short version of the paper appeared in WADS 15.]
17. Exact Algorithms for Terrain Guarding (with P. Ashok, F. V. Fomin, S. Kolay, and M. Zehavi). ACM Trans. Algorithms 14(2): 25:1-25:20 (2018). [A short version of the paper appeared in SOCG 17.]
18. Parameterized Algorithms for Stable Matching with Ties and Incomplete Lists (with D. Adil, S. Gupta, S. Roy and M. Zehavi). Theoretical Computer Science 723: 1-10 (2018). Parameterized algorithms for deletion to classes of acyclic digraphs (with A. Agrawal, R. Sharma and M. Zehavi). Theory Comput. Syst. 62(8): 1880-1909 (2018).
19. Below all subsets for Minimal Connected Dominating Set (with D. Lokshtanov and M. Pilipczuk). SIAM J. Discrete Math. 32(3): 2332-2345 (2018).
20. Covering vectors by spaces: Regular matroids (with F. V. Fomin, P. A. Golovach and D. Lokshtanov). SIAM J. Discrete Math. 32(4): 2512-2565 (2018). [A short version of the paper appeared in ICALP 17.]
21. Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes (with F. V. Fomin and D. Lokshtanov). Journal of ACM, Volume 65, Issue 2, Article No. 2, (2018). [Short versions of the paper appeared in SODA 11 and SODA 12.]
22. Linear Time Parameterized Algorithms for Subset Feedback Vertex Set (with (D. Lokshtanov and M. S. Ramanujan). ACM Trans. Algorithms 14(1): 7:1-7:37 (2018). [A short version of the paper appeared in ICALP 15.]
23. Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors (with F. V. Fomin, D. Lokshtanov and D. Thilikos). ACM Trans. Algorithms 14(1): 6:1-6:31 (2018). [Short versions of the paper appeared in SODA 12 and STACS 13.]
24. Kernels for Deletion to Classes of Acyclic Digraphs (with A. Agrawal, R. Sharma and M. Zehavi). J. Comput. Syst. Sci. 92: 9-21 (2018). [A short version of the paper appeared in ISAAC 16.]
25. Bivariate Complexity Analysis of Almost Forest Deletion (with Ashutosh Rai). Theor. Comput. Sci. 708: 18-33 (2018). [A short version of the paper appeared in COCCON 15.]

2017

1. Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts (with M. S. Ramanujan). ACM Trans. Algorithms 13(4): 46:1-46:25 (2017). [A short version of the paper appeared in SODA 14.]
2. Representative Sets of Product Families (with F. V. Fomin, D. Lokshtanov and F. Panolan). ACM Trans. Algorithms 13(3): 36:1-36:29 (2017). [A short version of the paper appeared in ESA 14.]
3. Uniform Kernelization Complexity of Hitting Forbidden Minors (with A. Giannopoulou, B. M. P. Jansen, and D. Lokshtanov). ACM Trans. Algorithms 13(3): 35:1-35:35 (2017). [A short version of the paper appeared in ICALP 15.]
4. Parameterized Complexity of Directed Steiner Tree on Sparse Graphs (with M Jones, D. Lokshtanov, M. S. Ramanujan and O. Suchý). SIAM J. Discrete Math. 31(2): 12941327 (2017). [A short version of the paper appeared in ESA 13.]
5. Faster Exact Algorithms for Some Terminal Set Problems (with R. Chitnis, F. V. Fomin, D. Lokshtanov, P. Misra and M. S. Ramanujan). J. Comput. Syst. Sci. 88: 195-207 (2017). [A short version of the paper appeared in IPEC 13.]
6. On approximability of optimization problems related to Red/Blue-split graphs. (with S. Mishra, and S. Rajakrishnan). Theor. Comput. Sci. 690: 104-113 (2017).
7. Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth (with D. Lokshtanov, M. Plipczuck and M. Plipczuck). SIAM J. Comput. 46(1): 161-189 (2017). [A short version of the paper appeared in FOCS 14.] (Invited to the special issue of the SIAM Journal on Computing for FOCS 2014).
8. Irrelevant Vertices for the Planar Disjoint Paths Problem (with I. Adler, S. Kolliopoulos, P. K. Krause, D. Lokshtanov and D. Thilikos). J. Comb. Theory, Ser. B 122: 815-843 (2017). [A short version of the paper appeared in ICALP 11.]
9. Hitting Selected Odd Cycles: A Faster Parameterized Algorithm (with D. Lokshtanov, P. Misra and M. S. Ramanujan) (2017). SIAM J. Discrete Math. 31(3): 1581-1615 (2017).
10. On the parameterized complexity of b-chromatic number (with G. Philip and F. Panolan). J. Comput. Syst. Sci. 84: 120-131 (2017). [A short version of the paper appeared in IPEC 15.]
11. Quick but Odd Growth of Cacti (with S. Kolay, D. Lokshtanov and F. Panolan). Algorithmica 79(1): 271-290 (2017). [A short version of the paper appeared in IPEC 15.]
12. Multivariate Complexity Analysis of Geometric Red Blue Set Cover (with P. Ashok and S. Kolay). Algorithmica 79(3): 667-697 (2017). [A short version of the paper appeared in LATIN 16.]
13. Parameterized Complexity of Superstring Problems (with I. Bliznets, F. V. Fomin, P. A.Golovach, N. Karpov and A. S. Kulikov). Algorithmica 79(3): 798-813 (2017). [A short version of the paper appeared in CPM 15.]
14. Parameterized complexity of Strip Packing and Minimum Volume Packing (with P. Ashok, S. Kolay, and S. M. Meesum). Theor. Comput. Sci. 661: 56-64 (2017)

2016

1. Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms (with F. V. Fomin, D. Lokshtanov and F. Panolan). Journal of ACM, Volume 63, Issue 4, Article No. 29:1-21:60 (2016). [A short version of the paper appeared in SODA 14.]
2. (Meta) Kernelization (with H.L.Bodlaender, F.V.Fomin, D.Lokshtanov, E.Penninkx and D.M.Thilikos). Journal of ACM, Volume 63, Issue 5, Article No. 44:1-44:69 (2016). [A short version of the paper appeared in FOCS 09.]
3. On Problems as Hard as CNF-Sat (with M. Cygan, H. Dell, D. Lokshtanov, D. Marx, J. Nederlof, Y. Okamoto, R. Paturi, and M. Wahlstrom). ACM Trans. Algorithms 12(3):41:1-41:24 (2016). [A short version of the paper appeared in CCC 12.]
4. Tree Deletion Set has a Polynomial Kernel (but no OP T O(1) approximation) (with A. C. Giannopoulou, D. Lokshtanov and O. Suchý). SIAM J. Discrete Math. 30(3): 1371-1384 (2016). [A short version of the paper appeared in FSTTCS 14.]
5. Partial Kernels for Set Cover and Test Cover (with M. Basavaraju, M. C. Francis and M.S. Ramanujan). SIAM J. Discrete Math. 30(3): 1401-1423 (2016). [A short version of the paper appeared in FSTTCS 13.]
6. Parameterized Algorithms for Non-separating Trees and Branchings in digraphs (with J. Bang-Jensen and S. Simonsen). Algorithmica 76(1): 279-296 (2016).
7. Algorithms and Kernels for Feedback Set problems in generalizations of Tournaments (with J. Bang-Jensen and A. Maddaloni). Algorithmica 76(2): 320-343 (2016).
8. Hitting forbidden minors: Approximation and Kernelization (with F. V. Fomin, D. Lokshtanov, N. Misra, G. Philip). SIAM J. Discrete Math. 30(1): 383-410 (2016). [A short version of the paper appeared in STACS 11.]
9. Backdoors to q-Horn (with S. Gaspers, S. Ordyniak, S. Szeider and M. S. Ramanujan). Algorithmica 74(1): 540-557 (2016). [A short version of the paper appeared in STACS 13.]
10. Reducing Rank of the Adjacency Matrix by Graph Modification (with S. M. Meesum and P. Misra). Theor. Comput. Sci. 654: 70-79 (2016). [A short version of the paper appeared in COCOON 15.]

2015

1. The Curse of Connectivity: t-Total Vertex (Edge) Cover (with H. Fernau, F. V. Fomin and G. Philip). Theor. Comput. Sci. 565: 1-15 (2015). [A short version of the paper appeared in COCOON 10.]

2014

1. Faster Parameterized Algorithms using Linear Programming (with D. Lokshtanov, N. S. Narayanaswamy, V. Raman and M. S. Ramanujan). ACM Transactions on Algorithms 11(2): 15 (2014). [A short version of the paper appeared in STACS 12.]
2. Incompressibility Using Colors and IDs (with M. Dom and D. Lokshtanov). ACM Transactions on Algorithms 11(2): 13 (2014). [A short version of the paper appeared in ICALP 09.]
3. Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width (with F. V. Fomin, D. Lokshtanov and P. A. Golovach). SIAM Journal on Computing , Volume 43, Issue 5, 1541-1566 (2014). [A short version of the paper appeared in SODA 10.]
4. Hitting and Harvesting Pumpkins (with G. Joret, C. Paul, I. Sau and S. Thomasse). SIAM J. Discrete Math. 28(3): 1363-1390 (2014). [A short version of the paper appeared in ESA 11.]
5. Beyond Max-Cut: λ-Extendible Properties Parameterized Above the Poljak-Turzı́k Bound (with M. Mnich, G. Philip and O. Suchý). J. Comput. Syst. Sci. 80(7): 1384-1403 (2014). [A short version of the paper appeared in FSTTCS 12.]
6. The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles (with N. Misra, G. Philip and V. Raman). Algorithmica 68(2): 504-530 (2014). [A short version of the paper appeared in FSTTCS 10.]
7. On cutwidth parameterized by vertex cover (with M. Cygan, D. Lokshtanov, M. Pilipczuk and M. Pilipczuk). Algorithmica 68(4): 940-953 (2014)). [A short version of the paper appeared in IPEC11.]
8. Fixed-parameter tractability of satisfying beyond the number of variables (with R. Crowston, G. Gutin, M. Jones, V. Raman and A. Yeo). Algorithmica 68(3): 739-757 (2014). [A short version of the paper appeared in SAT 12.]
9. On the hardness of losing width (with M. Cygan, D. Lokshtanov, M. Pilipczuk and M. Pilipczuk). Theory Comput. Syst. 54(1): 73-82 (2014). [A short version of the paper appeared in IPEC 11.]
10. Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization (with S. Misra, M. Kumar and N. Safina Devi). Theor. Comput. Sci. 526: 90-96 (2014). [A short version of the paper appeared in WALCOM 11.]

2013

1. A polynomial kernel for Proper Interval Vertex Deletion (with F. V. Fomin and Y. Villanger). SIAM J. Discrete Math. 27(4): 1964-1976 (2013). [A short version of the paper appeared in ESA 12.]
2. Quadratic Upper Bounds on the Erdös-Pósa property for a generalization of Packing and Covering cycles (with F. V. Fomin, D. Lokshtanov, N. Misra, G. Philip). Journal of Graph Theory 74(4): 417-424 (2013).
3. Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization (with P. Heggernes, D. Kratsch, D. Lokshtanov and V. Raman). Inf. Comput. 231: 109-116 (2013). [A short version of the paper appeared in SWAT 10.]
4. Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs (with F. Dorn, F. V. Fomin, D. Lokshtanov and V. Raman). Inf. Comput. 233: 60-70 (2013). [A short version of the paper appeared in STACS 10.]
5. Imbalance is Fixed Parameter Tractable (with D. Lokshtanov and N. Misra). Inf. Process. Lett. 113(19-21): 714-718 (2013). [A short version of the paper appeared in COCOON 10.]
6. The Parameterized Complexity of Unique Coverage and Its Variants (with with N. Misra, H. Moser, V. Raman and S. Sikdar . Algorithmica 65(3): 517-544 (2013). [A short version of the paper appeared in CSR 09.]
7. A polynomial kernel for Feedback Arc Set on Bipartite Tournaments (with P. Misra, M. S. Ramanujan and V. Raman). Theory Comput. Syst. 53(4): 609-620 (2013). [A short version of the paper appeared in ISAAC 11.]
8. Computing Optimal Steiner Trees in Polynomial Space (with F. V. Fomin, F. Grandoni, D. Kratsch and D. Lokshtanov). Algorithmica 65(3): 584-604 (2013).
9. A Linear Vertex Kernel for Maximum Internal Spanning Tree (with F. V. Fomin, S. Gaspers and S. Thomassé). Journal of Computer System Sciences 79(1): 1-6 (2013). [A short version of the paper appeared in ISAAC 09.]
10. An FPT Algorithm for Tree Deletion Set (with V. Raman and O. Suchý). J. Graph Algorithms Appl. 17(6): 615-628 (2013). [A short version of the paper appeared in WALCOM 13.]
11. Parameterized Complexity of MaxSat Above Average (with R. Crowston, G. Gutin, M. Jones and V. Raman). Theor. Comput. Sci. 511: 77-84 (2013). [A short version of the paper appeared in LATIN 12.]
12. Distortion is Fixed Parameter Tractable (with M.Fellows, F. V. Fomin, D. Lok- shtanov, E. Losievska ja and F. A. Rosamond). TOCT 5(4): 16 (2013). [A short version of the paper appeared in ICALP 09.]

2012

1. Counting Subgraphs via Homomorphisms (with O. Amini and Fedor V. Fomin). SIAM Journal on Discrete Mathematics 26(2): 695-717 (2012). [A short version of the paper appeared in ICALP 09.]
2. Maximum r-regular induced subgraph problem: Fast exponential algorithms and Combinatorial Bounds (with S. Gupta and V. Raman). SIAM Journal on Discrete Mathematics 26(4): 1758-1780 (2012). [A short version of the paper appeared in FSTTCS 06.]
3. Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves (with D. Binkele-Raible, H. Fernau, F. V. Fomin, D. Lokshtanov, and Y. Villanger). ACM Transactions on Algorithms 8(4): 38 (2012). [A short version of the paper appeared in STACS 09.]
4. On Parameterized Independent Feedback Vertex Set (with N. Misra, G. Philip and V. Raman). Theoretical Computer Science 461: 65-75 (2012). [A short version of the paper appeared in COCOON 11.]
5. Local Search: Is brute-force avoidable? (with M. Fellows, F. V. Fomin, D. Lokshtanov, F. A. Rosamond, and Y. Villanger). Journal of Computer and System Sciences 78(3): 707-719 (2012). [A short version of the paper appeared in IJCAI 09.]
6. Sharp Separation and Applications to Exact and Parameterized Algorithms (with F. V. Fomin, F. Grandoni, and D. Lokshtanov). Algorithmica 63(3): 692-706 (2012). [A short version of the paper appeared in LATIN 10.]
7. FPT Algorithms for Connected Feedback Vertex Set (with N. Misra, G. Philip, V. Raman and S. Sikdar). J. Comb. Optim. 24(2): 131-146 (2012). [A short version of the paper appeared in WALCOM 10.]
8. On the approximability of some degree-constrained subgraph problems (with O. Amini, D. Peleg, S. Perennes, and I. Sau). Discrete Applied Mathematics 160(12): 1661-1679 (2012). [A short version of the paper appeared in WAOA 08.]
9. Parameterized complexity of finding small degree-constrained subgraphs (with O. Amini and I. Sau). J. Discrete Algorithms 10: 70-83 (2012). [A short version of the paper appeared in IWPEC (IPEC) 08.]

2011

1. Lower bounds based on the Exponential Time Hypothesis (with D. Lokshtanov and D. Marx). EATCS Bulletin, Volume 105, 41-71 (2011).
2. The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover (with S. Mishra, V. Raman, S. Sikdar, C. R. Subramanian). (Invited paper for ISAAC 2008.) Algorithmica. Volume 61, Issue 4, 857-881 (2011). [Short versions of the paper appeared in ISAAC 07 and ISAAC 08.]
3. Subexponential Algorithms for Partial Cover Problems (with F. Fomin, D. Lokshtanov and V. Raman). Information Processing Letters, Volume 111, Issue 16, 814-818 (2011). [A short version of the paper appeared in FSTTCS 09.]
4. Kernels for Feedback Arc Set In Tournaments (with S. Bessy, F. V. Fomin, S. Gaspers, C. Paul, A. Perez and S. Thomassé). Journal of Computer and System Sciences. Volume 77, Issue 6, Pages 1071-1078 (2011). [A short version of the paper appeared in FSTTCS 09.]
5. Implicit Branching and Parameterized Partial Cover Problems (with O. Amini and F. V. Fomin). Journal of Computer and System Sciences. Volume 77, Issue 6, Pages 1159-1171 (2011). [A short version of the paper appeared in FSTTCS 08.]
6. Bandwidth on AT-free graphs (with P. Golovach, P. Heggernes, D. Kratsch, D. Lokshtanov and D. Meister). Theoretical Computer Science, Volume 412, Issue 50, 7001-7008 (2011). [A short version of the paper appeared in ISAAC 09.]
7. Faster Algorithms for Finding and Counting Subgraphs (with F. V. Fomin, D. Lokshtanov, V. Raman and B. V. R. Rao). Journal of Computer System Sciences 78(3): 698-706 (2012).
8. An Exact Algorithm for Minimum Distortion Embedding (with F. V. Fomin and D. Lokshtanov). Theoretical Computer Science, Volume 412, Issue 29, 3530-3536 (2011). [A short version of the paper appeared in WG 09.]
9. On the Complexity of Some Colorful Problems Parameterized by Treewidth (with M. Fellows, F. V. Fomin, D. Lokshtanov, F. Rosamond, S. Szeider and C. Thomassen). Information and Computation, Volume 209, Issue 2, 143-153 (2011). [A short version of the paper appeared in COCOA 07.]
10. A Linear Kernel for Planar Connected Dominating Set (with D. Lokshtanov and M. Mnich). Theoretical Computer Science, Volume 412, Issue 23, 2536-2543 (2011). [A short version of the paper appeared in TAMC 09.]
11. Lower Bounds on Kernelization (with N. Misra and V. Raman). Discrete Optimization, Volume 8, Issue 1, 110-128 (2011).
12. On the Drected Degree-Preserving Spanning Tree Problem (with D. Lokshtanov, V. Raman and S. Sikdar). Discrete Optimization, Volume 8, Issue 1, 97-109 (2011). [A short version of the paper appeared in IWPEC (IPEC) 09.]
13. Improving the gap of Erdös-Pósa property for minor-closed graph classes (with F. V. Fomin and D. M. Thilikos). Journal of Graph Theory, Volume 66, Issue 3, 235-240 (2011). [A short version of the paper appeared in CTW 08.]

2010

1. Parameterized algorithm for Eternal Vertex Cover (with F. V. Fomin, S. Gaspers, P. A. Golovach and D. Kratsch). Information Processing Letters, Volume 110, 702-706 (2010).
2. Intractability of Clique-Width Parameterizations (with F. V. Fomin, D. Lokshtanov and P. A. Golovach). SIAM Journal on Computing , Volume 39, Issue 5, 1941-1956 (2010). [A short version of the paper appeared in SODA 09.]
3. Iterative Compression and Exact Algorithms (with F. V. Fomin, S. Gaspers, D. Kratsch, and M. Liedloff). Theoretical Computer Science, Volume 411, Issue (7-9), 1045-1053 (2010). [A short version of the paper appeared in MFCS 08.]
4. Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem (with N. Cohen, F. V. Fomin, G. Gutin, E. J. Kim and Anders Yeo). Journal of Computer and System Sciences. Volume 76, Issue 7, Pages 650-662 (2010). [A short version of the paper appeared in COCOON 09.]

2009

1. Spanning Directed Tree with many Leaves (with N. Alon, F. V. Fomin, G. Gutin and M. Krivelevich). SIAM Journal on Discrete Mathematics. Volume 23(1), Pages 466-476 (2009). [A short version of the paper appeared in FSTTCS 07.]
2. The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number (with M. Fellows, D. Lokshtanov, N. Misra, M. Mnich and F. A. Rosamond). Theory of Computing Systems. Volume 45(4): 822-848 (2009).
3. On Two Techniques of Combining Branching and Treewidth (with F. V. Fomin, S. Gaspers, and A. A. Stepanov). (Invited paper for ISAAC 2006. ) Algorithmica. Volume 54, Issue 2, Pages 181-207 (2009). [A short version of the paper appeared in ISAAC 06.]

2008

• Short Cycles make W-hard problems hard: FPT algorithms for W-hard problems in Graphs with no short cycles (with V. Raman). Algorithmica. Volume 52, Issue 2, Pages 203-225 (2008). [A short version of the paper appeared in SWAT 06.]

2007

1. Improved Fixed Parameter Tractable Algorithms for Two Edge Problems – MAXCUT and MAXDAG (with V. Raman). Information Processing Letters (IPL). Volume 104(2), Pages 65-72 (2007).
2. Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques (with V. Raman and S. Sikdar). Theory of Computing Systems. Volume 41, Issue 3, Pages 563-587 (2007). [A short version of the paper appeared in ICTCS 05.]

2006

1. Faster Fixed Parameter Tractable Algorithms for Finding Feedback Vertex Sets (with V. Raman and C. R. Subramanian). ACM Transactions on Algorithms (TALG). Volume 2, Issue 3, Pages 403-415 (2006). [Short versions of the paper appeared in ISAAC 02 and GRACO 05.]
2. Parameterized Algorithms for Feedback Set Problems and Their Duals in Tournaments (with V. Raman). Theoretical Computer Science (TCS). Volume 351, Issue 3, Pages 446-458 (2006). [Short versions of the paper appeared in WADS 03 and IWPEC (IPEC) 04.]