Pages that link to "Item:Q3656848"
From MaRDI portal
The following pages link to Kernelization: New Upper and Lower Bound Techniques (Q3656848):
Displaying 50 items.
- Planar graph vertex partition for linear problem kernels (Q355502) (← links)
- The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
- Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050) (← links)
- Incremental list coloring of graphs, parameterized by conservation (Q391091) (← links)
- Two-layer planarization parameterized by feedback edge set (Q391093) (← links)
- Improved linear problem kernel for planar connected dominating set (Q392013) (← links)
- Data reduction for graph coloring problems (Q393081) (← links)
- Polynomial kernels for proper interval completion and related problems (Q393083) (← links)
- Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables (Q414863) (← links)
- On making directed graphs transitive (Q414917) (← links)
- Graph-based data clustering with overlaps (Q456688) (← links)
- Towards optimal and expressive kernelization for \(d\)-hitting set (Q486984) (← links)
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- Fixed-parameter algorithms for DAG partitioning (Q507587) (← links)
- On making a distinguished vertex of minimum degree by vertex deletion (Q528861) (← links)
- Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring (Q533417) (← links)
- Kernel bounds for disjoint cycles and disjoint paths (Q638521) (← links)
- Solving MAX-\(r\)-SAT above a tight lower bound (Q644808) (← links)
- A generalization of Nemhauser and Trotter's local optimization theorem (Q657921) (← links)
- On parameterized independent feedback vertex set (Q690464) (← links)
- Average parameterization and partial kernelization for computing medians (Q716309) (← links)
- Turing kernelization for finding long paths and cycles in restricted graph classes (Q730497) (← links)
- On bounded-degree vertex deletion parameterized by treewidth (Q765338) (← links)
- Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique (Q896028) (← links)
- Change-making problems revisited: a parameterized point of view (Q1679517) (← links)
- Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775) (← links)
- Multivariate complexity analysis of Swap Bribery (Q1759677) (← links)
- Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes (Q1928521) (← links)
- A refined branching algorithm for the maximum satisfiability problem (Q2118385) (← links)
- Polynomial kernels for hitting forbidden minors under structural parameterizations (Q2202024) (← links)
- Constant thresholds can make target set selection tractable (Q2254488) (← links)
- On the kernelization of ranking \(r\)-CSPs: linear vertex-kernels for generalizations of feedback arc set and betweenness in tournaments (Q2345613) (← links)
- Using patterns to form homogeneous teams (Q2346970) (← links)
- A refined complexity analysis of degree anonymization in graphs (Q2347809) (← links)
- A complete parameterized complexity analysis of bounded planning (Q2353405) (← links)
- Parameterized complexity of control and bribery for \(d\)-approval elections (Q2354767) (← links)
- Possible winner problems on partial tournaments: a parameterized study (Q2359793) (← links)
- Tractability, hardness, and kernelization lower bound for and/or graph solution (Q2410230) (← links)
- Knapsack problems: a parameterized point of view (Q2419116) (← links)
- Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP (Q2429346) (← links)
- A cubic-vertex kernel for flip consensus tree (Q2441594) (← links)
- Towards optimal kernel for edge-disjoint triangle packing (Q2446590) (← links)
- A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion (Q2662677) (← links)
- Hitting Forbidden Minors: Approximation and Kernelization (Q2790404) (← links)
- FPT is characterized by useful obstruction sets (Q2828222) (← links)
- Parameterized Complexity of Control and Bribery for d-Approval Elections (Q2867125) (← links)
- Improved Parameterized Algorithms for above Average Constraint Satisfaction (Q2891342) (← links)
- Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs (Q2891348) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
