Pages that link to "Item:Q2944488"

The following pages link to Fixed-parameter algorithms for ( <i>k</i> , <i>r</i> )-center in planar graphs and map graphs (Q2944488):

Displaying 8 items.

• Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering (Q5885586) (← links)
• Parameterized approximation algorithms for some location problems in graphs (Q5915898) (← links)
• Hardness and structural results for half-squares of restricted tree convex bipartite graphs (Q5919674) (← links)
• Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems (Q6071818) (← links)
• Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center (Q6107886) (← links)
• A parameterized approximation algorithm for the multiple allocation \(k\)-hub center (Q6109001) (← links)
• Graph burning and non-uniform \(k\)-centers for small treewidth (Q6176547) (← links)
• Recognizing map graphs of bounded treewidth (Q6182682) (← links)