Matúš Mihalák


Ontology type: schema:Person     


Person Info

NAME

Matúš

SURNAME

Mihalák

Publications in SciGraph latest 50 shown

  • 2018-11 Improved bounds on equilibria solutions in the network design game in INTERNATIONAL JOURNAL OF GAME THEORY
  • 2018-08-09 Sequence Hypergraphs: Paths, Flows, and Cuts in PROGRESS IN PATTERN RECOGNITION, IMAGE ANALYSIS, COMPUTER VISION, AND APPLICATIONS
  • 2016-01 Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs in THEORY OF COMPUTING SYSTEMS
  • 2016 Collaborative Delivery with Energy-Constrained Mobile Robots in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2016 Computing and Listing st-Paths in Public Transportation Networks in COMPUTER SCIENCE – THEORY AND APPLICATIONS
  • 2015 Multicast Network Design Game on a Ring in COMBINATORIAL OPTIMIZATION AND APPLICATIONS
  • 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 An H n/2 Upper Bound on the Price of Stability of Undirected Network Design Games in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2014
  • 2014 Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods in COMBINATORIAL OPTIMIZATION
  • 2013-07 The Price of Anarchy in Network Creation Games Is (Mostly) Constant in THEORY OF COMPUTING SYSTEMS
  • 2013-01 Mapping Simple Polygons: How Robots Benefit from Looking Back in ALGORITHMICA
  • 2013 Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games in ALGORITHMS AND COMPLEXITY
  • 2013 Mapping Polygons with Agents That Measure Angles in ALGORITHMIC FOUNDATIONS OF ROBOTICS X
  • 2011 Maximum Independent Set in 2-Direction Outersegment Graphs in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 2010 Reconstructing a Simple Polygon from Its Angles in ALGORITHM THEORY - SWAT 2010
  • 2009 Shunting for Dummies: An Introductory Algorithmic Survey in ROBUST AND ONLINE LARGE-SCALE OPTIMIZATION
  • 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
  • 2006 Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2005 Network Discovery and Verification in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 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": "Mihal\u00e1k", 
        "givenName": "Mat\u00fa\u0161", 
        "id": "sg:person.012551340105.05", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012551340105.05"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:36", 
        "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_1388.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.012551340105.05'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...