Joachim Giesen

Ontology type: schema:Person     

Person Info





Publications in SciGraph latest 50 shown

  • 2016 Reconstructing a Sparse Solution from a Compressed Support Vector Machine in MATHEMATICAL ASPECTS OF COMPUTER AND INFORMATION SCIENCES
  • 2012 Optimizing over the Growing Spectrahedron in ALGORITHMS – ESA 2012
  • 2010 Approximating Parameterized Convex Optimization Problems in ALGORITHMS – ESA 2010
  • 2010 Choice-Based Conjoint Analysis: Classification vs. Discrete Choice Models in PREFERENCE LEARNING
  • 2009-10-09 Spectral Techniques to Explore Point Clouds in Euclidean Space, with Applications to Collective Coordinates in Structural Biology in NONLINEAR COMPUTATIONAL GEOMETRY
  • 2007 Collaborative Ranking: An Aggregation Algorithm for Individuals’ Preference Estimation in ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT
  • 2007 The Combinatorial Structure of Polyhedral Choice Based Conjoint Analysis in CONJOINT MEASUREMENT
  • 2006-08 The conformal alpha shape filtration in THE VISUAL COMPUTER
  • 2006 Approximate Sorting in LATIN 2006: THEORETICAL INFORMATICS
  • 2006 Delaunay Triangulation Based Surface Reconstruction in EFFECTIVE COMPUTATIONAL GEOMETRY FOR CURVES AND SURFACES
  • 2005 Bounding the Misclassification Error in Spectral Partitioning in the Planted Partition Model in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 2005 Reconstructing Many Partitions Using Spectral Techniques in FUNDAMENTALS OF COMPUTATION THEORY
  • 2005 Boosting Spectral Partitioning by Sampling and Iteration in ALGORITHMS AND COMPUTATION
  • 2004-07 Shape Dimension and Intrinsic Metric from Samples of Manifolds in DISCRETE & COMPUTATIONAL GEOMETRY
  • 2003 Shape Segmentation and Matching with Flow Discretization in ALGORITHMS AND DATA STRUCTURES
  • 2003 Detecting Undersampling in Surface Reconstruction in DISCRETE AND COMPUTATIONAL GEOMETRY
  • 2002-04-10 Duality in Disk Induced Flows in COMPUTATIONAL SCIENCE — ICCS 2002
  • 2002-02-21 A New Diagram from Disks in the Plane in STACS 2002
  • 2001 Robustness Issues in Surface Reconstruction in COMPUTATIONAL SCIENCE — ICCS 2001
  • 2000-12 Curve Reconstruction, the Traveling Salesman Problem, and Menger’s Theorem on Length in DISCRETE & COMPUTATIONAL GEOMETRY
  • 1999 Curve Reconstruction in Arbitrary Dimension and the Traveling Salesman Problem in DISCRETE GEOMETRY FOR COMPUTER IMAGERY
  • 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": "", 
        "affiliation": [
            "affiliation": {
              "id": "", 
              "type": "Organization"
            "isCurrent": true, 
            "type": "OrganizationRole"
            "id": "", 
            "type": "Organization"
        "familyName": "Giesen", 
        "givenName": "Joachim", 
        "id": "sg:person.015273211017.83", 
        "sameAs": [
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:53", 
        "sdLicense": "", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        "sdSource": "s3://com-uberresearch-data-dimensions-researchers-20181010/20181011/dim_researchers/base/researchers_1659.json", 
        "type": "Person"

    Download the RDF metadata as:  json-ld nt turtle xml License info


    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' ''

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

    curl -H 'Accept: application/n-triples' ''

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' ''

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

    curl -H 'Accept: application/rdf+xml' ''


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