Pages that link to "Item:Q2944488"
From MaRDI portal
The following pages link to Fixed-parameter algorithms for ( <i>k</i> , <i>r</i> )-center in planar graphs and map graphs (Q2944488):
Displayed 24 items.
- (Total) vector domination for graphs with bounded branchwidth (Q290105) (← links)
- New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
- Local search: is brute-force avoidable? (Q439931) (← links)
- Extended dynamic subgraph statistics using \(h\)-index parameterized data structures (Q443712) (← links)
- Subexponential parameterized algorithms (Q458457) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Implicit branching and parameterized partial cover problems (Q657922) (← links)
- A linear time algorithm for optimal \(k\)-hop dominating set of a tree (Q894482) (← links)
- Linearity of grid minors in treewidth with applications through bidimensionality (Q949776) (← links)
- Computing branchwidth via efficient triangulations and blocks (Q967315) (← links)
- Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm (Q967316) (← links)
- Approximation algorithm for the kinetic robust \(k\)-center problem (Q982946) (← links)
- Vertex fusion under distance constraints (Q1039434) (← links)
- A generalized linear time algorithm for an optimal \(k\)-distance dominating set of a weighted tree (Q1679914) (← links)
- Approximation algorithms via contraction decomposition (Q1945289) (← links)
- Augmenting Outerplanar Graphs to Meet Diameter Requirements (Q2862552) (← links)
- On Complexities of Minus Domination (Q2867118) (← links)
- Stack and Queue Layouts via Layered Separators (Q2961542) (← links)
- Subexponential Fixed-Parameter Algorithms for Partial Vector Domination (Q3195339) (← links)
- Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs (Q3449507) (← links)
- Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor (Q3656866) (← links)
- Parameterized Complexity for Domination Problems on Degenerate Graphs (Q5302055) (← links)
- Structure of Graphs with Locally Restricted Crossings (Q5346557) (← links)