Complexity results on untangling red-blue matchings (Q6101837): Difference between revisions

@@ Property / cites work @@
+Flips in planar graphs
@@ Property / cites work: Flips in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Flip distance to some plane configurations
@@ Property / cites work: Flip distance to some plane configurations / rank @@
+Normal rank
@@ Property / cites work @@
+Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP
+Normal rank
@@ Property / cites work @@
+The Number of Flips Required to Obtain Non-crossing Convex Cycles
+Normal rank
@@ Property / cites work @@
+On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
+Normal rank
@@ Property / cites work @@
+On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph  II.  Uniqueness
+Normal rank
@@ Property / cites work @@
+Transforming Graphs with the Same Degree Sequence
@@ Property / cites work: Transforming Graphs with the Same Degree Sequence / rank @@
+Normal rank
@@ Property / cites work @@
+On the Swap-Distances of Different Realizations of a Graphical Degree Sequence
+Normal rank
@@ Property / cites work @@
+Switching Distance Between Graphs with the Same Degrees
+Normal rank
@@ Property / cites work @@
+Approximating Shortest Connected Graph Transformation for Trees
+Normal rank
@@ Property / cites work @@
+Introduction to reconfiguration
@@ Property / cites work: Introduction to reconfiguration / rank @@
+Normal rank
@@ Property / cites work @@
+Flipping edges in triangulations
@@ Property / cites work: Flipping edges in triangulations / rank @@
+Normal rank
@@ Property / cites work @@
+Transforming triangulations
@@ Property / cites work: Transforming triangulations / rank @@
+Normal rank
@@ Property / cites work @@
+Flip distance between two triangulations of a point set is NP-complete
+Normal rank
@@ Property / cites work @@
+Flip distance between triangulations of a planar point set is APX-hard
+Normal rank
@@ Property / cites work @@
+Flip distance between triangulations of a simple polygon is NP-complete
+Normal rank
@@ Property / cites work @@
+The Perfect Matching Reconfiguration Problem
@@ Property / cites work: The Perfect Matching Reconfiguration Problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of reconfiguration problems
@@ Property / cites work: On the complexity of reconfiguration problems / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of change
@@ Property / cites work: The complexity of change / rank @@
+Normal rank
@@ Property / cites work @@
+Applications of a semi-dynamic convex hull algorithm
+Normal rank
@@ Property / cites work @@
+Q3360902
@@ Property / cites work: Q3360902 / rank @@
+Normal rank
@@ Property / cites work @@
+OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE
+Normal rank
@@ Property / cites work @@
+A matching problem in the plane
@@ Property / cites work: A matching problem in the plane / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:6101837