Image de couverture de livre

Computing crossing numbers with topological and geometric restrictions

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Hamm, Thekla, Klute, Fabian, Parada, Irene
Format:	Preprint
Publié:	2024
Sujets:	Computational Geometry Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Dichotomy for 1-Planarity with Restricted Crossing Types Parameterized by Treewidth
par: Cabello, Sergio, et autres
Publié: (2025)

Algorithms for Distance Problems in Continuous Graphs
par: Cabello, Sergio, et autres
Publié: (2025)

The Complexity of Geodesic Spanners using Steiner Points
par: de Berg, Sarita, et autres
Publié: (2024)

A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs
par: Hamm, Thekla, et autres
Publié: (2026)

Faster exponential algorithms for cut problems via geometric data structures
par: Kozma, László, et autres
Publié: (2025)

Subexponential algorithms in geometric graphs via the subquadratic grid minor property: the role of local radius
par: Berthe, Gaétan, et autres
Publié: (2023)

Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time
par: Eppstein, David
Publié: (2023)

Geometric Thickness of Multigraphs is $\exists \mathbb{R}$-complete
par: Förster, Henry, et autres
Publié: (2023)

Computing Diverse and Nice Triangulations
par: Gálvez, Waldo, et autres
Publié: (2025)

Algorithms for Computing Closest Points for Segments
par: Wang, Haitao
Publié: (2024)

Computing Maximum Cliques in Unit Disk Graphs
par: Tkachenko, Anastasiia, et autres
Publié: (2025)

Computing largest minimum color-spanning intervals of imprecise points
par: Acharyya, Ankush, et autres
Publié: (2024)

Learning with Structure: Computing Consistent Subsets on Structurally-Regular Graphs
par: Banik, Aritra, et autres
Publié: (2025)

Computing Dominating Sets in Disk Graphs with Centers in Convex Position
par: Tkachenko, Anastasiia, et autres
Publié: (2026)

Computing Diameter +1 in Truly Subquadratic Time for Unit-Disk Graphs
par: Chang, Hsien-Chih, et autres
Publié: (2024)

An Algorithm for Fast and Correct Computation of Reeb Spaces for PL Bivariate Fields
par: Chattopadhyay, Amit, et autres
Publié: (2024)

Charting the Diameter Computation Landscape of Geometric Intersection Graphs in Three Dimensions and Higher
par: Chan, Timothy M., et autres
Publié: (2026)

An Algorithmic Solution for Computing Circle Intersection Areas and its Applications to Wireless Communications
par: Librino, Federico, et autres
Publié: (2012)

An Improved FPT Algorithm for Computing the Interleaving Distance between Merge Trees via Path-Preserving Maps
par: P V, Althaf, et autres
Publié: (2026)

Near-tight Bounds for Computing the Fréchet Distance in d-Dimensional Grid Graphs and the Implications for λ-low Dense Curves
par: Conradi, Jacobus, et autres
Publié: (2026)

On Computing Vertex Connectivity of 1-Plane Graphs
par: Biedl, Therese, et autres
Publié: (2022)

Computational Complexities of Folding
par: Eppstein, David
Publié: (2024)

The Complexity of Temporal Vertex Cover in Small-Degree Graphs
par: Hamm, Thekla, et autres
Publié: (2022)

Beyond Bits: An Introduction to Computation over the Reals
par: Miltzow, Tillmann
Publié: (2026)

Internal versus external balancing in the evaluation of graph-based number types
par: Geppert, Hanna, et autres
Publié: (2019)

Computational Hardness of Private Coreset
par: Ghazi, Badih, et autres
Publié: (2026)

Approximation Algorithms for Smallest Intersecting Balls
par: Zheng, Jiaqi, et autres
Publié: (2024)

On Approximating the Weighted Region Problem in Square Tessellations
par: Kakimura, Naonori, et autres
Publié: (2024)

Online sorting and online TSP: randomized, stochastic, and high-dimensional
par: Abrahamsen, Mikkel, et autres
Publié: (2024)

Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3
par: Lokshtanov, Daniel, et autres
Publié: (2024)

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers
par: Bhore, Sujoy, et autres
Publié: (2024)

A Subquadratic Time Approximation Algorithm for Individually Fair k-Center
par: Ebbens, Matthijs, et autres
Publié: (2024)

Extraction Theorems With Small Extraction Numbers
par: Agarwal, Arjun, et autres
Publié: (2024)

Fréchet Distance in Subquadratic Time
par: Cheng, Siu-Wing, et autres
Publié: (2024)

Finding maximum matchings in RDV graphs efficiently
par: Biedl, Therese, et autres
Publié: (2024)

Maintaining Light Spanners via Minimal Updates
par: Khodabandeh, Hadi, et autres
Publié: (2024)

An Improved Algorithm for Shortest Paths in Weighted Unit-Disk Graphs
par: Brewer, Bruce W., et autres
Publié: (2024)

Top-k Stabbing Interval Queries
par: Akram, Waseem, et autres
Publié: (2024)

Simple Grid Polygon Online Exploration Revisited
par: Brock, Maximilian, et autres
Publié: (2024)

Sparse Outerstring Graphs Have Logarithmic Treewidth
par: An, Shinwoo, et autres
Publié: (2024)