Conference Publications

Conference Publications yet to appear in journals

2021

Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting (with D. Lokshtanov, and M. Zehavi). In the Proceedings of the 32nd ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), ACM and SIAM, pp. 179-198, 2021.
FPT Approximation for FPT Problems (with D. Lokshtanov, P. Misra, M. S. Ramanujan and M. Zehavi). In the Proceedings of the 32nd ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), ACM and SIAM, pp. 199-218, 2021.
A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane (with N. Kumar, D. Lokshtanov, and S. Suri). In the Proceedings of the 32nd ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), ACM and SIAM, pp. 822-839, 2021.
Strong Connectivity Augmentation is FPT (with Kristine V.K. Knudsen and P. Misra). In the Proceedings of the 32nd ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), ACM and SIAM, pp. 219-234, 2021.

2020

On the (Parameterized) Complexity of Almost Stable Marriage (with S. Gupta, P. Jain, S. Roy, and M. Zehavi). To appear in the Proceedings of 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020), 2020.
Optimal Output Sensitive Fault Tolerant Cuts (with N. Banerjee, and V. Raman). To appear in the Proceedings of 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020), 2020.
Parameterized Complexity of Feedback Vertex Sets on Hypergraphs (with P. Choudhary, D. Lokshtanov, L. Kanesh, and F. Panolan). To appear in the Proceedings of 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020), 2020.
On the Parameterized Complexity of Maximum Degree Contraction Problem (with P. Tale). To appear in the Proceedings of 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), 2020.
A Polynomial Kernel for Paw-Free Editing (with E. Eiben, and William Lochet). To appear in the Proceedings of 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), 2020.
Parameterized Complexity of Directed Spanner Problems (with F. V. Fomin, P. Golovach, W. Lochet, P. Misra, and R. Sharma). To appear in the Proceedings of 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), 2020.
Improved FPT Algorithms for Deletion to Forest-like Structures (with K. N Gowda, A. Lonkar, F. Panolan, and V. Patel). To appear in the Proceedings of 31st International Symposium on Algorithms and Computation (ISAAC 2020), 2020.
A Parameterized Approximation Scheme for Min k-Cut (with D. Lokshtanov and V. Surianarayanan). To appear in the 61st Annual Symposium on Foundations of Computer Science (FOCS 2020), 2020.
On the Parameterized Complexity of Deletion to H-free Strong Components (with R. Neogi, M. S. Ramanujan, and R. Sharma). Proceedings of 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020), (LIPIcs 170), 75:1-75:13 (2020).
Quick Separation in Chordal and Split Graphs (with P. Misra, F. Panolan, A. Rai, and R. Sharma). Proceedings of 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020), (LIPIcs 170), 70:1-70:14 (2020).
Approximation in (Poly)logarithmic Space (with A. Biswas and V. Raman). Proceedings of 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020), (LIPIcs 170), 16:1-16:15 (2020).
Fixed Parameter Tractability of Graph Deletion Problems over Data Streams (with A. Bishnu, A. Ghosh, S. Kolay, and G. Mishra). Proceedings of 26th International Conference on Computing and Combinatorics (COCOON 2020), (Springer Verlag, LNCS 12273), 652-663, 2020.
Parameterized Complexity of Maximum Edge Colorable Subgraph (with A. Agrawal, M. Kundu, A. Sahu, and P. Tale). Proceedings of 26th International Conference on Computing and Combinatorics (COCOON 2020), (Springer Verlag, LNCS 12273), 615-626, 2020.
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs (with S. Gunda, P. Jain, D. Lokshtanov, and P. Tale). Proceedings of 23rd International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPORX 2020), (LIPIcs 176), 51:1-51:19 (2020).
Well Structured Committees (with S. Gupta and P. Jain). Proceedings of 29th International Joint Conference on Artificial Intelligence and the 17th Pacific Rim International Conference on Artificial Intelligence (IJCAI-PRICAI 2020): 189-195, 2020.
A (2 + \epsilon)-factor Approximation Algorithm for Split Vertex Deletion (with D. Lokshtanov, P. Misra, F. Panolan, and G. Philip). Proceedings of 47th International Colloquium on Automata, Languages and Programming (ICALP 2020), (LIPIcs 168), 80:1-80:16 (2020).
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds (with F. V. Fomin, D. Lokshtanov, I. Mihajlin, and M. Zehavi). Proceedings of 47th International Colloquium on Automata, Languages and Programming (ICALP 2020), (LIPIcs 168), 49:1-49:18 (2020).
On the Parameterized Complexity of Grid Contraction (with U. D. S. Souza and P. Tale). Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020), (LIPIcs 162), 34:1-34:17 (2020).
Kernelization of Arc Disjoint Cycle Packing in alpha-bounded digraphs (with A. Sahu). Proceedings of the 15th International Computer Science Symposium in Russia (CSR 2020), (Springer Verlag,LNCS 12159), 367-378, 2020.
Parameterized Complexity of Fair Feedback Vertex Set Problem (with L. Kanesh, S. Maity, and K. Muluk). Proceedings of the 15th International Computer Science Symposium in Russia (CSR 2020), (Springer Verlag, LNCS 12159), 250-262, 2020.
On the Complexity of Singly Connected Vertex Deletion (with A. Das, L. Kanesh, Jayakrishnan M., K. Muluk, and N. Purohit). Proceedings of the 31st International Workshop on Combinatorial Algorithms (IWOCA 2020), (Springer Verlag, LNCS 12126), 237-250, 2020.
Graph Hamiltonicity Parameterized by Proper Interval Deletion Set (with P. A. Golovach, R. Krithika, A. Sahu, and M. Zehavi). To appear in the Proceedings of the 14th Latin American Theoretical Informatics Symposium (LATIN 2020), 2020.
ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs (with F. V. Fomin, D. Lokshtanov, F. Panolan and M. Zehavi). Proceedings of the 36th International Symposium on Computational Geometry (SoCG 2020), (LIPIcs 164), 44:1-44:18 (2020).
The Parameterized Complexity of Guarding Almost Convex Polygons (with A. Agrawal, K. Knudsen, D. Lokshtanov, and M. Zehavi). Proceedings of the 36th International Symposium on Computational Geometry (SoCG 2020), (LIPIcs 164), 3:1-3:16 (2020).
Hitting Topological Minors is FPT (with F. V. Fomin, D. Lokshtanov, F. Panolan and M. Zehavi). Proceedings of the 52nd ACM Symposium on Theory of Computing (STOC 2020), ACM, 1317-1326, 2020.
An Exponential Time Parameterized Algorithm for Planar Disjoint Paths (with D. Lokshtanov, P. Misra, M. Pilipczuk and M. Zehavi). Proceedings of the 52nd ACM Symposium on Theory of Computing (STOC 2020), ACM, STOC 2020: 1307-1316, 2020.
2-Approximating Feedback Vertex Set in Tournaments (with D. Lokshtanov, P. Misra, J. Mukherjee, F. Panolan and G. Philip). In the Proceedings of the 31st ACM-SIAM Symposium on Discrete Algorithms (SODA 2020), ACM and SIAM, pp. 1010-1018, 2020. [pdf]
Parameterized Complexity and Approximability of Directed Odd Cycle Transversal (with D. Lokshtanov, M. S. Ramanujan and M. Zehavi). In the Proceedings of the 31st ACM-SIAM Symposium on Discrete Algorithms (SODA 2020), ACM and SIAM, pp. 2181-2200, 2020.
Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs (with F. V. Fomin, D. Lokshtanov and M. Zehavi). In the Proceedings of the 31st ACM-SIAM Symposium on Discrete Algorithms (SODA 2020), ACM and SIAM, pp. 2299-2318, 2020.
Parameterization Above a Multiplicative Guarantee (with F. V. Fomin, P. A. Golovach, D. Lokshtanov, F. Panolan and M. Zehavi). In the proceedings of ITCS ’20, (LIPIcs 151), pp. 39:1-39:13 (2020).
Fault Tolerant Subgraphs with Applications in Kernelization (with W. Lochet, D. Lok- shtanov, P. Misra, R. Sharma and M. Zehavi). In the proceedings of ITCS ’20, (LIPIcs 151), pp. 47:1-47:22 (2020).

2019

Exact and Approximate Digraph Bandwidth (with P. Jain, L. Kanesh, W. Lochet and R. Sharma). In the proceedings of FSTTCS ’19, (LIPICs 150), 18:1-18:15 (2019).
Parameterized Streaming Algorithms for MIN-ONES d-SAT(with A.Agrawal, A.Biswas, E. Bonnet, N. Bretell, R. Curticapean, D. Marx, T. Miltzow and V. Raman). In the proceedings of FSTTCS ’19, (LIPICs 150), 8:1-8:20 (2019).
Parameterized Dichotomy of Deletion to List Matrix-Partition for low-order Matrices (with A. Agrawal, S. Kolay, and J. Madathil). In the proceedings of ISSAC ’19, (LIPICs 149), 41:1-41:14 (2019).
Going Far From Degeneracy (with F. V. Fomin, P. A. Golovach, D. Lokshtanov, F. Panolan and M. Zehavi). In the proceedings of ESA ’19, (LIPICs 144), 47:1-47:14 (2019).
On Succinct Encodings for the Tournament Fixing Problem (with S. Gupta, M.S. Ramanujan and M. Zehavi). In the proceedings of IJCAI 2019: 322-328.
Path Contraction Faster than 2ⁿ(with A. Agrawal, F. Fomin, D. Lokshtanov, and P. Tale). In the proceedings of ICALP ’19, (LIPIcs 132), 11:1-11:13 (2019).
Decomposition of Map Graphs with Applications (with F. V. Fomin, D. Lokshtanov, F. Panolan and M. Zehavi). In the proceedings of ICALP ’19, (LIPIcs 132), 60:1-60:15 (2019).
Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals (with F. V. Fomin, D. Lokshtanov, P. Golovach and M. Zehavi). In the proceedings of ICALP ’19, (LIPIcs 132), 59:1-59:13 (2019).
Approximate Counting of k-Paths: Deterministic and in Polynomial Space (with A. Bjo ̈rklund, D. Lokshtanov, and M. Zehavi). In the proceedings of ICALP ’19, (LIPIcs 132), 24:1-24:15 (2019).
Connecting the Dots (with Minimum Crossings) (with A. Agrawal, G. Guspiel, J. Ma- dathil, and M. Zehavi). In the proceedings of SoCG ’19, (LIPIcs 129), 7:1-7:17 (2019).
Gehrlein Stability in Committee Selection: Parameterized Hardness and Algorithms (with S. Gupta, P. Jain, S. Roy, and M. Zehavi). In the proceedings of AAMAS 2019: 511-519.
Packing Arc-Disjoint Cycles in Tournaments (with S. Bessy, M. Bougeret, R. Krithika, A. Sahu, J. Thiebaut and M. Zehavi). In the proceedings of MFCS ’19, (LIPIcs 138), 27:1-27:14 (2019).
Parameterized Complexity of Conflict-Free Matchings and Paths (with A. Agrawal, P. Jain and L. Kanesh). In the proceedings of MFCS ’19, (LIPIcs 138), 35:1-35:15 (2019).
Solving Group Interval Scheduling Efficiently (with A. Biswas and V. Raman). In the proceedings of IWOCA’ 19, (Springer Verlag, LNCS 11638), 97-107 (2019).
Fully Dynamic Arboricity Maintenance (with N. Banerjee and V. Raman). In the proceedings of COCOON’ 19, (Springer Verlag, LNCS 11653), 1-12 (2019).
An Erdos-Posa Theorem on Neighborhoods and Domination Number (with J.Madathil and P. Misra). In the proceedings of COCOON’ 19, (Springer Verlag, LNCS 11653), 437-444 (2019).
Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS (with D. Lokshtanov, M.S. Ramanujan, R. Sharma, and M. Zehavi). In the proceedings of WADS’ 19, (Springer Verlag, LNCS 11646), 523-537 (2019).
Balanced Stable Marriage: How Close is Close Enough? (with S. Gupta, S. Roy and M. Zehavi). In the proceedings of WADS ’19, (Springer Verlag, LNCS 11646), 423-437 (2019).
On the Complexity of Mixed Dominating Set (with J. Madathil, F. Panolan, and A. Sahu). In the proceedings of CSR ’19, (Springer Verlag, LNCS 11532), 262-274 (2019).
On the Parameterized Complexity of Edge-Linked Paths (with N.Misra,and F.Panolan). In the proceedings of CSR’ 19, (Springer Verlag, LNCS 11532), 286-298 (2019).
Subset Feedback Vertex Set in Chordal and Split Graphs (with G. Philip, V. Rajan, and P. Tale). To appear in the proceedings of CIAC 2019.
Popular Matching in Roommates Setting is NP-hard (with S. Gupta, P. Misra and M. Zehavi). Proceedings of the 30th ACM-SIAM Symposium on Discrete Algorithms (SODA 2019), ACM and SIAM, pp. 2810-2822, 2019.
Interval Vertex Deletion Admits a Polynomial Kernel (with A. Agrawal, P. Misra, and M. Zehavi). Proceedings of the 30th ACM-SIAM Symposium on Discrete Algorithms (SODA 2019), ACM and SIAM, pp. 1711-1730, 2019.
Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity (with F. Panolan and M. Zehavi). Proceedings of the 30th ACM-SIAM Symposium on Discrete Algorithms (SODA 2019), ACM and SIAM, pp. 1035-1054, 2019.

2018

Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number (with P. Misra, R. Sharma, and M. Zehavi). In the proceedings of FSTTCS ’18, (LIPIcs 122), 25:1-25:12 (2018).
Parameterized Query Complexity of Hitting Set using Stability of Sunflowers (with A. Bishnu, A. Ghosh, S. Kolay, and G. Mishra). In the proceedings of ISAAC ’18, (LIPIcs123), 35:1-35:19 (2018).
Exploring the Kernelization Borders for Hitting Cycles (with A. Agrawal, L. Kanesh and P. Jain). In the proceedings of IPEC ’18, (LIPIcs 115), 14:1-14:14 (2018).
A Strongly-Uniform Slicewise Polynomial-Time Algorithm for the Embedded Planar Diameter Improvement Problem (with Mateus De Oliveria Oliveira, and D. Lokshtanov). In the proceedings of IPEC ’18, (LIPIcs 115), 25:1-25:13 (2018).
Parameterized Complexity of Multi-Node Hubs (With M. Zehavi). In the proceedings of IPEC ’18, (LIPIcs 115), 8:1-8:14 (2018).
On the Optimality of Pseudo-polynomial Algorithms for Integer Programming (with F. V. Fomin, F. Panolan and M. S. Ramanujan). In the proceedings of ESA 2018, (LIPIcs 112), 31:1–31:13 (2018).
Conflict Free Feedback Vertex Set: A Parameterized Dichotomy (with A. Agrawal, L.Kanesh, P. Jain, and D. Lokshtanov). In the proceedings of MFCS 2018, (LIPIcs 117), 53:1:–53:15 (2018).
Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems (with A. Agrawal, D. Lokshtanov, P. Misra and M. Zehavi). In the proceedings of APPROX RANDOM 2018, (LIPIcs 116), 1:1:–1:15 (2018).
Winning a Tournament by Any Means Necessary (with S. Gupta, S. Roy and M. Zehavi). In the proceedings of IJCAI-ECAI 2018: 282-288.
When Rigging a Tournament, Let Greediness Blind You (with S. Gupta, S. Roy and M. Zehavi). In the proceedings of IJCAI-ECAI 2018: 275-281.
Hitting and Covering Partially (with A. Agrawal, P. Choudhary, P. Jain, L. Kanesh, and V. Sahlot). In the proceedings of COCOON ’18, (Springer Verlag, LNCS 10976), 751-763 (2018).
Reducing CMSOL Model Checking to Highly Connected Graphs (with D. Lokshtanov, M. S. Ramanujan and M. Zehavi). In the proceedings of ICALP 2018, (LIPIcs 107), 135:1–135:14 (2018).
Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces (with T. Carpenter, F. Fomin, D. Lokshtanov, and A. Sidiropoulos). In the proceedings of SoCG 2018, (LIPIcs 99), 21:1–21:14 (2018).
Max-Cut Above Spanning Tree is Fixed Parameter Tractable (with J. Madathil, and M. Zehavi). In the proceedings of CSR ’18, (Springer Verlag, LNCS 10846), 244-256 (2018).
Erdős-Pósa Property of Obstructions to Interval Graphs (with A. Agrawal, D. Lokshtanov, P. Misra, and M. Zehavi). In the proceedings of STACS ’18, (LIPIcs 96), 71:1-71:15 (2018).
The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue (with R. Krithika, A. Sahu, and M. Zehavi). In the proceedings of LATIN ’18, (Springer Verlag, LNCS 10807), 712-726 (2018).
A Polynomial Sized Kernel for Tracking Paths Problem (A. Banik, P. Choudhary, D. Lokshtanov, and V. Raman). In the proceedings of LATIN ’18, (Springer Verlag, LNCS 10807), 94-107 (2018).
Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity (with D. Lokshtanov, P. Misra, F. Panolan and M. Zehavi). In the proceedings of ITCS ’18, (LIPIcs 94), 32:1-32:13 (2018).
Covering small independent sets and separators with applications to parameterized algorithms (with D. Lokshtanov, F. Panolan, R. Sharma and M. Zehavi). Proceedings of the 29th ACM-SIAM Symposium on Discrete Algorithms (SODA 2018), ACM and SIAM, pp. 2785-2800, 2018.
When Recursion is Better than Iteration: A Linear-Time Algorithm for Acyclicity with Few Error Vertices (with D. Lokshtanov and M. S. Ramanujan). Proceedings of the 29th ACM-SIAM Symposium on Discrete Algorithms (SODA 2018), ACM and SIAM, pp. 1916-1933, 2018.
Parameterized algorithms for survivable network design with uniform demands (with J. Bang-JensenM. Basavaraju, K. V. Klinkby, P. Misra, Ramanujan M. S and M. Zehavi). Proceedings of the 29th ACM-SIAM Symposium on Discrete Algorithms (SODA 2018), ACM and SIAM, pp. 2838-2850, 2018.

2017

Parameterized Analysis for the Group Activity Selection Problem on Graphs (with S. Gupta, S. Roy, and M. Zehavi). In the proceedings of SAGT ’17, (Springer Verlag, LNCS 10504), 106-118 (2017).
A Linear-Time Parameterized Algorithm for Node Unique Label Cover (with D. Lokshtanov and M. S. Ramanujan). In the proceedings of ESA ’17, (LIPIcs 87), 57:1-57:15 (2017).
Linear Representation of Transversal Matroids and Gammoids parameterized by rank (with P. Misra, Ramanujan M. S and F. Panolan). In the proceedings of COCOON ’17, (Springer Verlag, LNCS 10392), 420-432 (2017).
Packing Cycles Faster Than Erdős-Pósa (with D. Lokshtanov, A. Mouawad, and M. Zehavi). In the proceedings of ICALP ’17, (LIPIcs 80), 26:1-26:14 (2017).
Parameterized Complexity of Geometric Covering Problems Having Conflicts (with A. Banik, F. Panolan, V. Raman, and V. Sahlot). In the proceedings of WADS ’17,(Springer Verlag, LNCS 10389), 61-72 (2017).
Fast Exact Algorithms for Survivable Network Design with Uniform Requirements (with A. Agrawal, P. Misra, and F. Panolan). In the proceedings of WADS ’17, (Springer Verlag, LNCS 10389), 25-36 (2017).
Lossy Kernelization (with D. Lokshtanov, F. Panolan and M. S. Ramanujan). In the Proceedings of the ACM Symposium on the Theory of Computing (STOC 2017), 224-237, ACM, 2017.
Paths to Trees and Cacti (with A. Agrawal, L. Kanesh and P. Tale). In the proceedings of CIAC ’17, (Springer Verlag, LNCS 10236), 31-42 (2017).
Parameterized and Exact Algorithms for Class Domination Coloring (with R. Krithika,A. Rai, and P. Tale). In the proceedings of SOFSEM ’17, (Springer Verlag, LNCS 10139), 336-349 (2017).

2016

Simultaneous Feedback Edge Set: A Parameterized Perspective (with A. Agrawal, F. Panolan and M. Zehavi). In the proceedings of ISAAC ’16, (LIPIcs 64), 5:1-5:13 (2016).
Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set (with A. Agrawal, S. Gupta and R. Sharma). In the proceedings of IPEC ’16, (LIPIcs 63), 2:1-2:14 (2016).
Subexponential parameterized algorithms for planar and apex-minor-free graphs via low treewidth pattern covering (with F. V. Fomin, D. Lokshtanov, D. Marx, M. Pilipczuk, and M. Pilipczuk). In the proceedings of FOCS, 515-524 (2016).
Kernelizing Buttons and Scissors (with A. Agrawal, S. Kolay, and R. Sharma). In the proceedings of CCCG, 279-286 (2016).
Parameterized Algorithms on Perfect Graphs for deletion to (r, `) graphs (with S. Kolay, F. Panolan and V. Raman). In the proceedings of MFCS ’16, (LIPIcs 58), 75:1-75:13 (2016).
Lower bounds for approximation schemes for Closest String (with M. Cygan, D. Lokshtanov, M. Pilipczuk and M. Pilipczuk). In the proceedings of SWAT’16, (LIPIcs 53),12:1-12:10 (2016).
A Parameterized Algorithm for Mixed-Cut (with A. Rai and Ramanujan M. S). In the proceedings of LATIN ’16, (Springer Verlag, LNCS 9644), 672-685 (2016).
A faster FPT Algorithm and a smaller Kernel for Block Graph Vertex Deletion (with A. Agrawal, S. Kolay and D. Lokshtanov). In the proceedings of LATIN ’16, (Springer Verlag, LNCS 9644), 1-13 (2016).

2015

FO Model Checking on Posets of Bounded Width (J. Gajarský, P. Hlinený, D. Lokshtanov, J. Obdrzálek, S. Ordyniak, M. S. Ramanujan). In the proceedings of FOCS, 963-974 (2015).
On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids (with M. S. Ramanujan and F. Panolan). In the proceedings of WADS ’15,(Springer Verlag, LNCS 9214), 566-577 (2015).
Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs (with N. Banerjee, S. Chakraborty, V. Raman and S. Roy). In the proceedings of COCOON ’15, (Springer Verlag, LNCS 9198), 349-360 (2015).
Unique Covering Problems with Geometric Sets (with P. Ashok, S. Kolay and N. Misra). In the proceedings of COCOON ’15, (Springer Verlag, LNCS 9198), 548-558 (2015).
Solving d-SAT via Backdoors to Small Treewidth (with F. V. Fomin, D. Lokshtanov, N. Misra and M. S. Ramanujan). Proceedings of the 26th ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), ACM and SIAM, pp. 630-641, 2015.

2014

Connecting Vertices by Independent Trees (with M. Basavaraju, F. V. Fomin and P. A. Golovach). In the proceedings of FSTTCS’14, 73-84 (2014).
Solving Multicut Faster Than 2 n (with D. Lokshtanov and O. Suchý). In the proceedings of ESA ’14, (Springer Verlag, LNCS 8737), 666-676 (2014).
Parameterized Approximations via d-Skew-Symmetric Multicut (with S. Kolay, P. Misra and M. S. Ramanujan). In the proceedings of MFCS ’14, (Springer Verlag, LNCS 8635), 457-468 (2014).
Parameterized Algorithms to Preserve Connectivity (with M. Basavaraju, F. V. Fomin, P. A. Golovach, P. Misra and M. S. Ramanujan). In the proceedings of ICALP ’14, (Springer Verlag, LNCS 8572), 800-811 (2014).
A Near-Optimal Planarization Algorithm (with B. M. P. Jansen and D. Lokshtanov). Proceedings of the 25th ACM-SIAM Symposium on Discrete Algorithms (SODA 2014), ACM and SIAM, pp. 1802-1811, 2014.

2013

Polynomial Kernels for λ-extendible Properties Parameterized Above the Poljak-Turzik Bound (with R. Crowston, M. Jones, G. Muciaccia, G. Philip and A. Rai). In the proceedings of FSTTCS ’13, 43-54 (2013).
Hardness of r-dominating SET on Graphs of Diameter r + 1 (with D. Lokshtanov, N. Misra, G. Philip and M. S. Ramanujan). In the proceedings of IPEC ’13, (Springer Verlag, LNCS 8246), 255-267 (2013).
On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges (with D. Lokshtanov and N. Misra). In the proceedings of IPEC ’13, (Springer Verlag, LNCS 8246), 243-254 (2013).

2012

Subexponential Parameterized Odd Cycle Transversal on Planar Graphs (with D. Lokshtanov and M. Wahlström) In the proceedings of FSTTCS ’12, 424-434 (2012).
Kernelization - Preprocessing with a Guarantee. The Multivariate Algorithmic Revolution and Beyond (with D. Lokshtanov and N. Misra). Essays dedicated to Michael R. Fellows on the occasion of his 60th birthday (Springer Verlag, LNCS 7370), 129-161 (2012).
Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms (with F. V. Fomin, D. Lokshtanov and N. Misra). In the proceedings of FOCS ’12, 470-479 (2012).
Parameterized Study of the Test Cover Problem (with R. Crowston, G. Gutin, M. Jones and A. Yeo). In the proceedings of MFCS ’12, (Springer Verlag, LNCS 7464), 283-295 (2012).
Parameterized Algorithms for Even Cycle Transversal (with P. Misra, V. Raman and Ramanujan M. S). In the proceedings of WG ’12, (Springer Verlag, LNCS 7551), 172-183 (2012).
Don’t Be Strict in Local Search! (with S. Gaspers, E. J. Jim, S. Ordyniak and S. Szeider). In the proceedings of AAAI ’12 (2012).
New Lower Bound on Max-Cut of hypergraphs with an application to r-SET SPLITTING (with A. Giannopoulou and S. Kolay). In the proceedings of LATIN ’12, (Springer Verlag, LNCS 7256), 408-419 (2012)

2011

Paths, Flowers and Vertex Cover (with V. Raman and M. S. Ramanujan). In the proceedings of ESA ’11, (Springer Verlag, LNCS 6942), 382-393 (2011).
Algorithmic Aspects of Dominator Colorings in Graphs (with S. Arumugam, K. R. Chandrasekar, N. Misra and G. Philip). In the proceedings of IWOCA ’11, (Springer Verlag, LNCS 7056), 19-30 (2011).
Planar k-Path in Subexponential Time and Polynomial Space (with D. Lokshtanov and M. Mnich). In the proceedings of WG ’11, (Springer Verlag, LNCS 6986), 262-270 (2011).

2010

Determining the Winner of a Dodgson Election is Hard (with M. Fellows, B. Jansen, D. Lokshtanov and F. A. Rosamond). In the proceedings of FSTTCS ’10, 459-468 (2010).
Parameterized Algorithms for Boxicity (with A. Adiga and R. Chitnis). In the proceedings of ISAAC ’10: (Springer Verlag, LNCS 6506), 366-377 (2010).
Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments (with F. V. Fomin, D. Lokshtanov and V. Raman). In the proceedings of AAAI ’10 (2010).
Ranking and Drawing in Subexponential Time (with H. Fernau, F. V. Fomin, D. Lokshtanov, M. Mnich, and G. Philip). In the proceedings of IWOCA ’10: (Springer Verlag,LNCS 6460), 337-348 (2010).

2009

Even Faster Algorithm for Set Splitting! (with D. Lokshtanov). In the proceedings of IWPEC ’09: (Springer Verlag, LNCS 5917), 288-299 (2009).
Simpler Parameterized Algorithm for OCT (with D. Lokshtanov and S. Sikdar). In the proceedings of IWOCA ’09: (Springer Verlag, LNCS 5874), 380-384 (2009).
Fast FAST (with N. Alon and D. Lokshtanov). In the proceedings of ICALP ’09: (Springer Verlag, ARCoSS, LNCS 5555), 49-58 (2009).

2008

Graph Layout problems Parameterized by Vertex Cover (with M. Fellows, D. Lokshtanov, N. Misra and F. A. Rosamond). In the proceedings of ISAAC ’08: (Springer Verlag, LNCS 5369) 294-305 (2008).
Capacitated Domination and Covering: A Parameterized Perspective. (with M. Dom, D. Lokshtanov and Y. Villanger). In the proceedings of IWPEC’08: (Springer Verlag, LNCS 5018) 78-90 (2008).
A Moderately Exponential Time Algorithm for Full Degree Spanning Tree. (with S. Gaspers, and A. A. Stepanov). In the proceedings of TAMC’08: (Springer Verlag, LNCS 4978) 479-489 (2008).
Parameterized Algorithms for Generalized Domination (with V. Raman, and S. Srihari). In the proceedings of COCOA 2008: (Springer Verlag, LNCS 5165) 116-126 (2008).

2007

Improved Exact Algorithms for Counting 3- and 4- Colorings (with F. V. Fomin and S. Gaspers) In the proceedings of COCOON’07: (Springer Verlag, LNCS 4598) 65-74 (2007).
Parameterized Algorithms for Directed Maximum Leaf Problems (with N. Alon, F. V. Fomin, G. Gutin and M. Krivelevich). In the proceedings of ICALP’07: (Springer Verlag, LNCS 4596) 352-362 (2007).

2006

Exact and Parameterized Algorithms through (old and new) Structural Graph theoretical Results (with V. Raman). In the proceedings of the International Conference on Discrete Mathematics (2006), 177-189.

MANUSCRIPTS

A Finite Algorithm for the Realizabilty of a Delaunay Triangulation (with A. Agrawal and M. Zehavi).
A parameterized runtime analysis of randomized local search and evolutionary algorithm for max l-uncut (with P. Jain, L. Kanesh, and J. Madathil). GECCO (Companion) 2018: 326-327
Hitting Non-null Cycles Through Prescribed Vertices in Group Labeled Graphs (with D. Lokshtanov and M. S. Ramanujan)
Parameterized Tractability of Multiway Cut with Parity Constraints (D. Lokshtanov and M. S. Ramanujan) (2013).
Preprocessing in Iterative Compression for Planar F-deletion problem (with F. V. Fomin, D. Lokshtanov and N. Misra) (2013).

Page updated

Google Sites

Report abuse