Pages that link to "Item:Q1004602"
From MaRDI portal
The following pages link to Parameterizing above or below guaranteed values (Q1004602):
Displaying 45 items.
- Parameterizations of test cover with bounded test sizes (Q261370) (← links)
- Maximum balanced subgraph problem parameterized above lower bound (Q391973) (← links)
- Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables (Q414863) (← links)
- \textsc{Max-Cut} parameterized above the Edwards-Erdős bound (Q494801) (← links)
- Fixed-parameter tractability of satisfying beyond the number of variables (Q528862) (← links)
- A probabilistic approach to problems parameterized above or below tight bounds (Q632807) (← links)
- Vertex cover problem parameterized above and below tight bounds (Q633768) (← links)
- Solving MAX-\(r\)-SAT above a tight lower bound (Q644808) (← links)
- Note on Max Lin-2 above average (Q656604) (← links)
- Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width (Q713329) (← links)
- Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems (Q719315) (← links)
- Linear kernels and linear-time algorithms for finding large cuts (Q722541) (← links)
- On the parameterized vertex cover problem for graphs with perfect matching (Q893740) (← links)
- Note on maximal bisection above tight lower bound (Q1675768) (← links)
- Betweenness parameterized above tight lower bound (Q1959433) (← links)
- Greed is good for deterministic scale-free networks (Q2205637) (← links)
- Fixed-parameter tractable algorithms for tracking shortest paths (Q2210499) (← links)
- Parameterized complexity of satisfying almost all linear equations over \(\mathbb F_2\) (Q2392244) (← links)
- Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP (Q2429346) (← links)
- Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound (Q2453557) (← links)
- On the kernelization of split graph problems (Q2636501) (← links)
- Satisfying more than half of a system of linear equations over GF(2): a multivariate approach (Q2637641) (← links)
- Large Independent Sets in Subquartic Planar Graphs (Q2803824) (← links)
- Improved Parameterized Algorithms for above Average Constraint Satisfaction (Q2891342) (← links)
- The Impact of Parameterized Complexity to Interdisciplinary Problem Solving (Q2908532) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations (Q2947879) (← links)
- Ranking and Drawing in Subexponential Time (Q3000521) (← links)
- Partial Kernelization for Rank Aggregation: Theory and Experiments (Q3058689) (← links)
- A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application (Q3088277) (← links)
- Acyclic Digraphs (Q3120435) (← links)
- Simultaneous Approximation of Constraint Satisfaction Problems (Q3448785) (← links)
- A Probabilistic Approach to Problems Parameterized above or below Tight Bounds (Q3656865) (← links)
- The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments (Q4632200) (← links)
- Finding Detours is Fixed-Parameter Tractable (Q4972756) (← links)
- (Q4993600) (← links)
- (Q5075790) (← links)
- (Q5092402) (← links)
- Going Far from Degeneracy (Q5130907) (← links)
- Balanced Judicious Bipartition is Fixed-Parameter Tractable (Q5136332) (← links)
- Balanced Judicious Bipartition is Fixed-Parameter Tractable (Q5238741) (← links)
- Large Independent Sets in Triangle-Free Planar Graphs (Q5270410) (← links)
- Parameterized Traveling Salesman Problem: Beating the Average (Q5743554) (← links)
- Recognizing \(k\)-clique extendible orderings (Q5925536) (← links)
- Detours in directed graphs (Q6113279) (← links)
