Image de couverture de livre

Finding maximum matchings in RDV graphs efficiently

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Biedl, Therese, Gokhale, Prashant
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

Using Ray-shooting Queries for Sublinear Algorithms for Dominating Sets in RDV Graphs
par: Biedl, Therese, et autres
Publié: (2026)

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

Face-hitting dominating sets in planar graphs: Alternative proof and linear-time algorithm
par: Biedl, Therese
Publié: (2025)

Adversarially Robust Approximate Furthest Neighbor
par: Banihashem, Kiarash, et autres
Publié: (2026)

Computing Vertex and Edge Connectivity of Graphs Embedded with Crossings
par: Biedl, Therese, et autres
Publié: (2024)

Finding a Largest-Area Triangle in a Terrain in Near-Linear Time
par: Cabello, Sergio, et autres
Publié: (2021)

Local Routing on Ordered $Θ$-graphs
par: van Renssen, André, et autres
Publié: (2025)

Dynamic parameterized problems on unit disk graphs
par: An, Shinwoo, et autres
Publié: (2024)

A dynamic $(1+\varepsilon)$-spanner for disk intersection graphs
par: de Berg, Sarita, et autres
Publié: (2026)

A face cover perspective to $\ell_1$ embeddings of planar graphs
par: Filtser, Arnold
Publié: (2019)

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

Sequential non-determinism in tile self-assembly: a general framework and an application to efficient temperature-1 self-assembly of squares
par: Furcy, David, et autres
Publié: (2024)

Finding sparse induced subgraphs on graphs of bounded induced matching treewidth
par: Bodlaender, Hans L., et autres
Publié: (2025)

Balancing expression dags for more efficient lazy adaptive evaluation
par: Wilhelm, Martin
Publié: (2017)

Certifying Euclidean Sections and Finding Planted Sparse Vectors Beyond the $\sqrt{n}$ Dimension Threshold
par: Guruswami, Venkatesan, et autres
Publié: (2024)

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

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)

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

Computing Diameter +1 in Truly Subquadratic Time for Unit-Disk Graphs
par: Chang, Hsien-Chih, 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)

Weakly Leveled Planarity with Bounded Span
par: Bekos, Michael, et autres
Publié: (2024)

Dynamic Unit-Disk Range Reporting
par: Wang, Haitao, et autres
Publié: (2024)

Data Structures for Range Sorted Consecutive Occurrence Queries
par: Akram, Waseem, et autres
Publié: (2024)

New Complexity and Algorithmic Bounds for Minimum Consistent Subsets
par: Banik, Aritra, et autres
Publié: (2024)

Euclidean distance compression via deep random features
par: Leroux, Brett, et autres
Publié: (2024)

An $O(n \log n)$-Time Approximation Scheme for Geometric Many-to-Many Matching
par: Bandyapadhyay, Sayan, et autres
Publié: (2024)

Constrained Level Planarity is FPT with Respect to the Vertex Cover Number
par: Klemz, Boris, et autres
Publié: (2024)

Unweighted Geometric Hitting Set for Line-Constrained Disks and Related Problems
par: Liu, Gang, et autres
Publié: (2024)

NP-hardness and a PTAS for the Euclidean Steiner Line Problem
par: Bartlmae, Simon, et autres
Publié: (2024)