Pages that link to "Item:Q5311519"
From MaRDI portal
The following pages link to Parameterized and Exact Computation (Q5311519):
Displaying 24 items.
- Polynomial kernels for proper interval completion and related problems (Q393083) (← links)
- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization (Q393084) (← links)
- Improved upper bounds for vertex cover (Q708228) (← links)
- Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems (Q719315) (← links)
- Linear kernelizations for restricted 3-Hitting Set problems (Q989471) (← links)
- Improved parameterized set splitting algorithms: A Probabilistic approach (Q1040647) (← links)
- A \((3+\epsilon)k\)-vertex kernel for edge-disjoint triangle packing (Q1628680) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- Kernels for packing and covering problems (Q2272393) (← links)
- The control complexity of \(r\)-Approval: from the single-peaked case to the general case (Q2402374) (← links)
- Crown reductions for the minimum weighted vertex cover problem (Q2473030) (← links)
- Hitting forbidden minors: approximation and kernelization (Q2790404) (← links)
- Parameterized exact and approximation algorithms for maximum<i>k</i>-set cover and related satisfiability problems (Q2956881) (← links)
- Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting (Q3058704) (← links)
- Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters (Q3503572) (← links)
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems (Q3637312) (← links)
- Cluster Editing in Multi-Layer and Temporal Graphs. (Q5091014) (← links)
- Algorithms – ESA 2004 (Q5464568) (← links)
- A parameterized algorithm for subset feedback vertex set in tournaments (Q6076355) (← links)
- Exact algorithms for restricted subset feedback vertex set in chordal and split graphs (Q6140360) (← links)
- What Is Known About Vertex Cover Kernelization? (Q6163635) (← links)
- Kernelization for edge triangle packing and covering via a discharging method (Q6558639) (← links)
- A discharging method: improved kernels for edge triangle packing and covering (Q6591629) (← links)
- Cluster editing for multi-layer and temporal graphs (Q6635696) (← links)