Pages that link to "Item:Q3546362"
From MaRDI portal
The following pages link to Minimum-weight triangulation is NP-hard (Q3546362):
Displaying 50 items.
- The complexity of separating points in the plane (Q262254) (← links)
- On plane geometric spanners: a survey and open problems (Q359741) (← links)
- Fast-mixed searching and related problems on graphs (Q393051) (← links)
- Matching colored points with rectangles (Q511687) (← links)
- Binary pattern tile set synthesis is NP-hard (Q527409) (← links)
- Minimum weight convex Steiner partitions (Q548652) (← links)
- On minimum weight pseudo-triangulations (Q924080) (← links)
- The Voronoi diagram of three lines (Q1028584) (← links)
- Neighbour-sum-2-distinguishing edge-weightings: doubling the 1-2-3 conjecture (Q1627846) (← links)
- On the complexity of clustering with relaxed size constraints in fixed dimension (Q1704856) (← links)
- Turning cliques into paths to achieve planarity (Q1725735) (← links)
- Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications (Q1799219) (← links)
- The inverse Voronoi problem in graphs. I: Hardness (Q2006948) (← links)
- Further results on an equitable 1-2-3 conjecture (Q2022502) (← links)
- On proper labellings of graphs with minimum label sum (Q2118389) (← links)
- Parameterized complexity of minimum membership dominating set (Q2154108) (← links)
- Geometric multicut: shortest fences for separating groups of objects in the plane (Q2207588) (← links)
- Towards an algorithmic guide to Spiral Galaxies (Q2347000) (← links)
- On planar valued CSPs (Q2396724) (← links)
- Rectangle transformation problem (Q2415366) (← links)
- Complexity and algorithms for recognizing polar and monopolar graphs (Q2437850) (← links)
- A note on a QPTAS for maximum weight triangulation of planar point sets (Q2448113) (← links)
- A new asymmetric inclusion region for minimum weight triangulation (Q2655340) (← links)
- On the computational complexity of the bipartizing matching problem (Q2675722) (← links)
- Rectangular spiral galaxies are still hard (Q2678258) (← links)
- On the Complexity of Clustering with Relaxed Size Constraints (Q2830056) (← links)
- (Q3386616) (← links)
- On Planar Boolean CSP (Q3448805) (← links)
- Contact Graphs of Circular Arcs (Q3449800) (← links)
- COMPUTING GEOMETRIC MINIMUM-DILATION GRAPHS IS NP-HARD (Q3562852) (← links)
- Conflict-Free Coloring of Graphs (Q4556952) (← links)
- Conflict-Free Coloring of Intersection Graphs (Q4557736) (← links)
- (Q4691882) (← links)
- Augmenting Geometric Graphs with Matchings (Q5014140) (← links)
- On Proper Labellings of Graphs with Minimum Label Sum (Q5041179) (← links)
- (Q5111296) (← links)
- (Q5115812) (← links)
- Planar 3-SAT with a clause/variable cycle (Q5116495) (← links)
- (Q5136250) (← links)
- Geometry and Generation of a New Graph Planarity Game (Q5233138) (← links)
- OPTIMAL TRIANGULATIONS OF POINTS AND SEGMENTS WITH STEINER POINTS (Q5305065) (← links)
- (Q5743438) (← links)
- Minimum membership covering and hitting (Q5918296) (← links)
- Maximum independent and disjoint coverage (Q5918798) (← links)
- Computing coverage kernels under restricted settings (Q5919535) (← links)
- The Complexity of Drawing Graphs on Few Lines and Few Planes (Q6075709) (← links)
- Parameterized complexity of minimum membership dominating set (Q6090540) (← links)
- (Q6124757) (← links)
- Square Coloring Planar Graphs with Automatic Discharging (Q6141869) (← links)
- An ETH-Tight Exact Algorithm for Euclidean TSP (Q6156029) (← links)
