The Complexity of Drawing a Graph in a Polygonal Region (Q5050006): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Who Needs Crossings? Hardness of Plane Graph Rigidity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irrational Guards are Sometimes Needed / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Art Gallery Problem is ∃ℝ-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Planarity of Partially Embedded Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-link watchman tours / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some provably hard crossing number problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Simultaneous Geometric Graph Embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing Partially Embedded and Simultaneously Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing graphs on few lines and few planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5786239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete one-forms on meshes and applications to 3D mesh parameterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4097031 / 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: Convex drawings of graphs with non-convex boundary constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Kuratowski-type theorem for planarity of partially embedded graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sphere and dot product representations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2978407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection graphs of segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple realizability of complete abstract topological graphs simplified / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of drawing a graph in a polygonal region / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer realizations of disk and segment graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending convex partial drawings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-link paths among obstacles in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3819622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variants of the segment number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON EXTENDING A PARTIAL STRAIGHT-LINE DRAWING / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mnëv's universality theorem revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Some Geometric and Topological Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thirty Essays on Geometric Graph Theory / 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: On the Complexity of Some Geometric Problems With Fixed Parameters / 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: Q3138887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for minimum link paths inside a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Representations of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Draw a Graph / rank
 
Normal rank

Latest revision as of 20:29, 30 July 2024

scientific article; zbMATH DE number 7616349
Language Label Description Also known as
English
The Complexity of Drawing a Graph in a Polygonal Region
scientific article; zbMATH DE number 7616349

    Statements

    The Complexity of Drawing a Graph in a Polygonal Region (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 November 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references