Pages that link to "Item:Q5897987"
From MaRDI portal
The following pages link to SOFSEM 2006: Theory and Practice of Computer Science (Q5897987):
Displaying 18 items.
- Partial degree bounded edge packing problem for graphs and \(k\)-uniform hypergraphs (Q328705) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Combinatorics for smaller kernels: the differential of a graph (Q476877) (← links)
- Lower bounds on the differential of a graph (Q713137) (← links)
- Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems (Q719315) (← links)
- A parameterized perspective on packing paths of length two (Q849135) (← links)
- Data reductions and combinatorial bounds for improved approximation algorithms (Q899583) (← links)
- Constant factor approximation for the weighted partial degree bounded edge packing problem (Q1631679) (← links)
- To close is easier than to open: dual parameterization to \(k\)-median (Q2117693) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- The complexity of finding harmless individuals in social networks (Q2339843) (← links)
- Sparsification upper and lower bounds for graph problems and not-all-equal SAT (Q2408194) (← links)
- Computing the differential of a graph: hardness, approximability and exact algorithms (Q2448922) (← links)
- On the Complexity Landscape of the Domination Chain (Q2795935) (← links)
- Constant Factor Approximation for the Weighted Partial Degree Bounded Edge Packing Problem (Q2958313) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- Weighted Upper Edge Cover: Complexity and Approximability (Q5216282) (← links)