Imagen de Portada

A Simple Partially Embedded Planarity Test Based on Vertex-Addition

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Fink, Simon D., Rutter, Ignaz, P, Sandhya T.
Formato:	Preprint
Publicado:	2024
Materias:	Computational Geometry
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Clustered Planarity Variants for Level Graphs
por: Fink, Simon D., et al.
Publicado: (2024)

Upward Book Embeddings of Partitioned Digraphs
por: Da Lozzo, Giordano, et al.
Publicado: (2026)

Parameterized Complexity of Simultaneous Planarity
por: Fink, Simon D., et al.
Publicado: (2023)

Upward-Planar Drawings with Bounded Span
por: Angelini, Patrizio, et al.
Publicado: (2026)

Crossing Number of 3-Plane Drawings
por: Goetze, Miriam, et al.
Publicado: (2025)

Weakly Leveled Planarity with Bounded Span
por: Bekos, Michael, et al.
Publicado: (2024)

On $k$-Plane Insertion into Plane Drawings
por: Katheder, Julia, et al.
Publicado: (2024)

Level Planarity Is More Difficult Than We Thought
por: Fink, Simon D., et al.
Publicado: (2024)

Segment Intersection Representations, Level Planarity and Constrained Ordering Problems
por: Fink, Simon D., et al.
Publicado: (2025)

Dispersive Vertex Guarding for Simple and Non-Simple Polygons
por: Fekete, Sándor P., et al.
Publicado: (2024)

A Simple Proof of the Existence of a Planar Separator
por: Har-Peled, Sariel
Publicado: (2011)

Constrained Level Planarity is FPT with Respect to the Vertex Cover Number
por: Klemz, Boris, et al.
Publicado: (2024)

Ranking and Unranking of the Planar Embeddings of a Planar Graph
por: Di Battista, Giuseppe, et al.
Publicado: (2024)

The Price of Upwardness
por: Angelini, Patrizio, et al.
Publicado: (2024)

Upward Pointset Embeddings of Planar st-Graphs
por: Alegria, Carlos, et al.
Publicado: (2024)

Evolutionary Algorithms for One-Sided Bipartite Crossing Minimisation
por: Baumann, Jakob, et al.
Publicado: (2024)

The Price of Connectivity Augmentation on Planar Graphs
por: Akitaya, Hugo A., et al.
Publicado: (2025)

Reweighted Spectral Partitioning Works: A Simple Algorithm for Vertex Separators in Special Graph Classes
por: Spalding-Jamieson, Jack
Publicado: (2025)

Fully Dynamic Geometric Vertex Cover and Matching
por: Bhore, Sujoy, et al.
Publicado: (2024)

Circle graphs can be recognized in linear time
por: Paul, Christophe, et al.
Publicado: (2025)

Garment numbers of bi-colored point sets in the plane
por: Aichholzer, Oswin, et al.
Publicado: (2026)

The Parameterized Complexity of Extending Stack Layouts
por: Depian, Thomas, et al.
Publicado: (2024)

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms
por: Depian, Thomas, et al.
Publicado: (2025)

The Peculiarities of Extending Queue Layouts
por: Depian, Thomas, et al.
Publicado: (2025)

Polyhedral Collision Detection via Vertex Enumeration
por: Cinar, Andrew, et al.
Publicado: (2025)

Realizing Planar Linkages in Polygonal Domains
por: Depian, Thomas, et al.
Publicado: (2026)

Fréchet Distance in Unweighted Planar Graphs
por: van der Hoog, Ivor, et al.
Publicado: (2025)

VQhull: a Fast Planar Quickhull
por: Koopman, Thomas, et al.
Publicado: (2025)

Pathways to Tractability for Geometric Thickness
por: Depian, Thomas, et al.
Publicado: (2024)

Optimal Algorithm for the Planar Two-Center Problem
por: Cho, Kyungjin, et al.
Publicado: (2020)

Computing Planar Convex Hulls with a Promise
por: Aghamolaei, Sepideh, et al.
Publicado: (2026)

Planar Stories of Graph Drawings: Algorithms and Experiments
por: Binucci, Carla, et al.
Publicado: (2025)

The Parameterized Complexity of Geometric 1-Planarity
por: Firbas, Alexander
Publicado: (2026)

Categorizing Merge Tree Edit Distances by Stability using Minimal Vertex Perturbation
por: Wetzels, Florian, et al.
Publicado: (2025)

Constrained and Ordered Level Planarity Parameterized by the Number of Levels
por: Blažej, Václav, et al.
Publicado: (2024)

Parallel Graph Drawing Algorithm for Bipartite Planar Graphs
por: Jain, Naman
Publicado: (2024)

Arc Spline Approximation of Envelopes of Evolving Planar Domains
por: Vráblíková, Jana, et al.
Publicado: (2025)

SimpleSets: Capturing Categorical Point Patterns with Simple Shapes
por: Broek, Steven van den, et al.
Publicado: (2024)

Approximately: Independence Implies Vertex Cover
por: Har-Peled, Sariel
Publicado: (2023)

A Combinatorial Proof of Universal Optimality for Computing a Planar Convex Hull
por: van der Hoog, Ivor, et al.
Publicado: (2025)