Pages that link to "Item:Q2447760"

The following pages link to Faster algorithms for vertex partitioning problems parameterized by clique-width (Q2447760):

Displaying 12 items.

• Several notions of rank-width for countable graphs (Q505916) (← links)
• Star colouring of bounded degree graphs and regular graphs (Q2124639) (← links)
• Solving Hamiltonian cycle by an EPT algorithm for a non-sparse parameter (Q2357164) (← links)
• Rank-width: algorithmic and structural results (Q2403788) (← 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)
• Structural parameters, tight bounds, and approximation for \((k, r)\)-center (Q2422740) (← links)
• More Applications of the $d$-Neighbor Equivalence: Acyclicity and Connectivity Constraints (Q5009336) (← links)
• (Q5075752) (← links)
• (Q5136270) (← links)
• Node multiway cut and subset feedback vertex set on graphs of bounded mim-width (Q5970812) (← links)
• Parameterized complexity for iterated type partitions and modular-width (Q6126724) (← links)