Imagen de Portada

Segment Intersection Representations, Level Planarity and Constrained Ordering Problems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Fink, Simon D., Pfretzschner, Matthias, Stumpf, Peter
Formato:	Preprint
Publicado:	2025
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)

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

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

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

A Simple Partially Embedded Planarity Test Based on Vertex-Addition
por: Fink, Simon D., et al.
Publicado: (2024)

Unbent Collections of Orthogonal Drawings
por: Antić, Todor, et al.
Publicado: (2025)

Saturated Drawings of Geometric Thickness k
por: Bachmann, Patricia, et al.
Publicado: (2025)

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

Computing the Girth of a Segment Intersection Graph
por: Chan, Timothy M., et al.
Publicado: (2026)

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

Subset Selection Problems in Planar Point Sets
por: Balogh, József, et al.
Publicado: (2024)

Star-Based Separators for Intersection Graphs of $c$-Colored Pseudo-Segments
por: de Berg, M., et al.
Publicado: (2025)

Bowties and Hourglasses: Intersections of Double-Wedges (or Stabbing and Avoiding Line Segments)
por: Bertschinger, Daniel, et al.
Publicado: (2026)

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

Two Results on Outer-String Graphs
por: Antić, Todor, et al.
Publicado: (2026)

Constrained Two-Line Center Problems
por: Ahn, Taehoon, et al.
Publicado: (2024)

Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems
por: Agarwal, Pankaj K., et al.
Publicado: (2022)

A Robust Approach to Detect Intersections between Triangles with Different Numerical Representations
por: Garau, Luca, et al.
Publicado: (2025)

On the Complexity of the Ordered Covering Problem in Distance Geometry
por: Souza, Michael, et al.
Publicado: (2025)

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

Robust Algorithms for Path and Cycle Problems in Geometric Intersection Graphs
por: Marin, Malory, et al.
Publicado: (2025)

Dominating Set, Independent Set, Discrete $k$-Center, Dispersion, and Related Problems for Planar Points in Convex Position
por: Tkachenko, Anastasiia, et al.
Publicado: (2024)

Hop-Spanners for Geometric Intersection Graphs
por: Conroy, Jonathan B., et al.
Publicado: (2021)

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

Smallest Intersecting and Enclosing Balls
por: Zheng, Jiaqi, et al.
Publicado: (2025)

Eliminating Crossings in Ordered Graphs
por: Agrawal, Akanksha, 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)

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

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)

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

Planar Network Diversion
por: Bentert, Matthias, et al.
Publicado: (2025)

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

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

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

The Impossibility of Simultaneous Time and I/O Optimality for The Planar Maxima and Convex Hull Problems
por: Afshani, Peyman, et al.
Publicado: (2026)

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

Approximating Densest Subgraph in Geometric Intersection Graphs
por: Har-Peled, Sariel, et al.
Publicado: (2024)

On Zarankiewicz's Problem for Intersection Hypergraphs of Geometric Objects
por: Chan, Timothy M., et al.
Publicado: (2024)