Pages that link to "Item:Q4962173"
From MaRDI portal
The following pages link to Faster Parameterized Algorithms Using Linear Programming (Q4962173):
Displaying 50 items.
- On a generalization of Nemhauser and Trotter's local optimization theorem (Q340561) (← links)
- Parameterized complexity of MaxSat above average (Q392026) (← links)
- List H-coloring a graph by removing few vertices (Q527415) (← links)
- Edge bipartization faster than \(2^k\) (Q666655) (← links)
- Approximability of clique transversal in perfect graphs (Q724231) (← links)
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover (Q897878) (← links)
- Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
- Improved analysis of highest-degree branching for feedback vertex set (Q2041981) (← links)
- Above guarantee parameterization for vertex cover on graphs with maximum degree 4 (Q2111076) (← links)
- Structural parameterizations with modulator oblivion (Q2161010) (← links)
- Distance from triviality 2.0: hybrid parameterizations (Q2169932) (← links)
- List-coloring -- parameterizing from triviality (Q2173305) (← links)
- Faster graph bipartization (Q2301359) (← links)
- Revisiting connected vertex cover: FPT algorithms and lossy kernels (Q2322693) (← links)
- Polynomial kernels for vertex cover parameterized by small degree modulators (Q2322700) (← links)
- Tractability of König edge deletion problems (Q2333799) (← links)
- Fixed-parameter tractability for subset feedback set problems with parity constraints (Q2344735) (← links)
- Faster parameterized algorithms for deletion to split graphs (Q2350905) (← links)
- Parameterized complexity of satisfying almost all linear equations over \(\mathbb F_2\) (Q2392244) (← links)
- On approximability of optimization problems related to red/blue-split graphs (Q2399618) (← links)
- Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion} (Q2408559) (← links)
- Another disjoint compression algorithm for odd cycle transversal (Q2445321) (← links)
- A faster FPT algorithm for bipartite contraction (Q2445333) (← links)
- Parameterized and exact algorithms for class domination coloring (Q2659082) (← links)
- Preprocessing to reduce the search space: antler structures for feedback vertex set (Q2672419) (← links)
- Odd cycle transversal in mixed graphs (Q2672431) (← links)
- Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs (Q2689443) (← links)
- Half-integrality, LP-branching, and FPT Algorithms (Q2816829) (← links)
- Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics (Q2827798) (← links)
- Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations (Q2947879) (← links)
- Parameterized and Exact Algorithms for Class Domination Coloring (Q2971145) (← links)
- A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter (Q3177162) (← links)
- A Faster Parameterized Algorithm for Group Feedback Edge Set (Q3181064) (← links)
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions (Q3187169) (← links)
- Odd Multiway Cut in Directed Acyclic Graphs (Q3300762) (← links)
- The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments (Q4632200) (← links)
- FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters (Q4632216) (← links)
- Backdoor Sets for CSP. (Q4993598) (← links)
- Autarkies and Persistencies for QUBO (Q5050145) (← links)
- (Q5075790) (← links)
- (Q5089163) (← links)
- (Q5090486) (← links)
- New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition (Q5091022) (← links)
- (Q5092402) (← links)
- Elimination Distances, Blocking Sets, and Kernels for Vertex Cover (Q5099101) (← links)
- An Updated Experimental Evaluation of Graph Bipartization Methods (Q5102059) (← links)
- A Linear-Time Parameterized Algorithm for Node Unique Label Cover (Q5111746) (← links)
- Odd Multiway Cut in Directed Acyclic Graphs (Q5111871) (← links)
- Going Far from Degeneracy (Q5130907) (← links)
- (Q5136298) (← links)