Takeaki Uno


Ontology type: schema:Person     


Person Info

NAME

Takeaki

SURNAME

Uno

Publications in SciGraph latest 50 shown

  • 2018-11 Optimization algorithm for k-anonymization of datasets with low information loss in INTERNATIONAL JOURNAL OF INFORMATION SECURITY
  • 2018-03-21 Exact Algorithms for the Max-Min Dispersion Problem in FRONTIERS IN ALGORITHMICS
  • 2018 Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth in COMBINATORIAL ALGORITHMS
  • 2018 Computational Complexity of Robot Arm Simulation Problems in COMBINATORIAL ALGORITHMS
  • 2018 Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 2018 Efficient Enumeration of Bipartite Subgraphs in Graphs in COMPUTING AND COMBINATORICS
  • 2018 An Efficient Algorithm for Enumerating Induced Subgraphs with Bounded Degeneracy in COMBINATORIAL OPTIMIZATION AND APPLICATIONS
  • 2017-11-16 Listing Acyclic Subgraphs and Subgraphs of Bounded Girth in Directed Graphs in COMBINATORIAL OPTIMIZATION AND APPLICATIONS
  • 2017-09-06 Listing Maximal Independent Sets with Minimal Space and Bounded Delay in STRING PROCESSING AND INFORMATION RETRIEVAL
  • 2017-07-01 Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph in COMPUTING AND COMBINATORICS
  • 2017 Sequentially Swapping Colored Tokens on Graphs in WALCOM: ALGORITHMS AND COMPUTATION
  • 2017 Counting Minimal Dominating Sets in THEORY AND APPLICATIONS OF MODELS OF COMPUTATION
  • 2016 Amortized Analysis on Enumeration Algorithms in ENCYCLOPEDIA OF ALGORITHMS
  • 2016 A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 2015 Constant Time Enumeration by Amortization in ALGORITHMS AND DATA STRUCTURES
  • 2015 Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs in ALGORITHMS AND DATA STRUCTURES
  • 2015 Mining Preserving Structures in a Graph Sequence in COMPUTING AND COMBINATORICS
  • 2014 Swapping Labeled Tokens on Graphs in FUN WITH ALGORITHMS
  • 2014 Frequent Pattern Mining in ENCYCLOPEDIA OF ALGORITHMS
  • 2014 Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set in FUN WITH ALGORITHMS
  • 2014 Amortized Analysis on Enumeration Algorithms in ENCYCLOPEDIA OF ALGORITHMS
  • 2014 Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph in ALGORITHMS AND COMPUTATION
  • 2014 An Efficient Algorithm for Enumerating Chordless Cycles and Chordless Paths in DISCOVERY SCIENCE
  • 2014 A Fast Method of Statistical Assessment for Combinatorial Hypotheses Based on Frequent Itemset Enumeration in MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES
  • 2013-12 Identification of both copy number variation-type and constant-type core elements in a large segmental duplication region of the mouse genome in BMC GENOMICS
  • 2013 Faster Algorithms for Tree Similarity Based on Compressed Enumeration of Bounded-Sized Ordered Subtrees in SIMILARITY SEARCH AND APPLICATIONS
  • 2013 On Complexity of Flooding Games on Graphs with Interval Representations in COMPUTATIONAL GEOMETRY AND GRAPHS
  • 2013 On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs in ALGORITHMS AND COMPUTATION
  • 2013 A New Approach to String Pattern Mining with Approximate Match in DISCOVERY SCIENCE
  • 2013 Base Location Problems for Base-Monotone Regions in WALCOM: ALGORITHMS AND COMPUTATION
  • 2013 Polynomial Delay and Space Discovery of Connected and Acyclic Sub-hypergraphs in a Hypergraph in DISCOVERY SCIENCE
  • 2012-10 Finding Maximum Edge Bicliques in Convex Bipartite Graphs in ALGORITHMICA
  • 2012-04 Partitioning a Weighted Tree into Subtrees with Weights in a Given Range in ALGORITHMICA
  • 2012 Hitori Number in FUN WITH ALGORITHMS
  • 2012 A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks in ALGORITHMS AND COMPUTATION
  • 2012 Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression in WALCOM: ALGORITHMS AND COMPUTATION
  • 2012 Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application in COMPUTING AND COMBINATORICS
  • 2012 Efficient Computation of Power Indices for Weighted Majority Games in ALGORITHMS AND COMPUTATION
  • 2012 A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares in ALGORITHM THEORY – SWAT 2012
  • 2011-05 Algorithmic Folding Complexity in GRAPHS AND COMBINATORICS
  • 2011 Dominating Set Counting in Graph Classes in COMPUTING AND COMBINATORICS
  • 2011 Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width in THEORY AND APPLICATIONS OF MODELS OF COMPUTATION
  • 2011 Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem in THEORY AND APPLICATIONS OF MODELS OF COMPUTATION
  • 2010-11 Multi-sorting algorithm for finding pairs of similar short substrings from large-scale string data in KNOWLEDGE AND INFORMATION SYSTEMS
  • 2010-07 Improved Bounds for Wireless Localization in ALGORITHMICA
  • 2010-03 Student mental state inference from unintentional body gestures using dynamic Bayesian networks in JOURNAL ON MULTIMODAL USER INTERFACES
  • 2010 Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 2010 Levelwise Mesh Sparsification for Shortest Path Queries in ALGORITHMS AND COMPUTATION
  • 2010 Finding Maximum Edge Bicliques in Convex Bipartite Graphs in COMPUTING AND COMBINATORICS
  • 2010-01 An Efficient Algorithm for Solving Pseudo Clique Enumeration Problem in ALGORITHMICA
  • 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.250343.3", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "https://www.grid.ac/institutes/grid.419501.8", 
            "type": "Organization"
          }
        ], 
        "familyName": "Uno", 
        "givenName": "Takeaki", 
        "id": "sg:person.016517167551.57", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016517167551.57"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:40", 
        "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_1453.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.016517167551.57'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...