N S Narayanaswamy

Ontology type: schema:Person     

Person Info





Publications in SciGraph latest 50 shown

  • 2018-08 Approximability of Clique Transversal in Perfect Graphs in ALGORITHMICA
  • 2018-04-25 Facility Location on Planar Graphs with Unreliable Links in COMPUTER SCIENCE – THEORY AND APPLICATIONS
  • 2018-03-21 Exact Algorithms for Allocation Problems in FRONTIERS IN ALGORITHMICS
  • 2018-02 Approximation Algorithms for Connected Graph Factors of Minimum Weight in THEORY OF COMPUTING SYSTEMS
  • 2018 Minimum Membership Hitting Sets of Axis Parallel Segments in COMPUTING AND COMBINATORICS
  • 2017 A Refined Analysis of Online Path Coloring in Trees in APPROXIMATION AND ONLINE ALGORITHMS
  • 2015-03 Obtaining Matrices with the Consecutive Ones Property by Row Deletions in ALGORITHMICA
  • 2015 Approximate Distance Oracle in O(n 2) Time and O(n) Space for Chordal Graphs in WALCOM: ALGORITHMS AND COMPUTATION
  • 2015 Approximation and Exact Algorithms for Special Cases of Connected f-Factors in COMPUTER SCIENCE -- THEORY AND APPLICATIONS
  • 2015 Tree Path Labeling of Hypergraphs – A Generalization of the Consecutive Ones Property in ALGORITHMS AND DISCRETE APPLIED MATHEMATICS
  • 2015 Block Sorting Is APX-Hard in ALGORITHMS AND COMPLEXITY
  • 2014 LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs in ALGORITHMS - ESA 2014
  • 2014 Approximability of Connected Factors in APPROXIMATION AND ONLINE ALGORITHMS
  • 2014 On Minimum Average Stretch Spanning Trees in Polygonal 2-Trees in ALGORITHMS AND COMPUTATION
  • 2014 Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments in ALGORITHM THEORY – SWAT 2014
  • 2013 FPT Algorithms for Consecutive Ones Submatrix Problems in PARAMETERIZED AND EXACT COMPUTATION
  • 2012 Generalized Above Guarantee Vertex Cover and r-Partization in WALCOM: ALGORITHMS AND COMPUTATION
  • 2011 A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs in WALCOM: ALGORITHMS AND COMPUTATION
  • 2010 Solving minones-2-sat as Fast as vertex cover in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2010
  • 2009-11 On the Structure of Contractible Edges in k-connected Partial k-trees in GRAPHS AND COMBINATORICS
  • 2009-09 Analysis of algorithms for an online version of the convoy movement problem in JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
  • 2008-02 A Note on First-Fit Coloring of Interval Graphs in ORDER
  • 2006 Sequences Characterizing k-Trees in COMPUTING AND COMBINATORICS
  • 2005 Algorithms for Satisfiability Using Independent Sets of Variables in THEORY AND APPLICATIONS OF SATISFIABILITY TESTING
  • 2004 On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts in COMPUTING AND COMBINATORICS
  • 2004 Dynamic Storage Allocation and On-Line Colouring Interval Graphs in COMPUTING AND COMBINATORICS
  • JSON-LD is the canonical representation for SciGraph data.

    TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

        "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
        "familyName": "Narayanaswamy", 
        "givenName": "N S", 
        "id": "sg:person.010006120612.67", 
        "sameAs": [
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T14:15", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        "sdSource": "s3://com-uberresearch-data-dimensions-researchers-20181010/20181011/dim_researchers/base/researchers_2016.json", 
        "type": "Person"

    Download the RDF metadata as:  json-ld nt turtle xml License info


    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/person.010006120612.67'

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/person.010006120612.67'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/person.010006120612.67'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/person.010006120612.67'


    This table displays all metadata directly associated to this object as RDF triples.

    11 TRIPLES      9 PREDICATES      10 URIs      6 LITERALS      1 BLANK NODES

    Subject Predicate Object
    1 sg:person.010006120612.67 schema:familyName Narayanaswamy
    2 schema:givenName N S
    3 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010006120612.67
    4 schema:sdDatePublished 2019-03-07T14:15
    5 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    6 schema:sdPublisher N6e449600ffbf449ab4467a28ee59644b
    7 sgo:license sg:explorer/license/
    8 sgo:sdDataset persons
    9 rdf:type schema:Person
    10 N6e449600ffbf449ab4467a28ee59644b schema:name Springer Nature - SN SciGraph project
    11 rdf:type schema:Organization

    Preview window. Press ESC to close (or click here)