Connecting the dots (with minimum crossings) (Q5088932): Difference between revisions

@@ label / en / label / en @@
+Connecting the dots (with minimum crossings)
@@ Property / cites work @@
+Approximating the bottleneck plane perfect matching of a point set
+Normal rank
@@ Property / cites work @@
+Bottleneck non-crossing matching in the plane
@@ Property / cites work: Bottleneck non-crossing matching in the plane / rank @@
+Normal rank
@@ Property / cites work @@
+Counting crossing-free structures
@@ Property / cites work: Counting crossing-free structures / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Multi-criteria One-Sided Boundary Labeling
+Normal rank
@@ Property / cites work @@
+Graph Drawing
@@ Property / cites work: Graph Drawing / rank @@
+Normal rank
@@ Property / cites work @@
+Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard
+Normal rank
@@ Property / cites work @@
+A Bottleneck Matching Problem with Edge-Crossing Constraints
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for drawing graphs: An annotated bibliography
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4796197
@@ Property / cites work: Q4796197 / rank @@
+Normal rank
@@ Property / cites work @@
+Drawing graphs in two layers
@@ Property / cites work: Drawing graphs in two layers / rank @@
+Normal rank
@@ Property / cites work @@
+Edge crossings in drawings of bipartite graphs
@@ Property / cites work: Edge crossings in drawings of bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of multiple-interval graph problems
+Normal rank
@@ Property / cites work @@
+Kernelization
@@ Property / cites work: Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Crossing Number is NP-Complete
@@ Property / cites work: Crossing Number is NP-Complete / rank @@
+Normal rank
@@ Property / cites work @@
+Computing crossing numbers in quadratic time
@@ Property / cites work: Computing crossing numbers in quadratic time / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability for Non-Crossing Spanning Trees
+Normal rank
@@ Property / cites work @@
+Crossing number is hard for cubic graphs
@@ Property / cites work: Crossing number is hard for cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Crossing Number is Hard for Kernelization
@@ Property / cites work: Crossing Number is Hard for Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of detecting crossingfree configurations in the plane
+Normal rank
@@ Property / cites work @@
+Graph drawing software
@@ Property / cites work: Graph drawing software / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549636
@@ Property / cites work: Q3549636 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5115821
@@ Property / cites work: Q5115821 / rank @@
+Normal rank
@@ Property / cites work @@
+Noncrossing Subgraphs in Topological Layouts
@@ Property / cites work: Noncrossing Subgraphs in Topological Layouts / rank @@
+Normal rank
@@ Property / cites work @@
+Node-Deletion NP-Complete Problems
@@ Property / cites work: Node-Deletion NP-Complete Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems
+Normal rank
@@ Property / cites work @@
+Q4606338
@@ Property / cites work: Q4606338 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal crossing-free Hamiltonian circuit drawings of \(K_n\)
+Normal rank
@@ Property / cites work @@
+The graph crossing number and its variants: a survey
+Normal rank
@@ Property / cites work @@
+On the Number of Crossing‐Free Matchings, Cycles, and Partitions
+Normal rank
@@ Property / cites work @@
+Counting and enumerating crossing-free geometric graphs
+Normal rank
@@ Property / cites work @@
+Swapping labeled tokens on graphs
@@ Property / cites work: Swapping labeled tokens on graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A New Exact Algorithm for the Two-Sided Crossing Minimization Problem
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.4230/LIPIcs.SoCG.2019.7
+Normal rank
@@ Property / OpenAlex ID @@
+W2946078147
@@ Property / OpenAlex ID: W2946078147 / rank @@
+Normal rank
@@ Property / title @@
+Connecting the dots (with minimum crossings) (English)
@@ Property / title: Connecting the dots (with minimum crossings) (English) / rank @@
+Normal rank