On parameterized enumeration
From MaRDI portal
Recommendations
Cited in
(23)- The union of minimal hitting sets: parameterized combinatorial bounds and counting
- Randomised enumeration of small witnesses using a decision oracle
- On the complexity of solution extension of optimization problems
- Tractability beyond -acyclicity for conjunctive queries with negation and SAT
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
- Complexity of independency and cliquy trees
- Paradigms for parameterized enumeration
- Crown reductions for the minimum weighted vertex cover problem
- Invited talks
- Parameterized enumeration for modification problems
- Paradigms for parameterized enumeration
- Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations
- Constraint bipartite vertex cover: simpler exact algorithms and implementations
- Extension of some edge graph problems: standard, parameterized and approximation complexity
- Vertex cover problem parameterized above and below tight bounds
- Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints
- Hypergraph dualization with \textsf{FPT}-delay parameterized by the degeneracy and dimension
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
- Enumeration kernels for vertex cover and feedback vertex set
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
- Enumerate and expand: Improved algorithms for connected vertex cover and tree cover
- Fixed-parameter enumerability of cluster editing and related problems
This page was built for publication: On parameterized enumeration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4808679)