Evangelos Kranakis


Ontology type: schema:Person     


Person Info

NAME

Evangelos

SURNAME

Kranakis

Publications in SciGraph latest 50 shown

  • 2019 Group Search and Evacuation in DISTRIBUTED COMPUTING BY MOBILE ENTITIES
  • 2019 Patrolling in DISTRIBUTED COMPUTING BY MOBILE ENTITIES
  • 2018-10-31 Priority Evacuation from a Disk Using Mobile Robots in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2018-10-31 Gathering in the Plane of Location-Aware Robots in the Presence of Spies in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2018-10 Doppler Effect in the Acoustic Ultra Low Frequency Band for Wireless Underwater Networks in MOBILE NETWORKS AND APPLICATIONS
  • 2018-03 Guest Editorial: Special Issue on Theoretical Informatics in ALGORITHMICA
  • 2018 Low Frequency Mobile Communications in Underwater Networks in AD-HOC, MOBILE, AND WIRELESS NETWORKS
  • 2018 Doppler Effect in the Underwater Acoustic Ultra Low Frequency Band in AD HOC NETWORKS
  • 2018 The Sound of Communication in Underwater Acoustic Sensor Networks in AD HOC NETWORKS
  • 2017-12-22 Patrolling a Path Connecting a Set of Points with Unbalanced Frequencies of Visits in SOFSEM 2018: THEORY AND PRACTICE OF COMPUTER SCIENCE
  • 2017-12-22 Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots in SOFSEM 2018: THEORY AND PRACTICE OF COMPUTER SCIENCE
  • 2017-11 When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots in ALGORITHMICA
  • 2017-03-07 Search on a line with faulty robots in DISTRIBUTED COMPUTING
  • 2017 Evacuation from a Disc in the Presence of a Faulty Robot in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2017 Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults in ALGORITHMS FOR SENSOR SYSTEMS
  • 2017 Querying with Uncertainty in ALGORITHMS FOR SENSOR SYSTEMS
  • 2017 Patrolling Trees with Mobile Robots in FOUNDATIONS AND PRACTICE OF SECURITY
  • 2017 Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs in SOFSEM 2017: THEORY AND PRACTICE OF COMPUTER SCIENCE
  • 2017 Weak Coverage of a Rectangular Barrier in ALGORITHMS AND COMPLEXITY
  • 2017 Linear Search with Terrain-Dependent Speeds in ALGORITHMS AND COMPLEXITY
  • 2017 Search-and-Fetch with One Robot on a Disk in ALGORITHMS FOR SENSOR SYSTEMS
  • 2017 Searching for a Non-adversarial, Uncooperative Agent on a Cycle in ALGORITHMS FOR SENSOR SYSTEMS
  • 2017 Distributed Patrolling with Two-Speed Robots (and an Application to Transportation) in OPERATIONS RESEARCH AND ENTERPRISE SYSTEMS
  • 2016-10 Distributed algorithms for barrier coverage using relocatable sensors in DISTRIBUTED COMPUTING
  • 2016 Optimization Problems in Infrastructure Security in FOUNDATIONS AND PRACTICE OF SECURITY
  • 2016 Mobile Agents and Exploration in ENCYCLOPEDIA OF ALGORITHMS
  • 2016 Know When to Persist: Deriving Value from a Stream Buffer in ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT
  • 2016 Reconstructing Cactus Graphs from Shortest Path Information in ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT
  • 2015-08 Localization for a system of colliding robots in DISTRIBUTED COMPUTING
  • 2015-03 Monitoring the Plane with Rotating Radars in GRAPHS AND COMBINATORICS
  • 2015-03 Introduction to the Special Issue: Combinatorics and Geometry in GRAPHS AND COMBINATORICS
  • 2015 Plane and Planarity Thresholds for Random Geometric Graphs in ALGORITHMS FOR SENSOR SYSTEMS
  • 2015 Rendezvous of Many Agents with Different Speeds in a Cycle in AD-HOC, MOBILE, AND WIRELESS NETWORKS
  • 2015 Information Spreading by Mobile Particles on a Line in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2015 Wireless Autonomous Robot Evacuation from Equilateral Triangles and Squares in AD-HOC, MOBILE, AND WIRELESS NETWORKS
  • 2015 Optimal Online and Offline Algorithms for Robot-Assisted Restoration of Barrier Coverage in APPROXIMATION AND ONLINE ALGORITHMS
  • 2015 The Multi-source Beachcombers’ Problem in ALGORITHMS FOR SENSOR SYSTEMS
  • 2015 Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract) in ALGORITHMS AND COMPLEXITY
  • 2015 When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots in ALGORITHMS AND COMPUTATION
  • 2015 On the Displacement for Covering a Square with Randomly Placed Sensors in AD-HOC, MOBILE, AND WIRELESS NETWORKS
  • 2015 Localization of a Mobile Node in Shaded Areas in AD-HOC, MOBILE, AND WIRELESS NETWORKS
  • 2015 On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols in AUTOMATA, LANGUAGES, AND PROGRAMMING
  • 2015 Maintaining Intruder Detection Capability in a Rectangular Domain with Sensors in ALGORITHMS FOR SENSOR SYSTEMS
  • 2014-05 Editorial: Fun with Algorithms in THEORY OF COMPUTING SYSTEMS
  • 2014 Survivability of Swarms of Bouncing Robots in LATIN 2014: THEORETICAL INFORMATICS
  • 2014 Displacing Random Sensors to Avoid Interference in COMPUTING AND COMBINATORICS
  • 2014 Evacuating Robots via Unknown Exit in a Disk in DISTRIBUTED COMPUTING
  • 2014 Revisiting the Performance of the Modular Clock Algorithm for Distributed Blind Rendezvous in Cognitive Radio Networks in AD-HOC, MOBILE, AND WIRELESS NETWORKS
  • 2014 Excuse Me! or The Courteous Theatregoers’ Problem in FUN WITH ALGORITHMS
  • 2014 The Beachcombers’ Problem: Walking and Searching with Mobile Robots in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 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.34428.39", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "https://www.grid.ac/institutes/grid.248883.d", 
            "type": "Organization"
          }
        ], 
        "familyName": "Kranakis", 
        "givenName": "Evangelos", 
        "id": "sg:person.01015450242.93", 
        "identifier": {
          "name": "orcid_id", 
          "type": "PropertyValue", 
          "value": [
            "0000-0002-8959-4428"
          ]
        }, 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01015450242.93", 
          "https://orcid.org/0000-0002-8959-4428"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T14:57", 
        "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_661.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.01015450242.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.01015450242.93'

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...