Pages that link to "Item:Q383833"
From MaRDI portal
The following pages link to Fundamentals of parameterized complexity (Q383833):
Displaying 50 items.
- Computing nearest neighbour interchange distances between ranked phylogenetic trees (Q96718) (← links)
- Parameterized complexity of the anchored \(k\)-core problem for directed graphs (Q259037) (← links)
- Parameterizations of test cover with bounded test sizes (Q261370) (← links)
- Parameterized algorithms for finding square roots (Q262249) (← links)
- Linear-vertex kernel for the problem of packing \(r\)-stars into a graph without long induced paths (Q264204) (← links)
- Complexity and monotonicity results for domination games (Q266262) (← links)
- On the ordered list subgraph embedding problems (Q270006) (← links)
- An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification (Q284360) (← links)
- Structural parameterizations for boxicity (Q289935) (← links)
- Win-win kernelization for degree sequence completion problems (Q295647) (← links)
- A fast algorithm for permutation pattern matching based on alternating runs (Q300457) (← links)
- Chordal editing is fixed-parameter tractable (Q300460) (← links)
- Reduction rules for the maximum parsimony distance on phylogenetic trees (Q306268) (← links)
- Parameterized tractability of the maximum-duo preservation string mapping problem (Q306271) (← links)
- On the complexity of connection games (Q307770) (← links)
- Solving linear equations parameterized by Hamming weight (Q309792) (← links)
- Polynomial kernels and user reductions for the workflow satisfiability problem (Q309799) (← links)
- Parameterized approximation algorithms for packing problems (Q313963) (← links)
- Rural postman parameterized by the number of components of required edges (Q314816) (← links)
- Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory (Q314827) (← links)
- Kernelization of edge perfect code and its variants (Q317422) (← links)
- Algorithms for the workflow satisfiability problem engineered for counting constraints (Q328681) (← links)
- New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
- \(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments (Q329039) (← links)
- Parameterized complexity of the \(k\)-arc Chinese postman problem (Q340562) (← links)
- On the parameterized complexity of b-\textsc{chromatic number} (Q340565) (← links)
- The parameterised complexity of list problems on graphs of bounded treewidth (Q342709) (← links)
- Prices matter for the parameterized complexity of shift bribery (Q342714) (← links)
- Parameterized algorithms for the module motif problem (Q342716) (← links)
- Courcelle's theorem for triangulations (Q346450) (← links)
- Do branch lengths help to locate a tree in a phylogenetic network? (Q347040) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Exploiting a hypergraph model for finding Golomb rulers (Q471187) (← links)
- Parametrized algorithms for random serial dictatorship (Q477775) (← links)
- Path-driven orientation of mixed graphs (Q479025) (← links)
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- Minimizing Rosenthal potential in multicast games (Q493648) (← links)
- Complexity of rainbow vertex connectivity problems for restricted graph classes (Q505435) (← links)
- Partition on trees with supply and demand: kernelization and algorithms (Q507429) (← links)
- Shortcutting directed and undirected networks with a degree constraint (Q507583) (← links)
- Fixed-parameter algorithms for DAG partitioning (Q507587) (← links)
- Graph editing to a given degree sequence (Q507592) (← links)
- Separating sets of strings by finding matching patterns is almost always hard (Q507598) (← links)
- On the parameterized complexity of the edge monitoring problem (Q509893) (← links)
- Unit interval editing is fixed-parameter tractable (Q515577) (← links)
- A linear kernel for planar red-blue dominating set (Q516887) (← links)
- The complexity of finding effectors (Q519899) (← links)
- Graph editing problems with extended regularity constraints (Q526874) (← links)
- List H-coloring a graph by removing few vertices (Q527415) (← links)
- Edge bipartization faster than \(2^k\) (Q666655) (← links)
