A structural view on parameterizing problems: Distance from triviality
From MaRDI portal
Recommendations
- The parameterized complexity of maximality and minimality problems
- scientific article; zbMATH DE number 806748
- The Parameterized Complexity of Maximality and Minimality Problems
- Ubiquitous parameterization -- invitation to fixed-parameter algorithms
- Parameterized complexity: the main ideas and connections to practical computing
Cited in
(73)- A fixed parameter algorithm for optimal convex partitions
- Some tractable instances of interval data minmax regret problems
- Bivariate complexity analysis of \textsc{Almost Forest Deletion}
- Parameterized algorithms for conflict-free colorings of graphs
- A new view on rural postman based on Eulerian extension and matching
- Distance from triviality 2.0: hybrid parameterizations
- The power of linear-time data reduction for maximum matching
- Constant thresholds can make target set selection tractable
- On explaining integer vectors by few homogeneous segments
- A linear kernel for finding square roots of almost planar graphs
- Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs
- Fixed-parameter tractable distances to sparse graph classes
- The traveling salesman problem with few inner points
- A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion
- FPT algorithms to compute the elimination distance to bipartite graphs and more
- Nested structure in parameterized rough reduction
- Open problems on graph coloring for special graph classes
- Backdoors to satisfaction
- Graph isomorphism parameterized by elimination distance to bounded degree
- Bivariate complexity analysis of \textsc{Almost Forest Deletion}
- Two-layer planarization parameterized by feedback edge set
- Parameterized complexity of max-lifetime target coverage in wireless sensor networks
- Aspects of a multivariate complexity analysis for rectangle tiling
- Resolving conflicts for lower-bounded clustering
- A fixed-parameter tractable algorithm for elimination distance to bounded degree graphs
- scientific article; zbMATH DE number 7525474 (Why is no real title available?)
- Elimination Distance to Bounded Degree on Planar Graphs
- The Power of Linear-Time Data Reduction for Maximum Matching
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?
- On the maximum colorful arborescence problem and color hierarchy graph structure
- Network-based vertex dissolution
- Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs
- Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality
- On finding separators in temporal split and permutation graphs
- Block elimination distance
- Block elimination distance
- Parameterized complexity of diameter
- On finding separators in temporal split and permutation graphs
- k-apices of minor-closed graph classes. I: Bounding the obstructions
- Temporal interval cliques and independent sets
- On the Parameterized Complexity of Clique Elimination Distance
- A multivariate complexity analysis of the material consumption scheduling problem
- Separator-based data reduction for signed graph balancing
- Parameterized aspects of distinct Kemeny rank aggregation
- Backdoor DNFs
- Aspmc: new frontiers of algebraic answer set counting
- Elimination distance to bounded degree on planar graphs preprint
- Faster parameterized algorithms for modification problems to minor-closed classes
- Parameterized aspects of distinct Kemeny rank aggregation
- Parameterizing path partitions
- Tractable graph structures in EFX orientation
- Kernelization dichotomies for hitting subgraphs under structural parameterizations
- Multicut problems in embedded graphs: the dependency of complexity on the demand pattern
- Parameterized complexity of shortest path with positive disjunctive constraints
- Temporal graph realization from fastest paths
- Vertex identification to a forest
- FPT approximations for packing and covering problems parameterized by elimination distance and even less
- Parameterized complexity of dominating set variants in almost cluster and split graphs
- Perfect Roman domination: aspects of enumeration and parameterization
- Compound logics for modification problems
- An FPT algorithm for elimination distance to bounded degree graphs
- On the descriptive complexity of vertex deletion problems
- Equitable connected partition and structural parameters revisited: N-fold beats Lenstra
- Steiner tree parameterized by multiway cut and even less
- Roman hitting functions
- On the polynomial kernelizations of finding a shortest path with positive disjunctive constraints
- Elimination distance to dominated clusters
- Temporal unit interval independent sets
- Quantifying distance from simplicity
- Parameterized coloring problems on chordal graphs
- Parameterized power domination complexity
- Improved algorithms and complexity results for power domination in graphs
- Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs
This page was built for publication: A structural view on parameterizing problems: Distance from triviality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311509)
