Convex Polygons in Geometric Triangulations (Q3449827): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Csaba D. Tóth / rank
Normal rank
 
Property / author
 
Property / author: Csaba D. Tóth / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2156083238 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1411.1303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of plane geometric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing-Free Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting crossing-free structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple aggregative algorithm for counting triangulations of planar point sets and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting triangulations and other crossing-free structures approximately / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Cycles in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the Maximum Multiplicity of Some Common Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Polygons in Geometric Triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding minimum area \(k\)-gons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3207683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the number of crossing-free subgraphs of \(K_N\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Many Potatoes Are in a Mesh? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting carambolas / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdos-Szekeres problem on points in convex position – a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number of Crossing-Free Geometric Graphs vs. Triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Plane Graphs with Exponential Speed-Up / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid discretization of the Signorini problem with Coulomb friction. Theoretical aspects and comparison of some numerical solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Plane Graphs: Cross-Graph Charging Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Crossing‐Free Matchings, Cycles, and Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting and Enumerating Crossing-free Geometric Graphs / rank
 
Normal rank

Latest revision as of 23:25, 10 July 2024

scientific article
Language Label Description Also known as
English
Convex Polygons in Geometric Triangulations
scientific article

    Statements

    Convex Polygons in Geometric Triangulations (English)
    0 references
    0 references
    0 references
    30 October 2015
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references