Travelled to:1 × Finland
1 × Italy
1 × Japan
1 × The Netherlands
1 × USA
Collaborated with:A.E.Mouawad N.Nishimura V.Pathak J.H.(.Liang V.Ganesh K.Czarnecki N.Misra S.Ordyniak S.Szeider J.I.Munro R.Raman S.S.Rao R.Crowston G.Gutin M.Jones S.Saurabh A.Yeo
Talks about:reconfigur (1) represent (1) tractabl (1) succinct (1) shortest (1) backdoor (1) variabl (1) satisfi (1) paramet (1) formula (1)
Person: Venkatesh Raman
DBLP: Raman:Venkatesh
Contributed to:
2015
2015
201320122003Wrote 5 papers:
- ICALP-v1-2015-MouawadNPR #configuration management
- Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas (AEM, NN, VP, VR), pp. 985–996.
- SPLC-2015-LiangGCR #analysis #feature model #modelling #satisfiability #scalability
- SAT-based analysis of large real-world feature models is easy (JH(L, VG, KC, VR), pp. 91–100.
- SAT-2013-MisraORS #bound #detection #set
- Upper and Lower Bounds for Weak Backdoor Set Detection (NM, SO, VR, SS), pp. 394–402.
- SAT-2012-CrowstonGJRSY #parametricity
- Fixed-Parameter Tractability of Satisfying beyond the Number of Variables (RC, GG, MJ, VR, SS, AY), pp. 355–368.
- ICALP-2003-MunroRRR #permutation
- Succinct Representations of Permutations (JIM, RR, VR, SSR), pp. 345–356.