( en | de | ru )

 

Disambiguation of "Narayanaswamy, N. S."

Author of the publication

copydeleteadd this publication to your clipboard
Connected (s, t)-Vertex Separator Parameterized by Chordality.

, and . J. Graph Algorithms Appl., 19 (1): 549-565 (2015)

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. You can also use the button next to the name to display some publications already assigned to the person.

S N Chillrud

n-s Yi

Hy n-s Yi

Hy n-s Pak

n n n

 

Other publications of authors with the same name

Protein similarity search under mRNA structural constraints: application to selenocysteine incorporation., , and . In Silico Biology, 2 (3): 275-290 (2002)Dynamic data structures for interval coloring., , and . Theor. Comput. Sci., (2020)Approximate Distance Oracle in O(n 2) Time and O(n) Space for Chordal Graphs., , and . WALCOM, volume 8973 of Lecture Notes in Computer Science, page 89-100. Springer, (2015)Solving minones-2-sat as Fast as vertex cover., , , and . MFCS, volume 6281 of Lecture Notes in Computer Science, page 549-555. Springer, (2010)Perfect Resolution of Conflict-Free Colouring of Interval Hypergraphs., and . STACS, volume 154 of LIPIcs, page 52:1-52:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)TRANS: Schema-Aware Mapping of OWL Ontologies into Relational Databases., and . COMAD, Computer Society of India, (2009)On the Complexity of Connected (s, t)-Vertex Separator, and . CoRR, (2011)Fully Dynamic Data Structures for Interval Coloring., , and . CoRR, (2019)Solving min ones 2-sat as fast as vertex cover., , , and . Theor. Comput. Sci., (2013)Planning for the Convoy Movement Problem., , , and . ICAART (1), page 495-498. SciTePress, (2012)