pith. sign in

Venkatesh Raman

Identifiers

  • name variant Venkatesh Raman 0.60 · backfill

Papers (22)

  1. Frameworks for Designing In-place Graph Algorithms cs.DS · 2017 · author #3
  2. Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels cs.DS · 2017 · author #3
  3. Biconnectivity, $st$-numbering and other applications of DFS using $O(n)$ bits cs.DS · 2016 · author #2
  4. Improved Space efficient linear time algorithms for BFS, DFS and applications cs.DS · 2016 · author #3
  5. Parameterized Algorithms on Perfect Graphs for deletion to $(r,\ell)$-graphs cs.DS · 2015 · author #3
  6. SAT-based Analysis of Large Real-world Feature Models is Easy cs.SE · 2015 · author #3
  7. Reconfiguration over tree decompositions cs.CC · 2014 · author #3
  8. Shortest reconfiguration paths in the solution space of Boolean formulas cs.CC · 2014 · author #4
  9. Evolution and Controllability of Cancer Networks: a Boolean Perspective q-bio.MN · 2013 · author #2
  10. On the Parameterized Complexity of Reconfiguration Problems cs.CC · 2013 · author #3
  11. Succinct data structures for representing equivalence classes cs.DS · 2013 · author #3
  12. Upper and Lower Bounds for Weak Backdoor Set Detection cs.DS · 2013 · author #3
  13. Faster Parameterized Algorithms using Linear Programming cs.DS · 2012 · author #3
  14. Parameterized Complexity of MaxSat Above Average cs.CC · 2011 · author #4
  15. Succinct Representations of Permutations and Functions cs.DS · 2011 · author #3
  16. A Quartic Kernel for Pathwidth-One Vertex Deletion cs.DS · 2010 · author #2
  17. Bidimensionality and EPTAS cs.DS · 2010 · author #3
  18. Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs cs.DS · 2010 · author #4
  19. Faster Algorithms for Finding and Counting Subgraphs cs.DS · 2009 · author #3
  20. FPT Algorithms for Connected Feedback Vertex Set cs.DS · 2009 · author #3
  21. Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels cs.DS · 2009 · author #2
  22. Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets cs.DS · 2007 · author #2

Mentions

  • 1108.4501 #4 · backfill · confidence 0.70 Venkatesh Raman
  • 1108.1983 #3 · backfill · confidence 0.70 Venkatesh Raman
  • 1009.0806 #2 · backfill · confidence 0.70 Venkatesh Raman
  • 1005.5449 #3 · backfill · confidence 0.70 Venkatesh Raman
  • 1001.0821 #4 · backfill · confidence 0.70 Venkatesh Raman
  • 0912.2371 #3 · backfill · confidence 0.70 Venkatesh Raman
  • 0909.3180 #3 · backfill · confidence 0.70 Venkatesh Raman
  • 0903.4521 #2 · backfill · confidence 0.70 Venkatesh Raman
  • 0705.0552 #2 · backfill · confidence 0.70 Venkatesh Raman

Frequent Coauthors