Pages that link to "Item:Q5902506"
From MaRDI portal
The following pages link to Graph-Theoretic Concepts in Computer Science (Q5902506):
Displayed 27 items.
- Win-win kernelization for degree sequence completion problems (Q295647) (← links)
- The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT (Q456705) (← links)
- Subexponential parameterized algorithms (Q458457) (← links)
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (Q635734) (← links)
- Improved upper bounds for vertex cover (Q708228) (← links)
- The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
- Looking at the stars (Q820158) (← links)
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization (Q856420) (← links)
- Exact algorithms and applications for tree-like Weighted Set Cover (Q866547) (← links)
- Faster fixed-parameter tractable algorithms for matching and packing problems (Q958209) (← links)
- Linear kernelizations for restricted 3-Hitting Set problems (Q989471) (← links)
- A fixed-parameter tractability result for multicommodity demand flow in trees (Q1045910) (← links)
- Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
- A \(2k\)-kernelization algorithm for vertex cover based on crown decomposition (Q1643162) (← links)
- Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable (Q1765303) (← links)
- A \(5k\)-vertex kernel for \(P_2\)-packing (Q2118855) (← links)
- Kernels for packing and covering problems (Q2272393) (← links)
- Crown reductions for the minimum weighted vertex cover problem (Q2473030) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
- Preprocessing to reduce the search space: antler structures for feedback vertex set (Q2672419) (← links)
- A Fast Approximation Scheme for the Multiple Knapsack Problem (Q2891378) (← links)
- Structural Properties of Hard Metric TSP Inputs (Q3075532) (← links)
- Parameterized Power Vertex Cover (Q3181050) (← links)
- Fixed-parameter tractability and data reduction for multicut in trees (Q3367053) (← links)
- Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters (Q3503572) (← links)
- The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT (Q3637173) (← links)
- What Is Known About Vertex Cover Kernelization? (Q6163635) (← links)