The following pages link to Parameterized Algorithms (Q5502162):
Displaying 50 items.
- Parameterized complexity of the anchored \(k\)-core problem for directed graphs (Q259037) (← links)
- A randomized algorithm for long directed cycle (Q264199) (← links)
- Linear-vertex kernel for the problem of packing \(r\)-stars into a graph without long induced paths (Q264204) (← links)
- On finding rainbow and colorful paths (Q266284) (← links)
- On polynomial kernels for sparse integer linear programs (Q269481) (← links)
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- On the complexity of connection games (Q307770) (← links)
- \(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments (Q329039) (← links)
- On the parameterized complexity of b-\textsc{chromatic number} (Q340565) (← links)
- Prices matter for the parameterized complexity of shift bribery (Q342714) (← links)
- Parameterized complexity of strip packing and minimum volume packing (Q501656) (← links)
- 1.5D terrain guarding problem parameterized by guard range (Q501659) (← links)
- On the complexity of computing the \(k\)-restricted edge-connectivity of a graph (Q501666) (← 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)
- Fixed-parameter algorithms for DAG partitioning (Q507587) (← links)
- Graph editing to a given degree sequence (Q507592) (← links)
- On optimal approximability results for computing the strong metric dimension (Q512531) (← links)
- \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions (Q516870) (← links)
- The complexity of finding effectors (Q519899) (← links)
- On the parameterized complexity of reconfiguration problems (Q527426) (← links)
- Edge bipartization faster than \(2^k\) (Q666655) (← links)
- Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs (Q666662) (← links)
- The minimum feasible tileset problem (Q666670) (← links)
- Parameterized algorithms for list \(K\)-cycle (Q666679) (← links)
- On the complete width and edge clique cover problems (Q721937) (← links)
- Rank reduction of oriented graphs by vertex and edge deletions (Q722520) (← links)
- Complexity of secure sets (Q722534) (← links)
- Stable matching games: manipulation via subgraph isomorphism (Q722540) (← links)
- Fréchet distance between a line and avatar point set (Q722543) (← links)
- Dynamic parameterized problems (Q722546) (← links)
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization (Q722549) (← links)
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← links)
- Approximability of clique transversal in perfect graphs (Q724231) (← links)
- Turing kernelization for finding long paths and cycles in restricted graph classes (Q730497) (← links)
- Multi-budgeted directed cuts (Q786027) (← links)
- The parameterised complexity of computing the maximum modularity of a graph (Q786031) (← links)
- Best-case and worst-case sparsifiability of Boolean CSPs (Q786033) (← links)
- Dual parameterization of weighted coloring (Q786042) (← links)
- Parameterized complexity of independent set in H-free graphs (Q786045) (← links)
- On the proper orientation number of chordal graphs (Q820574) (← links)
- A parameterized complexity view on collapsing \(k\)-cores (Q825978) (← links)
- Compactors for parameterized counting problems (Q826317) (← links)
- A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows (Q827589) (← links)
- New algorithms for minimizing the weighted number of tardy jobs on a single machine (Q829184) (← links)
- A \((2 + \epsilon ) k\)-vertex kernel for the dual coloring problem (Q831124) (← links)
- Coloring problems on bipartite graphs of small diameter (Q831342) (← links)
- On structural parameterizations of load coloring (Q831701) (← links)
- Parameterized complexity of \(d\)-hitting set with quotas (Q831823) (← links)
- The balanced satisfactory partition problem (Q831826) (← links)
