scientific article; zbMATH DE number 6783430
From MaRDI portal
Publication:5365078
Recommendations
- Bidimensionality: new connections between FPT algorithms and PTASs
- Bidimensionality and kernels
- Bidimensionality and kernels
- scientific article; zbMATH DE number 7053376
- Multidimensional bisection: A dual viewpoint
- Elementarity and dimensions
- Coordinate gap and bidualily
- scientific article; zbMATH DE number 205895
- On two hierarchies of dimensions
- Bimetric plane symmetric quantities in higher dimensional space-time
Cited in
(32)- On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability
- Explicit linear kernels for packing problems
- Structurally parameterized \(d\)-scattered set
- An improved approximation bound for minimum weight dominating set on graphs of bounded arboricity
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability
- Local search is a PTAS for feedback vertex set in minor-free graphs
- Contraction obstructions for treewidth
- Finding, hitting and packing cycles in subexponential time on unit disk graphs
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- Graph minors and parameterized algorithm design
- Bidimensionality: new connections between FPT algorithms and PTASs
- Complexity of metric dimension on planar graphs
- Bidimensionality and kernels
- Data reduction for graph coloring problems
- Excluded grid minors and efficient polynomial-time approximation schemes
- Coverability and sub-exponential parameterized algorithms in planar graphs
- Polylogarithmic approximation algorithms for weighted-\(\mathcal{F}\)-deletion problems
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths
- A Retrospective on (Meta) Kernelization
- Hitting weighted even cycles in planar graphs
- Algorithmic properties of sparse digraphs
- Contraction-bidimensionality of geometric intersection graphs
- Maximum cut parameterized by crossing number
- Packing cycles faster than Erdős-Pósa
- Bidimensionality and kernels
- Linear kernels for (connected) dominating set on \(H\)-minor-free graphs
- Improved (In-)Approximability Bounds for d-Scattered Set
- Computing connected-k-subgraph cover with connectivity requirement
- Fixed-parameter tractable certified algorithms for covering and dominating in planar graphs and beyond
- A constant factor approximation for directed feedback vertex set in graphs of bounded genus
- Kick the cliques
- Contraction bidimensionality of geometric intersection graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5365078)
