The following pages link to (Q4393480):
Displaying 50 items.
- A simple algorithm for multicuts in planar graphs with outer terminals (Q1026166) (← links)
- Parameterized complexity of finding regular induced subgraphs (Q1026227) (← links)
- Algorithms for optimal outlier removal (Q1026234) (← links)
- Linear CNF formulas and satisfiability (Q1028433) (← links)
- The parameterized complexity of the induced matching problem (Q1028465) (← links)
- On parameterized exponential time complexity (Q1029333) (← links)
- Parameterized computational complexity of control problems in voting systems (Q1029347) (← links)
- On problems without polynomial kernels (Q1034099) (← links)
- Parameterized learnability of juntas (Q1034613) (← links)
- Fixed-parameter algorithms for Kemeny rankings (Q1035688) (← links)
- Isolation concepts for clique enumeration: comparison and computational experiments (Q1040581) (← links)
- Parameterized complexity of candidate control in elections and related digraph problems (Q1040585) (← links)
- Computational study on planar dominating set problem (Q1040587) (← links)
- A faster parameterized algorithm for set packing (Q1041711) (← links)
- On the shape of decomposable trees (Q1043555) (← links)
- The union of minimal hitting sets: parameterized combinatorial bounds and counting (Q1044023) (← links)
- Algorithms for generating convex sets in acyclic digraphs (Q1044043) (← links)
- Threshold dominating cliques in random graphs and interval routing (Q1044044) (← links)
- Bandwidth of bipartite permutation graphs in polynomial time (Q1044045) (← links)
- A fixed-parameter tractability result for multicommodity demand flow in trees (Q1045910) (← links)
- Fixed-parameter tractability of graph modification problems for hereditary properties (Q1352005) (← links)
- On the complexity of finding common approximate substrings. (Q1426464) (← links)
- Default reasoning from conditional knowledge bases: Complexity and tractable cases (Q1589638) (← links)
- An improved algorithm for the jump number problem (Q1603444) (← links)
- Perfect Code is \(W[1]\)-complete (Q1603518) (← links)
- The computational complexity of densest region detection (Q1604217) (← links)
- A general method to speed up fixed-parameter-tractable algorithms (Q1607033) (← links)
- Solving multi-granularity temporal constraint networks (Q1614864) (← links)
- A \((3+\epsilon)k\)-vertex kernel for edge-disjoint triangle packing (Q1628680) (← links)
- Triangle-free planar graphs with small independence number (Q1633607) (← links)
- Forming \(k\) coalitions and facilitating relationships in social networks (Q1647520) (← links)
- Two edge modification problems without polynomial kernels (Q1662097) (← links)
- The complexity of probabilistic lobbying (Q1662102) (← links)
- Critical and maximum independent sets of a graph (Q1671323) (← links)
- A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees (Q1671997) (← links)
- Note on maximal bisection above tight lower bound (Q1675768) (← links)
- The \(k\)-leaf spanning tree problem admits a klam value of 39 (Q1678098) (← links)
- Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover} (Q1679222) (← links)
- Chain minors are FPT (Q1679223) (← links)
- Change-making problems revisited: a parameterized point of view (Q1679517) (← links)
- FPT approximation schemes for maximizing submodular functions (Q1680508) (← links)
- On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability (Q1680511) (← links)
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
- Parameterized approximation via fidelity preserving transformations (Q1686226) (← links)
- Fixing improper colorings of graphs (Q1698729) (← links)
- On the parameterized complexity of \((k,s)\)-SAT (Q1711421) (← links)
- Multi-attribute proportional representation (Q1731837) (← links)
- A new decomposition technique for maximal clique enumeration for sparse graphs (Q1740688) (← links)
- The complexity of routing with collision avoidance (Q1741493) (← links)
- Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms (Q1745716) (← links)
