Kurt Mehlhorn


Ontology type: schema:Person     


Person Info

NAME

Kurt

SURNAME

Mehlhorn

Publications in SciGraph latest 50 shown

  • 2022-01-08 The Maximum-Level Vertex in an Arrangement of Lines in DISCRETE & COMPUTATIONAL GEOMETRY
  • 2019 Sequential and Parallel Algorithms and Data Structures, The Basic Toolbox in NONE
  • 2017-08-19 Earning Limits in Fisher Markets with Spending-Constraint Utilities in ALGORITHMIC GAME THEORY
  • 2016-11-01 Opposition Frameworks in LOGICS IN ARTIFICIAL INTELLIGENCE
  • 2016-09-17 Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design in THEORY OF COMPUTING SYSTEMS
  • 2015-12-10 Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism Design in ALGORITHMIC GAME THEORY
  • 2015-11-22 On the Implementation of Combinatorial Algorithms for the Linear Exchange Market in ALGORITHMS, PROBABILITY, NETWORKS, AND GAMES
  • 2015-11-12 Self-Adjusting Binary Search Trees: What Makes Them Tick? in ALGORITHMS - ESA 2015
  • 2015-09-22 Certifying 3-Edge-Connectivity in ALGORITHMICA
  • 2015-07-28 Greedy Is an Almost Optimal Deque in ALGORITHMS AND DATA STRUCTURES
  • 2015-04-08 Fair Matchings and Related Problems in ALGORITHMICA
  • 2014-06-14 On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets in ALGORITHMICA
  • 2014 Algorithmen und Datenstrukturen, Die Grundwerkzeuge in NONE
  • 2014 New Approximability Results for the Robust k-Median Problem in ALGORITHM THEORY – SWAT 2014
  • 2014 Verification of Certifying Computations through AutoCorres and Simpl in NASA FORMAL METHODS
  • 2014 Algorithms for Equilibrium Prices in Linear Market Models in ALGORITHMS AND COMPUTATION
  • 2013-06-29 A Framework for the Verification of Certifying Computations in JOURNAL OF AUTOMATED REASONING
  • 2013-02-15 Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms in ALGORITHMICA
  • 2013 On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets in COMPUTING AND COMBINATORICS
  • 2013 The Query Complexity of Finding a Hidden Permutation in SPACE-EFFICIENT DATA STRUCTURES, STREAMS, AND ALGORITHMS
  • 2013 A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market in AUTOMATA, LANGUAGES, AND PROGRAMMING
  • 2013 Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds in AUTOMATA, LANGUAGES, AND PROGRAMMING
  • 2013 Certifying 3-Edge-Connectivity in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 2012 Counting Arbitrary Subgraphs in Data Streams in AUTOMATA, LANGUAGES, AND PROGRAMMING
  • 2011 The Physarum Computer in WALCOM: ALGORITHMS AND COMPUTATION
  • 2011 Multiplication of Long Integers - Faster than Long Multiplication in ALGORITHMS UNPLUGGED
  • 2011 Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms in ALGORITHMS – ESA 2011
  • 2011 Online Graph Exploration: New Results on Old and New Algorithms in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2011 Approximate Counting of Cycles in Streams in ALGORITHMS – ESA 2011
  • 2011 Verification of Certifying Computations in COMPUTER AIDED VERIFICATION
  • 2010-12-08 An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs in ALGORITHMICA
  • 2010-10-16 Arrangements on Parametric Surfaces I: General Framework and Infrastructure in MATHEMATICS IN COMPUTER SCIENCE
  • 2010-03-30 Guest Editorial: Selected Papers from European Symposium on Algorithms in ALGORITHMICA
  • 2010-01-12 Assigning Papers to Referees in ALGORITHMICA
  • 2010 Reliable and Efficient Geometric Computing in MATHEMATICAL SOFTWARE – ICMS 2010
  • 2010 Progress on Certifying Algorithms in FRONTIERS IN ALGORITHMICS
  • 2009-05-20 New Approximation Algorithms for Minimum Cycle Bases of Graphs in ALGORITHMICA
  • 2009 Breaking the O(m2n) Barrier for Minimum Cycle Bases in ALGORITHMS - ESA 2009
  • 2009 Assigning Papers to Referees in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2008-01-01 Multiplikation langer Zahlen (schneller als in der Schule) in TASCHENBUCH DER ALGORITHMEN
  • 2007-12-04 A Separation Bound for Real Algebraic Expressions in ALGORITHMICA
  • 2007-10-13 An Algorithm for Minimum Cycle Basis of Graphs in ALGORITHMICA
  • 2007-06 Algorithms to Compute Minimum Cycle Basis in Directed Graphs in THEORY OF COMPUTING SYSTEMS
  • 2007-01-01 Minimum Cycle Bases in Graphs Algorithms and Applications in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2007
  • 2007-01-01 New Approximation Algorithms for Minimum Cycle Bases of Graphs in STACS 2007
  • 2007-01-01 Matchings in Graphs Variations of the Problem in COMBINATORIAL OPTIMIZATION AND APPLICATIONS
  • 2007-01-01 Reliable Geometric Computing in OPERATIONS RESEARCH PROCEEDINGS 2006
  • 2007-01-01 Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step in ALGORITHMS – ESA 2007
  • 2006 Reliable and Efficient Geometric Computing in ALGORITHMS AND COMPLEXITY
  • 2006 Reliable and Efficient Computational Geometry Via Controlled Perturbation in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 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.419528.3", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.4372.2", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.482020.c", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.11749.3a", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.166341.7", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.35403.31", 
            "type": "Organization"
          }
        ], 
        "familyName": "Mehlhorn", 
        "givenName": "Kurt", 
        "id": "sg:person.011757371347.43", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011757371347.43"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2022-08-04T17:38", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20220804/entities/gbq_results/person/person_702.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.011757371347.43'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     

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

    26 TRIPLES      10 PREDICATES      16 URIs      7 LITERALS      2 BLANK NODES

    Subject Predicate Object
    1 sg:person.011757371347.43 schema:affiliation N0aad55cf51b240d587b238229ec66a55
    2 grid-institutes:grid.11749.3a
    3 grid-institutes:grid.166341.7
    4 grid-institutes:grid.35403.31
    5 grid-institutes:grid.4372.2
    6 grid-institutes:grid.482020.c
    7 schema:familyName Mehlhorn
    8 schema:givenName Kurt
    9 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011757371347.43
    10 schema:sdDatePublished 2022-08-04T17:38
    11 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    12 schema:sdPublisher Nc2f60bc2a15e450887488cf687c537be
    13 sgo:license sg:explorer/license/
    14 sgo:sdDataset persons
    15 rdf:type schema:Person
    16 N0aad55cf51b240d587b238229ec66a55 schema:affiliation grid-institutes:grid.419528.3
    17 sgo:isCurrent true
    18 rdf:type schema:OrganizationRole
    19 Nc2f60bc2a15e450887488cf687c537be schema:name Springer Nature - SN SciGraph project
    20 rdf:type schema:Organization
    21 grid-institutes:grid.11749.3a schema:Organization
    22 grid-institutes:grid.166341.7 schema:Organization
    23 grid-institutes:grid.35403.31 schema:Organization
    24 grid-institutes:grid.419528.3 schema:Organization
    25 grid-institutes:grid.4372.2 schema:Organization
    26 grid-institutes:grid.482020.c schema:Organization
     




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


    ...