From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Fixed-Parameter Tractability of Satisfying beyond the Number of Variables.

R. Crowston, G. Gutin, M. Jones, V. Raman, S. Saurabh, и A. Yeo. SAT, том 7317 из Lecture Notes in Computer Science, стр. 355-368. Springer, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Venkatesh Kolluru

Venkatesh Ramakrishnan

Sreenath Ramanath

Aravamudhan Raman

Natraj Raman

Другие публикации лиц с тем же именем

Ontology Re-Engineering: A Case Study from the Automotive IndustryN. Rychtyckyj, V. Raman, B. Sankaranarayanan, P. Kuma, и D. Khemani. AI Magazine, 39 (1): 49--60 (2017)Faster Algorithms for Finding and Counting SubgraphsF. Fomin, D. Lokshtanov, V. Raman, B. Rao, и S. Saurabh. CoRR, (2009)FPT Algorithms for Connected Feedback Vertex SetN. Misra, G. Philip, V. Raman, S. Saurabh, и S. Sikdar. CoRR, (2009)Triangles, 4-Cycles and Parameterized (In-)Tractability.V. Raman, и S. Saurabh. SWAT, том 4059 из Lecture Notes in Computer Science, стр. 304-315. Springer, (2006)Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas.A. Mouawad, N. Nishimura, V. Pathak, и V. Raman. ICALP (1), том 9134 из Lecture Notes in Computer Science, стр. 985-996. Springer, (2015)On Parameterized Independent Feedback Vertex Set.N. Misra, G. Philip, V. Raman, и S. Saurabh. COCOON, том 6842 из Lecture Notes in Computer Science, стр. 98-109. Springer, (2011)Sorting and Selection with Equality Comparisons.V. Jayapaul, J. Munro, V. Raman, и S. Satti. WADS, том 9214 из Lecture Notes in Computer Science, стр. 434-445. Springer, (2015)Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime.A. Biswas, V. Jayapaul, и V. Raman. CALDAM, том 10156 из Lecture Notes in Computer Science, стр. 50-59. Springer, (2017)Subexponential Algorithms for Partial Cover Problems.F. Fomin, D. Lokshtanov, V. Raman, и S. Saurabh. FSTTCS, том 4 из LIPIcs, стр. 193-201. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2009)Parameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs.S. Kolay, F. Panolan, V. Raman, и S. Saurabh. MFCS, том 58 из LIPIcs, стр. 75:1-75:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

BibSonomy

Disambiguation