Pages that link to "Item:Q5417643"
From MaRDI portal
The following pages link to Bidimensionality and Geometric Graphs (Q5417643):
Displayed 50 items.
- On polynomial kernels for sparse integer linear programs (Q269481) (← links)
- A \(13k\)-kernel for planar feedback vertex set via region decomposition (Q306250) (← links)
- Kernelization using structural parameters on sparse graph classes (Q340583) (← links)
- Planar graph vertex partition for linear problem kernels (Q355502) (← links)
- A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments (Q385516) (← links)
- A \(9k\) kernel for nonseparating independent set in planar graphs (Q385964) (← links)
- Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- The kernelization complexity of connected domination in graphs with (no) small cycles (Q476436) (← links)
- On the parameterized complexity of finding separators with non-hereditary properties (Q494799) (← links)
- Improved kernel results for some FPT problems based on simple observations (Q507431) (← links)
- A linear kernel for planar red-blue dominating set (Q516887) (← links)
- A linear kernel for a planar connected dominating set (Q534569) (← links)
- Spanners in sparse graphs (Q657919) (← links)
- Implicit branching and parameterized partial cover problems (Q657922) (← links)
- FPT algorithms for connected feedback vertex set (Q695322) (← links)
- Kernelization hardness of connectivity problems in \(d\)-degenerate graphs (Q713308) (← links)
- A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem (Q743120) (← links)
- Compactors for parameterized counting problems (Q826317) (← links)
- Contraction bidimensionality of geometric intersection graphs (Q832527) (← links)
- Characterising bounded expansion by neighbourhood complexity (Q1621072) (← links)
- On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability (Q1680511) (← links)
- An FPT 2-approximation for tree-cut decomposition (Q1702123) (← links)
- Explicit linear kernels for packing problems (Q1739112) (← links)
- Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775) (← links)
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications (Q1759678) (← links)
- Towards optimal kernel for connected vertex cover in planar graphs (Q1949125) (← links)
- Partial vertex cover on graphs of bounded degeneracy (Q2097233) (← links)
- On the parameterized complexity of the expected coverage problem (Q2135628) (← links)
- Sparse obstructions for minor-covering parameters (Q2174553) (← links)
- Kernels for packing and covering problems (Q2272393) (← links)
- Contraction obstructions for treewidth (Q2275894) (← links)
- Structural sparsity of complex networks: bounded expansion in random models and real-world graphs (Q2316938) (← links)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? (Q2324243) (← links)
- Finding, hitting and packing cycles in subexponential time on unit disk graphs (Q2334507) (← links)
- Linear kernels for \(k\)-tuple and liar's domination in bounded genus graphs (Q2403794) (← links)
- On kernelization and approximation for the vector connectivity problem (Q2408198) (← links)
- Linear kernels for outbranching problems in sparse digraphs (Q2408200) (← links)
- Meta-kernelization using well-structured modulators (Q2413976) (← links)
- Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP (Q2429346) (← links)
- On the hardness of losing width (Q2441542) (← links)
- Edge-disjoint packing of stars and cycles (Q2629232) (← links)
- Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs (Q2662795) (← links)
- Hitting Forbidden Minors: Approximation and Kernelization (Q2790404) (← links)
- On the Hardness of Losing Width (Q2891345) (← links)
- Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs (Q2891348) (← links)
- Kernelization – Preprocessing with a Guarantee (Q2908537) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)