Pages that link to "Item:Q383833"
From MaRDI portal
The following pages link to Fundamentals of parameterized complexity (Q383833):
Displaying 50 items.
- FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective (Q6100609) (← links)
- Essentially tight kernels for (weakly) closed graphs (Q6103524) (← links)
- Equitable scheduling on a single machine (Q6103750) (← links)
- Computing dense and sparse subgraphs of weakly closed graphs (Q6107896) (← links)
- Gehrlein stable committee with multi-modal preferences (Q6109543) (← links)
- Target set selection with maximum activation time (Q6110610) (← links)
- Detours in directed graphs (Q6113279) (← links)
- Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs (Q6116185) (← links)
- Star covers and star partitions of double-split graphs (Q6124494) (← links)
- Recognizing when a preference system is close to admitting a master list (Q6124592) (← links)
- Packing arc-disjoint cycles in oriented graphs (Q6126480) (← links)
- Parameterised and fine-grained subgraph counting, modulo 2 (Q6130316) (← links)
- A multivariate complexity analysis of the material consumption scheduling problem (Q6136081) (← links)
- How to find a good explanation for clustering? (Q6136087) (← links)
- Invertibility of Digraphs and Tournaments (Q6141864) (← links)
- Disentangling the computational complexity of network untangling (Q6151149) (← links)
- Deep kernelization for the tree bisection and reconnection (TBR) distance in phylogenetics (Q6152184) (← links)
- CSP beyond tractable constraint languages (Q6154179) (← links)
- Grid recognition: classical and parameterized computational perspectives (Q6156159) (← links)
- Solving infinite-domain CSPs using the patchwork property (Q6157211) (← links)
- Parameterized Counting and Cayley Graph Expanders (Q6158357) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- What Is Known About Vertex Cover Kernelization? (Q6163635) (← links)
- A Modern View on Stability of Approximation (Q6163638) (← links)
- Computing maximum matchings in temporal graphs (Q6168321) (← links)
- Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space (Q6170447) (← links)
- Lossy kernelization of same-size clustering (Q6174654) (← links)
- Turing machines with two-level memory: new computational models for analyzing the input/output complexity (Q6185847) (← links)
- The parameterized complexity of guarding almost convex polygons (Q6191439) (← links)
- Maximizing Social Welfare in Score-Based Social Distance Games (Q6199615) (← links)
- Constrained hitting set problem with intervals: hardness, FPT and approximation algorithms (Q6201335) (← links)
- Diverse collections in matroids and graphs (Q6201861) (← links)
- One-sided terrain guarding and chordal graphs (Q6204302) (← links)
- A Fixed-Parameter Algorithm for Scheduling Unit Dependent Tasks with Unit Communication Delays (Q6487185) (← links)
- Approximate search for known gene clusters in new genomes using PQ-trees (Q6487618) (← links)
- An algorithmic framework for locally constrained homomorphisms (Q6499010) (← links)
- On the parameterized complexity of freezing dynamics (Q6499443) (← links)
- Bounding and computing obstacle numbers of graphs (Q6542540) (← links)
- Kernelization for finding lineal topologies (depth-first spanning trees) with many or few leaves (Q6546606) (← links)
- Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines (Q6547133) (← links)
- On star partition of split graphs (Q6547833) (← links)
- Star covers and star partitions of cographs and butterfly-free graphs (Q6547835) (← links)
- Open packing in \(H\)-free graphs and subclasses of split graphs (Q6547836) (← links)
- Directed ear anonymity (Q6547947) (← links)
- A polynomial kernel for proper Helly circular-arc vertex deletion (Q6547958) (← links)
- On the parameterized complexity of non-hereditary relaxations of clique (Q6549685) (← links)
- On approximation of multiple intruder locating domination number of a graph (Q6551048) (← links)
- Being an influencer is hard: the complexity of influence maximization in temporal graphs with a fixed source (Q6559029) (← links)
- Preprocessing to reduce the search space: antler structures for feedback vertex set (Q6564613) (← links)
- Backdoor DNFs (Q6564620) (← links)
