The following pages link to (Q4808679):
Displayed 18 items.
- Constraint bipartite vertex cover: simpler exact algorithms and implementations (Q431922) (← links)
- Vertex cover problem parameterized above and below tight bounds (Q633768) (← links)
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction (Q820146) (← links)
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization (Q856420) (← links)
- Enumerate and expand: Improved algorithms for connected vertex cover and tree cover (Q929296) (← links)
- Fixed-parameter enumerability of cluster editing and related problems (Q970105) (← links)
- The union of minimal hitting sets: parameterized combinatorial bounds and counting (Q1044023) (← links)
- Randomised enumeration of small witnesses using a decision oracle (Q1725640) (← links)
- On the complexity of solution extension of optimization problems (Q2072063) (← links)
- Tractability beyond \(\beta\)-acyclicity for conjunctive queries with negation and SAT (Q2110380) (← links)
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration (Q2237892) (← links)
- Complexity of independency and cliquy trees (Q2283099) (← links)
- Paradigms for parameterized enumeration (Q2398214) (← links)
- Crown reductions for the minimum weighted vertex cover problem (Q2473030) (← links)
- Invited talks (Q2692717) (← links)
- Parameterized Enumeration for Modification Problems (Q2799203) (← links)
- Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations (Q3507320) (← links)
- Extension of some edge graph problems: standard, parameterized and approximation complexity (Q6048430) (← links)