


default search action
Saket Saurabh 0001
Person information
- affiliation: Institute of Mathematical Sciences, Chennai, India
Other persons with the same name
- Saket Saurabh 0002 — University of Wisconsin-Madison, USA
- Saket Saurabh 0003 — Tata Consultancy Services, India
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
- [j208]Pallavi Jain, Lawqueen Kanesh, Willian Lochet, Saket Saurabh, Roohani Sharma:
Exact and Approximate Digraph Bandwidth. Theory Comput. Syst. 69(1): 10 (2025) - [c340]Matthias Bentert, Fedor V. Fomin, Tanmay Inamdar, Saket Saurabh:
Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems. ITCS 2025: 15:1-15:18 - [c339]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
Parameterized Geometric Graph Modification with Disk Scaling. ITCS 2025: 51:1-51:17 - [c338]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Saket Saurabh:
Fixed-Parameter Tractability of Hedge Cut. SODA 2025: 1402-1411 - [c337]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Jie Xue, Meirav Zehavi:
Crossing Number in Slightly Superexponential Time (Extended Abstract). SODA 2025: 1412-1424 - [c336]Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov:
Packing Short Cycles. SODA 2025: 1425-1463 - [c335]Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Vaishali Surianarayanan, Jie Xue:
Parameterized Approximation for Capacitated d-Hitting Set with Hard Capacities. SODA 2025: 1565-1592 - [c334]Sayan Bandyapadhyay, Katie Clinch, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue:
PTASes for Euclidean TSP with Unit Disk and Unit Square Neighborhoods. SODA 2025: 2326-2356 - [c333]Ankit Abhinav, Satyabrata Jana, Nidhi Purohit, Abhishek Sahu, Saket Saurabh:
Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints. SOFSEM (1) 2025: 23-36 - [c332]Shubhada Aute, Fahad Panolan, Souvik Saha, Saket Saurabh, Anannya Upasana:
Parameterized Complexity of Generalizations of Edge Dominating Set. SOFSEM (1) 2025: 65-79 - [c331]D. Karthika, R. Muthucumaraswamy, Matthias Bentert, Sriram Bhyravarapu, Saket Saurabh, Sanjay Seetharaman:
On the Complexity of Minimum Membership Dominating Set. SOFSEM (1) 2025: 94-107 - [c330]Sriram Bhyravarapu, Pankaj Kumar, Saket Saurabh:
On the Structural Parameterized Complexity of Defective Coloring. SOFSEM (1) 2025: 108-121 - [c329]Akanksha Agrawal, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Shaily Verma:
Parameterized Saga of First-Fit and Last-Fit Coloring. STACS 2025: 5:1-5:21 - [c328]Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh:
Multivariate Exploration of Metric Dilation. STACS 2025: 14:1-14:17 - [c327]Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity, Saket Saurabh, Roohani Sharma:
MaxMin Separation Problems: FPT Algorithms for st-Separator and Odd Cycle Transversal. STACS 2025: 36:1-36:21 - [i171]Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh:
Multivariate Exploration of Metric Dilation. CoRR abs/2501.04555 (2025) - [i170]Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity, Saket Saurabh, Roohani Sharma:
MaxMin Separation Problems: FPT Algorithms for st-Separator and Odd Cycle Transversal. CoRR abs/2502.10449 (2025) - [i169]Matthias Bentert, Fedor V. Fomin, Tanmay Inamdar, Saket Saurabh:
Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems. CoRR abs/2502.10909 (2025) - 2024
- [j207]Kishen N. Gowda
, Aditya Lonkar, Fahad Panolan, Vraj Patel, Saket Saurabh:
Improved FPT Algorithms for Deletion to Forest-Like Structures. Algorithmica 86(5): 1657-1699 (2024) - [j206]Akanksha Agrawal
, Kristine V. K. Knudsen, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
The Parameterized Complexity of Guarding Almost Convex Polygons. Discret. Comput. Geom. 71(2): 358-398 (2024) - [j205]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
(Re)packing Equal Disks into Rectangle. Discret. Comput. Geom. 72(4): 1596-1629 (2024) - [j204]Fedor V. Fomin
, Petr A. Golovach
, Fahad Panolan
, Geevarghese Philip, Saket Saurabh:
Diverse collections in matroids and graphs. Math. Program. 204(1): 415-447 (2024) - [j203]Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan
:
A Parameterized Approximation Scheme for Min $k$-Cut. SIAM J. Comput. 53(6): S20-205 (2024) - [j202]Rian Neogi, M. S. Ramanujan, Saket Saurabh, Roohani Sharma:
On the Parameterized Complexity of Deletion to \(\boldsymbol{\mathcal{H}}\)-Free Strong Components. SIAM J. Discret. Math. 38(4): 3079-3110 (2024) - [j201]Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity. ACM Trans. Algorithms 20(2): 15 (2024) - [j200]Sayan Bandyapadhyay
, William Lochet
, Daniel Lokshtanov
, Saket Saurabh
, Jie Xue
:
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. ACM Trans. Algorithms 20(3): 20 (2024) - [j199]Satyabrata Jana
, Souvik Saha
, Abhishek Sahu, Saket Saurabh, Shaily Verma:
Partitioning subclasses of chordal graphs with few deletions. Theor. Comput. Sci. 983: 114288 (2024) - [j198]Soumen Mandal, Pranabendu Misra, Ashutosh Rai, Saket Saurabh:
Parameterized approximation algorithms for weighted vertex cover. Theor. Comput. Sci. 1021: 114870 (2024) - [c326]Rune D. Kjærsgaard, Pekka Parviainen, Saket Saurabh, Madhumita Kundu, Line H. Clemmensen:
Fair Soft Clustering. AISTATS 2024: 1270-1278 - [c325]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
Hybrid k-Clustering: Blending k-Median and k-Center. APPROX/RANDOM 2024: 4:1-4:19 - [c324]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3. APPROX/RANDOM 2024: 6:1-6:14 - [c323]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs. SoCG 2024: 72:1-72:11 - [c322]Madhumita Kundu, Pekka Parviainen, Saket Saurabh:
Discovering Bayesian Networks when Few Variables Matter. ECAI 2024: 3047-3054 - [c321]Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh:
Cuts in Graphs with Matroid Constraints. ESA 2024: 17:1-17:15 - [c320]Viktoriia Korchemna, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan, Jie Xue:
Efficient Approximation of Fractional Hypertree Width. FOCS 2024: 754-779 - [c319]Sushmita Gupta, Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
When Far Is Better: The Chamberlin-Courant Approach to Obnoxious Committee Selection. FSTTCS 2024: 24:1-24:21 - [c318]Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana:
Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. ICALP 2024: 88:1-88:18 - [c317]Tanmay Inamdar, Madhumita Kundu, Pekka Parviainen, M. S. Ramanujan, Saket Saurabh:
Exponential-Time Approximation Schemes via Compression. ITCS 2024: 64:1-64:22 - [c316]Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Kernelization of Counting Problems. ITCS 2024: 77:1-77:23 - [c315]Nikita Andreev, Ivan Bliznets, Madhumita Kundu, Saket Saurabh, Vikash Tripathi, Shaily Verma:
Parameterized Complexity of Paired Domination. IWOCA 2024: 523-536 - [c314]Matthias Bentert, Fedor V. Fomin, Fanny Hauser, Saket Saurabh:
The Parameterized Complexity Landscape of Two-Sets Cut-Uncut. IPEC 2024: 14:1-14:23 - [c313]Satyabrata Jana, Lawqueen Kanesh, Madhumita Kundu, Saket Saurabh:
Subset Feedback Vertex Set in Tournaments as Fast as Without the Subset. IPEC 2024: 17:1-17:17 - [c312]Soumen Mandal, Pranabendu Misra, Ashutosh Rai, Saket Saurabh:
Parameterized Approximation Algorithms for Weighted Vertex Cover. LATIN (2) 2024: 177-192 - [c311]Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha
, Abhishek Sahu, Saket Saurabh, Anannya Upasana:
Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses. LATIN (2) 2024: 223-237 - [c310]Sushmita Gupta, Sounak Modak, Saket Saurabh, Sanjay Seetharaman:
Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments. LATIN (1) 2024: 225-240 - [c309]Matthias Bentert, Michael R. Fellows, Petr A. Golovach, Frances A. Rosamond, Saket Saurabh:
Breaking a Graph into Connected Components with Small Dominating Sets. MFCS 2024: 24:1-24:15 - [c308]Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue:
Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. SODA 2024: 699-711 - [c307]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Meta-theorems for Parameterized Streaming Algorithms‡. SODA 2024: 712-739 - [c306]Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Saket Saurabh, Roohani Sharma:
Odd Cycle Transversal on P5-free Graphs in Quasi-polynomial Time. SODA 2024: 5276-5290 - [c305]Sriram Bhyravarapu, Lawqueen Kanesh, A. Mohanapriya, Nidhi Purohit, N. Sadagopan, Saket Saurabh:
On the Parameterized Complexity of Minus Domination. SOFSEM 2024: 96-110 - [c304]Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff:
Eliminating Crossings in Ordered Graphs. SWAT 2024: 1:1-1:19 - [c303]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Saket Saurabh:
Stability in Graphs with Matroid Constraints. SWAT 2024: 22:1-22:16 - [c302]Satyabrata Jana, Sounak Modak, Saket Saurabh, Kushal Singanporia:
Roman Cycle Hitting Set. WG 2024: 282-296 - [i168]Sushmita Gupta, Sounak Modak, Saket Saurabh, Sanjay Seetharaman:
Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments. CoRR abs/2402.06407 (2024) - [i167]Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Pawel Rzazewski, Saket Saurabh, Roohani Sharma:
Odd Cycle Transversal on P5-free Graphs in Polynomial Time. CoRR abs/2402.11465 (2024) - [i166]Susobhan Bandopadhyay, Aritra Banik, Sushmita Gupta, Pallavi Jain, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale:
Conflict and Fairness in Resource Allocation. CoRR abs/2403.04265 (2024) - [i165]P. S. Ardra, R. Krithika, Saket Saurabh, Roohani Sharma:
Balanced Substructures in Bicolored Graphs. CoRR abs/2403.06608 (2024) - [i164]Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana:
Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. CoRR abs/2403.07328 (2024) - [i163]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Saket Saurabh:
Stability in Graphs with Matroid Constraints. CoRR abs/2404.03979 (2024) - [i162]Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff:
Eliminating Crossings in Ordered Graphs. CoRR abs/2404.09771 (2024) - [i161]Sushmita Gupta, Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
When far is better: The Chamberlin-Courant approach to obnoxious committee selection. CoRR abs/2405.15372 (2024) - [i160]Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana
, Saket Saurabh:
Cuts in Graphs with Matroid Constraints. CoRR abs/2406.19134 (2024) - [i159]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
Hybrid k-Clustering: Blending k-Median and k-Center. CoRR abs/2407.08295 (2024) - [i158]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3. CoRR abs/2407.09356 (2024) - [i157]Matthias Bentert, Fedor V. Fomin, Fanny Hauser, Saket Saurabh:
The Parameterized Complexity Landscape of Two-Sets Cut-Uncut. CoRR abs/2408.13543 (2024) - [i156]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
Subexponential Parameterized Algorithms for Hitting Subgraphs. CoRR abs/2409.04786 (2024) - [i155]Viktoriia Korchemna, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan, Jie Xue:
Efficient Approximation of Fractional Hypertree Width. CoRR abs/2409.20172 (2024) - [i154]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Saket Saurabh:
Fixed-Parameter Tractability of Hedge Cut. CoRR abs/2410.17641 (2024) - [i153]Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov:
Packing Short Cycles. CoRR abs/2410.18878 (2024) - [i152]Akanksha Agrawal, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Shaily Verma:
Parameterized Saga of First-Fit and Last-Fit Coloring. CoRR abs/2410.20629 (2024) - [i151]Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Vaishali Surianarayanan, Jie Xue:
Parameterized Approximation for Capacitated d-Hitting Set with Hard Capacities. CoRR abs/2410.20900 (2024) - [i150]Daniel Lokshtanov, Pawel Rzazewski, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Maximum Partial List H-Coloring on P5-free graphs in polynomial time. CoRR abs/2410.21569 (2024) - [i149]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
Parameterized Geometric Graph Modification with Disk Scaling. CoRR abs/2411.13171 (2024) - [i148]Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Dániel Marx, Pranabendu Misra, Daniel Neuen, Saket Saurabh, Prafullkumar Tale, Jie Xue:
Robust Contraction Decomposition for Minor-Free Graphs and its Applications. CoRR abs/2412.04145 (2024) - 2023
- [j197]Pranabendu Misra, Saket Saurabh, Roohani Sharma
, Meirav Zehavi:
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. Algorithmica 85(7): 2065-2086 (2023) - [j196]Sushmita Gupta, Pallavi Jain
, Saket Saurabh, Nimrod Talmon:
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules. Algorithmica 85(12): 3717-3740 (2023) - [j195]Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue
:
Clustering what Matters: Optimal Approximation for Clustering with Outliers. J. Artif. Intell. Res. 78: 143-166 (2023) - [j194]Saket Saurabh, Meirav Zehavi:
Parameterized complexity of multi-node hubs. J. Comput. Syst. Sci. 131: 64-85 (2023) - [j193]Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh:
Almost optimal query algorithm for hitting set using a subset query. J. Comput. Syst. Sci. 137: 50-65 (2023) - [j192]Fedor V. Fomin
, Petr A. Golovach
, William Lochet
, Danil Sagunov, Saket Saurabh, Kirill Simonov:
Detours in directed graphs. J. Comput. Syst. Sci. 137: 66-86 (2023) - [j191]Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh
, Meirav Zehavi:
Erdős-Pósa property of obstructions to interval graphs. J. Graph Theory 102(4): 702-727 (2023) - [j190]Fedor V. Fomin
, Fahad Panolan
, M. S. Ramanujan
, Saket Saurabh:
On the optimality of pseudo-polynomial algorithms for integer programming. Math. Program. 198(1): 561-593 (2023) - [j189]Abhishek Sahu, Saket Saurabh:
Kernelization of Arc Disjoint Cycle Packing in α-Bounded Digraphs. Theory Comput. Syst. 67(2): 221-233 (2023) - [j188]Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh:
Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams. Theory Comput. Syst. 67(6): 1241-1267 (2023) - [j187]Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy
, Abhishek Sahu, Saket Saurabh:
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. SIAM J. Discret. Math. 37(4): 2626-2669 (2023) - [j186]Akanksha Agrawal
, Daniel Lokshtanov
, Pranabendu Misra
, Saket Saurabh
, Meirav Zehavi
:
Polynomial Kernel for Interval Vertex Deletion. ACM Trans. Algorithms 19(2): 11:1-11:68 (2023) - [j185]Ankit Abhinav
, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh:
Parameterized algorithms for finding highly connected solution. Theor. Comput. Sci. 942: 47-56 (2023) - [c301]Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue:
Clustering What Matters: Optimal Approximation for Clustering with Outliers. AAAI 2023: 6666-6674 - [c300]Satyabrata Jana
, Souvik Saha
, Abhishek Sahu, Saket Saurabh, Shaily Verma:
Partitioning Subclasses of Chordal Graphs with Few Deletions. CIAC 2023: 293-307 - [c299]Sayan Bandyapadhyay, William Lochet
, Saket Saurabh, Jie Xue
:
Minimum-Membership Geometric Set Cover, Revisited. SoCG 2023: 11:1-11:14 - [c298]Sayan Bandyapadhyay, William Lochet
, Saket Saurabh:
FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii. SoCG 2023: 12:1-12:14 - [c297]Jørgen Bang-Jensen
, Kristine Vitting Klinkby
, Pranabendu Misra, Saket Saurabh:
A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands. ESA 2023: 13:1-13:15 - [c296]Fedor V. Fomin
, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
Kernelization for Spreading Points. ESA 2023: 48:1-48:16 - [c295]Fedor V. Fomin
, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi:
Lossy Kernelization for (Implicit) Hitting Set Problems. ESA 2023: 49:1-49:14 - [c294]Tanmay Inamdar, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan:
Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability). ESA 2023: 63:1-63:17 - [c293]Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, M. S. Ramanujan, Saket Saurabh:
FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less. FSTTCS 2023: 28:1-28:16 - [c292]Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan:
Breaking the All Subsets Barrier for Min k-Cut. ICALP 2023: 90:1-90:19 - [c291]Neeldhara Misra, Harshil Mittal, Saket Saurabh, Dhara Thakkar:
On the Complexity of the Eigenvalue Deletion Problem. ISAAC 2023: 53:1-53:17 - [c290]Pradeesha Ashok, Sayani Das, Lawqueen Kanesh, Saket Saurabh, Avi Tomar, Shaily Verma:
Burn and Win. IWOCA 2023: 36-48 - [c289]Sriram Bhyravarapu, Satyabrata Jana
, Lawqueen Kanesh, Saket Saurabh, Shaily Verma:
Parameterized Algorithms for Eccentricity Shortest Path Problem. IWOCA 2023: 74-86 - [c288]Sriram Bhyravarapu, Satyabrata Jana
, Saket Saurabh, Roohani Sharma:
Difference Determines the Degree: Structural Kernelizations of Component Order Connectivity. IPEC 2023: 5:1-5:14 - [c287]Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh:
Fixed-Parameter Algorithms for Fair Hitting Set Problems. MFCS 2023: 55:1-55:14 - [c286]Satyabrata Jana
, Daniel Lokshtanov, Soumen Mandal, Ashutosh Rai, Saket Saurabh:
Parameterized Approximation Scheme for Feedback Vertex Set. MFCS 2023: 56:1-56:15 - [c285]Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh, Jie Xue
, Meirav Zehavi:
A Framework for Approximation Schemes on Disk Graphs. SODA 2023: 2228-2241 - [c284]Pallavi Jain, Lawqueen Kanesh, Fahad Panolan
, Souvik Saha
, Abhishek Sahu, Saket Saurabh, Anannya Upasana:
Parameterized Approximation Scheme for Biclique-free Max k-Weight SAT and Max Coverage. SODA 2023: 3713-3733 - [c283]P. S. Ardra, R. Krithika
, Saket Saurabh, Roohani Sharma:
Balanced Substructures in Bicolored Graphs. SOFSEM 2023: 177-191 - [c282]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan
, Saket Saurabh, Meirav Zehavi:
An ETH-Tight Algorithm for Bidirected Steiner Connectivity. WADS 2023: 588-604 - [i147]Sayan Bandyapadhyay, William Lochet, Saket Saurabh:
FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii. CoRR abs/2303.07923 (2023) - [i146]Ajaykrishnan E. S, Soumen Maity, Abhishek Sahu, Saket Saurabh:
An Improved Exact Algorithm for Knot-Free Vertex Deletion. CoRR abs/2303.10866 (2023) - [i145]Sriram Bhyravarapu, Satyabrata Jana
, Lawqueen Kanesh, Saket Saurabh, Shaily Verma:
Parameterized algorithms for Eccentricity Shortest Path Problem. CoRR abs/2304.03233 (2023) - [i144]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
Hitting Subgraphs in Sparse Graphs and Geometric Intersection Graphs. CoRR abs/2304.13695 (2023) - [i143]Sayan Bandyapadhyay, William Lochet, Saket Saurabh, Jie Xue:
Minimum-Membership Geometric Set Cover, Revisited. CoRR abs/2305.03985 (2023) - [i142]Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh:
Fixed-Parameter Algorithms for Fair Hitting Set Problems. CoRR abs/2307.08854 (2023) - [i141]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan
, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Meta-theorems for Parameterized Streaming Algorithms. CoRR abs/2308.01598 (2023) - [i140]Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Kernelization of Counting Problems. CoRR abs/2308.02188 (2023) - [i139]Fedor V. Fomin
, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi:
Lossy Kernelization for (Implicit) Hitting Set Problems. CoRR abs/2308.05974 (2023) - [i138]Fedor V. Fomin
, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
Kernelization for Spreading Points. CoRR abs/2308.07099 (2023) - [i137]Tanmay Inamdar, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan:
Parameterized Complexity of Fair Bisection: FPT-Approximation meets Unbreakability. CoRR abs/2308.10657 (2023) - [i136]Sushmita Gupta, Pallavi Jain, Saket Saurabh:
How to assign volunteers to tasks compatibly ? A graph theoretic and parameterized approach. CoRR abs/2309.04995 (2023) - [i135]Neeldhara Misra, Harshil Mittal, Saket Saurabh, Dhara Thakkar:
On the Complexity of the Eigenvalue Deletion Problem. CoRR abs/2310.00600 (2023) - [i134]Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, M. S. Ramanujan, Saket Saurabh:
FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less. CoRR abs/2310.03469 (2023) - [i133]Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue:
Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. CoRR abs/2312.01589 (2023) - 2022
- [j184]Saket Saurabh, Prafullkumar Tale
:
On the Parameterized Complexity of Maximum Degree Contraction Problem. Algorithmica 84(2): 405-435 (2022) - [j183]Fedor V. Fomin
, Petr A. Golovach
, William Lochet
, Pranabendu Misra, Saket Saurabh, Roohani Sharma:
Parameterized Complexity of Directed Spanner Problems. Algorithmica 84(8): 2292-2308 (2022) - [j182]Akanksha Agrawal
, Pranabendu Misra, Fahad Panolan
, Saket Saurabh:
Fast Exact Algorithms for Survivable Network Design with Uniform Requirements. Algorithmica 84(9): 2622-2641 (2022) - [j181]Akanksha Agrawal, Madhumita Kundu
, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale:
Parameterized Complexity of Maximum Edge Colorable Subgraph. Algorithmica 84(10): 3075-3100 (2022) - [j180]Jan Derbisz, Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh, Shaily Verma:
A Polynomial Kernel for Bipartite Permutation Vertex Deletion. Algorithmica 84(11): 3246-3275 (2022) - [j179]C. Aiswarya, Vikraman Arvind, Saket Saurabh:
Theory research in India: 2019-2022. Commun. ACM 65(11): 88-93 (2022) - [j178]Saket Saurabh, Uéverton dos Santos Souza
, Prafullkumar Tale:
On the parameterized complexity of Grid Contraction. J. Comput. Syst. Sci. 129: 22-38 (2022) - [j177]Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh:
Exact Multi-Covering Problems with Geometric Sets. Theory Comput. Syst. 66(1): 89-113 (2022) - [j176]Fedor V. Fomin
, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk
, Michal Pilipczuk, Saket Saurabh:
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. SIAM J. Comput. 51(6): 1866-1930 (2022) - [j175]Sushmita Gupta, Saket Saurabh, Meirav Zehavi:
On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization). SIAM J. Discret. Math. 36(1): 596-681 (2022) - [j174]Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan
, M. S. Ramanujan
, Saket Saurabh:
A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs. SIAM J. Discret. Math. 36(2): 911-921 (2022) - [j173]Sushmita Gupta, Sanjukta Roy
, Saket Saurabh, Meirav Zehavi:
Resolute control: Forbidding candidates from winning an election is hard. Theor. Comput. Sci. 915: 74-89 (2022) - [j172]Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk
, Nidhi Purohit, Saket Saurabh:
On the complexity of singly connected vertex deletion. Theor. Comput. Sci. 934: 47-64 (2022) - [c281]Sayan Bandyapadhyay, William Lochet
, Daniel Lokshtanov, Saket Saurabh, Jie Xue
:
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. SoCG 2022: 11:1-11:16 - [c280]Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue
:
Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles. SoCG 2022: 52:1-52:14 - [c279]Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh:
Parameterized Algorithms for Finding Highly Connected Solution. CSR 2022: 1-16 - [c278]Niranka Banerjee, Manoj Gupta, Venkatesh Raman, Saket Saurabh:
Output Sensitive Fault Tolerant Maximum Matching. CSR 2022: 115-132 - [c277]Petr A. Golovach, Fahad Panolan
, Ashutosh Rai, Saket Saurabh:
Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs. CSR 2022: 152-169 - [c276]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Parameterized Analysis for the Group Activity Selection Problem on Graphs. ISAIM 2022 - [c275]Akanksha Agrawal, Saket Saurabh, Meirav Zehavi:
A Finite Algorithm for the Realizabilty of a Delaunay Triangulation. IPEC 2022: 1:1-1:16 - [c274]Fedor V. Fomin
, Petr A. Golovach, Tanmay Inamdar
, Nidhi Purohit, Saket Saurabh:
Exact Exponential Algorithms for Clustering Problems. IPEC 2022: 13:1-13:14 - [c273]Sriram Bhyravarapu, Satyabrata Jana
, Fahad Panolan
, Saket Saurabh, Shaily Verma:
List Homomorphism: Beyond the Known Boundaries. LATIN 2022: 593-609 - [c272]Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi
, Shunsuke Nagano, Yota Otachi
, Saket Saurabh:
Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets. MFCS 2022: 6:1-6:15 - [c271]M. S. Ramanujan, Abhishek Sahu, Saket Saurabh, Shaily Verma:
An Exact Algorithm for Knot-Free Vertex Deletion. MFCS 2022: 78:1-78:15 - [c270]Sushmita Gupta, Pallavi Jain, Daniel Lokshtanov, Sanjukta Roy
, Saket Saurabh:
Gehrlein Stable Committee with Multi-modal Preferences. SAGT 2022: 508-525 - [c269]Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan
, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent. SODA 2022: 1976-2004 - [c268]Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh, Jie Xue
, Meirav Zehavi:
Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract). SODA 2022: 2005-2031 - [c267]Sayan Bandyapadhyay, William Lochet
, Daniel Lokshtanov, Saket Saurabh, Jie Xue
:
Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H<-Minor-Free Graphs. SODA 2022: 2063-2084 - [c266]Fedor V. Fomin
, Petr A. Golovach, William Lochet
, Danil Sagunov, Kirill Simonov, Saket Saurabh:
Detours in Directed Graphs. STACS 2022: 29:1-29:16 - [c265]Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy
, Abhishek Sahu, Saket Saurabh:
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. STACS 2022: 39:1-39:20 - [c264]Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor. STOC 2022: 914-923 - [i132]Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh:
Detours in Directed Graphs. CoRR abs/2201.03318 (2022) - [i131]Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh:
Parameterized Complexity of Graph Partitioning into Connected Clusters. CoRR abs/2202.12042 (2022) - [i130]Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue:
Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles. CoRR abs/2203.08193 (2022) - [i129]R. Krithika
, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale:
Parameterized and Exact Algorithms for Class Domination Coloring. CoRR abs/2203.09106 (2022) - [i128]Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity, Saket Saurabh, Shuvam Kant Tripathi:
Maximum Minimal Feedback Vertex Set: A Parameterized Perspective. CoRR abs/2208.01953 (2022) - [i127]Ajinkya Gaikwad, Soumen Maity, Saket Saurabh:
Parameterized Algorithms for Locally Minimal Defensive Alliance. CoRR abs/2208.03491 (2022) - [i126]Fedor V. Fomin
, Petr A. Golovach, Tanmay Inamdar, Nidhi Purohit, Saket Saurabh:
Exact Exponential Algorithms for Clustering Problems. CoRR abs/2208.06847 (2022) - [i125]Akanksha Agrawal, Saket Saurabh, Meirav Zehavi:
A Finite Algorithm for the Realizabilty of a Delaunay Triangulation. CoRR abs/2210.03932 (2022) - [i124]Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Highly unbreakable graph with a fixed excluded minor are almost rigid. CoRR abs/2210.14629 (2022) - [i123]Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Fixed-parameter tractability of Graph Isomorphism in graphs with an excluded minor. CoRR abs/2210.14638 (2022) - [i122]Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh, Jie Xue, Meirav Zehavi:
A Framework for Approximation Schemes on Disk Graphs. CoRR abs/2211.02717 (2022) - [i121]Fedor V. Fomin
, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
(Re)packing Equal Disks into Rectangle. CoRR abs/2211.09603 (2022) - [i120]Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue:
Clustering What Matters: Optimal Approximation for Clustering with Outliers. CoRR abs/2212.00696 (2022) - 2021
- [j171]Akanksha Agrawal, Fahad Panolan
, Saket Saurabh, Meirav Zehavi:
Simultaneous Feedback Edge Set: A Parameterized Perspective. Algorithmica 83(2): 753-774 (2021) - [j170]Stéphane Bessy, Marin Bougeret
, R. Krithika
, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut
, Meirav Zehavi:
Packing Arc-Disjoint Cycles in Tournaments. Algorithmica 83(5): 1393-1420 (2021) - [j169]Arindam Biswas
, Venkatesh Raman
, Saket Saurabh
:
Approximation in (Poly-) Logarithmic Space. Algorithmica 83(7): 2303-2331 (2021) - [j168]R. Krithika
, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale
:
Parameterized and exact algorithms for class domination coloring. Discret. Appl. Math. 291: 286-299 (2021) - [j167]Meirav Zehavi, Fedor V. Fomin
, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh:
ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. J. Comput. Geom. 12(2): 126-148 (2021) - [j166]Marek Cygan, Pawel Komosa, Daniel Lokshtanov, Marcin Pilipczuk
, Michal Pilipczuk, Saket Saurabh, Magnus Wahlström
:
Randomized Contractions Meet Lean Decompositions. ACM Trans. Algorithms 17(1): 6:1-6:30 (2021) - [j165]Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan
, Geevarghese Philip, Saket Saurabh:
2-Approximating Feedback Vertex Set in Tournaments. ACM Trans. Algorithms 17(2): 11:1-11:14 (2021) - [j164]Daniel Lokshtanov, Andreas Björklund, Saket Saurabh, Meirav Zehavi:
Approximate Counting of k-Paths: Simpler, Deterministic, and in Polynomial Space. ACM Trans. Algorithms 17(3): 26:1-26:44 (2021) - [j163]Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh, Prafullkumar Tale
:
Paths to trees and cacti. Theor. Comput. Sci. 860: 98-116 (2021) - [j162]Lawqueen Kanesh, Soumen Maity, Komal Muluk
, Saket Saurabh:
Parameterized complexity of fair feedback vertex set problem. Theor. Comput. Sci. 867: 1-12 (2021) - [j161]Sushmita Gupta, Sanjukta Roy
, Saket Saurabh, Meirav Zehavi:
Balanced stable marriage: How close is close enough? Theor. Comput. Sci. 883: 19-43 (2021) - [j160]Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Popular Matching in Roommates Setting Is NP-hard. ACM Trans. Comput. Theory 13(2): 9:1-9:20 (2021) - [j159]Fedor V. Fomin
, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi:
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. ACM Trans. Comput. Theory 13(2): 10:1-10:25 (2021) - [j158]Fedor V. Fomin
, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh, Meirav Zehavi:
Multiplicative Parameterization Above a Guarantee. ACM Trans. Comput. Theory 13(3): 18:1-18:16 (2021) - [j157]Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
:
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. ACM Trans. Comput. Theory 13(4): 27:1-27:40 (2021) - [c263]Pallavi Jain, Lawqueen Kanesh, Shivesh Kumar Roy, Saket Saurabh, Roohani Sharma:
Circumventing Connectivity for Kernelization. CIAC 2021: 300-313 - [c262]Jørgen Bang-Jensen
, Kristine Vitting Klinkby
, Saket Saurabh:
k-Distinct Branchings Admits a Polynomial Kernel. ESA 2021: 11:1-11:15 - [c261]Fedor V. Fomin
, Petr A. Golovach, Tanmay Inamdar
, Saket Saurabh:
ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space. FSTTCS 2021: 21:1-21:16 - [c260]Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue:
An ETH-Tight Algorithm for Multi-Team Formation. FSTTCS 2021: 28:1-28:9 - [c259]Sushmita Gupta, Pallavi Jain, Saket Saurabh, Nimrod Talmon:
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules. IJCAI 2021: 217-223 - [c258]Akanksha Agrawal, Aditya Anand
, Saket Saurabh:
A Polynomial Kernel for Deletion to Ptolemaic Graphs. IPEC 2021: 1:1-1:15 - [c257]Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh, Shaily Verma:
A Polynomial Kernel for Bipartite Permutation Vertex Deletion. IPEC 2021: 23:1-23:18 - [c256]Sushmita Gupta, Pallavi Jain, Fahad Panolan
, Sanjukta Roy
, Saket Saurabh:
Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms. SAGT 2021: 140-155 - [c255]Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting (Extended Version). SODA 2021: 179-198 - [c254]Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
FPT-approximation for FPT Problems. SODA 2021: 199-218 - [c253]Kristine Vitting Klinkby
, Pranabendu Misra, Saket Saurabh:
Strong Connectivity Augmentation is FPT. SODA 2021: 219-234 - [c252]Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri:
A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane. SODA 2021: 822-839 - [c251]Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan
, M. S. Ramanujan
, Saket Saurabh:
An FPT Algorithm for Elimination Distance to Bounded Degree Graphs. STACS 2021: 5:1-5:11 - [c250]Fedor V. Fomin
, Petr A. Golovach, Fahad Panolan
, Geevarghese Philip, Saket Saurabh:
Diverse Collections in Matroids and Graphs. STACS 2021: 31:1-31:14 - [c249]William Lochet
, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Exploiting Dense Structures in Parameterized Complexity. STACS 2021: 50:1-50:17 - [c248]Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh:
Odd Cycle Transversal in Mixed Graphs. WG 2021: 130-142 - [i119]Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
Diverse Collections in Matroids and Graphs. CoRR abs/2101.04633 (2021) - [i118]Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh:
Gerrymandering on graphs: Computational complexity and parameterized algorithms. CoRR abs/2102.09889 (2021) - [i117]Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh, Meirav Zehavi:
An Exponential Time Parameterized Algorithm for Planar Disjoint Paths. CoRR abs/2103.17041 (2021) - [i116]Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
Elimination Distance to Topological-minor-free Graphs is FPT. CoRR abs/2104.09950 (2021) - [i115]Fredrik Manne, Geevarghese Philip, Saket Saurabh, Prafullkumar Tale:
α-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms. CoRR abs/2106.14169 (2021) - [i114]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh:
ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space. CoRR abs/2107.06715 (2021) - [i113]Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue:
Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H-Minor-Free Graphs. CoRR abs/2111.14196 (2021) - [i112]Arindam Biswas, Venkatesh Raman, Srinivasa Rao Satti, Saket Saurabh:
Space-Efficient FPT Algorithms. CoRR abs/2112.15233 (2021) - 2020
- [j156]Sushmita Gupta, Pallavi Jain, Sanjukta Roy
, Saket Saurabh, Meirav Zehavi:
Gehrlein stability in committee selection: parameterized hardness and algorithms. Auton. Agents Multi Agent Syst. 34(1): 27 (2020) - [j155]Aritra Banik, Fahad Panolan
, Venkatesh Raman, Vibha Sahlot, Saket Saurabh
:
Parameterized Complexity of Geometric Covering Problems Having Conflicts. Algorithmica 82(1): 1-19 (2020) - [j154]Aritra Banik, Pratibha Choudhary
, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
A Polynomial Sized Kernel for Tracking Paths Problem. Algorithmica 82(1): 41-63 (2020) - [j153]Sushmita Gupta, Sanjukta Roy
, Saket Saurabh, Meirav Zehavi:
Quadratic Vertex Kernel for Rainbow Matching. Algorithmica 82(4): 881-897 (2020) - [j152]Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh
, Saket Saurabh:
Parameterized Complexity of Conflict-Free Matchings and Paths. Algorithmica 82(7): 1939-1965 (2020) - [j151]Diptapriyo Majumdar
, M. S. Ramanujan, Saket Saurabh:
On the Approximate Compressibility of Connected Vertex Cover. Algorithmica 82(10): 2902-2926 (2020) - [j150]Aritra Banik, Vibha Sahlot
, Saket Saurabh:
Approximation algorithms for geometric conflict free covering problems. Comput. Geom. 89: 101591 (2020) - [j149]Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Popular Matching in Roommates Setting is NP-hard. Bull. EATCS 130 (2020) - [j148]Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:
A characterization of König-Egerváry graphs with extendable vertex covers. Inf. Process. Lett. 161: 105964 (2020) - [j147]Sudeshna Kolay, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh:
Faster Graph bipartization. J. Comput. Syst. Sci. 109: 45-55 (2020) - [j146]Neeldhara Misra, Fahad Panolan
, Saket Saurabh:
Subexponential algorithm for d-cluster edge deletion: Exception or rule? J. Comput. Syst. Sci. 113: 150-162 (2020) - [j145]Jayakrishnan Madathil
, Saket Saurabh, Meirav Zehavi:
Fixed-Parameter Tractable Algorithm and Polynomial Kernel for Max-Cut Above Spanning Tree. Theory Comput. Syst. 64(1): 62-100 (2020) - [j144]Fedor V. Fomin
, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Bidimensionality and Kernels. SIAM J. Comput. 49(6): 1397-1422 (2020) - [j143]Akanksha Agrawal, Fedor V. Fomin
, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
:
Path Contraction Faster than 2n. SIAM J. Discret. Math. 34(2): 1302-1325 (2020) - [j142]Fedor V. Fomin
, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh, Meirav Zehavi:
Going Far from Degeneracy. SIAM J. Discret. Math. 34(3): 1587-1601 (2020) - [j141]Fedor V. Fomin
, Petr A. Golovach
, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh:
Approximation Schemes for Low-rank Binary Matrix Approximation Problems. ACM Trans. Algorithms 16(1): 12:1-12:39 (2020) - [j140]Fedor V. Fomin
, Daniel Lokshtanov, Sudeshna Kolay, Fahad Panolan
, Saket Saurabh:
Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. ACM Trans. Algorithms 16(2): 21:1-21:37 (2020) - [j139]Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. ACM Trans. Algorithms 16(3): 32:1-32:31 (2020) - [j138]Akanksha Agrawal
, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems. ACM Trans. Algorithms 16(4): 51:1-51:38 (2020) - [j137]Pranabendu Misra, Fahad Panolan
, M. S. Ramanujan, Saket Saurabh:
Linear representation of transversal matroids and gammoids parameterized by rank. Theor. Comput. Sci. 818: 51-59 (2020) - [j136]Niranka Banerjee, Venkatesh Raman, Saket Saurabh:
Fully dynamic arboricity maintenance. Theor. Comput. Sci. 822: 1-14 (2020) - [j135]Aritra Banik, Pratibha Choudhary
, Venkatesh Raman, Saket Saurabh:
Fixed-parameter tractable algorithms for Tracking Shortest Paths. Theor. Comput. Sci. 846: 1-13 (2020) - [c247]Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
:
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. APPROX-RANDOM 2020: 51:1-51:19 - [c246]Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths. Treewidth, Kernels, and Algorithms 2020: 112-128 - [c245]Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale
:
Parameterized Complexity of Maximum Edge Colorable Subgraph. COCOON 2020: 615-626 - [c244]Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh:
Fixed Parameter Tractability of Graph Deletion Problems over Data Streams. COCOON 2020: 652-663 - [c243]Akanksha Agrawal
, Kristine V. K. Knudsen, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
:
The Parameterized Complexity of Guarding Almost Convex Polygons. SoCG 2020: 3:1-3:16 - [c242]Fedor V. Fomin
, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh, Meirav Zehavi:
ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. SoCG 2020: 44:1-44:18 - [c241]Lawqueen Kanesh, Soumen Maity, Komal Muluk
, Saket Saurabh:
Parameterized Complexity of Fair Feedback Vertex Set Problem. CSR 2020: 250-262 - [c240]Abhishek Sahu, Saket Saurabh:
Kernelization of Arc Disjoint Cycle Packing in α-Bounded Digraphs. CSR 2020: 367-378 - [c239]Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan:
A Parameterized Approximation Scheme for Min $k$-Cut. FOCS 2020: 798-809 - [c238]Niranka Banerjee, Venkatesh Raman, Saket Saurabh:
Optimal Output Sensitive Fault Tolerant Cuts. FSTTCS 2020: 10:1-10:19 - [c237]Pratibha Choudhary, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh:
Parameterized Complexity of Feedback Vertex Sets on Hypergraphs. FSTTCS 2020: 18:1-18:15 - [c236]Sushmita Gupta, Pallavi Jain, Sanjukta Roy
, Saket Saurabh, Meirav Zehavi:
On the (Parameterized) Complexity of Almost Stable Marriage. FSTTCS 2020: 24:1-24:17 - [c235]Fedor V. Fomin
, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi:
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. ICALP 2020: 49:1-49:18 - [c234]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan
, Geevarghese Philip, Saket Saurabh:
A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion. ICALP 2020: 80:1-80:16 - [c233]Sushmita Gupta, Pallavi Jain, Saket Saurabh:
Well-Structured Committees. IJCAI 2020: 189-195 - [c232]Fedor V. Fomin
, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh, Meirav Zehavi:
Parameterization Above a Multiplicative Guarantee. ITCS 2020: 39:1-39:13 - [c231]William Lochet
, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Fault Tolerant Subgraphs with Applications in Kernelization. ITCS 2020: 47:1-47:22 - [c230]Kishen N. Gowda
, Aditya Lonkar, Fahad Panolan
, Vraj Patel, Saket Saurabh:
Improved FPT Algorithms for Deletion to Forest-Like Structures. ISAAC 2020: 34:1-34:16 - [c229]Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh:
On the Complexity of Singly Connected Vertex Deletion. IWOCA 2020: 237-250 - [c228]Eduard Eiben
, William Lochet
, Saket Saurabh:
A Polynomial Kernel for Paw-Free Editing. IPEC 2020: 10:1-10:15 - [c227]Fedor V. Fomin
, Petr A. Golovach
, William Lochet
, Pranabendu Misra, Saket Saurabh, Roohani Sharma:
Parameterized Complexity of Directed Spanner Problems. IPEC 2020: 12:1-12:11 - [c226]Saket Saurabh, Prafullkumar Tale
:
On the Parameterized Complexity of Maximum Degree Contraction Problem. IPEC 2020: 26:1-26:16 - [c225]Petr A. Golovach, R. Krithika
, Abhishek Sahu, Saket Saurabh, Meirav Zehavi:
Graph Hamiltonicity Parameterized by Proper Interval Deletion Set. LATIN 2020: 104-115 - [c224]Arindam Biswas
, Venkatesh Raman
, Saket Saurabh
:
Approximation in (Poly-) Logarithmic Space. MFCS 2020: 16:1-16:15 - [c223]Pranabendu Misra, Fahad Panolan
, Ashutosh Rai
, Saket Saurabh, Roohani Sharma:
Quick Separation in Chordal and Split Graphs. MFCS 2020: 70:1-70:14 - [c222]Rian Neogi
, M. S. Ramanujan, Saket Saurabh, Roohani Sharma:
On the Parameterized Complexity of Deletion to ℋ-Free Strong Components. MFCS 2020: 75:1-75:13 - [c221]Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan
, Geevarghese Philip, Saket Saurabh:
2-Approximating Feedback Vertex Set in Tournaments. SODA 2020: 1010-1018 - [c220]Daniel Lokshtanov, M. S. Ramanujan
, Saket Saurabh, Meirav Zehavi:
Parameterized Complexity and Approximability of Directed Odd Cycle Transversal. SODA 2020: 2181-2200 - [c219]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs. SODA 2020: 2299-2318 - [c218]Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh, Meirav Zehavi:
An exponential time parameterized algorithm for planar disjoint paths. STOC 2020: 1307-1316 - [c217]Fedor V. Fomin
, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh, Meirav Zehavi:
Hitting topological minors is FPT. STOC 2020: 1317-1326 - [c216]Saket Saurabh, Uéverton dos Santos Souza
, Prafullkumar Tale
:
On the Parameterized Complexity of Grid Contraction. SWAT 2020: 34:1-34:17 - [p2]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Parameterized Algorithms. Beyond the Worst-Case Analysis of Algorithms 2020: 27-51 - [i111]Aritra Banik, Pratibha Choudhary, Venkatesh Raman, Saket Saurabh:
Fixed-parameter tractable algorithms for Tracking Shortest Paths. CoRR abs/2001.08977 (2020) - [i110]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. CoRR abs/2003.00938 (2020) - [i109]Akanksha Agrawal, Kristine V. K. Knudsen, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
The Parameterized Complexity of Guarding Almost Convex Polygons. CoRR abs/2003.07793 (2020) - [i108]Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi:
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. CoRR abs/2004.11621 (2020) - [i107]Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan:
A Parameterized Approximation Scheme for Min k-Cut. CoRR abs/2005.00134 (2020) - [i106]Rian Neogi, M. S. Ramanujan, Saket Saurabh, Roohani Sharma:
On the Parameterized Complexity of Deletion to H-free Strong Components. CoRR abs/2005.01359 (2020) - [i105]Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
On the (Parameterized) Complexity of Almost Stable Marriage. CoRR abs/2005.08150 (2020) - [i104]Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale:
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. CoRR abs/2006.10364 (2020) - [i103]Arindam Biswas, Venkatesh Raman, Saket Saurabh:
Approximation in (Poly-) Logarithmic Space. CoRR abs/2008.04416 (2020) - [i102]Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale:
Parameterized Complexity of Maximum Edge Colorable Subgraph. CoRR abs/2008.07953 (2020) - [i101]Saket Saurabh, Uéverton dos Santos Souza, Prafullkumar Tale:
On the Parameterized Complexity Of Grid Contraction. CoRR abs/2008.07967 (2020) - [i100]Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths. CoRR abs/2008.08373 (2020) - [i99]Saket Saurabh, Prafullkumar Tale:
On the Parameterized Complexity of \textsc{Maximum Degree Contraction} Problem. CoRR abs/2009.11793 (2020) - [i98]Kishen N. Gowda, Aditya Lonkar, Fahad Panolan, Vraj Patel, Saket Saurabh:
Improved FPT Algorithms for Deletion to Forest-like Structures. CoRR abs/2009.13949 (2020) - [i97]Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri:
A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane. CoRR abs/2011.14463 (2020)
2010 – 2019
- 2019
- [j134]Sushmita Gupta
, Fahad Panolan
, Saket Saurabh, Meirav Zehavi:
Stability in barter exchange markets. Auton. Agents Multi Agent Syst. 33(5): 518-539 (2019) - [j133]Neeldhara Misra, Fahad Panolan
, Ashutosh Rai, Venkatesh Raman, Saket Saurabh:
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. Algorithmica 81(1): 26-46 (2019) - [j132]Fahad Panolan
, Saket Saurabh, Meirav Zehavi:
Parameterized Algorithms for List K-Cycle. Algorithmica 81(3): 1267-1287 (2019) - [j131]Sushmita Gupta, Sanjukta Roy
, Saket Saurabh, Meirav Zehavi:
Parameterized Algorithms and Kernels for Rainbow Matching. Algorithmica 81(4): 1684-1698 (2019) - [j130]Geevarghese Philip, Varun Rajan, Saket Saurabh, Prafullkumar Tale
:
Subset Feedback Vertex Set in Chordal and Split Graphs. Algorithmica 81(9): 3586-3629 (2019) - [j129]R. Krithika
, Abhishek Sahu, Saket Saurabh, Meirav Zehavi:
The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue. Algorithmica 81(9): 3803-3841 (2019) - [j128]Fedor V. Fomin
, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh, Meirav Zehavi:
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. Discret. Comput. Geom. 62(4): 879-911 (2019) - [j127]Fedor V. Fomin
, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh:
Exact Algorithms via Monotone Local Search. J. ACM 66(2): 8:1-8:23 (2019) - [j126]Akanksha Agrawal, Saket Saurabh, Prafullkumar Tale
:
On the Parameterized Complexity of Contraction to Generalization of Trees. Theory Comput. Syst. 63(3): 587-614 (2019) - [j125]Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Minimum Bisection Is Fixed-Parameter Tractable. SIAM J. Comput. 48(2): 417-450 (2019) - [j124]Fedor V. Fomin
, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh:
Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. SIAM J. Discret. Math. 33(1): 327-345 (2019) - [j123]Fedor V. Fomin
, Petr A. Golovach, Fahad Panolan
, Saket Saurabh:
Editing to Connected F-Degree Graph. SIAM J. Discret. Math. 33(2): 795-836 (2019) - [j122]Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh, Meirav Zehavi:
Packing Cycles Faster Than Erdos-Posa. SIAM J. Discret. Math. 33(3): 1194-1215 (2019) - [j121]Syed Mohammad Meesum
, Fahad Panolan
, Saket Saurabh, Meirav Zehavi:
Rank Vertex Cover as a Natural Problem for Algebraic Compression. SIAM J. Discret. Math. 33(3): 1277-1296 (2019) - [j120]Daniel Lokshtanov, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Balanced Judicious Bipartition is Fixed-Parameter Tractable. SIAM J. Discret. Math. 33(4): 1878-1911 (2019) - [j119]Fedor V. Fomin
, Petr A. Golovach
, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring. ACM Trans. Algorithms 15(1): 9:1-9:27 (2019) - [j118]Akanksha Agrawal
, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. ACM Trans. Algorithms 15(1): 11:1-11:28 (2019) - [j117]Fedor V. Fomin
, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi:
Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. ACM Trans. Algorithms 15(1): 13:1-13:44 (2019) - [j116]Fedor V. Fomin
, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
Spanning Circuits in Regular Matroids. ACM Trans. Algorithms 15(4): 52:1-52:38 (2019) - [j115]Jørgen Bang-Jensen
, Kristine Vitting Klinkby
, Saket Saurabh, Meirav Zehavi:
The parameterized complexity landscape of finding 2-partitions of digraphs. Theor. Comput. Sci. 795: 108-114 (2019) - [j114]Sudeshna Kolay, Fahad Panolan
, Saket Saurabh:
Communication Complexity and Graph Families. ACM Trans. Comput. Theory 11(2): 11:1-11:28 (2019) - [j113]Akanksha Agrawal
, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Split Contraction: The Untold Story. ACM Trans. Comput. Theory 11(3): 18:1-18:22 (2019) - [c215]Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Gehrlein Stability in Committee Selection: Parameterized Hardness and Algorithms. AAMAS 2019: 511-519 - [c214]Geevarghese Philip, Varun Rajan, Saket Saurabh, Prafullkumar Tale
:
Subset Feedback Vertex Set in Chordal and Split Graphs. CIAC 2019: 365-376 - [c213]Niranka Banerjee, Venkatesh Raman, Saket Saurabh:
Fully Dynamic Arboricity Maintenance. COCOON 2019: 1-12 - [c212]Jayakrishnan Madathil, Pranabendu Misra, Saket Saurabh:
An Erdős-Pósa Theorem on Neighborhoods and Domination Number. COCOON 2019: 437-444 - [c211]Akanksha Agrawal
, Grzegorz Guspiel, Jayakrishnan Madathil
, Saket Saurabh, Meirav Zehavi:
Connecting the Dots (with Minimum Crossings). SoCG 2019: 7:1-7:17 - [c210]Jayakrishnan Madathil, Fahad Panolan
, Abhishek Sahu, Saket Saurabh:
On the Complexity of Mixed Dominating Set. CSR 2019: 262-274 - [c209]Neeldhara Misra, Fahad Panolan
, Saket Saurabh:
On the Parameterized Complexity of Edge-Linked Paths. CSR 2019: 286-298 - [c208]Fedor V. Fomin
, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh, Meirav Zehavi:
Going Far From Degeneracy. ESA 2019: 47:1-47:14 - [c207]Akanksha Agrawal, Arindam Biswas, Édouard Bonnet, Nick Brettell
, Radu Curticapean, Dániel Marx, Tillmann Miltzow, Venkatesh Raman, Saket Saurabh:
Parameterized Streaming Algorithms for Min-Ones d-SAT. FSTTCS 2019: 8:1-8:20 - [c206]Pallavi Jain, Lawqueen Kanesh, William Lochet
, Saket Saurabh, Roohani Sharma:
Exact and Approximate Digraph Bandwidth. FSTTCS 2019: 18:1-18:15 - [c205]Akanksha Agrawal
, Fedor V. Fomin
, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
:
Path Contraction Faster Than 2n. ICALP 2019: 11:1-11:13 - [c204]Andreas Björklund, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Approximate Counting of k-Paths: Deterministic and in Polynomial Space. ICALP 2019: 24:1-24:15 - [c203]Fedor V. Fomin
, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. ICALP 2019: 59:1-59:13 - [c202]Fedor V. Fomin
, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh, Meirav Zehavi:
Decomposition of Map Graphs with Applications. ICALP 2019: 60:1-60:15 - [c201]Sushmita Gupta, Saket Saurabh, Ramanujan Sridharan, Meirav Zehavi:
On Succinct Encodings for the Tournament Fixing Problem. IJCAI 2019: 322-328 - [c200]Akanksha Agrawal, Sudeshna Kolay, Jayakrishnan Madathil
, Saket Saurabh:
Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices. ISAAC 2019: 41:1-41:14 - [c199]Arindam Biswas
, Venkatesh Raman, Saket Saurabh:
Solving Group Interval Scheduling Efficiently. IWOCA 2019: 97-107 - [c198]Stéphane Bessy, Marin Bougeret
, R. Krithika
, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut
, Meirav Zehavi:
Packing Arc-Disjoint Cycles in Tournaments. MFCS 2019: 27:1-27:14 - [c197]Akanksha Agrawal
, Pallavi Jain, Lawqueen Kanesh, Saket Saurabh:
Parameterized Complexity of Conflict-Free Matchings and Paths. MFCS 2019: 35:1-35:15 - [c196]Fahad Panolan
, Saket Saurabh, Meirav Zehavi:
Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity. SODA 2019: 1035-1054 - [c195]Akanksha Agrawal
, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Interval Vertex Deletion Admits a Polynomial Kernel. SODA 2019: 1711-1730 - [c194]Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Popular Matching in Roommates Setting is NP-hard. SODA 2019: 2810-2822 - [c193]Sushmita Gupta, Sanjukta Roy
, Saket Saurabh, Meirav Zehavi:
Balanced Stable Marriage: How Close Is Close Enough? WADS 2019: 423-437 - [c192]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS. WADS 2019: 523-537 - [c191]Fahad Panolan
, Saket Saurabh, Meirav Zehavi:
Parameterized Computational Geometry via Decomposition Theorems. WALCOM 2019: 15-27 - [i96]Geevarghese Philip, Varun Rajan, Saket Saurabh, Prafullkumar Tale:
Subset Feedback Vertex Set in Chordal and Split Graphs. CoRR abs/1901.02209 (2019) - [i95]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Going Far From Degeneracy. CoRR abs/1902.02526 (2019) - [i94]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. CoRR abs/1902.06957 (2019) - [i93]Daniel Lokshtanov, Dániel Marx, Saket Saurabh:
Slightly Superexponential Parameterized Problems. CoRR abs/1902.08723 (2019) - [i92]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Decomposition of Map Graphs with Applications. CoRR abs/1903.01291 (2019) - [i91]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Reducing Topological Minor Containment to the Unique Linkage Theorem. CoRR abs/1904.02944 (2019) - [i90]Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
A Brief Note on Single Source Fault Tolerant Reachability. CoRR abs/1904.08150 (2019) - [i89]Akanksha Agrawal, Pradeesha Ashok, Meghana M. Reddy, Saket Saurabh, Dolly Yadav:
FPT Algorithms for Conflict-free Coloring of Graphs and Chromatic Terrain Guarding. CoRR abs/1905.01822 (2019) - [i88]Diptapriyo Majumdar, M. S. Ramanujan, Saket Saurabh:
On the Approximate Compressibility of Connected Vertex Cover. CoRR abs/1905.03379 (2019) - [i87]Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh:
Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams. CoRR abs/1906.05458 (2019) - [i86]Eduard Eiben, William Lochet, Saket Saurabh:
A Polynomial Kernel for Paw-Free Editing. CoRR abs/1911.03683 (2019) - [i85]Fedor V. Fomin, Dániel Marx, Saket Saurabh, Meirav Zehavi:
New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041). Dagstuhl Reports 9(1): 67-87 (2019) - 2018
- [j112]Fedor V. Fomin
, Saket Saurabh:
Preface to Special Issue Dedicated to the 60th Birthday of Gregory Gutin. Algorithmica 80(9): 2513-2515 (2018) - [j111]Syed Mohammad Meesum, Saket Saurabh:
Rank Reduction of Oriented Graphs by Vertex and Edge Deletions. Algorithmica 80(10): 2757-2776 (2018) - [j110]Saket Saurabh, Meirav Zehavi:
$$(k, n-k)$$ ( k , n - k ) -Max-Cut: An $$\mathcal{O}^*(2^p)$$ O ∗ ( 2 p ) -Time Algorithm and a Polynomial Kernel. Algorithmica 80(12): 3844-3860 (2018) - [j109]Fedor V. Fomin
, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh, Meirav Zehavi:
Long directed (s, t)-path: FPT algorithm. Inf. Process. Lett. 140: 8-12 (2018) - [j108]Fedor V. Fomin
, Daniel Lokshtanov, Saket Saurabh:
Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes. J. ACM 65(2): 10:1-10:44 (2018) - [j107]Akanksha Agrawal
, Saket Saurabh, Roohani Sharma, Meirav Zehavi
:
Kernels for deletion to classes of acyclic digraphs. J. Comput. Syst. Sci. 92: 9-21 (2018) - [j106]Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan
, M. S. Ramanujan
, Saket Saurabh:
Reconfiguration on sparse graphs. J. Comput. Syst. Sci. 95: 122-131 (2018) - [j105]Prachi Goyal, Pranabendu Misra, Fahad Panolan
, Geevarghese Philip, Saket Saurabh:
Finding even subgraphs even faster. J. Comput. Syst. Sci. 97: 1-13 (2018) - [j104]Akanksha Agrawal
, Saket Saurabh, Roohani Sharma
, Meirav Zehavi:
Parameterised Algorithms for Deletion to Classes of DAGs. Theory Comput. Syst. 62(8): 1880-1909 (2018) - [j103]Diptapriyo Majumdar
, Venkatesh Raman, Saket Saurabh:
Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators. Theory Comput. Syst. 62(8): 1910-1951 (2018) - [j102]Daniel Lokshtanov, Dániel Marx, Saket Saurabh:
Slightly Superexponential Parameterized Problems. SIAM J. Comput. 47(3): 675-702 (2018) - [j101]Geevarghese Philip, Ashutosh Rai, Saket Saurabh:
Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel. SIAM J. Discret. Math. 32(2): 882-901 (2018) - [j100]Fedor V. Fomin
, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh, Meirav Zehavi:
Matrix Rigidity from the Viewpoint of Parameterized Complexity. SIAM J. Discret. Math. 32(2): 966-985 (2018) - [j99]Pradeesha Ashok
, Aditi Dudeja, Sudeshna Kolay, Saket Saurabh:
Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs. SIAM J. Discret. Math. 32(2): 1189-1208 (2018) - [j98]Akanksha Agrawal
, Daniel Lokshtanov, Diptapriyo Majumdar
, Amer E. Mouawad, Saket Saurabh:
Kernelization of Cycle Packing with Relaxed Disjointness Constraints. SIAM J. Discret. Math. 32(3): 1619-1643 (2018) - [j97]Daniel Lokshtanov, Michal Pilipczuk
, Saket Saurabh:
Below All Subsets for Minimal Connected Dominating Set. SIAM J. Discret. Math. 32(3): 2332-2345 (2018) - [j96]Fedor V. Fomin
, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
Covering Vectors by Spaces: Regular Matroids. SIAM J. Discret. Math. 32(4): 2512-2565 (2018) - [j95]Fedor V. Fomin
, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors. ACM Trans. Algorithms 14(1): 6:1-6:31 (2018) - [j94]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh:
Linear Time Parameterized Algorithms for Subset Feedback Vertex Set. ACM Trans. Algorithms 14(1): 7:1-7:37 (2018) - [j93]Daniel Lokshtanov, Dániel Marx, Saket Saurabh:
Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal. ACM Trans. Algorithms 14(2): 13:1-13:30 (2018) - [j92]Daniel Lokshtanov, Pranabendu Misra
, Fahad Panolan
, Saket Saurabh:
Deterministic Truncation of Linear Matroids. ACM Trans. Algorithms 14(2): 14:1-14:20 (2018) - [j91]Pradeesha Ashok
, Fedor V. Fomin
, Sudeshna Kolay, Saket Saurabh, Meirav Zehavi:
Exact Algorithms for Terrain Guarding. ACM Trans. Algorithms 14(2): 25:1-25:20 (2018) - [j90]Arnab Bhattacharyya, Fabrizio Grandoni
, Aleksandar Nikolov
, Barna Saha, Saket Saurabh, Aravindan Vijayaraghavan, Qin Zhang
:
Editorial: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2016 Special Issue. ACM Trans. Algorithms 14(3): 26:1-26:2 (2018) - [j89]Fedor V. Fomin
, Daniel Lokshtanov, Saket Saurabh, Michal Pilipczuk
, Marcin Wrochna
:
Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth. ACM Trans. Algorithms 14(3): 34:1-34:45 (2018) - [j88]Ashutosh Rai, Saket Saurabh:
Bivariate complexity analysis of Almost Forest Deletion. Theor. Comput. Sci. 708: 18-33 (2018) - [j87]Deeksha Adil, Sushmita Gupta, Sanjukta Roy
, Saket Saurabh, Meirav Zehavi:
Parameterized algorithms for stable matching with ties and incomplete lists. Theor. Comput. Sci. 723: 1-10 (2018) - [j86]Manu Basavaraju, Fahad Panolan
, Ashutosh Rai, M. S. Ramanujan, Saket Saurabh:
On the kernelization complexity of string problems. Theor. Comput. Sci. 730: 21-31 (2018) - [j85]Akanksha Agrawal
, Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh:
Simultaneous Feedback Vertex Set: A Parameterized Perspective. ACM Trans. Comput. Theory 10(4): 18:1-18:25 (2018) - [c190]Akanksha Agrawal
, Daniel Lokshtanov, Pranabendu Misra
, Saket Saurabh, Meirav Zehavi:
Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems. APPROX-RANDOM 2018: 1:1-1:15 - [c189]Sushmita Gupta, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Stability in Barter Exchange Markets. AAMAS 2018: 1371-1379 - [c188]Akanksha Agrawal, Pratibha Choudhary, Pallavi Jain, Lawqueen Kanesh, Vibha Sahlot, Saket Saurabh:
Hitting and Covering Partially. COCOON 2018: 751-763 - [c187]Timothy Carpenter, Fedor V. Fomin
, Daniel Lokshtanov, Saket Saurabh, Anastasios Sidiropoulos:
Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces. SoCG 2018: 21:1-21:14 - [c186]Jayakrishnan Madathil
, Saket Saurabh, Meirav Zehavi:
Max-Cut Above Spanning Tree is Fixed-Parameter Tractable. CSR 2018: 244-256 - [c185]Fedor V. Fomin
, Fahad Panolan
, M. S. Ramanujan, Saket Saurabh:
On the Optimality of Pseudo-polynomial Algorithms for Integer Programming. ESA 2018: 31:1-31:13 - [c184]Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. FSTTCS 2018: 35:1-35:19 - [c183]Pallavi Jain, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh:
A parameterized runtime analysis of randomized local search and evolutionary algorithm for max l-uncut. GECCO (Companion) 2018: 326-327 - [c182]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS. ICALP 2018: 110:1-110:4 - [c181]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Reducing CMSO Model Checking to Highly Connected Graphs. ICALP 2018: 135:1-135:14 - [c180]Sushmita Gupta, Sanjukta Roy
, Saket Saurabh, Meirav Zehavi:
When Rigging a Tournament, Let Greediness Blind You. IJCAI 2018: 275-281 - [c179]Sushmita Gupta, Sanjukta Roy
, Saket Saurabh, Meirav Zehavi:
Winning a Tournament by Any Means Necessary. IJCAI 2018: 282-288 - [c178]Daniel Lokshtanov, Pranabendu Misra
, Fahad Panolan
, Saket Saurabh, Meirav Zehavi
:
Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity. ITCS 2018: 32:1-32:13 - [c177]Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh:
Parameterized Query Complexity of Hitting Set Using Stability of Sunflowers. ISAAC 2018: 25:1-25:12 - [c176]Saket Saurabh, Meirav Zehavi:
Parameterized Complexity of Multi-Node Hubs. IPEC 2018: 8:1-8:14 - [c175]Akanksha Agrawal
, Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra, Saket Saurabh:
Exploring the Kernelization Borders for Hitting Cycles. IPEC 2018: 14:1-14:14 - [c174]Daniel Lokshtanov, Mateus de Oliveira Oliveira, Saket Saurabh:
A Strongly-Uniform Slicewise Polynomial-Time Algorithm for the Embedded Planar Diameter Improvement Problem. IPEC 2018: 25:1-25:13 - [c173]Aritra Banik
, Pratibha Choudhary, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
A Polynomial Sized Kernel for Tracking Paths Problem. LATIN 2018: 94-107 - [c172]R. Krithika
, Abhishek Sahu, Saket Saurabh, Meirav Zehavi:
The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue. LATIN 2018: 712-726 - [c171]Akanksha Agrawal
, Pallavi Jain, Lawqueen Kanesh, Daniel Lokshtanov, Saket Saurabh:
Conflict Free Feedback Vertex Set: A Parameterized Dichotomy. MFCS 2018: 53:1-53:15 - [c170]Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
:
Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth. SODA 2018: 262-273 - [c169]Tien-Nam Le
, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
:
Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. SODA 2018: 331-342 - [c168]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh:
When Recursion is Better than Iteration: A Linear-Time Algorithm for Acyclicity with Few Error Vertices. SODA 2018: 1916-1933 - [c167]Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh, Roohani Sharma, Meirav Zehavi
:
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. SODA 2018: 2785-2800 - [c166]Jørgen Bang-Jensen
, Manu Basavaraju, Kristine Vitting Klinkby
, Pranabendu Misra
, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
:
Parameterized Algorithms for Survivable Network Design with Uniform Demands. SODA 2018: 2838-2850 - [c165]Akanksha Agrawal
, Daniel Lokshtanov, Pranabendu Misra
, Saket Saurabh, Meirav Zehavi
:
Erdös-Pósa Property of Obstructions to Interval Graphs. STACS 2018: 7:1-7:15 - [i84]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Reducing CMSO Model Checking to Highly Connected Graphs. CoRR abs/1802.01453 (2018) - [i83]R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi:
The Parameterized Complexity of Packing Arc-Disjoint Cycles in Tournaments. CoRR abs/1802.07090 (2018) - [i82]Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Popular Matching in Roommates Setting is NP-hard. CoRR abs/1803.09370 (2018) - [i81]Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh:
Parameterized Query Complexity of Hitting Set using Stability of Sunflowers. CoRR abs/1807.06272 (2018) - [i80]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Approximation Schemes for Low-Rank Binary Matrix Approximation Problems. CoRR abs/1807.07156 (2018) - [i79]Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Geevarghese Philip, Fahad Panolan, Saket Saurabh:
A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments. CoRR abs/1809.08437 (2018) - [i78]Marek Cygan, Pawel Komosa, Daniel Lokshtanov, Michal Pilipczuk, Marcin Pilipczuk, Saket Saurabh:
Randomized contractions meet lean decompositions. CoRR abs/1810.06864 (2018) - 2017
- [j84]Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh:
Quick but Odd Growth of Cacti. Algorithmica 79(1): 271-290 (2017) - [j83]Pradeesha Ashok
, Sudeshna Kolay
, Saket Saurabh:
Multivariate Complexity Analysis of Geometric Red Blue Set Cover. Algorithmica 79(3): 667-697 (2017) - [j82]Ivan Bliznets
, Fedor V. Fomin
, Petr A. Golovach
, Nikolay Karpov, Alexander S. Kulikov
, Saket Saurabh:
Parameterized Complexity of Superstring Problems. Algorithmica 79(3): 798-813 (2017) - [j81]Fahad Panolan
, Geevarghese Philip, Saket Saurabh:
On the parameterized complexity of b-chromatic number. J. Comput. Syst. Sci. 84: 120-131 (2017) - [j80]Rajesh Chitnis
, Fedor V. Fomin
, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh:
Faster exact algorithms for some terminal set problems. J. Comput. Syst. Sci. 88: 195-207 (2017) - [j79]Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause
, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
:
Irrelevant vertices for the planar Disjoint Paths Problem. J. Comb. Theory B 122: 815-843 (2017) - [j78]Daniel Lokshtanov, Marcin Pilipczuk
, Michal Pilipczuk, Saket Saurabh:
Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth. SIAM J. Comput. 46(1): 161-189 (2017) - [j77]Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý
:
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. SIAM J. Discret. Math. 31(2): 1294-1327 (2017) - [j76]Daniel Lokshtanov, Pranabendu Misra
, M. S. Ramanujan, Saket Saurabh:
Hitting Selected (Odd) Cycles. SIAM J. Discret. Math. 31(3): 1581-1615 (2017) - [j75]Archontia C. Giannopoulou
, Bart M. P. Jansen
, Daniel Lokshtanov, Saket Saurabh:
Uniform Kernelization Complexity of Hitting Forbidden Minors. ACM Trans. Algorithms 13(3): 35:1-35:35 (2017) - [j74]Fedor V. Fomin
, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh:
Representative Families of Product Families. ACM Trans. Algorithms 13(3): 36:1-36:29 (2017) - [j73]M. S. Ramanujan
, Saket Saurabh:
Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts. ACM Trans. Algorithms 13(4): 46:1-46:25 (2017) - [j72]Pradeesha Ashok
, Sudeshna Kolay, Syed Mohammad Meesum
, Saket Saurabh:
Parameterized complexity of Strip Packing and Minimum Volume Packing. Theor. Comput. Sci. 661: 56-64 (2017) - [j71]Sounaka Mishra, Shijin Rajakrishnan, Saket Saurabh:
On approximability of optimization problems related to Red/Blue-split graphs. Theor. Comput. Sci. 690: 104-113 (2017) - [c164]Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh, Prafullkumar Tale
:
Paths to Trees and Cacti. CIAC 2017: 31-42 - [c163]Pranabendu Misra, Fahad Panolan
, M. S. Ramanujan, Saket Saurabh:
Linear Representation of Transversal Matroids and Gammoids Parameterized by Rank. COCOON 2017: 420-432 - [c162]Pradeesha Ashok
, Fedor V. Fomin
, Sudeshna Kolay, Saket Saurabh, Meirav Zehavi
:
Exact Algorithms for Terrain Guarding. SoCG 2017: 11:1-11:15 - [c161]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh:
A Linear-Time Parameterized Algorithm for Node Unique Label Cover. ESA 2017: 57:1-57:15 - [c160]Daniel Lokshtanov, Saket Saurabh, Roohani Sharma, Meirav Zehavi
:
Balanced Judicious Bipartition is Fixed-Parameter Tractable. FSTTCS 2017: 40:40-40:15 - [c159]Fedor V. Fomin
, Petr A. Golovach
, Daniel Lokshtanov, Saket Saurabh:
Covering Vectors by Spaces: Regular Matroids. ICALP 2017: 56:1-56:15 - [c158]Fedor V. Fomin
, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh, Meirav Zehavi
:
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. ICALP 2017: 65:1-65:15 - [c157]Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh, Meirav Zehavi
:
Packing Cycles Faster Than Erdos-Posa. ICALP 2017: 71:1-71:15 - [c156]Akanksha Agrawal
, Saket Saurabh, Prafullkumar Tale
:
On the Parameterized Complexity of Contraction to Generalization of Trees. IPEC 2017: 1:1-1:12 - [c155]Sudeshna Kolay, Fahad Panolan
, Saket Saurabh:
Communication Complexity of Pairs of Graph Families with Applications. MFCS 2017: 13:1-13:13 - [c154]Sushmita Gupta, Sanjukta Roy
, Saket Saurabh, Meirav Zehavi
:
Parameterized Algorithms and Kernels for Rainbow Matching. MFCS 2017: 71:1-71:13 - [c153]Sushmita Gupta, Sanjukta Roy
, Saket Saurabh, Meirav Zehavi
:
Group Activity Selection on Graphs: Parameterized Analysis. SAGT 2017: 106-118 - [c152]Akanksha Agrawal
, Daniel Lokshtanov, Pranabendu Misra
, Saket Saurabh, Meirav Zehavi
:
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. SODA 2017: 1383-1398 - [c151]Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh, Marcin Wrochna
:
Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. SODA 2017: 1419-1432 - [c150]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
Spanning Circuits in Regular Matroids. SODA 2017: 1433-1441 - [c149]R. Krithika
, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale
:
Parameterized and Exact Algorithms for Class Domination Coloring. SOFSEM 2017: 336-349 - [c148]Akanksha Agrawal
, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
:
Split Contraction: The Untold Story. STACS 2017: 5:1-5:14 - [c147]Fedor V. Fomin
, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh, Meirav Zehavi
:
Matrix Rigidity from the Viewpoint of Parameterized Complexity. STACS 2017: 32:1-32:14 - [c146]Daniel Lokshtanov, Fahad Panolan
, M. S. Ramanujan, Saket Saurabh:
Lossy kernelization. STOC 2017: 224-237 - [c145]Akanksha Agrawal, Pranabendu Misra, Fahad Panolan
, Saket Saurabh:
Fast Exact Algorithms for Survivable Network Design with Uniform Requirements. WADS 2017: 25-36 - [c144]Aritra Banik, Fahad Panolan
, Venkatesh Raman, Vibha Sahlot, Saket Saurabh:
Parameterized Complexity of Geometric Covering Problems Having Conflicts. WADS 2017: 61-72 - [i77]Manu Basavaraju, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh:
On finding highly connected spanning subgraphs. CoRR abs/1701.02853 (2017) - [i76]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh:
The Half-integral Erdös-Pósa Property for Non-null Cycles. CoRR abs/1703.02866 (2017) - [i75]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Parameterized Complexity and Approximability of Directed Odd Cycle Transversal. CoRR abs/1704.04249 (2017) - [i74]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. CoRR abs/1704.07279 (2017) - [i73]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. CoRR abs/1705.01414 (2017) - [i72]Syed Mohammad Meesum, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Rank Vertex Cover as a Natural Problem for Algebraic Compression. CoRR abs/1705.02822 (2017) - [i71]Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh, Meirav Zehavi:
Packing Cycles Faster Than Erdős-Pósa. CoRR abs/1707.01037 (2017) - [i70]Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Polylogarithmic Approximation Algorithms for Weighted-$\mathcal{F}$-Deletion Problems. CoRR abs/1707.04908 (2017) - [i69]Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. CoRR abs/1707.04917 (2017) - [i68]Sushmita Gupta, Saket Saurabh, Meirav Zehavi:
On Treewidth and Stable Marriage. CoRR abs/1707.05404 (2017) - [i67]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Balanced Stable Marriage: How Close is Close Enough? CoRR abs/1707.09545 (2017) - [i66]Akanksha Agrawal, Saket Saurabh, Prafullkumar Tale:
On the Parameterized Complexity of Contraction to Generalization of Trees. CoRR abs/1708.00622 (2017) - [i65]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
Covering vectors by spaces: Regular matroids. CoRR abs/1710.02300 (2017) - [i64]Daniel Lokshtanov, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Balanced Judicious Partition is Fixed-Parameter Tractable. CoRR abs/1710.05491 (2017) - [i63]Timothy Carpenter, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Anastasios Sidiropoulos:
Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces. CoRR abs/1712.06747 (2017) - 2016
- [j70]Serge Gaspers, Sebastian Ordyniak
, M. S. Ramanujan, Saket Saurabh, Stefan Szeider
:
Backdoors to q-Horn. Algorithmica 74(1): 540-557 (2016) - [j69]Jørgen Bang-Jensen
, Saket Saurabh, Sven Simonsen:
Parameterized Algorithms for Non-separating Trees and Branchings in Digraphs. Algorithmica 76(1): 279-296 (2016) - [j68]Jørgen Bang-Jensen
, Alessandro Maddaloni
, Saket Saurabh:
Algorithms and Kernels for Feedback Set Problems in Generalizations of Tournaments. Algorithmica 76(2): 320-343 (2016) - [j67]Fedor V. Fomin
, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh:
Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms. J. ACM 63(4): 29:1-29:60 (2016) - [j66]Hans L. Bodlaender
, Fedor V. Fomin
, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos:
(Meta) Kernelization. J. ACM 63(5): 44:1-44:69 (2016) - [j65]Fedor V. Fomin
, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh:
Hitting Forbidden Minors: Approximation and Kernelization. SIAM J. Discret. Math. 30(1): 383-410 (2016) - [j64]Archontia C. Giannopoulou
, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý
:
Tree Deletion Set Has a Polynomial Kernel but No OPTO(1) Approximation. SIAM J. Discret. Math. 30(3): 1371-1384 (2016) - [j63]Manu Basavaraju, Mathew C. Francis, M. S. Ramanujan, Saket Saurabh:
Partially Polynomial Kernels for Set Cover and Test Cover. SIAM J. Discret. Math. 30(3): 1401-1423 (2016) - [j62]Marek Cygan
, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto
, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström
:
On Problems as Hard as CNF-SAT. ACM Trans. Algorithms 12(3): 41:1-41:24 (2016) - [j61]Syed Mohammad Meesum
, Pranabendu Misra, Saket Saurabh:
Reducing rank of the adjacency matrix by graph modification. Theor. Comput. Sci. 654: 70-79 (2016) - [c143]Akanksha Agrawal, Sudeshna Kolay, Saket Saurabh, Roohani Sharma:
Kernelizing Buttons and Scissors. CCCG 2016: 279-286 - [c142]Fedor V. Fomin
, Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh:
Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. SoCG 2016: 39:1-39:15 - [c141]Fedor V. Fomin
, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk
, Michal Pilipczuk, Saket Saurabh:
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. FOCS 2016: 515-524 - [c140]Akanksha Agrawal
, Daniel Lokshtanov, Diptapriyo Majumdar
, Amer E. Mouawad, Saket Saurabh:
Kernelization of Cycle Packing with Relaxed Disjointness Constraints. ICALP 2016: 26:1-26:14 - [c139]Akanksha Agrawal
, Fahad Panolan
, Saket Saurabh, Meirav Zehavi
:
Simultaneous Feedback Edge Set: A Parameterized Perspective. ISAAC 2016: 5:1-5:13 - [c138]Akanksha Agrawal
, Saket Saurabh, Roohani Sharma, Meirav Zehavi
:
Kernels for Deletion to Classes of Acyclic Digraphs. ISAAC 2016: 6:1-6:12 - [c137]Akanksha Agrawal
, Sushmita Gupta, Saket Saurabh, Roohani Sharma:
Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set. IPEC 2016: 2:1-2:14 - [c136]Akanksha Agrawal, Sudeshna Kolay, Daniel Lokshtanov, Saket Saurabh:
A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion. LATIN 2016: 1-13 - [c135]Pradeesha Ashok
, Sudeshna Kolay, Saket Saurabh:
Parameterized Complexity of Red Blue Set Cover for Lines. LATIN 2016: 96-109 - [c134]Syed Mohammad Meesum, Saket Saurabh:
Rank Reduction of Directed Graphs by Vertex and Edge Deletions. LATIN 2016: 619-633 - [c133]Ashutosh Rai, M. S. Ramanujan
, Saket Saurabh:
A Parameterized Algorithm for Mixed-Cut. LATIN 2016: 672-685 - [c132]Saket Saurabh, Meirav Zehavi
:
(k, n-k)-Max-Cut: An 𝒪∗(2p)-Time Algorithm and a Polynomial Kernel. LATIN 2016: 686-699 - [c131]Sudeshna Kolay, Fahad Panolan
, Venkatesh Raman, Saket Saurabh:
Parameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs. MFCS 2016: 75:1-75:13 - [c130]Akanksha Agrawal
, Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh:
Simultaneous Feedback Vertex Set: A Parameterized Perspective. STACS 2016: 7:1-7:15 - [c129]Pål Grønås Drange, Markus Sortland Dregi, Fedor V. Fomin
, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl
, Fernando Sánchez Villaamil, Saket Saurabh, Sebastian Siebertz
, Somnath Sikdar:
Kernelization and Sparseness: the Case of Dominating Set. STACS 2016: 31:1-31:14 - [c128]Fedor V. Fomin
, Petr A. Golovach
, Fahad Panolan
, Saket Saurabh:
Editing to Connected f-Degree Graph. STACS 2016: 36:1-36:14 - [c127]Fedor V. Fomin
, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh:
Exact algorithms via monotone local search. STOC 2016: 764-775 - [c126]Marek Cygan
, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Lower Bounds for Approximation Schemes for Closest String. SWAT 2016: 12:1-12:10 - [e2]Akash Lal, S. Akshay, Saket Saurabh, Sandeep Sen:
36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016, December 13-15, 2016, Chennai, India. LIPIcs 65, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-027-9 [contents] - [r1]Fahad Panolan
, Saket Saurabh:
Matroids in Parameterized Complexity and Exact Algorithms. Encyclopedia of Algorithms 2016: 1203-1206 - [i62]Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
Lossy Kernelization. CoRR abs/1604.04111 (2016) - [i61]Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Subexponential parameterized algorithms for planar and apex-minor-free graphs via low treewidth pattern covering. CoRR abs/1604.05999 (2016) - [i60]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh:
A Linear Time Parameterized Algorithm for Node Unique Label Cover. CoRR abs/1604.08764 (2016) - [i59]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Bidimensionality and Kernels. CoRR abs/1606.05689 (2016) - [i58]Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
Fine-grained complexity of integer programming: The case of bounded branch-width and rank. CoRR abs/1607.05342 (2016) - [i57]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
Spanning Circuits in Regular Matroids. CoRR abs/1607.05516 (2016) - [i56]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh:
A Linear Time Parameterized Algorithm for Directed Feedback Vertex Set. CoRR abs/1609.04347 (2016) - [i55]Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh:
Below all subsets for Minimal Connected Dominating Set. CoRR abs/1611.00840 (2016) - [i54]Akanksha Agrawal, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Simultaneous Feedback Edge Set: A Parameterized Perspective. CoRR abs/1611.07701 (2016) - 2015
- [b1]Marek Cygan, Fedor V. Fomin, Lukasz Kowalik
, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk
, Michal Pilipczuk, Saket Saurabh:
Parameterized Algorithms. Springer 2015, ISBN 978-3-319-21274-6, pp. 3-555 - [j60]Henning Fernau
, Fedor V. Fomin
, Geevarghese Philip, Saket Saurabh:
On the parameterized complexity of vertex cover and edge cover with connectivity constraints. Theor. Comput. Sci. 565: 1-15 (2015) - [c125]Ashutosh Rai, Saket Saurabh:
Bivariate Complexity Analysis of Almost Forest Deletion. COCOON 2015: 133-144 - [c124]Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman, Sasanka Roy, Saket Saurabh:
Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs. COCOON 2015: 349-360 - [c123]Syed Mohammad Meesum, Pranabendu Misra, Saket Saurabh:
Reducing Rank of the Adjacency Matrix by Graph Modification. COCOON 2015: 361-373 - [c122]Pradeesha Ashok
, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh:
Unique Covering Problems with Geometric Sets. COCOON 2015: 548-558 - [c121]Ivan Bliznets
, Fedor V. Fomin
, Petr A. Golovach
, Nikolay Karpov, Alexander S. Kulikov
, Saket Saurabh:
Parameterized Complexity of Superstring Problems. CPM 2015: 89-99 - [c120]Fedor V. Fomin
, Saket Saurabh, Neeldhara Misra:
Graph Modification Problems: A Modern Perspective. FAW 2015: 3-6 - [c119]Jakub Gajarský, Petr Hlinený
, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak
, M. S. Ramanujan, Saket Saurabh:
FO Model Checking on Posets of Bounded Width. FOCS 2015: 963-974 - [c118]Prachi Goyal, Pranabendu Misra, Fahad Panolan
, Geevarghese Philip, Saket Saurabh:
Finding Even Subgraphs Even Faster. FSTTCS 2015: 434-447 - [c117]Fedor V. Fomin
, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh:
Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. ICALP (1) 2015: 494-505 - [c116]Archontia C. Giannopoulou
, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh:
Uniform Kernelization Complexity of Hitting Forbidden Minors. ICALP (1) 2015: 629-641 - [c115]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan
, Saket Saurabh:
Deterministic Truncation of Linear Matroids. ICALP (1) 2015: 922-934 - [c114]Daniel Lokshtanov, M. S. Ramanujan
, Saket Saurabh:
Linear Time Parameterized Algorithms for Subset Feedback Vertex Set. ICALP (1) 2015: 935-946 - [c113]Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh:
Quick but Odd Growth of Cacti. IPEC 2015: 258-269 - [c112]Diptapriyo Majumdar
, Venkatesh Raman, Saket Saurabh:
Kernels for Structural Parameterizations of Vertex Cover - Case of Small Degree Modulators. IPEC 2015: 331-342 - [c111]Fahad Panolan
, Geevarghese Philip, Saket Saurabh:
B-Chromatic Number: Beyond NP-Hardness. IPEC 2015: 389-401 - [c110]Geevarghese Philip, Ashutosh Rai, Saket Saurabh:
Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel. MFCS (2) 2015: 517-528 - [c109]Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, M. S. Ramanujan, Saket Saurabh:
Solving d-SAT via Backdoors to Small Treewidth. SODA 2015: 630-641 - [c108]Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan
, M. S. Ramanujan, Saket Saurabh:
Reconfiguration on Sparse Graphs. WADS 2015: 506-517 - [c107]Fahad Panolan
, M. S. Ramanujan, Saket Saurabh:
On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids. WADS 2015: 566-577 - [i53]Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh:
Parameterized Complexity of Superstring Problems. CoRR abs/1502.01461 (2015) - [i52]Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh:
Uniform Kernelization Complexity of Hitting Forbidden Minors. CoRR abs/1502.03965 (2015) - [i51]Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
Reconfiguration on sparse graphs. CoRR abs/1502.04803 (2015) - [i50]Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh:
FO Model Checking on Posets of Bounded Width. CoRR abs/1504.04115 (2015) - [i49]Ashutosh Rai, M. S. Ramanujan, Saket Saurabh:
A Parameterized Algorithm for Mixed Cut. CoRR abs/1509.05612 (2015) - [i48]Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Lower bounds for approximation schemes for Closest String. CoRR abs/1509.05809 (2015) - [i47]Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh:
Simultaneous Feedback Vertex Set: A Parameterized Perspective. CoRR abs/1510.01557 (2015) - [i46]Akanksha Agrawal, Sudeshna Kolay, Daniel Lokshtanov, Saket Saurabh:
A faster FPT Algorithm and a smaller Kernel for Block Graph Vertex Deletion. CoRR abs/1510.08154 (2015) - [i45]Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh, Marcin Wrochna:
Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. CoRR abs/1511.01379 (2015) - [i44]Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh:
Multivariate Complexity Analysis of Geometric {\sc Red Blue Set Cover}. CoRR abs/1511.07642 (2015) - [i43]Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh:
Exact Algorithms via Monotone Local Search. CoRR abs/1512.01621 (2015) - [i42]Sudeshna Kolay, Fahad Panolan, Venkatesh Raman, Saket Saurabh:
Parameterized Algorithms on Perfect Graphs for deletion to (r, ℓ)-graphs. CoRR abs/1512.04200 (2015) - 2014
- [j59]Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh:
The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles. Algorithmica 68(2): 504-530 (2014) - [j58]Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo
:
Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables. Algorithmica 68(3): 739-757 (2014) - [j57]Marek Cygan
, Daniel Lokshtanov, Marcin Pilipczuk
, Michal Pilipczuk, Saket Saurabh:
On Cutwidth Parameterized by Vertex Cover. Algorithmica 68(4): 940-953 (2014) - [j56]Matthias Mnich
, Geevarghese Philip, Saket Saurabh, Ondrej Suchý
:
Beyond Max-Cut: λ-extendible properties parameterized above the Poljak-Turzík bound. J. Comput. Syst. Sci. 80(7): 1384-1403 (2014) - [j55]Marek Cygan
, Daniel Lokshtanov, Marcin Pilipczuk
, Michal Pilipczuk, Saket Saurabh:
On the Hardness of Losing Width. Theory Comput. Syst. 54(1): 73-82 (2014) - [j54]Fedor V. Fomin
, Petr A. Golovach
, Daniel Lokshtanov, Saket Saurabh:
Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width. SIAM J. Comput. 43(5): 1541-1563 (2014) - [j53]Gwenaël Joret, Christophe Paul
, Ignasi Sau
, Saket Saurabh, Stéphan Thomassé
:
Hitting and Harvesting Pumpkins. SIAM J. Discret. Math. 28(3): 1363-1390 (2014) - [j52]Michael Dom, Daniel Lokshtanov, Saket Saurabh:
Kernelization Lower Bounds Through Colors and IDs. ACM Trans. Algorithms 11(2): 13:1-13:20 (2014) - [j51]Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:
Faster Parameterized Algorithms Using Linear Programming. ACM Trans. Algorithms 11(2): 15:1-15:31 (2014) - [j50]Mrinal Kumar, Sounaka Mishra, N. Safina Devi
, Saket Saurabh:
Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization. Theor. Comput. Sci. 526: 90-96 (2014) - [c106]Manu Basavaraju, Fahad Panolan
, Ashutosh Rai, M. S. Ramanujan, Saket Saurabh:
On the Kernelization Complexity of String Problems. COCOON 2014: 141-153 - [c105]Fedor V. Fomin
, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh:
Representative Sets of Product Families. ESA 2014: 443-454 - [c104]Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý
:
Solving Multicut Faster Than 2 n. ESA 2014: 666-676 - [c103]Daniel Lokshtanov, Marcin Pilipczuk
, Michal Pilipczuk, Saket Saurabh:
Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth. FOCS 2014: 186-195 - [c102]Manu Basavaraju, Fedor V. Fomin
, Petr A. Golovach
, Saket Saurabh:
Connecting Vertices by Independent Trees. FSTTCS 2014: 73-84 - [c101]Archontia C. Giannopoulou
, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý
:
Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation). FSTTCS 2014: 85-96 - [c100]Manu Basavaraju, Fedor V. Fomin
, Petr A. Golovach
, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh:
Parameterized Algorithms to Preserve Connectivity. ICALP (1) 2014: 800-811 - [c99]Sudeshna Kolay, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh:
Parameterized Approximations via d-Skew-Symmetric Multicut. MFCS (2) 2014: 457-468 - [c98]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh:
Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms. SODA 2014: 142-151 - [c97]M. S. Ramanujan
, Saket Saurabh:
Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts. SODA 2014: 1739-1748 - [c96]Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh:
A Near-Optimal Planarization Algorithm. SODA 2014: 1802-1811 - [c95]Marek Cygan
, Daniel Lokshtanov, Marcin Pilipczuk
, Michal Pilipczuk, Saket Saurabh:
Minimum bisection is fixed parameter tractable. STOC 2014: 323-332 - [p1]Fedor V. Fomin
, Saket Saurabh:
Kernelization Methods for Fixed-Parameter Tractability. Tractability 2014: 260-282 - [i41]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Representative Sets of Product Families. CoRR abs/1402.3909 (2014) - [i40]Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth. CoRR abs/1404.0818 (2014) - [i39]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh:
Deterministic Truncation of Linear Matroids. CoRR abs/1404.4506 (2014) - [i38]Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
Finding Even Subgraphs Even Faster. CoRR abs/1409.4935 (2014) - [i37]Pål Grønås Drange
, Markus S. Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Saket Saurabh, Fernando Sánchez Villaamil, Somnath Sikdar:
Kernelization and Sparseness: the case of Dominating Set. CoRR abs/1411.4575 (2014) - 2013
- [j49]Neeldhara Misra, Hannes Moser, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
The Parameterized Complexity of Unique Coverage and Its Variants. Algorithmica 65(3): 517-544 (2013) - [j48]Fedor V. Fomin
, Fabrizio Grandoni
, Dieter Kratsch, Daniel Lokshtanov, Saket Saurabh:
Computing Optimal Steiner Trees in Polynomial Space. Algorithmica 65(3): 584-604 (2013) - [j47]Venkatesh Raman, Saket Saurabh:
Guest Editorial: Special Issue on Parameterized and Exact Computation, Part II. Algorithmica 65(4): 711-712 (2013) - [j46]Pinar Heggernes
, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization. Inf. Comput. 231: 109-116 (2013) - [j45]Frederic Dorn, Fedor V. Fomin
, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs. Inf. Comput. 233: 60-70 (2013) - [j44]Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh:
Imbalance is fixed parameter tractable. Inf. Process. Lett. 113(19-21): 714-718 (2013) - [j43]Fedor V. Fomin
, Serge Gaspers, Saket Saurabh, Stéphan Thomassé:
A linear vertex kernel for maximum internal spanning tree. J. Comput. Syst. Sci. 79(1): 1-6 (2013) - [j42]Venkatesh Raman, Saket Saurabh, Ondrej Suchý
:
An FPT algorithm for Tree Deletion Set. J. Graph Algorithms Appl. 17(6): 615-628 (2013) - [j41]Fedor V. Fomin
, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh:
Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles. J. Graph Theory 74(4): 417-424 (2013) - [j40]Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:
A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments. Theory Comput. Syst. 53(4): 609-620 (2013) - [j39]Fedor V. Fomin
, Saket Saurabh, Yngve Villanger:
A Polynomial Kernel for Proper Interval Vertex Deletion. SIAM J. Discret. Math. 27(4): 1964-1976 (2013) - [j38]Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh:
Parameterized complexity of MaxSat Above Average. Theor. Comput. Sci. 511: 77-84 (2013) - [j37]Michael R. Fellows
, Fedor V. Fomin
, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond
, Saket Saurabh:
Distortion is Fixed Parameter Tractable. ACM Trans. Comput. Theory 5(4): 16:1-16:20 (2013) - [c94]Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý
:
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. ESA 2013: 671-682 - [c93]Robert Crowston, Mark Jones, Gabriele Muciaccia, Geevarghese Philip, Ashutosh Rai, Saket Saurabh:
Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzik Bound. FSTTCS 2013: 43-54 - [c92]Manu Basavaraju, Mathew C. Francis, M. S. Ramanujan, Saket Saurabh:
Partially Polynomial Kernels for Set Cover and Test Cover. FSTTCS 2013: 67-78 - [c91]Rajesh Hemant Chitnis
, Fedor V. Fomin
, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh:
Faster Exact Algorithms for Some Terminal Set Problems. IPEC 2013: 150-162 - [c90]Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh:
On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges. IPEC 2013: 243-254 - [c89]Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan, Saket Saurabh:
Hardness of r-dominating set on Graphs of Diameter (r + 1). IPEC 2013: 255-267 - [c88]Neeldhara Misra, Fahad Panolan
, Saket Saurabh:
Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule? MFCS 2013: 679-690 - [c87]Serge Gaspers, Sebastian Ordyniak
, M. S. Ramanujan, Saket Saurabh, Stefan Szeider
:
Backdoors to q-Horn. STACS 2013: 67-79 - [c86]Fedor V. Fomin
, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs. STACS 2013: 92-103 - [c85]Venkatesh Raman, Saket Saurabh, Ondrej Suchý
:
An FPT Algorithm for Tree Deletion Set. WALCOM 2013: 286-297 - [c84]Neeldhara Misra, Fahad Panolan
, Ashutosh Rai, Venkatesh Raman, Saket Saurabh:
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. WG 2013: 370-381 - [i36]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh:
Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms. CoRR abs/1304.4626 (2013) - [i35]M. S. Ramanujan, Saket Saurabh:
Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts. CoRR abs/1304.7505 (2013) - [i34]Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý:
Tree Deletion Set has a Polynomial Kernel (but no OPT^O(1) approximation). CoRR abs/1309.7891 (2013) - [i33]Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Irrelevant Vertices for the Planar Disjoint Paths Problem. CoRR abs/1310.2378 (2013) - [i32]Robert Crowston, Mark Jones, Gabriele Muciaccia, Geevarghese Philip, Ashutosh Rai, Saket Saurabh:
Polynomial Kernels for λ-extendible Properties Parameterized Above the Poljak-Turzík Bound. CoRR abs/1310.2928 (2013) - [i31]Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Minimum Bisection is fixed parameter tractable. CoRR abs/1311.2563 (2013) - 2012
- [j36]Fedor V. Fomin
, Fabrizio Grandoni
, Daniel Lokshtanov, Saket Saurabh:
Sharp Separation and Applications to Exact and Parameterized Algorithms. Algorithmica 63(3): 692-706 (2012) - [j35]Venkatesh Raman, Saket Saurabh:
Guest Editorial: Special Issue on Parameterized and Exact Computation, Part I. Algorithmica 64(1): 1-2 (2012) - [j34]Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau
, Saket Saurabh:
On the approximability of some degree-constrained subgraph problems. Discret. Appl. Math. 160(12): 1661-1679 (2012) - [j33]Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
FPT algorithms for Connected Feedback Vertex Set. J. Comb. Optim. 24(2): 131-146 (2012) - [j32]Fedor V. Fomin
, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, B. V. Raghavendra Rao
:
Faster algorithms for finding and counting subgraphs. J. Comput. Syst. Sci. 78(3): 698-706 (2012) - [j31]Michael R. Fellows
, Fedor V. Fomin
, Daniel Lokshtanov, Frances A. Rosamond
, Saket Saurabh, Yngve Villanger:
Local search: Is brute-force avoidable? J. Comput. Syst. Sci. 78(3): 707-719 (2012) - [j30]Omid Amini, Ignasi Sau
, Saket Saurabh:
Parameterized complexity of finding small degree-constrained subgraphs. J. Discrete Algorithms 10: 70-83 (2012) - [j29]Omid Amini, Fedor V. Fomin
, Saket Saurabh:
Counting Subgraphs via Homomorphisms. SIAM J. Discret. Math. 26(2): 695-717 (2012) - [j28]Sushmita Gupta, Venkatesh Raman, Saket Saurabh:
Maximum r-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds. SIAM J. Discret. Math. 26(4): 1758-1780 (2012) - [j27]Daniel Binkele-Raible, Henning Fernau
, Fedor V. Fomin
, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger:
Kernel(s) for problems with no kernel: On out-trees with many leaves. ACM Trans. Algorithms 8(4): 38:1-38:19 (2012) - [j26]Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh:
On Parameterized Independent Feedback Vertex Set. Theor. Comput. Sci. 461: 65-75 (2012) - [c83]Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak
, Saket Saurabh, Stefan Szeider:
Don't Be Strict in Local Search! AAAI 2012: 486-492 - [c82]Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh:
Kernelization - Preprocessing with a Guarantee. The Multivariate Algorithmic Revolution and Beyond 2012: 129-161 - [c81]Marek Cygan
, Holger Dell
, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto
, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström
:
On Problems as Hard as CNF-SAT. CCC 2012: 74-84 - [c80]Fedor V. Fomin
, Saket Saurabh, Yngve Villanger:
A Polynomial Kernel for Proper Interval Vertex Deletion. ESA 2012: 467-478 - [c79]Fedor V. Fomin
, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh:
Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms. FOCS 2012: 470-479 - [c78]Matthias Mnich
, Geevarghese Philip, Saket Saurabh, Ondrej Suchý
:
Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound. FSTTCS 2012: 412-423 - [c77]Daniel Lokshtanov, Saket Saurabh, Magnus Wahlström
:
Subexponential Parameterized Odd Cycle Transversal on Planar Graphs. FSTTCS 2012: 424-434 - [c76]Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh:
Parameterized Complexity of MaxSat above Average. LATIN 2012: 184-194 - [c75]Archontia C. Giannopoulou
, Sudeshna Kolay, Saket Saurabh:
New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting. LATIN 2012: 408-419 - [c74]Robert Crowston, Gregory Z. Gutin, Mark Jones, Saket Saurabh, Anders Yeo
:
Parameterized Study of the Test Cover Problem. MFCS 2012: 283-295 - [c73]Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo:
Fixed-Parameter Tractability of Satisfying beyond the Number of Variables. SAT 2012: 355-368 - [c72]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Linear kernels for (connected) dominating set on H-minor-free graphs. SODA 2012: 82-93 - [c71]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh:
Bidimensionality and geometric graphs. SODA 2012: 1563-1575 - [c70]N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:
LP can be a cure for Parameterized Problems. STACS 2012: 338-349 - [c69]Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:
Parameterized Algorithms for Even Cycle Transversal. WG 2012: 172-183 - [i30]Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:
Faster Parameterized Algorithms using Linear Programming. CoRR abs/1203.0833 (2012) - [i29]Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh:
Planar F-Deletion: Approximation and Optimal FPT Algorithms. CoRR abs/1204.4230 (2012) - [i28]Fedor V. Fomin, Saket Saurabh, Yngve Villanger:
A Polynomial kernel for Proper Interval Vertex Deletion. CoRR abs/1204.4880 (2012) - [i27]Matthias Mnich, Geevarghese Philip, Saket Saurabh, Ondrej Suchý:
Beyond Max-Cut: λ-Extendible Properties Parameterized Above the Poljak-Turzík Bound. CoRR abs/1207.5696 (2012) - [i26]Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider:
Don't Be Strict in Local Search! CoRR abs/1208.1688 (2012) - [i25]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs. CoRR abs/1210.0257 (2012) - [i24]Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý:
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. CoRR abs/1210.0260 (2012) - [i23]Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo:
Fixed-parameter tractability of satisfying beyond the number of variables. CoRR abs/1212.0106 (2012) - [i22]Robert Crowston, Gregory Z. Gutin, Mark Jones, Saket Saurabh, Anders Yeo:
Parameterized Study of the Test Cover Problem. CoRR abs/1212.0117 (2012) - [i21]