The maximum clique problem in multiple interval graphs (Q2350898): Difference between revisions

@@ Property / OpenAlex ID @@
+W2045135589
@@ Property / OpenAlex ID: W2045135589 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.0043
@@ Property / arXiv ID: 1201.0043 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex Intersection Graphs of Paths on a Grid
@@ Property / cites work: Vertex Intersection Graphs of Paths on a Grid / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921688
@@ Property / cites work: Q2921688 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling Split Intervals
@@ Property / cites work: Scheduling Split Intervals / rank @@
+Normal rank
@@ Property / cites work @@
+On approximation properties of the Independent set problem for degree 3 graphs
+Normal rank
@@ Property / cites work @@
+Q2934605
@@ Property / cites work: Q2934605 / rank @@
+Normal rank
@@ Property / cites work @@
+The Clique Problem in Ray Intersection Graphs
@@ Property / cites work: The Clique Problem in Ray Intersection Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Combinatorial Optimization Problems on <i>d</i>‐Dimensional Boxes
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of multiple-interval graph problems
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Tree Problem is $NP$-Complete
+Normal rank
@@ Property / cites work @@
+Algorithms for a maximum clique and a maximum independent set of a circle graph
+Normal rank
@@ Property / cites work @@
+Maximum weight independent sets and cliques in intersection graphs of filaments
+Normal rank
@@ Property / cites work @@
+Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms
+Normal rank
@@ Property / cites work @@
+Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs
+Normal rank
@@ Property / cites work @@
+On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs
+Normal rank
@@ Property / cites work @@
+Q3348944
@@ Property / cites work: Q3348944 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy
+Normal rank
@@ Property / cites work @@
+Transversals of \(d\)-intervals
@@ Property / cites work: Transversals of \(d\)-intervals / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for intersection graphs
@@ Property / cites work: Approximation algorithms for intersection graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3086024
@@ Property / cites work: Q3086024 / rank @@
+Normal rank
@@ Property / cites work @@
+The max clique problem in classes of string-graphs
+Normal rank
@@ Property / cites work @@
+Ramsey numbers and an approximation algorithm for the vertex cover problem
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+On double and multiple interval graphs
@@ Property / cites work: On double and multiple interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Universality considerations in VLSI circuits
@@ Property / cites work: Universality considerations in VLSI circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing graphs with fixed interval number is NP-complete
+Normal rank
@@ Property / cites work @@
+Linear degree extractors and the inapproximability of max clique and chromatic number
+Normal rank