Pages that link to "Item:Q392023"

The following pages link to Graph classes with structured neighborhoods and algorithmic applications (Q392023):

Displaying 40 items.

• Scattered packings of cycles (Q306707) (← links)
• Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems (Q392025) (← links)
• Solving problems on generalized convex graphs via mim-width (Q832860) (← links)
• A width parameter useful for chordal and co-comparability graphs (Q1680525) (← links)
• Output-polynomial enumeration on graphs of bounded (local) linear MIM-width (Q1709594) (← links)
• Maximum rooted connected expansion (Q2034397) (← links)
• Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
• Revising Johnson's table for the 21st century (Q2091799) (← links)
• A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs (Q2102897) (← links)
• Star colouring of bounded degree graphs and regular graphs (Q2124639) (← links)
• Parameterized algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage (Q2154102) (← links)
• Mim-width. I. Induced path problems (Q2174563) (← links)
• On the tractability of optimization problems on \(H\)-graphs (Q2196605) (← links)
• List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective (Q2234796) (← links)
• On pairwise compatibility graphs having Dilworth number \(k\) (Q2253200) (← links)
• Mim-width. II. The feedback vertex set problem (Q2285053) (← links)
• Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
• New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs (Q2330102) (← links)
• Mim-width. III. Graph powers and generalized distance domination problems (Q2333800) (← links)
• Lower bounds on the mim-width of some graph classes (Q2413964) (← links)
• Faster algorithms for vertex partitioning problems parameterized by clique-width (Q2447760) (← 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)
• More Applications of the $d$-Neighbor Equivalence: Acyclicity and Connectivity Constraints (Q5009336) (← links)
• (Q5009468) (← links)
• (Q5009589) (← links)
• (Q5075752) (← links)
• (Q5111880) (← links)
• Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs (Q5915760) (← links)
• The perfect matching cut problem revisited (Q5918785) (← links)
• The perfect matching cut problem revisited (Q5925551) (← 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)
• Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
• Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)
• Classes of intersection digraphs with good algorithmic properties (Q6201028) (← links)
• On \(d\)-stable locally checkable problems parameterized by mim-width (Q6202932) (← links)