Pages that link to "Item:Q392025"
From MaRDI portal
The following pages link to Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems (Q392025):
Displayed 44 items.
- Graph classes with structured neighborhoods and algorithmic applications (Q392023) (← 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)
- Cluster deletion on interval graphs and split related graphs (Q2037103) (← 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)
- A new approach on locally checkable problems (Q2127611) (← 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)
- 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)
- More results on weighted independent domination (Q2410364) (← links)
- When an optimal dominating set with given constraints exists (Q2420615) (← links)
- Fast exact algorithms for some connectivity problems parameterized by clique-width (Q2420640) (← 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)
- Graph Classes with Structured Neighborhoods and Algorithmic Applications (Q3104764) (← links)
- Distance Domination in Graphs (Q3384610) (← links)
- Boolean-Width of Graphs (Q3656851) (← links)
- More Applications of the $d$-Neighbor Equivalence: Acyclicity and Connectivity Constraints (Q5009336) (← links)
- (Q5009468) (← links)
- (Q5009589) (← links)
- (Q5075752) (← links)
- (Q5092370) (← links)
- (Q5111880) (← links)
- An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width (Q5918121) (← links)
- On the complexity of finding large odd induced subgraphs and odd colorings (Q5918338) (← 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)
- Finding perfect matching cuts faster (Q6182915) (← 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)