Approximating the minimum clique cover and other hard problems in subtree filament graphs (Q2506362): Difference between revisions

@@ Property / cites work @@
+Label placement by maximum independent set in rectangles
+Normal rank
@@ Property / cites work @@
+Free Bits, PCPs, and Nonapproximability---Towards Tight Results
+Normal rank
@@ Property / cites work @@
+Maximum independent set and maximum clique algorithms for overlap graphs
+Normal rank
@@ Property / cites work @@
+Partially Ordered Sets
@@ Property / cites work: Partially Ordered Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
+Normal rank
@@ Property / cites work @@
+The Complexity of Coloring Circular Arcs and Chords
+Normal rank
@@ Property / cites work @@
+Algorithms for a maximum clique and a maximum independent set of a circle graph
+Normal rank
@@ Property / cites work @@
+Algorithms for maximumk-colorings andk-coverings of transitive graphs
+Normal rank
@@ Property / cites work @@
+Maximum weight independent sets and cliques in intersection graphs of filaments
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+The ellipsoid method and its consequences in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Linear time algorithms on circular-arc graphs
@@ Property / cites work: Linear time algorithms on circular-arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-completeness column: an ongoing guide
@@ Property / cites work: The NP-completeness column: an ongoing guide / rank @@
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of domination problems in circle graphs
+Normal rank
@@ Property / cites work @@
+Fast stabbing of boxes in high dimensions
@@ Property / cites work: Fast stabbing of boxes in high dimensions / rank @@
+Normal rank
@@ Property / cites work @@
+Quantifiers and approximation
@@ Property / cites work: Quantifiers and approximation / rank @@
+Normal rank
@@ Property / cites work @@
+Recognition of Circle Graphs
@@ Property / cites work: Recognition of Circle Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient graph representations
@@ Property / cites work: Efficient graph representations / rank @@
+Normal rank
@@ Property / cites work @@
+A simplified NP-complete satisfiability problem
@@ Property / cites work: A simplified NP-complete satisfiability problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3787505
@@ Property / cites work: Q3787505 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of colouring circle graphs
@@ Property / cites work: The complexity of colouring circle graphs / rank @@
+Normal rank