Compatible geometric matchings (Q924079): Difference between revisions

@@ Property / DOI @@
-.1016/j.comgeo.2008.12.005
@@ Property / DOI: 10.1016/j.comgeo.2008.12.005 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2138849026
@@ Property / OpenAlex ID: W2138849026 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.3375
@@ Property / arXiv ID: 0709.3375 / rank @@
+Normal rank
@@ Property / cites work @@
+Augmenting the connectivity of geometric graphs
@@ Property / cites work: Augmenting the connectivity of geometric graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Transforming spanning trees and pseudo-triangulations
+Normal rank
@@ Property / cites work @@
+Sequences of spanning trees and a fixed tree theorem
+Normal rank
@@ Property / cites work @@
+A generalization of the Erdös-Szekeres convex n-gon theorem.
+Normal rank
@@ Property / cites work @@
+Convexly independent sets
@@ Property / cites work: Convexly independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+Every set of disjoint line segments admits a binary tree
+Normal rank
@@ Property / cites work @@
+Transforming spanning trees: A lower bound
@@ Property / cites work: Transforming spanning trees: A lower bound / rank @@
+Normal rank
@@ Property / cites work @@
+An orientation theorem with parity conditions
@@ Property / cites work: An orientation theorem with parity conditions / rank @@
+Normal rank
@@ Property / cites work @@
+Graph orientations with edge-connection and parity constraints
+Normal rank
@@ Property / cites work @@
+Algorithm Theory - SWAT 2004
@@ Property / cites work: Algorithm Theory - SWAT 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Alternating paths through disjoint line segments
@@ Property / cites work: Alternating paths through disjoint line segments / rank @@
+Normal rank
@@ Property / cites work @@
+Segment endpoint visibility graphs are Hamiltonian
+Normal rank
@@ Property / cites work @@
+Graphs of triangulations and perfect matchings
@@ Property / cites work: Graphs of triangulations and perfect matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian triangulations and circumscribing polygons of disjoint line segments
+Normal rank
@@ Property / cites work @@
+Edge-Disjoint Spanning Trees of Finite Graphs
@@ Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3799261
@@ Property / cites work: Q3799261 / rank @@
+Normal rank
@@ Property / cites work @@
+On circumscribing polygons for line segments
@@ Property / cites work: On circumscribing polygons for line segments / rank @@
+Normal rank
@@ Property / cites work @@
+Canonical theorems for convex sets
@@ Property / cites work: Canonical theorems for convex sets / rank @@
+Normal rank
@@ Property / cites work @@
+Erdős-Szekeres-type theorems for segments and noncrossing convex sets
+Normal rank
@@ Property / cites work @@
+Computing Simple Circuits from a Set of Line Segments is NP-Complete
+Normal rank
@@ Property / cites work @@
+Computing simple circuits from a set of line segments
+Normal rank
@@ Property / cites work @@
+Alternating paths along axis-parallel segments
@@ Property / cites work: Alternating paths along axis-parallel segments / rank @@
+Normal rank
@@ Property / cites work @@
+Finding convex sets in convex positions
@@ Property / cites work: Finding convex sets in convex positions / rank @@
+Normal rank
@@ Property / cites work @@
+On the Problem of Decomposing a Graph into <i>n</i>  Connected Factors
+Normal rank
@@ Property / cites work @@
+On a counterexample to a conjecture of Mirzaian
@@ Property / cites work: On a counterexample to a conjecture of Mirzaian / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.COMGEO.2008.12.005
@@ Property / DOI: 10.1016/J.COMGEO.2008.12.005 / rank @@
+Normal rank