Guo-Hui Lin


Ontology type: schema:Person     


Person Info

NAME

Guo-Hui

SURNAME

Lin

Publications in SciGraph latest 50 shown

  • 2022-05-11 Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2022-04-08 A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2022-03-16 Path Cover Problems with Length Cost in WALCOM: ALGORITHMS AND COMPUTATION
  • 2022-03-03 Improved Approximation Algorithms for Multiprocessor Scheduling with Testing in FRONTIERS OF ALGORITHMICS
  • 2022-03-03 Approximation Algorithms for the Directed Path Partition Problems in FRONTIERS OF ALGORITHMICS
  • 2021-09-12 Approximation Algorithms for Maximally Balanced Connected Graph Partition in ALGORITHMICA
  • 2021-08-16 Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2020-10-13 A randomized approximation algorithm for metric triangle packing in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2020-10-09 Acyclic Edge Coloring Conjecture Is True on Planar Graphs Without Intersecting Triangles in THEORY AND APPLICATIONS OF MODELS OF COMPUTATION
  • 2020-08-27 Graph Classes and Approximability of the Happy Set Problem in COMPUTING AND COMBINATORICS
  • 2020-08-09 Improved Hardness and Approximation Results for Single Allocation Hub Location in ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT
  • 2020-07-25 A (1.4+ϵ)-approximation algorithm for the 2-Max-Duo problem in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2020-05-21 Improved Approximation Algorithms for Path Vertex Covers in Regular Graphs in ALGORITHMICA
  • 2020-02-20 Parameterized Algorithms for the Happy Set Problem in WALCOM: ALGORITHMS AND COMPUTATION
  • 2020-02-17 Approximation algorithms for the maximally balanced connected graph tripartition problem in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2020-01-10 Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments in JOURNAL OF SCHEDULING
  • 2019-11-23 Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem in COMBINATORIAL OPTIMIZATION AND APPLICATIONS
  • 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-09-19 Single-machine scheduling with job-dependent machine deterioration in JOURNAL OF SCHEDULING
  • 2019-04-09 A Local Search 4/3-approximation Algorithm for the Minimum 3-path Partition Problem in FRONTIERS IN ALGORITHMICS
  • 2019-01-01 An improved approximation algorithm for the minimum 3-path partition problem in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2018-12-11 Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem in ALGORITHMICA
  • 2018-11-17 Approximation Algorithms and a Hardness Result for the Three-Machine Proportionate Mixed Shop in ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT
  • 2018-11-16 Open-Shop Scheduling for Unit Jobs Under Precedence Constraints in COMBINATORIAL OPTIMIZATION AND APPLICATIONS
  • 2018-08-31 An approximation algorithm for genome sorting by reversals to recover all adjacencies in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2018-07-03 Rescheduling due to machine disruption to minimize the total weighted completion time in JOURNAL OF SCHEDULING
  • 2018-06-29 An Approximation Framework for Bounded Facility Location Problems in COMPUTING AND COMBINATORICS
  • 2018-06-29 Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict Graph in COMPUTING AND COMBINATORICS
  • 2018-06-05 A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2017-09-12 Algorithms for Communication Scheduling in Data Gathering Network with Data Compression in ALGORITHMICA
  • 2017-07-01 Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem in COMPUTING AND COMBINATORICS
  • 2017-03-23 Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems in ALGORITHMICA
  • 2017-02-15 Single machine scheduling with job delivery to multiple customers in JOURNAL OF SCHEDULING
  • 2016-12-14 Parallel Metabolomic Profiling of Cerebrospinal Fluid and Serum for Identifying Biomarkers of Injury Severity after Acute Human Spinal Cord Injury in SCIENTIFIC REPORTS
  • 2016-12 Genotype Imputation Methods and Their Effects on Genomic Predictions in Cattle in SPRINGER SCIENCE REVIEWS
  • 2016-05-27 A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan in FRONTIERS IN ALGORITHMICS
  • 2015-10-23 Whole genome SNP genotype piecemeal imputation in BMC BIOINFORMATICS
  • 2015-09-04 Machine scheduling with a maintenance interval and job delivery coordination in OPTIMIZATION LETTERS
  • 2015-06-27 Machine Scheduling with a Maintenance Interval and Job Delivery Coordination in FRONTIERS IN ALGORITHMICS
  • 2015-03-18 Isomorphism and similarity for 2-generation pedigrees in BMC BIOINFORMATICS
  • 2015-02-03 A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines in OPTIMIZATION LETTERS
  • 2015-01-06 An improved two-machine flowshop scheduling with intermediate transportation in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2014-11-13 Algorithms for Cut Problems on Trees in COMBINATORIAL OPTIMIZATION AND APPLICATIONS
  • 2014-11-08 An Improved Approximation Algorithm for the Minimum Common Integer Partition Problem in ALGORITHMS AND COMPUTATION
  • 2014 Partially Dynamic Single-Source Shortest Paths on Digraphs with Positive Weights in ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT
  • 2014 Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-Like Set Systems in THEORY AND APPLICATIONS OF MODELS OF COMPUTATION
  • 2014 On the Smoothed Heights of Trie and Patricia Index Trees in COMPUTING AND COMBINATORICS
  • 2013-09-01 A 0.5358-approximation for Bandpass-2 in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2013-02-17 Preface 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", 
        "affiliation": [
          {
            "affiliation": {
              "id": "http://www.grid.ac/institutes/grid.17089.37", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.460183.8", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.21166.32", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.19373.3f", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.46078.3d", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.25073.33", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.266097.c", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.413273.0", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.9227.e", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.59062.38", 
            "type": "Organization"
          }
        ], 
        "familyName": "Lin", 
        "givenName": "Guo-Hui", 
        "id": "sg:person.01130357621.02", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01130357621.02"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2022-06-01T22:52", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20220601/entities/gbq_results/person/person_737.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.01130357621.02'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     

    This table displays all metadata directly associated to this object as RDF triples.

    34 TRIPLES      10 PREDICATES      20 URIs      7 LITERALS      2 BLANK NODES

    Subject Predicate Object
    1 sg:person.01130357621.02 schema:affiliation N78cca2ce384645058226c0d29eb85653
    2 grid-institutes:grid.19373.3f
    3 grid-institutes:grid.21166.32
    4 grid-institutes:grid.25073.33
    5 grid-institutes:grid.266097.c
    6 grid-institutes:grid.413273.0
    7 grid-institutes:grid.460183.8
    8 grid-institutes:grid.46078.3d
    9 grid-institutes:grid.59062.38
    10 grid-institutes:grid.9227.e
    11 schema:familyName Lin
    12 schema:givenName Guo-Hui
    13 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01130357621.02
    14 schema:sdDatePublished 2022-06-01T22:52
    15 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    16 schema:sdPublisher N8ae90a8d1f864e0d9a5f146f617d96d0
    17 sgo:license sg:explorer/license/
    18 sgo:sdDataset persons
    19 rdf:type schema:Person
    20 N78cca2ce384645058226c0d29eb85653 schema:affiliation grid-institutes:grid.17089.37
    21 sgo:isCurrent true
    22 rdf:type schema:OrganizationRole
    23 N8ae90a8d1f864e0d9a5f146f617d96d0 schema:name Springer Nature - SN SciGraph project
    24 rdf:type schema:Organization
    25 grid-institutes:grid.17089.37 schema:Organization
    26 grid-institutes:grid.19373.3f schema:Organization
    27 grid-institutes:grid.21166.32 schema:Organization
    28 grid-institutes:grid.25073.33 schema:Organization
    29 grid-institutes:grid.266097.c schema:Organization
    30 grid-institutes:grid.413273.0 schema:Organization
    31 grid-institutes:grid.460183.8 schema:Organization
    32 grid-institutes:grid.46078.3d schema:Organization
    33 grid-institutes:grid.59062.38 schema:Organization
    34 grid-institutes:grid.9227.e schema:Organization
     




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


    ...