Maw Shang Chang


Ontology type: schema:Person     


Person Info

NAME

Maw Shang

SURNAME

Chang

Publications in SciGraph latest 50 shown

  • 2016-08 An O∗(1.4366n)-time exact algorithm for maximum P2-packing in cubic graphs in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2015-06 Moderately exponential time algorithms for the maximum induced matching problem in OPTIMIZATION LETTERS
  • 2015-02 Linear-Time Algorithms for Tree Root Problems in ALGORITHMICA
  • 2013-09 Finding large -clubs in undirected graphs in COMPUTING
  • 2013 An O ∗ (1.4786 n )-Time Algorithm for the Maximum Induced Matching Problem in ADVANCES IN INTELLIGENT SYSTEMS AND APPLICATIONS - VOLUME 1
  • 2013 On the Min-Max 2-Cluster Editing Problem in ADVANCES IN INTELLIGENT SYSTEMS AND APPLICATIONS - VOLUME 1
  • 2011-12 Multi-objective optimization of enzyme manipulations in metabolic networks considering resilience effects in BMC SYSTEMS BIOLOGY
  • 2011-10 A Property Tester for Tree-Likeness of Quartet Topologies in THEORY OF COMPUTING SYSTEMS
  • 2011 Recognition of Probe Ptolemaic Graphs in COMBINATORIAL ALGORITHMS
  • 2010-10 Sensitivity analysis of dynamic biological systems with time-delays in BMC BIOINFORMATICS
  • 2010-08 New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem in THEORY OF COMPUTING SYSTEMS
  • 2010 Certifying Algorithms for the Path Cover and Related Problems on Interval Graphs in COMPUTATIONAL SCIENCE AND ITS APPLICATIONS – ICCSA 2010
  • 2009 Block-Graph Width in THEORY AND APPLICATIONS OF MODELS OF COMPUTATION
  • 2008-12 Dynamic sensitivity analysis of biological systems in BMC BIOINFORMATICS
  • 2008 Probe Ptolemaic Graphs in COMPUTING AND COMBINATORICS
  • 2008 New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem in PARAMETERIZED AND EXACT COMPUTATION
  • 2007 The 3-Steiner Root Problem in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 2006 Linear-Time Algorithms for Tree Root Problems in ALGORITHM THEORY – SWAT 2006
  • 2006 On Probe Permutation Graphs in THEORY AND APPLICATIONS OF MODELS OF COMPUTATION
  • 2006 Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs in ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT
  • 2006 Partitioned Probe Comparability Graphs in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 2005-06-09 Weighted domination on cocomparability graphs in ALGORITHMS AND COMPUTATIONS
  • 2005 On the Recognition of Probe Graphs of Some Self-Complementary Classes of Perfect Graphs in COMPUTING AND COMBINATORICS
  • 2004 An Efficient Exact Algorithm for the Minimum Ultrametric Tree Problem in ALGORITHMS AND COMPUTATION
  • 2001-10-02 Maximum Clique Transversals in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 2001-10-02 On the Tree-Degree of Graphs in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 2001-03 The Kr-Packing Problem in COMPUTING
  • 1998 The Vertex-Disjoint Triangles Problem in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 1997-05 Minimum feedback vertex sets in cocomparability graphs and convex bipartite graphs in ACTA INFORMATICA
  • 1997 Dynamic programming on distance-hereditary graphs in ALGORITHMS AND COMPUTATION
  • 1996 Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs in ALGORITHMS AND COMPUTATION
  • 1994 Weighted irredundance of interval graphs in ALGORITHMS AND COMPUTATION
  • 1993 Deferred-query—An efficient approach for problems on interval and circular-arc graphs in ALGORITHMS AND DATA STRUCTURES
  • 1992-12 Solving the Euclidean bottleneck matching problem byk-relative neighborhood graphs in ALGORITHMICA
  • 1990 20-Relative neighborhood graphs are Hamiltonian in ALGORITHMS
  • Affiliations

    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.412047.4", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }
        ], 
        "familyName": "Chang", 
        "givenName": "Maw Shang", 
        "id": "sg:person.013174232477.45", 
        "identifier": {
          "name": "orcid_id", 
          "type": "PropertyValue", 
          "value": [
            "0000-0003-1469-371X"
          ]
        }, 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013174232477.45", 
          "https://orcid.org/0000-0003-1469-371X"
        ], 
        "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_1472.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.013174232477.45'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...