Satisfiability

Solving min ones 2-sat as fast as vertex cover
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar
Theoretical Computer Science 506: 115-121 (2013).

Improved Fixed-Parameter Algorithm for the Minimum Weight 3-SAT problem
Venkatesh Raman and Bal Sri Shankar
Proceedings of WALCOM 2013: 265-273.

Upper and Lower Bounds for Weak Backdoor Set Detection
Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider
Proceedings of SAT 2013.

Fixed-parameter tractability of satisfying beyond the number of variables
R. Crowston, G. Gutin, M. Jones, V. Raman, S. Saurabh and A. Yeo 
proceedings of SAT 2012.

Parameterized Complexity of MaxSat Above Average 
R. Crowston, G. Gutin, M. Jones, V. Raman and S. Saurabh
CORR abs/1108.4501:(2011) in proceedings of LATIN 2012.

Upper Bounds for MaxSat: Further Improved [ps]
N. Bansal and V. Raman.
Proceedings of ISAAC 99 (Springer LNCS 1741) 247-258.

Parameterizing Above the Guarantee: MAXSAT and MAXCUT [ps]
M. Mahajan and V. Raman.
Journal of Algorithms 31 (1999) 335-354.
 
A Simplified NP-Complete MAXSAT Problem [pdf]
V. Raman, B. Ravikumar and S. Srinivasa Rao.
Information Processing Letters 65 (1998) 1-6.