Pages that link to "Item:Q820146"
From MaRDI portal
The following pages link to Parameterized enumeration, transversals, and imperfect phylogeny reconstruction (Q820146):
Displaying 34 items.
- Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing (Q392033) (← links)
- Towards optimal and expressive kernelization for \(d\)-hitting set (Q486984) (← links)
- Vertex cover problem parameterized above and below tight bounds (Q633768) (← links)
- Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover (Q714786) (← links)
- Multistage graph problems on a global budget (Q831134) (← links)
- Isolation concepts for efficiently enumerating dense subgraphs (Q837155) (← links)
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization (Q856420) (← links)
- Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
- Fixed-parameter enumerability of cluster editing and related problems (Q970105) (← links)
- Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
- Lower bounds for three algorithms for transversal hypergraph generation (Q1028117) (← links)
- The union of minimal hitting sets: parameterized combinatorial bounds and counting (Q1044023) (← links)
- Extended formulations for vertex cover (Q1790198) (← links)
- On the threshold of intractability (Q2051847) (← links)
- On the complexity of solution extension of optimization problems (Q2072063) (← links)
- Dynamic kernels for hitting sets and set packing (Q2093581) (← links)
- Optimal-size problem kernels for \(d\)-Hitting Set in linear time and space (Q2203595) (← links)
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration (Q2237892) (← links)
- Complexity of independency and cliquy trees (Q2283099) (← links)
- Parameterizations of hitting set of bundles and inverse scope (Q2344004) (← links)
- An average study of hypergraphs and their minimal transversals (Q2355712) (← links)
- On the fixed-parameter tractability of the equivalence test of monotone normal forms (Q2379965) (← links)
- Paradigms for parameterized enumeration (Q2398214) (← links)
- A cubic-vertex kernel for flip consensus tree (Q2441594) (← links)
- Invited talks (Q2692717) (← links)
- Parameterized Enumeration for Modification Problems (Q2799203) (← links)
- Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group Testing (Q2891340) (← links)
- COMPETITIVE GROUP TESTING AND LEARNING HIDDEN VERTEX COVERS WITH MINIMUM ADAPTIVITY (Q3063600) (← links)
- THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS (Q3421857) (← links)
- Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation (Q3508578) (← links)
- Extension of some edge graph problems: standard, parameterized and approximation complexity (Q6048430) (← links)
- Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU (Q6078297) (← links)
- Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes (Q6145807) (← links)
- Space-efficient graph kernelizations (Q6636090) (← links)
