( en | de | ru )

 

Disambiguation of "Narayanaswamy, N. S."

Author of the publication

copydeleteadd this publication to your clipboard
Block Sorting Is APX-Hard.

, and . CIAC, volume 9079 of Lecture Notes in Computer Science, page 377-389. Springer, (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

Planning for the Convoy Movement Problem., , , and . ICAART (1), page 495-498. SciTePress, (2012)Online Algorithms for Self-Organizing Sequential Search - A Survey, and . CoRR, (2009)Fully Dynamic Data Structures for Interval Coloring., , and . CoRR, (2019)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)TRANS: Schema-Aware Mapping of OWL Ontologies into Relational Databases., and . COMAD, Computer Society of India, (2009)Approximation and Exact Algorithms for Special Cases of Connected f-Factors., and . CSR, volume 9139 of Lecture Notes in Computer Science, page 350-363. Springer, (2015)Graph Editing to Bipartite Interval Graphs: Exact and Asymtotic Bounds., , , and . FSTTCS, volume 1346 of Lecture Notes in Computer Science, page 37-53. Springer, (1997)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)The Connected Domination Number of Grids., and . CoRR, (2020)