Pages that link to "Item:Q5899662"

The following pages link to Hardness of computing width parameters based on branch decompositions over the vertex set (Q5899662):

Displaying 17 items.

• Solving problems on generalized convex graphs via mim-width (Q832860) (← links)
• Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis (Q1712018) (← links)
• Tractability beyond \(\beta\)-acyclicity for conjunctive queries with negation and SAT (Q2110380) (← links)
• Mim-width. I. Induced path problems (Q2174563) (← links)
• List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective (Q2234796) (← links)
• Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
• Mim-width. III. Graph powers and generalized distance domination problems (Q2333800) (← links)
• On algorithmic applications of sim-width and mim-width of \((H_1,H_2)\)-free graphs (Q2697441) (← links)
• (Q3304141) (← links)
• Distance Domination in Graphs (Q3384610) (← links)
• (Q5009468) (← links)
• (Q5111880) (← links)
• Node multiway cut and subset feedback vertex set on graphs of bounded mim-width (Q5970812) (← links)
• Bounding the mim‐width of hereditary graph classes (Q6056798) (← links)
• Clique‐width: Harnessing the power of atoms (Q6062871) (← links)
• Bounding the Mim-Width of Hereditary Graph Classes. (Q6089650) (← links)
• Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)