Cover Image

Flipping Matchings is Hard

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Binucci, Carla, Montecchiani, Fabrizio, Perz, Daniel, Tappini, Alessandra
Format:	Preprint
Published:	2025
Subjects:	Computational Geometry Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Flipping odd matchings in geometric and combinatorial settings
by: Aichholzer, Oswin, et al.
Published: (2025)

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

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

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

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

Euclidean Maximum Matchings in the Plane---Local to Global
by: Biniaz, Ahmad, et al.
Published: (2024)

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

From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs
by: Di Battista, Giuseppe, et al.
Published: (2021)

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)

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)

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

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

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

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

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)

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

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

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

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)

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)

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

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

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

Flip Distance of Triangulations of Convex Polygons / Rotation Distance of Binary Trees is NP-complete
by: Dorfer, Joseph
Published: (2026)

Internally-Convex Drawings of Outerplanar Graphs in Small Area
by: Bekos, Michael A., et al.
Published: (2025)

Note on the Number of Almost Ordinary Triangles
by: Dumitrescu, Adrian, et al.
Published: (2025)

On the Vertices of Delta-modular Polyhedra
by: Mikhail, Bludov, et al.
Published: (2025)

Bounds on the Number of Pieces in Continuous Piecewise Affine Functions
by: Zanotti, Leo
Published: (2025)

Investigating Simple Drawings of $K_n$ using SAT
by: Bergold, Helena, et al.
Published: (2025)

Multivariate Exploration of Metric Dilation
by: Banik, Aritra, et al.
Published: (2025)

Effective Sampling for Robot Motion Planning Through the Lens of Lattices
by: Panasoff, Itai, et al.
Published: (2025)

Witness Set in Monotone Polygons: Exact and Approximate
by: Das, Udvas, et al.
Published: (2025)

Arcs with increasing chords in $\mathbf{R}^d$
by: Dumitrescu, Adrian, et al.
Published: (2025)

On the geometric $k$-colored crossing number of $K_n$
by: Hahn, Benedikt, et al.
Published: (2025)