Peter Widmayer


Ontology type: schema:Person     


Person Info

NAME

Peter

SURNAME

Widmayer

Publications in SciGraph latest 50 shown

  • 2018-08-09 Sequence Hypergraphs: Paths, Flows, and Cuts in PROGRESS IN PATTERN RECOGNITION, IMAGE ANALYSIS, COMPUTER VISION, AND APPLICATIONS
  • 2017-12 A better scoring model for de novo peptide sequencing: the symmetric difference between explained and measured masses in ALGORITHMS FOR MOLECULAR BIOLOGY
  • 2016 A Better Scoring Model for De Novo Peptide Sequencing: The Symmetric Difference Between Explained and Measured Masses in ALGORITHMS IN BIOINFORMATICS
  • 2016-01 Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs in THEORY OF COMPUTING SYSTEMS
  • 2015-01 An O(n4) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs in ALGORITHMICA
  • 2014 Counting Approximately-Shortest Paths in Directed Acyclic Graphs in APPROXIMATION AND ONLINE ALGORITHMS
  • 2014 Data Delivery by Energy-Constrained Mobile Agents on a Line in AUTOMATA, LANGUAGES, AND PROGRAMMING
  • 2014 Polygon-Constrained Motion Planning Problems in ALGORITHMS FOR SENSOR SYSTEMS
  • 2014 Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods in COMBINATORIAL OPTIMIZATION
  • 2013-01 Mapping Simple Polygons: How Robots Benefit from Looking Back in ALGORITHMICA
  • 2013 Mapping Polygons with Agents That Measure Angles in ALGORITHMIC FOUNDATIONS OF ROBOTICS X
  • 2011 Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 2011 Maximum Independent Set in 2-Direction Outersegment Graphs in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 2010-11-08 Optimal Placement of Ad Hoc Devices Under a VCG-Style Routing Protocol in THEORETICAL ASPECTS OF DISTRIBUTED COMPUTING IN SENSOR NETWORKS
  • 2010 Reconstructing a Simple Polygon from Its Angles in ALGORITHM THEORY - SWAT 2010
  • 2009 How to Sort a Train in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2009
  • 2009 Shunting for Dummies: An Introductory Algorithmic Survey in ROBUST AND ONLINE LARGE-SCALE OPTIMIZATION
  • 2009 Online Train Disposition: To Wait or Not to Wait? in ROBUST AND ONLINE LARGE-SCALE OPTIMIZATION
  • 2009 Optimal Transitions for Targeted Protein Quantification: Best Conditioned Submatrix Selection in COMPUTING AND COMBINATORICS
  • 2008 Computing Best Swaps in Optimal Tree Spanners in ALGORITHMS AND COMPUTATION
  • 2008 Counting Targets with Mobile Sensors in an Unknown Environment in ALGORITHMIC ASPECTS OF WIRELESS SENSOR NETWORKS
  • 2008 Rendezvous of Mobile Agents When Tokens Fail Anytime in PRINCIPLES OF DISTRIBUTED SYSTEMS
  • 2008 Angle Optimization in Target Tracking in ALGORITHM THEORY – SWAT 2008
  • 2007 Approximate Shortest Paths Guided by a Small Index in ALGORITHMS AND DATA STRUCTURES
  • 2006 Strongly Polynomial-Time Truthful Mechanisms in One Shot in INTERNET AND NETWORK ECONOMICS
  • 2006 Pattern Formation by Autonomous Mobile Robots in UNIFYING THEMES IN COMPLEX SYSTEMS
  • 2005 Geometric Routing Without Geometry in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2005 Computing All the Best Swap Edges Distributively in PRINCIPLES OF DISTRIBUTED SYSTEMS
  • 2003-12 Distributed Search Trees: Fault Tolerance in an Asynchronous Environment in THEORY OF COMPUTING SYSTEMS
  • 2003 Single and Bulk Updates in Stratified Trees: An Amortized andWorst-Case Analysis in COMPUTER SCIENCE IN PERSPECTIVE
  • 2003 Probabilistic Protocols for Node Discovery in Ad Hoc Multi-channel Broadcast Networks in AD-HOC, MOBILE, AND WIRELESS NETWORKS
  • 2002-03-15 Positioning Guards at Fixed Height Above a Terrain — An Optimum Inapproximability Result in ALGORITHMS — ESA’ 98
  • 2002-03-15 Approximation Algorithms for Clustering to Minimize the Sum of Diameters in ALGORITHM THEORY - SWAT 2000
  • 2002 Amortized Complexity of Bulk Updates in AVL-Trees in ALGORITHM THEORY — SWAT 2002
  • 2001-12-04 On the Complexity of Train Assignment Problems in ALGORITHMS AND COMPUTATION
  • 2001 Gathering of Asynchronous Oblivious Robots with Limited Visibility in STACS 2001
  • 2000-03-03 Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots in ALGORITHMS AND COMPUTATION
  • 2000 Maintaining a Minimum Spanning Tree under Transient Node Failures in ALGORITHMS - ESA 2000
  • 1999 How to Swap a Failing Edge of a Single Source Shortest Paths Tree in COMPUTING AND COMBINATORICS
  • 1997 Spatial data structures: Concepts and design choices in ALGORITHMIC FOUNDATIONS OF GEOGRAPHIC INFORMATION SYSTEMS
  • 1997 Space filling curves versus random walks in ALGORITHMIC FOUNDATIONS OF GEOGRAPHIC INFORMATION SYSTEMS
  • 1996-12 An asymptotically optimal multiversion B-tree in THE VLDB JOURNAL
  • 1995-09 On optimal cuts of hyperrectangles in COMPUTING
  • 1995 A Virtual Reality based System Environment for Intuitive Walk-Throughs and Exploration of Large-Scale Tourist Information in INFORMATION AND COMMUNICATION TECHNOLOGIES IN TOURISM
  • 1995 Binary space partitions for sets of hyperrectangles in ALGORITHMS, CONCURRENCY AND KNOWLEDGE
  • 1994 VisTool: A visualization tool for spatial access structures in IGIS '94: GEOGRAPHIC INFORMATION SYSTEMS
  • 1994 Geographic Information Systems: an Example in ADVANCES IN DATABASE SYSTEMS
  • 1992 Enclosing many boxes by an optimal pair of boxes in STACS 92
  • 1991 An optimal algorithm for approximating a set of rectangles by two minimum area rectangles in COMPUTATIONAL GEOMETRY-METHODS, ALGORITHMS AND APPLICATIONS
  • 1991 Anbindung einer räumlich clusternden Zugriffsstruktur für geometrische Attribute an ein Standard-Datenbanksystem am Beispiel von Oracle in DATENBANKSYSTEME IN BÜRO, TECHNIK UND WISSENSCHAFT
  • 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.5801.c", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }
        ], 
        "familyName": "Widmayer", 
        "givenName": "Peter", 
        "id": "sg:person.0757144477.93", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0757144477.93"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:25", 
        "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_1210.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.0757144477.93'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...