Pages that link to "Item:Q4242660"
From MaRDI portal
The following pages link to Parameterizing above Guaranteed Values: MaxSat and MaxCut (Q4242660):
Displayed 50 items.
- Parameterizations of test cover with bounded test sizes (Q261370) (← links)
- Intractability and the use of heuristics in psychological explanations (Q383037) (← links)
- Maximum balanced subgraph problem parameterized above lower bound (Q391973) (← links)
- Parameterized complexity of MaxSat above average (Q392026) (← links)
- A new bound for 3-satisfiable MaxSat and its algorithmic application (Q393085) (← links)
- Solving min ones 2-SAT as fast as vertex cover (Q393120) (← 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)
- Dealing with 4-variables by resolution: an improved MaxSAT algorithm (Q515546) (← 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)
- Solving MAX-\(r\)-SAT above a tight lower bound (Q644808) (← links)
- The complexity of König subgraph problems and above-guarantee vertex cover (Q652520) (← links)
- Note on Max Lin-2 above average (Q656604) (← 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)
- Improving exact algorithms for MAX-2-SAT (Q812398) (← links)
- Parameterized algorithms for feedback set problems and their duals in tournaments (Q820159) (← links)
- An efficient fixed-parameter algorithm for 3-hitting set (Q876698) (← links)
- On the parameterized vertex cover problem for graphs with perfect matching (Q893740) (← links)
- Solving sparse instances of Max SAT via width reduction and greedy restriction (Q905695) (← links)
- Parameterized algorithmics for linear arrangement problems (Q1003461) (← links)
- Parameterizing above or below guaranteed values (Q1004602) (← links)
- On parameterized exponential time complexity (Q1029333) (← links)
- Almost 2-SAT is fixed-parameter tractable (Q1034100) (← links)
- Fixed-parameter algorithms for Kemeny rankings (Q1035688) (← links)
- Minimum leaf out-branching and related problems (Q1035689) (← links)
- Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. (Q1408377) (← links)
- Worst-case study of local search for MAX-\(k\)-SAT. (Q1408379) (← links)
- Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
- Parameterized complexity and approximation issues for the colorful components problems (Q1643155) (← links)
- The \(S\)-\textsc{labeling} problem: an algorithmic tour (Q1647835) (← links)
- Note on maximal bisection above tight lower bound (Q1675768) (← links)
- Programming for modular reconfigurable robots (Q1758696) (← links)
- A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications (Q1759685) (← links)
- \((k,n-k)\)-\textsc{Max-Cut}: an \(\mathcal{O}^*(2^p)\)-time algorithm and a polynomial kernel (Q1799226) (← links)
- Parameterized complexity of finding subgraphs with hereditary properties. (Q1853579) (← links)
- A fixed-parameter algorithm for minimum quartet inconsistency (Q1877704) (← links)
- Improved exact algorithms for MAX-SAT (Q1878397) (← links)
- The analysis of expected fitness and success ratio of two heuristic optimizations on two bimodal MaxSat problems (Q1928267) (← links)
- Betweenness parameterized above tight lower bound (Q1959433) (← links)
- Parameterized complexity of multi-node hubs (Q2084737) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- Fixed-parameter tractable algorithms for tracking shortest paths (Q2210499) (← links)
- Algorithms for \((n,3)\)-MAXSAT and parameterization above the all-true assignment (Q2283027) (← links)
- Fixed-parameter tractable algorithm and polynomial kernel for \textsc{Max-Cut Above Spanning Tree} (Q2300620) (← links)
- Improved fixed parameter tractable algorithms for two ``edge'' problems: MAXCUT and MAXDAG (Q2379999) (← links)
- Improved exact algorithms for mildly sparse instances of MAX SAT (Q2405896) (← links)
- Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound (Q2453557) (← links)
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover (Q2576350) (← links)