Items where Author is "Raman, Venkatesh"

Misra, Neeldhara ; Panolan, Fahad ; Rai, Ashutosh ; Raman, Venkatesh ; Saurabh, Saket (2019) Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs Algorithmica, 81 (1). pp. 26-46. ISSN 0178-4617

Majumdar, Diptapriyo ; Raman, Venkatesh ; Saurabh, Saket (2018) Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators Theory of Computing Systems, 62 (8). pp. 1910-1951. ISSN 1432-4350

Lokshtanov, Daniel ; Narayanaswamy, N. S. ; Raman, Venkatesh ; Ramanujan, M. S. ; Saurabh, Saket (2014) Faster Parameterized Algorithms Using Linear Programming ACM Transactions on Algorithms, 11 (2). pp. 1-31. ISSN 1549-6325

Misra, Neeldhara ; Philip, Geevarghese ; Raman, Venkatesh ; Saurabh, Saket (2014) The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles Algorithmica, 68 (2). pp. 504-530. ISSN 0178-4617

Dorn, Frederic ; Fomin, Fedor V. ; Lokshtanov, Daniel ; Raman, Venkatesh ; Saurabh, Saket (2013) Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs Information and Computation, 233 . pp. 60-70. ISSN 0890-5401

Raman, Venkatesh ; Saurabh, Saket ; Suchý, Ondřej (2013) An FPT Algorithm for Tree Deletion Set Lecture Notes in Computer Science, 7748 . pp. 286-297. ISSN 0302-9743

Heggernes, Pinar ; Kratsch, Dieter ; Lokshtanov, Daniel ; Raman, Venkatesh ; Saurabh, Saket (2013) Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization Information and Computation, 231 . pp. 109-116. ISSN 0890-5401

Misra, Neeldhara ; Moser, Hannes ; Raman, Venkatesh ; Saurabh, Saket ; Sikdar, Somnath (2013) The Parameterized Complexity of Unique Coverage and Its Variants Algorithmica, 65 (3). pp. 517-544. ISSN 0178-4617

Fomin, Fedor V. ; Lokshtanov, Daniel ; Raman, Venkatesh ; Saurabh, Saket ; Rao, B.V. Raghavendra (2012) Faster algorithms for finding and counting subgraphs Journal of Computer and System Sciences, 78 (3). pp. 698-706. ISSN 0022-0000

Crowston, Robert ; Gutin, Gregory ; Jones, Mark ; Raman, Venkatesh ; Saurabh, Saket ; Yeo, Anders (2012) Fixed-Parameter Tractability of Satisfying beyond the Number of Variables Lecture Notes in Computer Science, 7317 . pp. 355-368. ISSN 0302-9743

Gupta, Sushmita ; Raman, Venkatesh ; Saurabh, Saket (2012) Maximum r-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds SIAM Journal on Discrete Mathematics, 26 (4). pp. 1758-1780. ISSN 0895-4801

Misra, Neeldhara ; Philip, Geevarghese ; Raman, Venkatesh ; Saurabh, Saket (2012) On Parameterized Independent Feedback Vertex Set Theoretical Computer Science, 461 . pp. 65-75. ISSN 0304-3975

Mishra, Sounaka ; Raman, Venkatesh ; Saurabh, Saket ; Sikdar, Somnath ; Subramanian, C. R. (2011) The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover Algorithmica, 61 (4). pp. 857-881. ISSN 0178-4617

Misra, Neeldhara ; Raman, Venkatesh ; Saurabh, Saket (2011) Lower bounds on kernelization Discrete Optimization, 8 (1). pp. 110-128. ISSN 1572-5286

Crowston, Robert ; Gutin, Gregory ; Jones, Mark ; Raman, Venkatesh ; Saurabh, Saket (2011) Parameterized Complexity of MaxSat Above Average Springer Fachmedien Wiesbaden GmbH.

Misra, Pranabendu ; Raman, Venkatesh ; Ramanujan, M. S. ; Saurabh, Saket (2011) A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments Lecture Notes in Computer Science, 7074 . pp. 333-343. ISSN 0302-9743

Fomin, Fedor V. ; Lokshtanov, Daniel ; Raman, Venkatesh ; Saurabh, Saket (2011) Subexponential algorithms for partial cover problems Information Processing Letters, 111 (16). pp. 814-818. ISSN 0020-0190

Misra, Neeldhara ; Philip, Geevarghese ; Raman, Venkatesh ; Saurabh, Saket ; Sikdar, Somnath (2010) FPT Algorithms for Connected Feedback Vertex Set Lecture Notes in Computer Science, 5942 . pp. 269-280. ISSN 0302-9743

Lokshtanov, Daniel ; Raman, Venkatesh ; Saurabh, Saket ; Sikdar, Somnath (2009) On the Directed Degree-Preserving Spanning Tree Problem Lecture Notes in Computer Science, 5917 . pp. 276-287. ISSN 0302-9743

Mahajan, Meena ; Raman, Venkatesh ; Sikdar, Somnath (2009) Parameterizing above or below guaranteed values Journal of Computer and System Sciences, 75 (2). pp. 137-153. ISSN 0022-0000

Raman, Venkatesh ; Saurabh, Saket (2008) Short Cycles Make W-hard Problems Hard: FPT Algorithms for W-hard Problems in Graphs with no Short Cycles Algorithmica, 52 (2). pp. 203-225. ISSN 0178-4617

Raman, Venkatesh ; Saurabh, Saket ; Sikdar, Somnath (2007) Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques Theory of Computing Systems, 41 (3). pp. 563-587. ISSN 1432-4350

Raman, Venkatesh ; Saurabh, Saket (2007) Improved fixed parameter tractable algorithms for two “edge” problems: MAXCUT and MAXDAG Information Processing Letters, 104 (2). pp. 65-72. ISSN 0020-0190

Gupta, Sushmita ; Raman, Venkatesh ; Saurabh, Saket (2006) Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems Lecture Notes in Computer Science, 4337 . pp. 139-151. ISSN 0302-9743

Raman, Venkatesh ; Saurabh, Saket ; Subramanian, C. R. (2006) Faster fixed parameter tractable algorithms for finding feedback vertex sets ACM Transactions on Algorithms, 2 (3). pp. 403-415. ISSN 1549-6325

Raman, Venkatesh ; Saurabh, Saket (2006) Parameterized algorithms for feedback set problems and their duals in tournaments Theoretical Computer Science, 351 (3). pp. 446-458. ISSN 0304-3975

Raman, Venkatesh ; Saurabh, Saket (2006) Triangles, 4-Cycles and Parameterized (In-)Tractability Lecture Notes in Computer Science, 4059 . pp. 304-315. ISSN 0302-9743

Raman, Venkatesh ; Saurabh, Saket ; Subramanian, C.R. (2005) Faster algorithms for feedback vertex set Electronic Notes in Discrete Mathematics, 19 . pp. 273-279. ISSN 1571-0653

Raman, Venkatesh ; Saurabh, Saket ; Sikdar, Somnath (2005) Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems Lecture Notes in Computer Science, 3701 . pp. 375-389. ISSN 0302-9743

Raman, Venkatesh ; Saurabh, Saket (2004) Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments Lecture Notes in Computer Science, 3162 . pp. 260-270. ISSN 0302-9743

Balasubramanian, R. ; Raman, Venkatesh ; Yegnanarayanan, V. (2003) On the pseudoachromatic number of join of graphs International Journal of Computer Mathematics, 80 (9). pp. 1131-1137. ISSN 0020-7160

Raman, Venkatesh ; Saurabh, Saket (2003) Parameterized Complexity of Directed Feedback Set Problems in Tournaments Lecture Notes in Computer Science, 2748 . pp. 484-492. ISSN 0302-9743

Raman, Venkatesh ; Saurabh, Saket ; Subramanian, C. R. (2002) Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set Lecture Notes in Computer Science, 2518 . pp. 241-248. ISSN 0302-9743

Radhakrishnan, Jaikumar ; Raman, Venkatesh (2001) A tradeoff between search and update in dictionaries Information Processing Letters, 80 (5). pp. 243-247. ISSN 0020-0190

Radhakrishnan, Jaikumar ; Raman, Venkatesh ; Srinivasa Rao, S. (2001) Explicit deterministic constructions for membership in the bitprobe model Lecture Notes in Computer Science, 2161 . pp. 290-299. ISSN 0302-9743

Mahajan, Meena ; Raman, Venkatesh (1999) Parameterizing above Guaranteed Values: MaxSat and MaxCut Journal of Algorithms, 31 (2). pp. 335-354. ISSN 0196-6774

Balasubramanian, R. ; Fellows, Michael R. ; Raman, Venkatesh (1998) An improved fixed-parameter algorithm for vertex cover Information Processing Letters, 65 (3). pp. 163-168. ISSN 0020-0190

Balasubramanian, R. ; Raman, Venkatesh ; Srinivasaragavan, G. (1997) Finding scores in tournaments Journal of Algorithms, 24 (2). pp. 380-394. ISSN 0196-6774