The following pages link to (Q4393480):
Displaying 22 items.
- Subexponential parameterized algorithms (Q458457) (← links)
- Combinatorics for smaller kernels: the differential of a graph (Q476877) (← links)
- Guard games on graphs: keep the intruder out! (Q650877) (← links)
- There is no EPTAS for two-dimensional knapsack (Q765522) (← links)
- On finding short resolution refutations and small unsatisfiable subsets (Q820148) (← links)
- Moving policies in cyclic assembly line scheduling (Q820155) (← links)
- Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
- Sort and Search: exact algorithms for generalized domination (Q989487) (← links)
- Fixed-parameter tractability of graph modification problems for hereditary properties (Q1352005) (← links)
- On the parametric complexity of schedules to minimize tardy tasks. (Q1874274) (← links)
- Improved Steiner tree algorithms for bounded treewidth (Q1932355) (← links)
- Subexponential algorithms for partial cover problems (Q1944141) (← links)
- Towards optimal kernel for connected vertex cover in planar graphs (Q1949125) (← links)
- The parameterized complexity of some minimum label problems (Q1959420) (← links)
- Facility location problems: a parameterized view (Q2275913) (← links)
- Approximating clique-width and branch-width (Q2496203) (← links)
- Sparse parameterized problems (Q2564046) (← links)
- Tight lower bounds for certain parameterized NP-hard problems (Q2568440) (← links)
- A refined search tree technique for dominating set on planar graphs (Q2575830) (← links)
- Satisfying more than half of a system of linear equations over GF(2): a multivariate approach (Q2637641) (← links)
- A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs (Q5154765) (← links)
- Fixed-parameter complexity of \(\lambda\)-labelings (Q5948961) (← links)
