Pages that link to "Parameterized complexity"
Showing 50 items.
- Complexity (links | edit)
- Computational complexity theory (links | edit)
- SameGame (links | edit)
- Bipartite graph (links | edit)
- Clique problem (links | edit)
- List of computability and complexity topics (links | edit)
- Interval graph (links | edit)
- Random ballot (links | edit)
- Time complexity (links | edit)
- 2-satisfiability (links | edit)
- Steiner tree problem (links | edit)
- Clique (graph theory) (links | edit)
- Vertex cover (links | edit)
- Fixed-parameter tractable (redirect to section "FPT") (links | edit)
- Quadratic residue (links | edit)
- Bipartite graph (links | edit)
- Hasse diagram (links | edit)
- Robertson–Seymour theorem (links | edit)
- Integer programming (links | edit)
- Combinatorial optimization (links | edit)
- 2-satisfiability (links | edit)
- Vertex cover (links | edit)
- Parameterized complexity (links | edit)
- List of complexity classes (links | edit)
- Graph homomorphism (links | edit)
- List coloring (links | edit)
- Betweenness problem (links | edit)
- Dominating set (links | edit)
- Feedback vertex set (links | edit)
- Feedback arc set (links | edit)
- Monochromatic triangle (links | edit)
- Fully polynomial-time approximation scheme (links | edit)
- No-three-in-line problem (links | edit)
- Book embedding (links | edit)
- Pathwidth (links | edit)
- Sunflower (mathematics) (links | edit)
- Crossing number (graph theory) (links | edit)
- Maximum cut (links | edit)
- Bipartite dimension (links | edit)
- Closest string (links | edit)
- Set splitting problem (links | edit)
- Permutation pattern (links | edit)
- Intersection number (graph theory) (links | edit)
- Iterative compression (links | edit)
- Utilitarian cake-cutting (links | edit)
- Leaf power (links | edit)
- Universal vertex (links | edit)
- Half graph (links | edit)
- Nonblocker (links | edit)
- Odd cycle transversal (links | edit)
- Induced matching (links | edit)
- Combinatorial participatory budgeting (links | edit)
- Crossing Numbers of Graphs (links | edit)
- Vertex cover in hypergraphs (links | edit)
- Graham–Pollak theorem (links | edit)
- Strong connectivity augmentation (links | edit)
- E-graph (links | edit)
- House allocation problem (links | edit)
- Cutwidth (links | edit)
- Twin-width (links | edit)
- Phylogenetic reconciliation (links | edit)
- Multi-issue voting (links | edit)
- Carving width (links | edit)
- Doignon's theorem (links | edit)
- Martin Fürer (links | edit)
- Flip distance (links | edit)
- Talk:Robertson–Seymour theorem (links | edit)
- Talk:Cobham's thesis (links | edit)
- User:Nmillerche/sandbox/Combinatorial optimization (links | edit)
- User:Tokenzero/Graph homomorphism (links | edit)
- Graph homomorphism (links | edit)
- Edge coloring (links | edit)
- Chordal graph (links | edit)
- Erik Demaine (links | edit)
- Cograph (links | edit)
- Betweenness problem (links | edit)
- Circuit rank (links | edit)
- Paul Seymour (mathematician) (links | edit)
- Hadwiger number (links | edit)
- Metric dimension (graph theory) (links | edit)
- Feedback arc set (links | edit)
- No-three-in-line problem (links | edit)
- Connected dominating set (links | edit)
- Proof complexity (links | edit)
- W1 (links | edit)
- Treewidth (links | edit)
- Book embedding (links | edit)
- Fixed-parameter algorithm (redirect page) (links | edit)
- Fixed-parameter tractability (redirect to section "FPT") (links | edit)
- Combinatorial optimization (links | edit)
- FPT (links | edit)
- Connected dominating set (links | edit)
- Graph embedding (links | edit)
- Hosoya index (links | edit)
- Kernelization (links | edit)
- Planar separator theorem (links | edit)
- Matching polynomial (links | edit)
- Apex graph (links | edit)
- Talk:Fixed-parameter algorithm (links | edit)
- Noga Alon (links | edit)
- Michael Langston (links | edit)
- Grundy number (links | edit)
- Sunflower (mathematics) (links | edit)
- Boxicity (links | edit)
- Claw-free graph (links | edit)
- Kernelization (links | edit)
- Clique-width (links | edit)
- Branch-decomposition (links | edit)
- Michael Fellows (links | edit)
- Longest path problem (links | edit)
- Planar separator theorem (links | edit)
- Closest string (links | edit)
- Equitable coloring (links | edit)
- Parameterized Complexity (redirect page) (links | edit)
- MAXEkSAT (links | edit)
- NP-completeness (links | edit)