RAC-Drawability is ∃ℝ-complete and Related Results (Q6181953): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.7155/jgaa.00646 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.7155/jgaa.00646 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4389318424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Art Gallery Problem is ∃ℝ-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On RAC drawings of graphs with one bend per edge / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Perspectives Opened by Right Angle Crossing Drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Straight-Line RAC Drawing Problem is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs that admit right angle crossing drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On RAC drawings of 1-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing and drawing IC-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of some problems of linear algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition and complexity of point visibility graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Area, curve complexity, and crossing resolution of non-planar graph drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Right Angle Crossing Drawings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing graphs with right angle crossings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Crossing-Angle Resolution in Graph Drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on large angle crossing graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5874523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Intrinsic Spread of a Configuration in R d / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving systems of polynomial inequalities in subexponential time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of the Planar Slope Number Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3819622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing integers among rational numbers with a universal-existential formula / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mnëv's universality theorem revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Geometric k-Planarity for Fixed k / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Angular Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed points, Nash equilibria, and the existential theory of the reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3974991 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.7155/JGAA.00646 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:12, 30 December 2024

scientific article; zbMATH DE number 7781101
Language Label Description Also known as
English
RAC-Drawability is ∃ℝ-complete and Related Results
scientific article; zbMATH DE number 7781101

    Statements

    RAC-Drawability is ∃ℝ-complete and Related Results (English)
    0 references
    0 references
    20 December 2023
    0 references
    RAC-drawing
    0 references
    junctions
    0 references
    0 references
    0 references
    0 references

    Identifiers