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
  • 2016 Bribeproof Mechanisms for Two-Values Domains in ALGORITHMIC GAME THEORY
  • 2016 Sequence Hypergraphs in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 2015 Recurring Comparison Faults: Sorting and Finding the Minimum in FUNDAMENTALS OF COMPUTATION THEORY
  • 2015-01 An O(n4) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs in ALGORITHMICA
  • 2014 Data Delivery by Energy-Constrained Mobile Agents on a Line in AUTOMATA, LANGUAGES, AND PROGRAMMING
  • 2014 Counting Approximately-Shortest Paths in Directed Acyclic Graphs in APPROXIMATION AND ONLINE ALGORITHMS
  • 2014 Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods in COMBINATORIAL OPTIMIZATION
  • 2014 Polygon-Constrained Motion Planning Problems in ALGORITHMS FOR SENSOR SYSTEMS
  • 2014 Data Delivery by Energy-Constrained Mobile Agents in ALGORITHMS FOR SENSOR SYSTEMS
  • 2014 Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods in COMBINATORIAL OPTIMIZATION
  • 2013 To Be Uncertain Is Uncomfortable, But to Be Certain Is Ridiculous in AUTOMATA, LANGUAGES, AND PROGRAMMING
  • 2013 Deterministic Symmetric Rendezvous in Arbitrary Graphs: Overcoming Anonymity, Failures and Uncertainty in SEARCH THEORY
  • 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
  • 2013 Interval Selection with Machine-Dependent Intervals in ALGORITHMS AND DATA STRUCTURES
  • 2013 Mapping a Polygon with Holes Using a Compass in ALGORITHMS FOR SENSOR SYSTEMS
  • 2012 Combinatorial Optimization with Noisy Inputs: How Can We Separate the Wheat from the Chaff? in WALCOM: ALGORITHMS AND COMPUTATION
  • 2011-12 How to Guard a Graph? in ALGORITHMICA
  • 2011-04 On robust online scheduling algorithms in JOURNAL OF SCHEDULING
  • 2011 On the Complexity of the Metric TSP under Stability Considerations in SOFSEM 2011: THEORY AND PRACTICE OF COMPUTER SCIENCE
  • 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
  • 2011 DISC 2011 Invited Lecture: Polygon Reconstruction with Little Information: An Example for the Power of Simple Micro-robots in DISTRIBUTED COMPUTING
  • 2011 An Time Algorithm to Compute the Bisection Width of Solid Grid Graphs in ALGORITHMS – ESA 2011
  • 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-08 Approximate Shortest Paths Guided by a Small Index in ALGORITHMICA
  • 2010 Reconstructing Visibility Graphs with Simple Robots in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2010 Rendezvous of Mobile Agents in Directed Graphs in DISTRIBUTED COMPUTING
  • 2010 Reconstructing a Simple Polygon from Its Angles in ALGORITHM THEORY - SWAT 2010
  • 2010 Stability of Networks in Stretchable Graphs in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2010 How Simple Robots Benefit from Looking Back in ALGORITHMS AND COMPLEXITY
  • 2010 Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids in COMBINATORIAL OPTIMIZATION AND APPLICATIONS
  • 2009-04 Single machine batch scheduling with release times in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2009 How to Sort a Train in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2009
  • 2009 Optimal Transitions for Targeted Protein Quantification: Best Conditioned Submatrix Selection in COMPUTING AND COMBINATORICS
  • 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 Reoptimization of Weighted Graph and Covering Problems in APPROXIMATION AND ONLINE ALGORITHMS
  • 2009 Pseudonyms in Cost-Sharing Games in INTERNET AND NETWORK ECONOMICS
  • 2008 On the Hardness of Reoptimization in SOFSEM 2008: THEORY AND PRACTICE OF COMPUTER SCIENCE
  • 2008 Counting Targets with Mobile Sensors in an Unknown Environment in ALGORITHMIC ASPECTS OF WIRELESS SENSOR NETWORKS
  • 2008 Computing Best Swaps in Optimal Tree Spanners in ALGORITHMS AND COMPUTATION
  • 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
  • 2008 Simple Robots in Polygonal Environments: A Hierarchy in ALGORITHMIC ASPECTS OF WIRELESS SENSOR NETWORKS
  • 2008 Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game in INTERNET AND NETWORK ECONOMICS
  • 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)


    ...