Bang Ye Wu


Ontology type: schema:Person     


Person Info

NAME

Bang Ye

SURNAME

Wu

Publications in SciGraph latest 50 shown

  • 2017-07 Parameterized algorithms for min–max 2-cluster editing in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2017-04 On the minimum routing cost clustered tree problem in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2017-02 An improved parameterized algorithm for the p-cluster vertex deletion problem in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2017 On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality in ALGORITHMS AND COMPLEXITY
  • 2016 Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs in COMPUTING AND COMBINATORICS
  • 2015-08 On the clustered Steiner tree problem in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2015-07 Parameterized Algorithms for the 2-Clustering Problem with Minimum Sum and Minimum Sum of Squares Objective Functions in ALGORITHMICA
  • 2015 A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion in COMPUTING AND COMBINATORICS
  • 2014 Finding Centers and Medians of a Tree by Distance Queries in FUN WITH ALGORITHMS
  • 2013-10 Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2013-02 A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem in ALGORITHMICA
  • 2013 Balancing a Complete Signed Graph by Editing Edges and Deleting Nodes in ADVANCES IN INTELLIGENT SYSTEMS AND APPLICATIONS - VOLUME 1
  • 2013 On the Clustered Steiner Tree Problem in COMBINATORIAL OPTIMIZATION AND APPLICATIONS
  • 2013 On the Min-Max 2-Cluster Editing Problem in ADVANCES IN INTELLIGENT SYSTEMS AND APPLICATIONS - VOLUME 1
  • 2011 On the Maximum Locally Clustered Subgraph and Some Related Problems in COMBINATORIAL OPTIMIZATION AND APPLICATIONS
  • 2011 A 7/6-Approximation Algorithm for the Max-Min Connected Bipartition Problem on Grid Graphs in COMPUTATIONAL GEOMETRY, GRAPHS AND APPLICATIONS
  • 2010-07 Tree-based object tracking without mobility statistics in wireless sensor networks in WIRELESS NETWORKS
  • 2010 Influence Clubs in Social Networks in COMPUTATIONAL COLLECTIVE INTELLIGENCE. TECHNOLOGIES AND APPLICATIONS
  • 2010 A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem in COMBINATORIAL OPTIMIZATION AND APPLICATIONS
  • 2008-03 The Swap Edges of a Multiple-Sources Routing Tree in ALGORITHMICA
  • 2006-11 Tree edge decomposition with an application to minimum ultrametric tree approximation in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2004-03 Constructing the Maximum Consensus Tree from Rooted Triples in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2004 Approximation Algorithms for k-Source Bottleneck Routing Cost Spanning Tree Problems in COMPUTATIONAL SCIENCE AND ITS APPLICATIONS – ICCSA 2004
  • 2002-06-04 Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices in COMPUTING AND COMBINATORICS
  • 2002-04-12 Constructing Light Spanning Trees with Small Routing Cost in STACS 99
  • 2001-03-29 Approximation Algorithms for Some Optimum Communication Spanning Tree Problems in ALGORITHMS AND COMPUTATION
  • 1999-07 Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 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": "Wu", 
        "givenName": "Bang Ye", 
        "id": "sg:person.013045767237.23", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013045767237.23"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:41", 
        "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_1473.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.013045767237.23'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     

    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.013045767237.23 schema:familyName Wu
    2 schema:givenName Bang Ye
    3 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013045767237.23
    4 schema:sdDatePublished 2019-03-07T13:41
    5 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    6 schema:sdPublisher N9815f962b333412aa18f43a50edbb384
    7 sgo:license sg:explorer/license/
    8 sgo:sdDataset persons
    9 rdf:type schema:Person
    10 N9815f962b333412aa18f43a50edbb384 schema:name Springer Nature - SN SciGraph project
    11 rdf:type schema:Organization
     




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


    ...