On Collinear Sets in Straight-Line Drawings (Q3104785): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-25870-1_27 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2138317300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial bound for untangling geometric planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Untangling polygons and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytic combinatorics of non-crossing configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On triconnected and cubic plane graphs on given point sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3656240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Untangling a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortness exponents of families of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest cycles in 3-connected cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Untangling planar graphs from a specified vertex position-Hard cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2726740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Untangling a polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Collinear Sets in Straight-Line Drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the obfuscation complexity of planar graphs / rank
 
Normal rank

Latest revision as of 18:40, 4 July 2024

scientific article
Language Label Description Also known as
English
On Collinear Sets in Straight-Line Drawings
scientific article

    Statements

    On Collinear Sets in Straight-Line Drawings (English)
    0 references
    0 references
    0 references
    16 December 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    allocation problem
    0 references
    straight-line drawing
    0 references
    planarity
    0 references
    NP-hardness
    0 references
    hardness of approximation
    0 references
    moving vertices
    0 references
    untangling
    0 references
    point-set embeddability
    0 references
    0 references