Pages that link to "Item:Q5111748"

The following pages link to Subexponential parameterized algorithms for graphs of polynomial growth (Q5111748):

Displaying 3 items.

• Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (Q5009577) (← links)
• Surprising Applications of Treewidth Bounds for Planar Graphs (Q5042457) (← links)
• Algorithms and Turing kernels for detecting and counting small patterns in unit disk graphs (Q6655672) (← links)