The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Saket Saurabh 0001" ( http://dblp.L3S.de/Authors/Saket_Saurabh_0001 )

URL (Homepage):  http://www.imsc.res.in/~saket/  Author page on DBLP  Author page in RDF  Community of Saket Saurabh 0001 in ASPL-2

Publication years (Num. hits)
2002-2007 (19) 2008 (15) 2009 (28) 2010 (22) 2011 (30) 2012 (36) 2013 (30) 2014 (28) 2015 (33) 2016 (39) 2017 (50) 2018 (61) 2019 (54)
Publication types (Num. hits)
article(228) book(1) incollection(2) inproceedings(212) proceedings(2)
Venues (Conferences, Journals, ...)
CoRR(93) Algorithmica(25) SODA(23) SIAM J. Discrete Math.(20) ACM Trans. Algorithms(19) FSTTCS(17) Theor. Comput. Sci.(16) COCOON(14) IPEC(14) J. Comput. Syst. Sci.(12) STACS(12) ICALP(11) ISAAC(11) ICALP (1)(10) LATIN(10) ESA(9) More (+10 of total 69)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 22 occurrences of 18 keywords

Results
Found 446 publication records. Showing 445 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Sushmita Gupta, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi Stability in barter exchange markets. Search on Bibsonomy Autonomous Agents and Multi-Agent Systems The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Dániel Marx, Saket Saurabh 0001, Meirav Zehavi New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041). Search on Bibsonomy Dagstuhl Reports The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh 0001, Stéphan Thomassé, Meirav Zehavi Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh 0001, Meirav Zehavi Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001 Spanning Circuits in Regular Matroids. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Saket Saurabh 0001 Editing to Connected F-Degree Graph. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh 0001, Meirav Zehavi Packing Cycles Faster Than Erdos-Posa. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001 Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Syed Mohammad Meesum, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi Rank Vertex Cover as a Natural Problem for Algebraic Compression. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi Parameterized Algorithms for List K-Cycle. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sushmita Gupta, Sanjukta Roy, Saket Saurabh 0001, Meirav Zehavi Parameterized Algorithms and Kernels for Rainbow Matching. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Neeldhara Misra, Fahad Panolan, Ashutosh Rai 0001, Venkatesh Raman 0001, Saket Saurabh 0001 Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1R. Krithika 0001, Abhishek Sahu, Saket Saurabh 0001, Meirav Zehavi The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Geevarghese Philip, Varun Rajan, Saket Saurabh 0001, Prafullkumar Tale Subset Feedback Vertex Set in Chordal and Split Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jørgen Bang-Jensen, Kristine Vitting Klinkby, Saket Saurabh 0001, Meirav Zehavi The parameterized complexity landscape of finding 2-partitions of digraphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh 0001 Exact Algorithms via Monotone Local Search. Search on Bibsonomy J. ACM The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Akanksha Agarwal, Saket Saurabh 0001, Prafullkumar Tale On the Parameterized Complexity of Contraction to Generalization of Trees. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh 0001 Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Akanksha Agrawal, Pradeesha Ashok, Meghana M. Reddy, Saket Saurabh 0001, Dolly Yadav FPT Algorithms for Conflict-free Coloring of Graphs and Chromatic Terrain Guarding. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi Going Far From Degeneracy. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi Reducing Topological Minor Containment to the Unique Linkage Theorem. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh 0001, Meirav Zehavi A Brief Note on Single Source Fault Tolerant Reachability. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Daniel Lokshtanov, Dániel Marx, Saket Saurabh 0001 Slightly Superexponential Parameterized Problems. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Geevarghese Philip, Varun Rajan, Saket Saurabh 0001, Prafullkumar Tale Subset Feedback Vertex Set in Chordal and Split Graphs. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Diptapriyo Majumdar, M. S. Ramanujan, Saket Saurabh 0001 On the Approximate Compressibility of Connected Vertex Cover. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi Decomposition of Map Graphs with Applications. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Sudeshna Kolay, Fahad Panolan, Saket Saurabh 0001 Communication Complexity and Graph Families. Search on Bibsonomy TOCT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Akanksha Agrawal, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi Split Contraction: The Untold Story. Search on Bibsonomy TOCT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. Search on Bibsonomy Discrete & Computational Geometry The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh 0001 Minimum Bisection Is Fixed-Parameter Tractable. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Akanksha Agrawal, Pranabendu Misra, Saket Saurabh 0001, Meirav Zehavi Interval Vertex Deletion Admits a Polynomial Kernel. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sushmita Gupta, Pranabendu Misra, Saket Saurabh 0001, Meirav Zehavi Popular Matching in Roommates Setting is NP-hard. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi Parameterized Computational Geometry via Decomposition Theorems. Search on Bibsonomy WALCOM The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi Going Far From Degeneracy. Search on Bibsonomy ESA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Andreas Björklund, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi Approximate Counting of k-Paths: Deterministic and in Polynomial Space. Search on Bibsonomy ICALP The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi Decomposition of Map Graphs with Applications. Search on Bibsonomy ICALP The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. Search on Bibsonomy ICALP The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Prafullkumar Tale Path Contraction Faster Than 2n. Search on Bibsonomy ICALP The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Akanksha Agrawal, Grzegorz Guspiel, Jayakrishnan Madathil, Saket Saurabh 0001, Meirav Zehavi Connecting the Dots (with Minimum Crossings). Search on Bibsonomy Symposium on Computational Geometry The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Akanksha Agrawal, Pallavi Jain 0001, Lawqueen Kanesh, Saket Saurabh 0001 Parameterized Complexity of Conflict-Free Matchings and Paths. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Stéphane Bessy, Marin Bougeret, R. Krithika 0001, Abhishek Sahu, Saket Saurabh 0001, Jocelyn Thiebaut, Meirav Zehavi Packing Arc-Disjoint Cycles in Tournaments. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu, Saket Saurabh 0001 On the Complexity of Mixed Dominating Set. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Neeldhara Misra, Fahad Panolan, Saket Saurabh 0001 On the Parameterized Complexity of Edge-Linked Paths. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Geevarghese Philip, Varun Rajan, Saket Saurabh 0001, Prafullkumar Tale Subset Feedback Vertex Set in Chordal and Split Graphs. Search on Bibsonomy CIAC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS. Search on Bibsonomy WADS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sushmita Gupta, Sanjukta Roy, Saket Saurabh 0001, Meirav Zehavi Balanced Stable Marriage: How Close Is Close Enough? Search on Bibsonomy WADS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Arindam Biswas, Venkatesh Raman 0001, Saket Saurabh 0001 Solving Group Interval Scheduling Efficiently. Search on Bibsonomy IWOCA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Niranka Banerjee, Venkatesh Raman 0001, Saket Saurabh 0001 Fully Dynamic Arboricity Maintenance. Search on Bibsonomy COCOON The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jayakrishnan Madathil, Pranabendu Misra, Saket Saurabh 0001 An Erdős-Pósa Theorem on Neighborhoods and Domination Number. Search on Bibsonomy COCOON The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sushmita Gupta, Saket Saurabh 0001, Ramanujan Sridharan, Meirav Zehavi On Succinct Encodings for the Tournament Fixing Problem. Search on Bibsonomy IJCAI The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sushmita Gupta, Pallavi Jain 0001, Sanjukta Roy, Saket Saurabh 0001, Meirav Zehavi Gehrlein Stability in Committee Selection: Parameterized Hardness and Algorithms. Search on Bibsonomy AAMAS The full citation details ... 2019 DBLP  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi Long directed (s, t)-path: FPT algorithm. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh 0001 Deterministic Truncation of Linear Matroids. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Arnab Bhattacharyya 0001, Fabrizio Grandoni 0001, Aleksandar Nikolov, Barna Saha, Saket Saurabh 0001, Aravindan Vijayaraghavan, Qin Zhang 0001 Editorial: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2016 Special Issue. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Dániel Marx, Saket Saurabh 0001 Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Michal Pilipczuk, Marcin Wrochna Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh 0001 Linear Time Parameterized Algorithms for Subset Feedback Vertex Set. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Dimitrios M. Thilikos Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Pradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh 0001, Meirav Zehavi Exact Algorithms for Terrain Guarding. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Geevarghese Philip, Ashutosh Rai 0001, Saket Saurabh 0001 Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Pradeesha Ashok, Aditi Dudeja, Sudeshna Kolay, Saket Saurabh 0001 Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001 Covering Vectors by Spaces: Regular Matroids. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh 0001 Below All Subsets for Minimal Connected Dominating Set. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Akanksha Agrawal, Daniel Lokshtanov, Diptapriyo Majumdar, Amer E. Mouawad, Saket Saurabh 0001 Kernelization of Cycle Packing with Relaxed Disjointness Constraints. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh 0001, Meirav Zehavi Matrix Rigidity from the Viewpoint of Parameterized Complexity. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Saket Saurabh 0001, Meirav Zehavi $$(k, n-k)$$ ( k , n - k ) -Max-Cut: An $$\mathcal{O}^*(2^p)$$ O ∗ ( 2 p ) -Time Algorithm and a Polynomial Kernel. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Syed Mohammad Meesum, Saket Saurabh 0001 Rank Reduction of Oriented Graphs by Vertex and Edge Deletions. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Saket Saurabh 0001 Preface to Special Issue Dedicated to the 60th Birthday of Gregory Gutin. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Deeksha Adil, Sushmita Gupta, Sanjukta Roy, Saket Saurabh 0001, Meirav Zehavi Parameterized algorithms for stable matching with ties and incomplete lists. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Manu Basavaraju, Fahad Panolan, Ashutosh Rai 0001, M. S. Ramanujan, Saket Saurabh 0001 On the kernelization complexity of string problems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ashutosh Rai 0001, Saket Saurabh 0001 Bivariate complexity analysis of Almost Forest Deletion. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Akanksha Agrawal, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi Kernels for deletion to classes of acyclic digraphs. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh 0001 Finding even subgraphs even faster. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh 0001 Reconfiguration on sparse graphs. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001 Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Diptapriyo Majumdar, Venkatesh Raman 0001, Saket Saurabh 0001 Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Akanksha Agrawal, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi Parameterised Algorithms for Deletion to Classes of DAGs. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Geevarghese Philip, Fahad Panolan, Saket Saurabh 0001 A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1R. Krithika 0001, Abhishek Sahu, Saket Saurabh 0001, Meirav Zehavi The Parameterized Complexity of Packing Arc-Disjoint Cycles in Tournaments. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh 0001, Meirav Zehavi Reducing CMSO Model Checking to Highly Connected Graphs. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001 Approximation Schemes for Low-Rank Binary Matrix Approximation Problems. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Marek Cygan, Pawel Komosa, Daniel Lokshtanov, Michal Pilipczuk, Marcin Pilipczuk, Saket Saurabh 0001 Randomized contractions meet lean decompositions. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh 0001 Parameterized Query Complexity of Hitting Set using Stability of Sunflowers. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Sushmita Gupta, Pranabendu Misra, Saket Saurabh 0001, Meirav Zehavi Popular Matching in Roommates Setting is NP-hard. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh 0001 Simultaneous Feedback Vertex Set: A Parameterized Perspective. Search on Bibsonomy TOCT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Dániel Marx, Saket Saurabh 0001 Slightly Superexponential Parameterized Problems. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh 0001 Parameterized Query Complexity of Hitting Set Using Stability of Sunflowers. Search on Bibsonomy ISAAC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh 0001 When Recursion is Better than Iteration: A Linear-Time Algorithm for Acyclicity with Few Error Vertices. Search on Bibsonomy SODA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jørgen Bang-Jensen, Manu Basavaraju, Kristine Vitting Klinkby, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh 0001, Meirav Zehavi Parameterized Algorithms for Survivable Network Design with Uniform Demands. Search on Bibsonomy SODA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth. Search on Bibsonomy SODA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. Search on Bibsonomy SODA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh 0001, Stéphan Thomassé, Meirav Zehavi Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. Search on Bibsonomy SODA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity. Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh 0001 On the Optimality of Pseudo-polynomial Algorithms for Integer Programming. Search on Bibsonomy ESA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh 0001, Meirav Zehavi Reducing CMSO Model Checking to Highly Connected Graphs. Search on Bibsonomy ICALP The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS. Search on Bibsonomy ICALP The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Timothy Carpenter, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Anastasios Sidiropoulos Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces. Search on Bibsonomy Symposium on Computational Geometry The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 445 (100 per page; Change: )
Pages: [1][2][3][4][5][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license