Zhi-Zhong Chen


Ontology type: schema:Person     


Person Info

NAME

Zhi-Zhong

SURNAME

Chen

Publications in SciGraph latest 50 shown

  • 2021-09-12 Approximation Algorithms for Maximally Balanced Connected Graph Partition in ALGORITHMICA
  • 2020-10-13 A randomized approximation algorithm for metric triangle packing in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2020-05-21 Improved Approximation Algorithms for Path Vertex Covers in Regular Graphs in ALGORITHMICA
  • 2020-02-17 Approximation algorithms for the maximally balanced connected graph tripartition problem in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2019-11-23 A Randomized Approximation Algorithm for Metric Triangle Packing in COMBINATORIAL OPTIMIZATION AND APPLICATIONS
  • 2019-11-23 Approximation Algorithms for Maximally Balanced Connected Graph Partition in COMBINATORIAL OPTIMIZATION AND APPLICATIONS
  • 2019-05-09 Computing a Consensus Phylogeny via Leaf Removal in BIOINFORMATICS RESEARCH AND APPLICATIONS
  • 2018-12-11 Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem in ALGORITHMICA
  • 2018-02-19 Better ILP models for haplotype assembly in BMC BIOINFORMATICS
  • 2018-01-15 An approximation algorithm for maximum internal spanning tree in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2017-07-01 Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem in COMPUTING AND COMBINATORICS
  • 2017-05-31 A New 2-Approximation Algorithm for rSPR Distance in BIOINFORMATICS RESEARCH AND APPLICATIONS
  • 2017-05-23 Designing and Implementing Algorithms for the Closest String Problem in FRONTIERS IN ALGORITHMICS
  • 2017-02-21 An Approximation Algorithm for Maximum Internal Spanning Tree in WALCOM: ALGORITHMS AND COMPUTATION
  • 2016-07-20 An Improved Approximation Algorithm for rSPR Distance in COMPUTING AND COMBINATORICS
  • 2016-05-27 Better Approximation Algorithms for Scaffolding Problems in FRONTIERS IN ALGORITHMICS
  • 2014-10-28 Randomized Fixed-Parameter Algorithms for the Closest String Problem in ALGORITHMICA
  • 2014 Randomized and Parameterized Algorithms for the Closest String Problem in COMBINATORIAL PATTERN MATCHING
  • 2013-12-08 Faster exact computation of rSPR distance in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2013 Faster Exact Computation of rSPR Distance in FRONTIERS IN ALGORITHMICS AND ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT
  • 2013 Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings in COMBINATORIAL OPTIMIZATION AND APPLICATIONS
  • 2012-12-20 The Parameterized Complexity of the Shared Center Problem in ALGORITHMICA
  • 2012-07-02 A fast tool for minimum hybridization networks in BMC BIOINFORMATICS
  • 2012 An Improved Approximation Algorithm for the Bandpass-2 Problem in COMBINATORIAL OPTIMIZATION AND APPLICATIONS
  • 2012 The Parameterized Complexity of the Shared Center Problem in COMBINATORIAL PATTERN MATCHING
  • 2010-01-21 An Approximation Algorithm for the Minimum Co-Path Set Problem in ALGORITHMICA
  • 2010 Approximating Maximum Edge 2-Coloring in Simple Graphs in ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT
  • 2010 A Linear Kernel for Co-Path/Cycle Packing in ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT
  • 2010 A Three-String Approach to the Closest String Problem in COMPUTING AND COMBINATORICS
  • 2008-07-03 Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats in ALGORITHMICA
  • 2008-01-01 An Improved Randomized Approximation Algorithm for Maximum Triangle Packing in ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT
  • 2008-01-01 Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement in ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT
  • 2007-10-19 Approximation Algorithms for Bounded Degree Phylogenetic Roots in ALGORITHMICA
  • 2007-01-01 An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs in ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT
  • 2006-12-08 Improved approximation algorithms for metric MaxTSP in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2006-02-10 Recognizing Hole-Free 4-Map Graphs in Cubic Time in ALGORITHMICA
  • 2005-06 An Improved Randomized Approximation Algorithm for Max TSP in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2005-02-07 A Linear-Time Algorithm for 7-Coloring 1-Plane Graphs in ALGORITHMICA
  • 2005 Improved Approximation Algorithms for Metric Max TSP in ALGORITHMS – ESA 2005
  • 2004 Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard in COMPUTING AND COMBINATORICS
  • 2004 New Bounds on the Number of Edges in a k-Map Graph in COMPUTING AND COMBINATORICS
  • 2004 Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 2003-12-05 Disk Embeddings of Planar Graphs in ALGORITHMICA
  • 2003-06-24 A Space Efficient Algorithm for Sequence Alignment with Inversions in COMPUTING AND COMBINATORICS
  • 2003 More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling in ALGORITHMS - ESA 2003
  • 2003 A Linear-Time Algorithm for 7-Coloring 1-Planar Graphs in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2003
  • 2001-08-02 Computing Phylogenetic Roots with Bounded Degrees and Errors in ALGORITHMS AND DATA STRUCTURES
  • 2001-07-04 The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2000-07-21 Approximation Algorithms for Independent Sets in Map Graphs in COMPUTING AND COMBINATORICS
  • 2000-07-21 Hierarchical Topological Inference on Planar Disc Maps 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", 
        "affiliation": [
          {
            "affiliation": {
              "id": "http://www.grid.ac/institutes/grid.412773.4", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.260026.0", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.266298.1", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.35030.35", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.47840.3f", 
            "type": "Organization"
          }
        ], 
        "familyName": "Chen", 
        "givenName": "Zhi-Zhong", 
        "id": "sg:person.015654265661.98", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015654265661.98"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2022-01-01T19:57", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20220101/entities/gbq_results/person/person_766.jsonl", 
        "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.015654265661.98'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...