The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Saket Saurabh: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sushmita Gupta, Venkatesh Raman, Saket Saurabh
    Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2006, pp:139-151 [Conf]
  2. Venkatesh Raman, Saket Saurabh, Somnath Sikdar
    Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:375-389 [Conf]
  3. Fedor V. Fomin, Serge Gaspers, Saket Saurabh
    Branching and Treewidth Based Exact Algorithms. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:16-25 [Conf]
  4. Venkatesh Raman, Saket Saurabh, C. R. Subramanian
    Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:241-248 [Conf]
  5. Venkatesh Raman, Saket Saurabh
    Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:260-270 [Conf]
  6. Venkatesh Raman, Saket Saurabh
    Triangles, 4-Cycles and Parameterized (In-)Tractability. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:304-315 [Conf]
  7. Venkatesh Raman, Saket Saurabh
    Parameterized Complexity of Directed Feedback Set Problems in Tournaments. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:484-492 [Conf]
  8. Venkatesh Raman, Saket Saurabh, C. R. Subramanian
    Faster fixed parameter tractable algorithms for finding feedback vertex sets. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:3, pp:403-415 [Journal]
  9. Venkatesh Raman, Saket Saurabh
    Parameterized algorithms for feedback set problems and their duals in tournaments. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:351, n:3, pp:446-458 [Journal]
  10. Fedor V. Fomin, Serge Gaspers, Saket Saurabh
    Improved Exact Algorithms for Counting 3- and 4-Colorings. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:65-74 [Conf]
  11. Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh
    Parameterized Algorithms for Directed Maximum Leaf Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:352-362 [Conf]
  12. Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen
    On the Complexity of Some Colorful Problems Parameterized by Treewidth. [Citation Graph (0, 0)][DBLP]
    COCOA, 2007, pp:366-377 [Conf]
  13. Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh
    Parameterized Algorithms for Directed Maximum Leaf Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  14. Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh
    Better Algorithms and Bounds for Directed Maximum Leaf Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  15. Venkatesh Raman, Saket Saurabh
    Improved fixed parameter tractable algorithms for two "edge" problems: MAXCUT and MAXDAG. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:104, n:2, pp:65-72 [Journal]

  16. Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments. [Citation Graph (, )][DBLP]


  17. Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem. [Citation Graph (, )][DBLP]


  18. The Curse of Connectivity: t-Total Vertex (Edge) Cover. [Citation Graph (, )][DBLP]


  19. Imbalance Is Fixed Parameter Tractable. [Citation Graph (, )][DBLP]


  20. The Budgeted Unique Coverage Problem and Color-Coding. [Citation Graph (, )][DBLP]


  21. (Meta) Kernelization. [Citation Graph (, )][DBLP]


  22. Better Algorithms and Bounds for Directed Maximum Leaf Problems. [Citation Graph (, )][DBLP]


  23. Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract). [Citation Graph (, )][DBLP]


  24. Subexponential Algorithms for Partial Cover Problems. [Citation Graph (, )][DBLP]


  25. Kernels for Feedback Arc Set In Tournaments. [Citation Graph (, )][DBLP]


  26. Incompressibility through Colors and IDs. [Citation Graph (, )][DBLP]


  27. Distortion Is Fixed Parameter Tractable. [Citation Graph (, )][DBLP]


  28. Fast FAST. [Citation Graph (, )][DBLP]


  29. Counting Subgraphs via Homomorphisms. [Citation Graph (, )][DBLP]


  30. Local Search: Is Brute-Force Avoidable? [Citation Graph (, )][DBLP]


  31. A Linear Vertex Kernel for Maximum Internal Spanning Tree. [Citation Graph (, )][DBLP]


  32. Bandwidth on AT-Free Graphs. [Citation Graph (, )][DBLP]


  33. The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number. [Citation Graph (, )][DBLP]


  34. Graph Layout Problems Parameterized by Vertex Cover. [Citation Graph (, )][DBLP]


  35. König Deletion Sets and Vertex Covers above the Matching Size. [Citation Graph (, )][DBLP]


  36. Even Faster Algorithm for Set Splitting! [Citation Graph (, )][DBLP]


  37. Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem. [Citation Graph (, )][DBLP]


  38. Capacitated Domination and Covering: A Parameterized Perspective. [Citation Graph (, )][DBLP]


  39. On the Directed Degree-Preserving Spanning Tree Problem. [Citation Graph (, )][DBLP]


  40. Sharp Separation and Applications to Exact and Parameterized Algorithms. [Citation Graph (, )][DBLP]


  41. Iterative Compression and Exact Algorithms. [Citation Graph (, )][DBLP]


  42. Clique-width: on the price of generality. [Citation Graph (, )][DBLP]


  43. Bidimensionality and Kernels. [Citation Graph (, )][DBLP]


  44. Algorithmic Lower Bounds for Problems Parameterized with Clique-Width. [Citation Graph (, )][DBLP]


  45. Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. [Citation Graph (, )][DBLP]


  46. Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. [Citation Graph (, )][DBLP]


  47. Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. [Citation Graph (, )][DBLP]


  48. A Moderately Exponential Time Algorithm for Full Degree Spanning Tree. [Citation Graph (, )][DBLP]


  49. Linear Kernel for Planar Connected Dominating Set. [Citation Graph (, )][DBLP]


  50. Degree-Constrained Subgraph Problems: Hardness and Approximation Results. [Citation Graph (, )][DBLP]


  51. An Exact Algorithm for Minimum Distortion Embedding. [Citation Graph (, )][DBLP]


  52. FPT Algorithms for Connected Feedback Vertex Set. [Citation Graph (, )][DBLP]


  53. Parameterized Algorithms for Generalized Domination. [Citation Graph (, )][DBLP]


  54. Improving the gap of Erdös-Pósa property for minor-closed graph classes. [Citation Graph (, )][DBLP]


  55. Simpler Parameterized Algorithm for OCT. [Citation Graph (, )][DBLP]


  56. On Two Techniques of Combining Branching and Treewidth. [Citation Graph (, )][DBLP]


  57. Short Cycles Make W -hard Problems Hard: FPT Algorithms for W -hard Problems in Graphs with no Short Cycles. [Citation Graph (, )][DBLP]


  58. Parameterized Algorithms for Partial Cover Problems [Citation Graph (, )][DBLP]


  59. Spanning directed trees with many leaves [Citation Graph (, )][DBLP]


  60. Parameterized Low-distortion Embeddings - Graph metrics into lines and trees [Citation Graph (, )][DBLP]


  61. Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves [Citation Graph (, )][DBLP]


  62. Algorithm for Finding $k$-Vertex Out-trees and its Application to $k$-Internal Out-branching Problem [Citation Graph (, )][DBLP]


  63. (Meta) Kernelization [Citation Graph (, )][DBLP]


  64. Kernels for Feedback Arc Set In Tournaments [Citation Graph (, )][DBLP]


  65. A Linear Vertex Kernel for Maximum Internal Spanning Tree [Citation Graph (, )][DBLP]


  66. FPT Algorithms for Connected Feedback Vertex Set [Citation Graph (, )][DBLP]


  67. Faster Algorithms for Finding and Counting Subgraphs [Citation Graph (, )][DBLP]


  68. Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs [Citation Graph (, )][DBLP]


  69. Bidimensionality and EPTAS [Citation Graph (, )][DBLP]


  70. Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal [Citation Graph (, )][DBLP]


Search in 1.755secs, Finished in 1.760secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002