Pages that link to "Item:Q5311509"
From MaRDI portal
The following pages link to Parameterized and Exact Computation (Q5311509):
Displaying 50 items.
- Nested structure in parameterized rough reduction (Q278817) (← links)
- Graph isomorphism parameterized by elimination distance to bounded degree (Q309797) (← links)
- Two-layer planarization parameterized by feedback edge set (Q391093) (← links)
- Parameterized complexity of max-lifetime target coverage in wireless sensor networks (Q391780) (← links)
- Aspects of a multivariate complexity analysis for rectangle tiling (Q408398) (← links)
- Separator-based data reduction for signed graph balancing (Q613659) (← links)
- Parameterized coloring problems on chordal graphs (Q820152) (← links)
- Parameterized power domination complexity (Q844180) (← links)
- Improved algorithms and complexity results for power domination in graphs (Q958210) (← links)
- Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334) (← links)
- A fixed parameter algorithm for optimal convex partitions (Q1002101) (← links)
- Some tractable instances of interval data minmax regret problems (Q1003488) (← links)
- Bivariate complexity analysis of \textsc{Almost Forest Deletion} (Q1686068) (← links)
- Parameterized algorithms for conflict-free colorings of graphs (Q1786593) (← links)
- A new view on rural postman based on Eulerian extension and matching (Q1932348) (← links)
- Distance from triviality 2.0: hybrid parameterizations (Q2169932) (← links)
- The power of linear-time data reduction for maximum matching (Q2211355) (← links)
- Constant thresholds can make target set selection tractable (Q2254488) (← links)
- On explaining integer vectors by few homogeneous segments (Q2256725) (← links)
- A linear kernel for finding square roots of almost planar graphs (Q2402259) (← links)
- Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs (Q2402262) (← links)
- Fixed-parameter tractable distances to sparse graph classes (Q2408199) (← links)
- The traveling salesman problem with few inner points (Q2583717) (← links)
- A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion (Q2662677) (← links)
- FPT algorithms to compute the elimination distance to bipartite graphs and more (Q2672425) (← links)
- Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- Bivariate Complexity Analysis of Almost Forest Deletion (Q3196379) (← links)
- (Q5009486) (← links)
- A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs (Q5071096) (← links)
- (Q5075776) (← links)
- Elimination Distance to Bounded Degree on Planar Graphs (Q5089238) (← links)
- The Power of Linear-Time Data Reduction for Maximum Matching (Q5111261) (← links)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs (Q5111869) (← links)
- The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph (Q5140781) (← links)
- Network-Based Vertex Dissolution (Q5254088) (← links)
- Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs (Q5387822) (← links)
- Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality (Q5448654) (← links)
- Temporal graph classes: a view through temporal separators (Q5915590) (← links)
- Efficient algorithms for measuring the funnel-likeness of DAGs (Q5915704) (← links)
- Parameterized aspects of triangle enumeration (Q5915757) (← links)
- On finding separators in temporal split and permutation graphs (Q5918685) (← links)
- Block elimination distance (Q5918777) (← links)
- Block elimination distance (Q5925550) (← links)
- Parameterized complexity of diameter (Q5925618) (← links)
- On finding separators in temporal split and permutation graphs (Q5925700) (← links)
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions (Q6038588) (← links)
- Temporal interval cliques and independent sets (Q6039892) (← links)
- On the Parameterized Complexity of Clique Elimination Distance (Q6068235) (← links)
- A multivariate complexity analysis of the material consumption scheduling problem (Q6136081) (← links)