scientific article; zbMATH DE number 512804
From MaRDI portal
Publication:4281497
Recommendations
Cited in
(60)- Parameterized circuit complexity and the \(W\) hierarchy
- The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
- \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling
- Improved analysis of highest-degree branching for feedback vertex set
- On the parameterized complexity of the expected coverage problem
- From the \(W\)-hierarchy to XNLP. Classes of fixed parameter intractability
- Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers
- Bounded fixed-parameter tractability and reducibility
- A polynomial kernel for block graph deletion
- On the structure of parameterized problems in NP
- Sparse parameterized problems
- Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits
- Fixed-parameter tractability, definability, and model-checking
- The birth and early years of parameterized complexity
- A basic parameterized complexity primer
- A Parameterized Halting Problem
- Reachability in graph transformation systems and slice languages
- Fixed-parameter decidability: extending parameterized complexity analysis
- A quartic kernel for pathwidth-one vertex deletion
- An Isomorphism Between Subexponential and Parameterized Complexity Theory
- scientific article; zbMATH DE number 125608 (Why is no real title available?)
- scientific article; zbMATH DE number 1114020 (Why is no real title available?)
- Book review of: Rolf Niedermeier, Invitation to fixed-parameter algorithms
- Confronting intractability via parameters
- scientific article; zbMATH DE number 749922 (Why is no real title available?)
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Graphs with few \(P_4\)'s under the convexity of paths of order three
- On feedback vertex set: new measure and new structures
- scientific article; zbMATH DE number 7378390 (Why is no real title available?)
- Exploring the kernelization borders for hitting cycles
- On the Complexity of Singly Connected Vertex Deletion
- On the Parameterized Complexity of the Expected Coverage Problem
- A Retrospective on (Meta) Kernelization
- Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues
- Parameterized complexity of conflict-free matchings and paths
- scientific article; zbMATH DE number 7286685 (Why is no real title available?)
- Modified parameterized complexity theory
- Computing and Combinatorics
- An improved FPT algorithm for independent feedback vertex set
- Index sets and parametric reductions
- Improved FPT Algorithms for Deletion to Forest-Like Structures.
- Domino treewidth
- Generating Faster Algorithms for d-Path Vertex Cover
- Dominating set is fixed parameter tractable in claw-free graphs
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Advice classes of parametrized tractability
- Hard problems on random graphs
- On parameterized independent feedback vertex set
- Roman cycle hitting set
- Parameterized quantum query algorithms for graph problems
- Solving subset feedback vertex set in chordal graphs faster than 2ᵏ
- Parameterized complexity of feedback vertex set with connectivity constraints
- Solving partial dominating set and related problems using twin-width
- Parameterised holant problems
- Compactors for parameterized counting problems
- Parameterized power domination complexity
- On the hardness of labeled correlation clustering problem: a parameterized complexity view
- Efficient algorithms for counting parameterized list H-colorings
- Improved algorithms for feedback vertex set problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4281497)
