The following pages link to (Q4393480):
Displaying 50 items.
- Structural tractability of counting of solutions to conjunctive queries (Q269342) (← links)
- Ranking chain sum orders (Q290525) (← links)
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- Kernelizations for the hybridization number problem on multiple nonbinary trees (Q295644) (← links)
- On the complexity of connection games (Q307770) (← links)
- Solving linear equations parameterized by Hamming weight (Q309792) (← links)
- Graph isomorphism parameterized by elimination distance to bounded degree (Q309797) (← links)
- Fly-automata for checking monadic second-order properties of graphs of bounded tree-width (Q324700) (← links)
- The Flood-It game parameterized by the vertex cover number (Q324714) (← links)
- Kernelization using structural parameters on sparse graph classes (Q340583) (← links)
- A generalization of Spira's theorem and circuits with small segregators or separators (Q342721) (← links)
- Courcelle's theorem for triangulations (Q346450) (← links)
- Towards more expressive ontology languages: the query answering problem (Q359987) (← links)
- Fundamentals of parameterized complexity (Q383833) (← links)
- Increasing the minimum degree of a graph by contractions (Q385061) (← links)
- Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050) (← links)
- Parameterized complexity of Min-power multicast problems in wireless ad hoc networks (Q388087) (← links)
- Shuffled languages -- representation and recognition (Q388107) (← links)
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791) (← links)
- Finding approximate and constrained motifs in graphs (Q390871) (← links)
- Detecting induced minors in AT-free graphs (Q390909) (← links)
- Incremental list coloring of graphs, parameterized by conservation (Q391091) (← links)
- Two-layer planarization parameterized by feedback edge set (Q391093) (← links)
- Parameterized complexity of control by voter selection in Maximin, Copeland, Borda, Bucklin, and Approval election systems (Q391210) (← links)
- Parameterized complexity of max-lifetime target coverage in wireless sensor networks (Q391780) (← links)
- On the approximability of the link building problem (Q391785) (← links)
- Maximum balanced subgraph problem parameterized above lower bound (Q391973) (← links)
- Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game (Q391980) (← links)
- Parameterized complexity of \(k\)-Chinese postman problem (Q391983) (← links)
- Improved linear problem kernel for planar connected dominating set (Q392013) (← links)
- Parameterized maximum path coloring (Q392021) (← links)
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems (Q392025) (← links)
- Parameterized complexity of MaxSat above average (Q392026) (← links)
- Data reduction for graph coloring problems (Q393081) (← links)
- Polynomial kernels for proper interval completion and related problems (Q393083) (← links)
- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization (Q393084) (← links)
- A new bound for 3-satisfiable MaxSat and its algorithmic application (Q393085) (← links)
- Revisiting the complexity of and/or graph solution (Q394337) (← links)
- Parameterized complexity of connected even/odd subgraph problems (Q395000) (← links)
- The constrained shortest common supersequence problem (Q396654) (← links)
- On the approximability of the exemplar adjacency number problem for genomes with gene repetitions (Q401311) (← links)
- Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
- Towards NP-P via proof complexity and search (Q408544) (← links)
- A parameterized algorithm for the hyperplane-cover problem (Q410731) (← links)
- Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension (Q413466) (← links)
- Parameterized complexity of finding small degree-constrained subgraphs (Q414424) (← links)
- Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables (Q414863) (← links)
- A three-string approach to the closest string problem (Q414864) (← links)
- Editing graphs to satisfy degree constraints: a parameterized approach (Q414866) (← links)
- On bounded block decomposition problems for under-specified systems of equations (Q414888) (← links)
