Pages that link to "Item:Q3639278"
From MaRDI portal
The following pages link to Kernel Bounds for Disjoint Cycles and Disjoint Paths (Q3639278):
Displaying 30 items.
- Parameterized complexity of Min-power multicast problems in wireless ad hoc networks (Q388087) (← links)
- On the parameterized complexity of the repetition free longest common subsequence problem (Q413298) (← links)
- Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables (Q414863) (← links)
- Parameterized Eulerian strong component arc deletion problem on tournaments (Q437687) (← links)
- Lower bounds on kernelization (Q456702) (← links)
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning (Q460604) (← links)
- On the parameterized complexity of vertex cover and edge cover with connectivity constraints (Q482281) (← links)
- Solving MAX-\(r\)-SAT above a tight lower bound (Q644808) (← links)
- Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems (Q719315) (← links)
- Kernelization complexity of possible winner and coalitional manipulation problems in voting (Q906403) (← links)
- Note on maximal bisection above tight lower bound (Q1675768) (← links)
- A parameterized perspective on protecting elections (Q2034407) (← links)
- Facility location problems: a parameterized view (Q2275913) (← links)
- Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP (Q2429346) (← links)
- Parameterized algorithms for load coloring problem (Q2448120) (← links)
- Satisfying more than half of a system of linear equations over GF(2): a multivariate approach (Q2637641) (← links)
- Hitting Forbidden Minors: Approximation and Kernelization (Q2790404) (← links)
- Kernel Bounds for Path and Cycle Problems (Q2891344) (← links)
- On the Hardness of Losing Width (Q2891345) (← links)
- On the Kernelization Complexity of Colorful Motifs (Q3058688) (← links)
- On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems (Q3058699) (← links)
- Data Reduction for Graph Coloring Problems (Q3088272) (← links)
- Parameterized Complexity of Vertex Deletion into Perfect Graph Classes (Q3088287) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- Two Edge Modification Problems without Polynomial Kernels (Q3656868) (← links)
- Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses (Q5501928) (← links)
- (Q5743378) (← links)
- (Q5743380) (← links)
- (Q5743381) (← links)
- (Q5743382) (← links)
