Ashim Garg

Ontology type: schema:Person     

Person Info





Publications in SciGraph latest 50 shown

  • 2004 A More Practical Algorithm for Drawing Binary Trees in Linear Area with Arbitrary Aspect Ratio in GRAPH DRAWING
  • 2004 Area-Efficient Drawings of Outerplanar Graphs in GRAPH DRAWING
  • 2003-06-24 Area-Efficient Order-Preserving Planar Straight-Line Drawings of Ordered Trees in COMPUTING AND COMBINATORICS
  • 2003-06-18 Straight-Line Drawings of General Trees with Linear Area and Arbitrary Aspect Ratio in COMPUTATIONAL SCIENCE AND ITS APPLICATIONS — ICCSA 2003
  • 2002-11-08 Compact Encodings of Planar Orthogonal Drawings in GRAPH DRAWING
  • 2002 Straight-Line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio in GRAPH DRAWING
  • 2000-03-03 Almost Bend-Optimal Planar Orthogonal Drawings of Biconnected Degree-3 Planar Graphs in Quadratic Time in GRAPH DRAWING
  • 1998 Compact encodings of planar graphs via canonical orderings and multiple parentheses in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1997 A graph drawing and translation service on the WWW in GRAPH DRAWING
  • 1997 InteractiveGiotto: An algorithm for interactive orthogonal graph drawing in GRAPH DRAWING
  • 1997 Drawing directed acyclic graphs: An experimental study in GRAPH DRAWING
  • 1997 A new minimum cost flow algorithm with applications to graph drawing in GRAPH DRAWING
  • 1997 GIOTTO3D: A system for visualizing hierarchical structures in 3D in GRAPH DRAWING
  • 1996 Drawing with colors in ALGORITHMS — ESA '96
  • 1995-06 Upward planarity testing in ORDER
  • 1995 Drawing graphs by example efficiently: Trees and planar acyclic digraphs (extended abstract) in GRAPH DRAWING
  • 1995 On the computational complexity of upward and rectilinear planarity testing in GRAPH DRAWING
  • 1995 On drawing angle graphs in GRAPH DRAWING
  • 1994 Advances in graph drawing in ALGORITHMS AND COMPLEXITY
  • 1994 Planar drawings and angular resolution: Algorithms and bounds in ALGORITHMS — ESA '94
  • 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": "", 
        "affiliation": [
            "affiliation": {
              "id": "", 
              "type": "Organization"
            "isCurrent": true, 
            "type": "OrganizationRole"
        "familyName": "Garg", 
        "givenName": "Ashim", 
        "id": "sg:person.013377047435.30", 
        "sameAs": [
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T14:05", 
        "sdLicense": "", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        "sdSource": "s3://com-uberresearch-data-dimensions-researchers-20181010/20181011/dim_researchers/base/researchers_1850.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' ''

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

    curl -H 'Accept: application/n-triples' ''

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' ''

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

    curl -H 'Accept: application/rdf+xml' ''


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