Hsueh-I Lu


Ontology type: schema:Person     


Person Info

NAME

Hsueh-I

SURNAME

Lu

Publications in SciGraph latest 50 shown

  • 2013-08-07 Linear-Time Algorithms for Tree Root Problems in ALGORITHMICA
  • 2012 Randomly Coloring Regular Bipartite Graphs and Graphs with Bounded Common Neighbors in ALGORITHMS AND COMPUTATION
  • 2011 Computing the Girth of a Planar Graph in Linear Time in COMPUTING AND COMBINATORICS
  • 2009 Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights in GRAPH DRAWING
  • 2009 Minimum Cycle Bases of Weighted Outerplanar Graphs in ALGORITHMS AND COMPUTATION
  • 2009 An Optimal Labeling for Node Connectivity in ALGORITHMS AND COMPUTATION
  • 2007-09-14 Fast Algorithms for the Density Finding Problem in ALGORITHMICA
  • 2007-01-01 Width-Optimal Visibility Representations of Plane Graphs in ALGORITHMS AND COMPUTATION
  • 2006 Linear-Time Algorithms for Tree Root Problems in ALGORITHM THEORY – SWAT 2006
  • 2005 An Optimal Algorithm for Online Square Detection in COMBINATORIAL PATTERN MATCHING
  • 2005 Power-Saving Scheduling for Weakly Dynamic Voltage Scaling Devices in ALGORITHMS AND DATA STRUCTURES
  • 2005 Disjoint Segments with Maximum Density in COMPUTATIONAL SCIENCE – ICCS 2005
  • 2003-06-24 An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics in IMPLEMENTATION AND APPLICATION OF AUTOMATA
  • 2003 An Optimal Algorithm for the Maximum-Density Segment Problem in ALGORITHMS - ESA 2003
  • 2002-11-08 Some Applications of Orderly Spanning Trees in Graph Drawing in GRAPH DRAWING
  • 2002-10-10 Fast Algorithms for Finding Maximum-Density Segments of a Sequence with Applications to Bioinformatics in ALGORITHMS IN BIOINFORMATICS
  • 2002-08-29 Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees in COMPUTING AND COMBINATORICS
  • 2002-02-21 Floor-Planning via Orderly Spanning Trees in GRAPH DRAWING
  • 2001 On Maximum Symmetric Subgraphs in GRAPH DRAWING
  • 2000 Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets in ALGORITHMS AND COMPUTATION
  • 1999 A Fast General Methodology for Information—Theoretically Optimal Encodings of Graphs in ALGORITHMS - ESA’ 99
  • 1998 Compact encodings of planar graphs via canonical orderings and multiple parentheses in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1998 Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs in ALGORITHMS AND COMPUTATION
  • 1996 Race-condition detection in parallel computation with semaphores (extended abstract) in ALGORITHMS — ESA '96
  • 1993 Detecting race conditions in parallel programs that use one semaphore in ALGORITHMS AND DATA STRUCTURES
  • 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.19188.39", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.506928.0", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.412047.4", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.40263.33", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.28665.3f", 
            "type": "Organization"
          }
        ], 
        "familyName": "Lu", 
        "givenName": "Hsueh-I", 
        "id": "sg:person.013345515575.46", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013345515575.46"
        ], 
        "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_759.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.013345515575.46'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...