Q5009615 (Q5009615): Difference between revisions

@@ Property / DOI @@
-.4230/LIPIcs.ESA.2018.51
@@ Property / DOI: 10.4230/LIPIcs.ESA.2018.51 / rank @@
-Normal rank
@@ Property / author @@
+Iyad A. Kanj
@@ Property / author: Iyad A. Kanj / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning a graph into disjoint cliques and a triangle-free graph
+Normal rank
@@ Property / cites work @@
+The complexity of \(G\)-free colourability
@@ Property / cites work: The complexity of \(G\)-free colourability / rank @@
+Normal rank
@@ Property / cites work @@
+Kernelization Lower Bounds by Cross-Composition
@@ Property / cites work: Kernelization Lower Bounds by Cross-Composition / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of partitioning into disjoint cliques and a triangle-free graph
+Normal rank
@@ Property / cites work @@
+More about subcolorings
@@ Property / cites work: More about subcolorings / rank @@
+Normal rank
@@ Property / cites work @@
+About recognizing (\(\alpha\) ,\(\beta\) ) classes of polar graphs
+Normal rank
@@ Property / cites work @@
+On the Polarity and Monopolarity of Graphs
@@ Property / cites work: On the Polarity and Monopolarity of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Solving partition problems with colour-bipartitions
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Theory
@@ Property / cites work: Graph Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of multiple-interval graph problems
+Normal rank
@@ Property / cites work @@
+Graph Subcolorings: Complexity and Algorithms
@@ Property / cites work: Graph Subcolorings: Complexity and Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4193514
@@ Property / cites work: Q4193514 / rank @@
+Normal rank
@@ Property / cites work @@
+Infeasibility of instance compression and succinct PCPs for NP
+Normal rank
@@ Property / cites work @@
+Subcolorings and the subchromatic number of a graph
+Normal rank
@@ Property / cites work @@
+Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms on Perfect Graphs for Deletion to (r,l)-Graphs
+Normal rank
@@ Property / cites work @@
+On the computational complexity of (O,P)-partition problems
+Normal rank
@@ Property / cites work @@
+Complexity and algorithms for recognizing polar and monopolar graphs
+Normal rank
@@ Property / cites work @@
+On 2-Subcolourings of Chordal Graphs
@@ Property / cites work: On 2-Subcolourings of Chordal Graphs / rank @@
+Normal rank
@@ Property / DOI @@
+.4230/LIPICS.ESA.2018.51
@@ Property / DOI: 10.4230/LIPICS.ESA.2018.51 / rank @@
+Normal rank