Pages that link to "Item:Q4074668"
From MaRDI portal
The following pages link to Vertex packings: Structural properties and algorithms (Q4074668):
Displaying 50 items.
- On the Power of Simple Reductions for the Maximum Independent Set Problem (Q2817877) (← links)
- Moderately exponential time and fixed parameter approximation algorithms (Q2868915) (← links)
- Safe Approximation and Its Relation to Kernelization (Q2891346) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey (Q2908541) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- On the 2-Club Polytope of Graphs (Q2957469) (← links)
- Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures (Q3000504) (← links)
- Approximating Edge Dominating Set in Dense Graphs (Q3010383) (← links)
- Recoverable Values for Independent Sets (Q3012827) (← links)
- Vertex Cover in Graphs with Locally Few Colors (Q3012828) (← links)
- Minimum node covers and 2-bicritical graphs (Q3050138) (← links)
- VERY WELL-COVERED GRAPHS OF GIRTH AT LEAST FOUR AND LOCAL MAXIMUM STABLE SET GREEDOIDS (Q3087098) (← links)
- A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter (Q3177162) (← links)
- Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms (Q3183480) (← links)
- Stabilizing Weighted Graphs (Q3387926) (← links)
- Unicycle graphs and uniquely restricted maximum matchings (Q3439344) (← links)
- Vertex Cover in Conflict Graphs: Complexity and a Near Optimal Approximation (Q3467859) (← links)
- A Problem Kernelization for Graph Packing (Q3599088) (← links)
- On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph (Q3655146) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- Algorithm of determination of largest internally stable set of a graph (Q3673483) (← links)
- A decomposition algorithm for linear relaxation of the weightedr-covering problem (Q3688125) (← links)
- Roof duality, complementation and persistency in quadratic 0–1 optimization (Q3693267) (← links)
- An extension of the edge covering problem (Q3941210) (← links)
- Some facets of the simple plant location polytope (Q3945954) (← links)
- Vertices Belonging to All or to No Maximum Stable Sets of a Graph (Q3960467) (← links)
- Determining the number of internal stability of a graph (Q3960887) (← links)
- Finding the maximal internally stable set of a graph (Q3967362) (← links)
- On the integer-valued variables in the linear vertex packing problem (Q4136929) (← links)
- Improvement on vertex cover for low-degree graphs (Q4506265) (← links)
- Approximation and Kernelization for Chordal Vertex Deletion (Q4586151) (← links)
- Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation (Q4596147) (← links)
- Primal-dual approximation algorithms for feedback problems in planar graphs (Q4645920) (← links)
- (Q5002762) (← links)
- Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. (Q5009611) (← links)
- Persistency of Linear Programming Relaxations for the Stable Set Problem (Q5041757) (← links)
- Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds (Q5042452) (← links)
- Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel (Q5048303) (← links)
- Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems (Q5048305) (← links)
- Autarkies and Persistencies for QUBO (Q5050145) (← links)
- On approximation properties of the Independent set problem for degree 3 graphs (Q5057456) (← links)
- (Q5075740) (← links)
- Estimating the Size of Branch-and-Bound Trees (Q5085999) (← links)
- Elimination Distances, Blocking Sets, and Kernels for Vertex Cover (Q5099101) (← links)
- Data Reduction for Maximum Matching on Real-World Graphs (Q5102046) (← links)
- Smaller Parameters for Vertex Cover Kernelization (Q5111879) (← links)
- Technical Note—Assortment Optimization with Small Consideration Sets (Q5129194) (← links)
- Why Is Maximum Clique Often Easy in Practice? (Q5144801) (← links)
- On König-Egerváry collections of maximum critical independent sets (Q5198028) (← links)
