Danny Krizanc


Ontology type: schema:Person     


Person Info

NAME

Danny

SURNAME

Krizanc

Publications in SciGraph latest 50 shown

  • 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-03-13 Satisfying Neighbor Preferences on a Circle in LATIN 2018: THEORETICAL INFORMATICS
  • 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 Weak Coverage of a Rectangular Barrier in ALGORITHMS AND COMPLEXITY
  • 2017 Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs in SOFSEM 2017: THEORY AND PRACTICE OF COMPUTER SCIENCE
  • 2017 Linear Search with Terrain-Dependent Speeds in ALGORITHMS AND COMPLEXITY
  • 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-03 Monitoring the Plane with Rotating Radars in GRAPHS AND COMBINATORICS
  • 2015 Wireless Autonomous Robot Evacuation from Equilateral Triangles and Squares in AD-HOC, MOBILE, AND WIRELESS NETWORKS
  • 2015 Multi-Robot Foremost Coverage of Time-Varying Graphs in ALGORITHMS FOR SENSOR SYSTEMS
  • 2015 Optimal Online and Offline Algorithms for Robot-Assisted Restoration of Barrier Coverage in APPROXIMATION AND ONLINE ALGORITHMS
  • 2015 When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots in ALGORITHMS AND COMPUTATION
  • 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 Excuse Me! or The Courteous Theatregoers’ Problem in FUN WITH ALGORITHMS
  • 2014 DMVP: Foremost Waypoint Coverage of Time-Varying Graphs in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 2013-12 Asymptotic Number of Hairpins of Saturated RNA Secondary Structures in BULLETIN OF MATHEMATICAL BIOLOGY
  • 2013-06 Speedy speciation in a bacterial microcosm: new species can arise as frequently as adaptations within a species in THE ISME JOURNAL
  • 2013-01 Asymptotic structural properties of quasi-random saturated structures of RNA in ALGORITHMS FOR MOLECULAR BIOLOGY
  • 2013 Complexity of Barrier Coverage with Relocatable Sensors in the Plane in ALGORITHMS AND COMPLEXITY
  • 2012-12 On the page number of RNA secondary structures with pseudoknots in JOURNAL OF MATHEMATICAL BIOLOGY
  • 2012 Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points in LATIN 2012: THEORETICAL INFORMATICS
  • 2012 The Complexity of Minor-Ancestral Graph Properties with Forbidden Pairs in COMPUTER SCIENCE – THEORY AND APPLICATIONS
  • 2012-01 Maintaining Privacy on a Line in THEORY OF COMPUTING SYSTEMS
  • 2011 Encoding 2D Range Maximum Queries in ALGORITHMS AND COMPUTATION
  • 2010-11-08 Maintaining Connectivity in Sensor Networks Using Directional Antennae in THEORETICAL ASPECTS OF DISTRIBUTED COMPUTING IN SENSOR NETWORKS
  • 2010 The Urinal Problem in FUN WITH ALGORITHMS
  • 2010 Maximum Interference of Random Sensors on a Line in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2010 Strong Connectivity in Sensor Networks with Given Number of Directional Antennae of Bounded Angle in COMBINATORIAL OPTIMIZATION AND APPLICATIONS
  • 2010 Optimal Balancing of Satellite Queues in Packet Transmission to Ground Stations in COMBINATORIAL OPTIMIZATION AND APPLICATIONS
  • 2010 Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs in COMBINATORIAL OPTIMIZATION AND APPLICATIONS
  • 2010 On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment in AD-HOC, MOBILE AND WIRELESS NETWORKS
  • 2009 Detecting Denial of Service Attacks in Tor in FINANCIAL CRYPTOGRAPHY AND DATA SECURITY
  • 2009 Routing on Delay Tolerant Sensor Networks in ALGORITHMIC ASPECTS OF WIRELESS SENSOR NETWORKS
  • 2009 On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment in AD-HOC, MOBILE AND WIRELESS NETWORKS
  • 2008 Mobile Agents and Exploration in ENCYCLOPEDIA OF ALGORITHMS
  • 2008 Balancing Traffic Load Using One-Turn Rectilinear Routing in THEORY AND APPLICATIONS OF MODELS OF COMPUTATION
  • 2008 Randomized Rendez-Vous with Limited Memory in LATIN 2008: THEORETICAL INFORMATICS
  • 2008 The Power of Tokens: Rendezvous and Symmetry Detection for Two Mobile Agents in a Ring in SOFSEM 2008: THEORY AND PRACTICE OF COMPUTER SCIENCE
  • 2007 An Algorithmic Theory of Mobile Agents in TRUSTWORTHY GLOBAL COMPUTING
  • 2007 Estimating Bacterial Diversity from Environmental DNA: A Maximum Likelihood Approach in BIOINFORMATICS RESEARCH AND APPLICATIONS
  • 2006 Mobile Agent Rendezvous: A Survey 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.268117.b", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "https://www.grid.ac/institutes/grid.248883.d", 
            "type": "Organization"
          }, 
          {
            "id": "https://www.grid.ac/institutes/grid.34428.39", 
            "type": "Organization"
          }
        ], 
        "familyName": "Krizanc", 
        "givenName": "Danny", 
        "id": "sg:person.01200667100.87", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01200667100.87"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T14:44", 
        "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_485.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.01200667100.87'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...