Cover Image

Euclidean Maximum Matchings in the Plane---Local to Global

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Biniaz, Ahmad, Maheshwari, Anil, Smid, Michiel
Format:	Preprint
Published:	2024
Subjects:	Computational Geometry Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Completely Independent Steiner Trees
by: Maheshwari, Anil, et al.
Published: (2026)

On Separating Path and Tree Systems in Graphs
by: Biniaz, Ahmad, et al.
Published: (2023)

Maximum rectilinear convex subsets
by: González-Aguilar, Hernán, et al.
Published: (2019)

Further Connectivity Results on Plane Spanning Path Reconfiguration
by: Boucard, Valentino, et al.
Published: (2024)

Automated Mathematical Discovery and Verification: Minimizing Pentagons in the Plane
by: Subercaseaux, Bernardo, et al.
Published: (2023)

Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults
by: Biniaz, Ahmad, et al.
Published: (2024)

Structural Properties of Shortest Flip Sequences Between Plane Spanning Trees
by: Aichholzer, Oswin, et al.
Published: (2026)

Flipping Matchings is Hard
by: Binucci, Carla, et al.
Published: (2025)

Plane Strong Connectivity Augmentation
by: Bessy, Stéphane, et al.
Published: (2025)

Plane Hamiltonian Cycles in Convex Drawings
by: Bergold, Helena, et al.
Published: (2024)

Constrained Flips in Plane Spanning Trees
by: Aichholzer, Oswin, et al.
Published: (2025)

Algorithms for Euclidean Distance Matrix Completion: Exploiting Proximity to Triviality
by: Fomin, Fedor V., et al.
Published: (2026)

When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations
by: Bentert, Matthias, et al.
Published: (2025)

On the Connectivity of the Flip Graph of Plane Spanning Paths
by: Kleist, Linda, et al.
Published: (2024)

The Complexity of Intersection Graphs of Lines in Space and Circle Orders
by: Cardinal, Jean
Published: (2024)

Bounding the Treewidth of Outer $k$-Planar Graphs via Triangulations
by: Firman, Oksana, et al.
Published: (2024)

Disk and Partial Disk Inspection: Worst- to Average-Case and Pareto Upper Bounds
by: Conley, James, et al.
Published: (2024)

On maximum-sum matchings of bichromatic points
by: Chacón-Rivera, Oscar, et al.
Published: (2024)

The Price of Upwardness
by: Angelini, Patrizio, et al.
Published: (2024)

Efficient search of a minimum tree on points in a space with the $l_1$-norm
by: Kaymakov, K. V., et al.
Published: (2024)

Flip Paths Between Lattice Triangulations
by: Sims, William, et al.
Published: (2020)

Pathwidth of 2-Layer $k$-Planar Graphs
by: Okada, Yuto
Published: (2025)

Drawing Trees and Cacti with Integer Edge Lengths on a Polynomial-Size Grid
by: Förster, Henry, et al.
Published: (2025)

Linear Layouts of Graphs with Priority Queues
by: Di Giacomo, Emilio, et al.
Published: (2025)

Stable Homology-Based Cycle Centrality Measures
by: Manzanares, John Rick D., et al.
Published: (2022)

On RAC Drawings of Graphs with Two Bends per Edge
by: Tóth, Csaba D.
Published: (2023)

Sparse Bounded Hop-Spanners for Geometric Intersection Graphs
by: Bhore, Sujoy, et al.
Published: (2025)

Automated Symmetric Constructions in Discrete Geometry
by: Subercaseaux, Bernardo, et al.
Published: (2025)

Outerplanar and Forest Storyplans
by: Fiala, Jiří, et al.
Published: (2023)

Counting of Shortest Paths in Cubic Grid
by: Dutt, Mousumi, et al.
Published: (2018)

Polychromatic Coloring of Tuples in Hypergraphs
by: Biniaz, Ahmad, et al.
Published: (2025)

A Couple of Simple Algorithms for $k$-Dispersion
by: Chen, Ke, et al.
Published: (2025)

Efficient Algorithms and Implementations for Extracting Maximum-Size $(k,\ell)$-Sparse Subgraphs
by: Madarasi, Péter
Published: (2025)

Quadratic-Time Algorithm for the Maximum-Weight $(k, \ell)$-Sparse Subgraph Problem
by: Deák, Bence, et al.
Published: (2025)

Improved upper bounds for the Heilbronn's Problem for $k$-gons
by: Gajjala, Rishikesh, et al.
Published: (2024)

Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints
by: NASA Space Robots Team, et al.
Published: (2024)

Combinatorics of rectangulations: Old and new bijections
by: Asinowski, Andrei, et al.
Published: (2024)

Separable Drawings: Extendability and Crossing-Free Hamiltonian Cycles
by: Aichholzer, Oswin, et al.
Published: (2024)

Flipping Non-Crossing Spanning Trees
by: Bjerkevik, Håvard Bakke, et al.
Published: (2024)

Improved bounds for the bracketing number of orthants or revisiting an algorithm of Thiémard to compute bounds for the star discrepancy
by: Gnewuch, Michael
Published: (2024)