Xin He


Ontology type: schema:Person     


Person Info

NAME

Xin

SURNAME

He

Publications in SciGraph latest 50 shown

  • 2016 Nearest Neighbor Interchange and Related Distances in ENCYCLOPEDIA OF ALGORITHMS
  • 2015 A Linear Time Algorithm for Determining Almost Bipartite Graphs in THEORY AND APPLICATIONS OF MODELS OF COMPUTATION
  • 2015 Star Shaped Orthogonal Drawing in THEORY AND APPLICATIONS OF MODELS OF COMPUTATION
  • 2015 Compact Monotone Drawing of Trees in COMPUTING AND COMBINATORICS
  • 2015 Monotone Drawings of 3-Connected Plane Graphs in ALGORITHMS - ESA 2015
  • 2014-02 On Succinct Greedy Drawings of Plane Triangulations and 3-Connected Plane Graphs in ALGORITHMICA
  • 2014 Nearest Neighbor Interchange and Related Distances in ENCYCLOPEDIA OF ALGORITHMS
  • 2013 Computing Distances Between Evolutionary Trees in HANDBOOK OF COMBINATORIAL OPTIMIZATION
  • 2012 Succinct Strictly Convex Greedy Drawing of 3-Connected Plane Graphs in FRONTIERS IN ALGORITHMICS AND ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT
  • 2010 Compact Visibility Representation of 4-Connected Plane Graphs in COMBINATORIAL OPTIMIZATION AND APPLICATIONS
  • 2010 Schnyder Greedy Routing Algorithm in THEORY AND APPLICATIONS OF MODELS OF COMPUTATION
  • 2009-05 Optimal st-orientations for plane triangulations in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2008 Nearest Neighbor Interchange and Related Distances in ENCYCLOPEDIA OF ALGORITHMS
  • 2007 Optimal st-Orientations for Plane Triangulations in ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT
  • 2006-07 Finding Hamiltonian paths in tournaments on clusters in CLUSTER COMPUTING
  • 2006 Nearly Optimal Visibility Representations of Plane Graphs in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2006 An Application of Well-Orderly Trees in Graph Drawing in GRAPH DRAWING
  • 2005-02 Canonical Ordering Trees and Their Applications in Graph Drawing in DISCRETE & COMPUTATIONAL GEOMETRY
  • 2005 New Theoretical Bounds of Visibility Representation of Plane Graphs in GRAPH DRAWING
  • 2004-04 Disk Embeddings of Planar Graphs in ALGORITHMICA
  • 2004 On Visibility Representation of Plane Graphs in STACS 2004
  • 2003-06-24 On Even Triangulations of 2-Connected Embedded Graphs in COMPUTING AND COMBINATORICS
  • 2003-01-14 A Fast General Methodology for Information—Theoretically Optimal Encodings of Graphs in ALGORITHMS - ESA’ 99
  • 2003 Compact Visibility Representation and Straight-Line Grid Embedding of Plane Graphs in ALGORITHMS AND DATA STRUCTURES
  • 2002-11-08 Average-Case Communication-Optimal Parallel Parenthesis Matching in ALGORITHMS AND COMPUTATION
  • 2001-08-02 A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs in ALGORITHMS AND DATA STRUCTURES
  • 2000-07-21 Hierarchical Topological Inference on Planar Disc Maps in COMPUTING AND COMBINATORICS
  • 1999-06 On the Linear-Cost Subtree-Transfer Distance between Phylogenetic Trees in ALGORITHMICA
  • 1998 Computing Distances between Evolutionary Trees in HANDBOOK OF COMBINATORIAL OPTIMIZATION
  • 1998 Compact encodings of planar graphs via canonical orderings and multiple parentheses in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1996-09 An NC algorithm for finding a minimum weighted completion time schedule on series parallel graphs in ALGORITHMICA
  • 1996 Grid embedding of 4-connected plane graphs in GRAPH DRAWING
  • 1996 Fast RNC and NC algorithms for finding a maximal set of paths with an application in COMPUTING AND COMBINATORICS
  • 1995-06 An efficient parallel algorithm for finding rectangular duals of plane triangular graphs in ALGORITHMICA
  • 1995 NC algorithms for partitioning planar graphs into induced forests and approximating NP-hard problems in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 1995 Regular edge labelings and drawings of planar graphs in GRAPH DRAWING
  • 1994 Two algorithms for finding rectangular duals of planar graphs in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 1993 Parallel construction of canonical ordering and convex drawing of triconnected planar graphs in ALGORITHMS AND COMPUTATION
  • 1993 Scheduling interval ordered tasks in parallel in STACS 93
  • 1992 Parallel algorithm for cograph recognition with applications in ALGORITHM THEORY — SWAT '92
  • 1990-06 Efficient parallel algorithms forr-dominating set andp-center problems on trees in ALGORITHMICA
  • 1990-06 Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs in ALGORITHMICA
  • 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", 
        "affiliation": [
          {
            "affiliation": {
              "id": "https://www.grid.ac/institutes/grid.273335.3", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }
        ], 
        "familyName": "He", 
        "givenName": "Xin", 
        "id": "sg:person.011352641523.42", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011352641523.42"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T14:05", 
        "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_1856.json", 
        "type": "Person"
      }
    ]
     

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

    HOW TO GET THIS DATA PROGRAMMATICALLY:

    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.011352641523.42'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...