Csaba D Tóth


Ontology type: schema:Person     


Person Info

NAME

Csaba D

SURNAME

Tóth

Publications in SciGraph latest 50 shown

  • 2018-08 Monotone Paths in Geometric Triangulations in THEORY OF COMPUTING SYSTEMS
  • 2018-03-31 Online Unit Clustering in Higher Dimensions in APPROXIMATION AND ONLINE ALGORITHMS
  • 2018-03-13 Transition Operations over Plane Trees in LATIN 2018: THEORETICAL INFORMATICS
  • 2018-01-21 Gap-Planar Graphs in GRAPH DRAWING AND NETWORK VISUALIZATION
  • 2018 Crossing Minimization in Perturbed Drawings in GRAPH DRAWING AND NETWORK VISUALIZATION
  • 2018 Online Unit Covering in Euclidean Space in COMBINATORIAL OPTIMIZATION AND APPLICATIONS
  • 2017-12 Recognizing Weakly Simple Polygons in DISCRETE & COMPUTATIONAL GEOMETRY
  • 2017-04 General position subsets and independent hyperplanes in d-space in JOURNAL OF GEOMETRY
  • 2017 Constant-Factor Approximation for TSP with Disks in A JOURNEY THROUGH DISCRETE MATHEMATICS
  • 2017 Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs in WALCOM: ALGORITHMS AND COMPUTATION
  • 2016-12 Diffuse Reflection Radius in a Simple Polygon in ALGORITHMICA
  • 2016-05 Counting Carambolas in GRAPHS AND COMBINATORICS
  • 2016 Multi-colored Spanning Graphs in GRAPH DRAWING AND NETWORK VISUALIZATION
  • 2016 Monotone Paths in Geometric Triangulations in COMBINATORIAL ALGORITHMS
  • 2015-10 On the total perimeter of homothetic convex bodies in a convex container in BEITRÄGE ZUR ALGEBRA UND GEOMETRIE / CONTRIBUTIONS TO ALGEBRA AND GEOMETRY
  • 2015-07 Free Edge Lengths in Plane Graphs in DISCRETE & COMPUTATIONAL GEOMETRY
  • 2015-03 Geometric Biplane Graphs I: Maximal Graphs in GRAPHS AND COMBINATORICS
  • 2015-03 Geometric Biplane Graphs II: Graph Augmentation in GRAPHS AND COMBINATORICS
  • 2015-02 The Szemerédi-Trotter theorem in the complex plane in COMBINATORICA
  • 2015-02 Packing anchored rectangles in COMBINATORICA
  • 2015 Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees in GRAPH DRAWING AND NETWORK VISUALIZATION
  • 2015 Binary Space Partitions in ENCYCLOPEDIA OF ALGORITHMS
  • 2015 Convex Polygons in Geometric Triangulations in ALGORITHMS AND DATA STRUCTURES
  • 2015 On the Number of Anchored Rectangle Packings for a Planar Point Set in COMPUTING AND COMBINATORICS
  • 2015 Linear-Size Universal Point Sets for One-Bend Drawings in GRAPH DRAWING AND NETWORK VISUALIZATION
  • 2015 Augmenting Planar Straight Line Graphs to 2-Edge-Connectivity in GRAPH DRAWING AND NETWORK VISUALIZATION
  • 2015 Graduate Workshop Recent Trends in Graph Drawing: Curves, Graphs, and Intersections in GRAPH DRAWING AND NETWORK VISUALIZATION
  • 2014-07 Vertex-Colored Encompassing Graphs in GRAPHS AND COMBINATORICS
  • 2014-03 Covering Paths for Planar Point Sets in DISCRETE & COMPUTATIONAL GEOMETRY
  • 2014-02 Relative Convex Hulls in Semi-Dynamic Arrangements in ALGORITHMICA
  • 2014 Diffuse Reflection Radius in a Simple Polygon in COMPUTING AND COMBINATORICS
  • 2014 The Flip Diameter of Rectangulations and Convex Subdivisions in LATIN 2014: THEORETICAL INFORMATICS
  • 2014 Disjoint Edges in Topological Graphs and the Tangled-Thrackle Conjecture in PROGRESS IN PATTERN RECOGNITION, IMAGE ANALYSIS, COMPUTER VISION, AND APPLICATIONS
  • 2013 Planar Packing of Binary Trees in ALGORITHMS AND DATA STRUCTURES
  • 2013 Universal Point Sets for Planar Three-Trees in ALGORITHMS AND DATA STRUCTURES
  • 2013 Plane Geometric Graph Augmentation: A Generic Perspective in THIRTY ESSAYS ON GEOMETRIC GRAPH THEORY
  • 2013 Monotone Paths in Planar Convex Subdivisions and Polytopes in DISCRETE GEOMETRY AND OPTIMIZATION
  • 2013 Counting Plane Graphs: Flippability and Its Applications in THIRTY ESSAYS ON GEOMETRIC GRAPH THEORY
  • 2013-01 Disjoint Compatible Geometric Matchings in DISCRETE & COMPUTATIONAL GEOMETRY
  • 2013 Covering Paths for Planar Point Sets in GRAPH DRAWING
  • 2013 On the Total Perimeter of Homothetic Convex Bodies in a Convex Container in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2013 Constrained Tri-Connected Planar Straight Line Graphs in THIRTY ESSAYS ON GEOMETRIC GRAPH THEORY
  • 2013 On the Upward Planarity of Mixed Plane Graphs in GRAPH DRAWING
  • 2012 Simultaneously Flippable Edges in Triangulations in COMPUTATIONAL GEOMETRY
  • 2012 Crossing Angles of Geometric Graphs in COMBINATORIAL OPTIMIZATION AND APPLICATIONS
  • 2012 Long-Term Pavement Performance Evaluation in 7TH RILEM INTERNATIONAL CONFERENCE ON CRACKING IN PAVEMENTS
  • 2012 Open Guard Edges and Edge Guards in Simple Polygons in COMPUTATIONAL GEOMETRY
  • 2012 Monotone Paths in Planar Convex Subdivisions in COMPUTING AND COMBINATORICS
  • 2012 Conflict-Free Graph Orientations with Parity Constraints in FUN WITH ALGORITHMS
  • 2012 Upper Bound Constructions for Untangling Planar Geometric Graphs in GRAPH DRAWING
  • 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.253563.4", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "https://www.grid.ac/institutes/grid.429997.8", 
            "type": "Organization"
          }, 
          {
            "id": "https://www.grid.ac/institutes/grid.22072.35", 
            "type": "Organization"
          }
        ], 
        "familyName": "T\u00f3th", 
        "givenName": "Csaba D", 
        "id": "sg:person.011373745067.01", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011373745067.01"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:59", 
        "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_1754.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.011373745067.01'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...