Pages that link to "Item:Q3434987"

The following pages link to Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up (Q3434987):

Displaying 3 items.

• Subexponential parameterized algorithms (Q458457) (← links)
• Computing branchwidth via efficient triangulations and blocks (Q967315) (← links)
• Planar Capacitated Dominating Set Is W[1]-Hard (Q3656850) (← links)