The following pages link to (Q4252414):
Displaying 15 items.
- Exact algorithms for dominating set (Q411862) (← links)
- The ordered covering problem (Q722532) (← links)
- Efficiency in exponential time for domination-type problems (Q1003475) (← links)
- On parameterized exponential time complexity (Q1029333) (← links)
- Pathwidth of cubic graphs and exact algorithms (Q1045933) (← links)
- Which problems have strongly exponential complexity? (Q1604206) (← links)
- Sparsification and subexponential approximation (Q1702300) (← links)
- Computing the number of induced copies of a fixed graph in a bounded degree graph (Q1741847) (← links)
- A note on the fine-grained complexity of MIS on regular graphs (Q2032165) (← links)
- Defensive alliances in graphs (Q2079875) (← links)
- Genus characterizes the complexity of certain graph problems: Some tight results (Q2641866) (← links)
- Simultaneous feedback edge set: a parameterized perspective (Q2659779) (← links)
- The Time Complexity of Constraint Satisfaction (Q3503589) (← links)
- Finding Points in General Position (Q4605338) (← links)
- Offensive alliances in graphs (Q6201327) (← links)