Approximation Algorithms for Geometric Intersection Graphs (Q3508563): Difference between revisions

@@ Property / cites work @@
+Label placement by maximum independent set in rectangles
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for NP-complete problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Unit disk graphs
@@ Property / cites work: Unit disk graphs / rank @@
+Normal rank
@@ Property / cites work @@
+MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs
+Normal rank
@@ Property / cites work @@
+Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a Maximum Cut of a Planar Graph in Polynomial Time
+Normal rank
@@ Property / cites work @@
+Representing graphs by disks and balls (a survey of recognition-complexity results)
+Normal rank
@@ Property / cites work @@
+NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
+Normal rank
@@ Property / cites work @@
+Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs
+Normal rank
@@ Property / cites work @@
+Q5767542
@@ Property / cites work: Q5767542 / rank @@
+Normal rank
@@ Property / cites work @@
+Simple heuristics for unit disk graphs
@@ Property / cites work: Simple heuristics for unit disk graphs / rank @@
+Normal rank