The following pages link to (Q4393480):
Displaying 50 items.
- Reconfiguration on sparse graphs (Q1747496) (← links)
- The critical node detection problem in networks: a survey (Q1750314) (← links)
- Min-max cover of a graph with a small number of parts (Q1751107) (← links)
- Polynomial kernels for deletion to classes of acyclic digraphs (Q1751231) (← links)
- Complexity of minimum irreducible infeasible subsystem covers for flow networks (Q1752598) (← links)
- FPT-algorithms for some problems related to integer programming (Q1752617) (← links)
- Augmenting tractable fragments of abstract argumentation (Q1761284) (← links)
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs (Q1764807) (← links)
- Embeddings of \(k\)-connected graphs of pathwidth \(k\) (Q1764809) (← links)
- Balanced vertex-orderings of graphs (Q1775059) (← links)
- Core instances for testing: a case study (Q1779532) (← links)
- Polynomial and APX-hard cases of the individual haplotyping problem (Q1781994) (← links)
- Contraction and deletion blockers for perfect graphs and \(H\)-free graphs (Q1784743) (← links)
- Preprocessing of intractable problems (Q1854544) (← links)
- On the parametric complexity of schedules to minimize tardy tasks. (Q1874274) (← links)
- Describing parameterized complexity classes (Q1877556) (← links)
- The Turing way to parameterized complexity (Q1877697) (← links)
- The \(k\)-feature set problem is \(W[2]\)-complete (Q1877698) (← links)
- Solving large FPT problems on coarse-grained parallel machines (Q1877701) (← links)
- Call control with \(k\) rejections (Q1877703) (← links)
- On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems (Q1877706) (← links)
- Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms (Q1877711) (← links)
- Hard problems in similarity searching (Q1885825) (← links)
- The complexity of first-order and monadic second-order logic revisited (Q1886318) (← links)
- Decidability of bounded second order unification (Q1887168) (← links)
- A new view on rural postman based on Eulerian extension and matching (Q1932348) (← links)
- Improved Steiner tree algorithms for bounded treewidth (Q1932355) (← links)
- A golden ratio parameterized algorithm for cluster editing (Q1932356) (← links)
- Even faster parameterized cluster deletion and cluster editing (Q1944120) (← links)
- Subexponential algorithms for partial cover problems (Q1944141) (← links)
- Automata for the verification of monadic second-order graph properties (Q1948277) (← links)
- Towards optimal kernel for connected vertex cover in planar graphs (Q1949125) (← links)
- Fixed-parameter evolutionary algorithms and the vertex cover problem (Q1949737) (← links)
- The parameterized complexity of some minimum label problems (Q1959420) (← links)
- Towards a dichotomy for the possible winner problem in elections based on scoring rules (Q1959429) (← links)
- An improved kernel for max-bisection above tight lower bound (Q1985605) (← links)
- On the parameterized complexity of contraction to generalization of trees (Q2000005) (← links)
- On the parameterized complexity of consensus clustering (Q2015135) (← links)
- Faster deterministic \textsc{Feedback Vertex Set} (Q2015151) (← links)
- Solution methods for the vertex variant of the network system vulnerability analysis problem (Q2017536) (← links)
- Succinct monotone circuit certification: planarity and parameterized complexity (Q2019496) (← links)
- Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives (Q2029600) (← links)
- The conditional \(p\)-dispersion problem (Q2046325) (← links)
- Fine-grained complexity of rainbow coloring and its variants (Q2051859) (← links)
- On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem (Q2078619) (← links)
- Defensive alliances in graphs (Q2079875) (← links)
- Finding kings in tournaments (Q2081490) (← links)
- CNF satisfiability in a subspace and related problems (Q2093572) (← links)
- Parameterized complexity classes defined by threshold circuits: using sorting networks to show collapses with W-hierarchy classes (Q2150563) (← links)
- Constrained stable marriage with free edges or few blocking pairs (Q2150572) (← links)
