The complexity of drawing a graph in a polygonal region (Q1725774): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963616416 / 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: 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: \(\forall\exists\mathbb {R}\)-completeness and area-universality / 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: Convex drawings of graphs with non-convex boundary constraints / 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: Q2978407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection graphs of segments / 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: ON EXTENDING A PARTIAL STRAIGHT-LINE DRAWING / 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: 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
Property / cites work
 
Property / cites work: Q3102944 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:14, 18 July 2024

scientific article
Language Label Description Also known as
English
The complexity of drawing a graph in a polygonal region
scientific article

    Statements

    The complexity of drawing a graph in a polygonal region (English)
    0 references
    0 references
    0 references
    0 references
    15 February 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references