The following pages link to (Q4393480):
Displaying 50 items.
- Crowns in bipartite graphs (Q510531) (← links)
- Campaign management under approval-driven voting rules (Q513294) (← links)
- Parameterized complexity of critical node cuts (Q517024) (← links)
- On the parameterized complexity of reconfiguration problems (Q527426) (← links)
- Complexity issues in vertex-colored graph pattern matching (Q533412) (← links)
- Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring (Q533417) (← links)
- A kernel of order \(2k - c\) for Vertex Cover (Q534063) (← links)
- Parameterized complexity of coloring problems: treewidth versus vertex cover (Q534566) (← links)
- The intractability of computing the Hamming distance (Q557834) (← links)
- Machine-based methods in parameterized complexity theory (Q557897) (← links)
- Parameterized pursuit-evasion games (Q604466) (← links)
- On the parameterized complexity of some optimization problems related to multiple-interval graphs (Q606990) (← links)
- Exact algorithms for computing the tree edit distance between unordered trees (Q620949) (← links)
- On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
- Computing bond orders in molecule graphs (Q631782) (← links)
- A probabilistic approach to problems parameterized above or below tight bounds (Q632807) (← links)
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (Q635734) (← links)
- Parameterized complexity of even/odd subgraph problems (Q635735) (← links)
- Contracting planar graphs to contractions of triangulations (Q635743) (← links)
- Kernel bounds for disjoint cycles and disjoint paths (Q638521) (← links)
- Hardness of subgraph and supergraph problems in \(c\)-tournaments (Q638528) (← links)
- Guard games on graphs: keep the intruder out! (Q650877) (← links)
- Bandwidth on AT-free graphs (Q650939) (← links)
- Approximation schemes for deal splitting and covering integer programs with multiplicity constraints (Q655417) (← links)
- Parameterized complexity of control problems in Maximin election (Q656582) (← links)
- Note on Max Lin-2 above average (Q656604) (← links)
- Spanners in sparse graphs (Q657919) (← links)
- A generalization of Nemhauser and Trotter's local optimization theorem (Q657921) (← links)
- Implicit branching and parameterized partial cover problems (Q657922) (← links)
- Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques (Q666659) (← links)
- Fixed-parameter tractability and completeness II: On completeness for W[1] (Q673779) (← links)
- Advice classes of parametrized tractability (Q676315) (← links)
- Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy (Q690460) (← links)
- On parameterized independent feedback vertex set (Q690464) (← links)
- On the complexity of fixed parameter clique and dominating set (Q703534) (← links)
- On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality (Q703542) (← links)
- Lower bounds on the differential of a graph (Q713137) (← links)
- Kernelization hardness of connectivity problems in \(d\)-degenerate graphs (Q713308) (← links)
- Cluster editing with locally bounded modifications (Q713321) (← links)
- Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width (Q713329) (← links)
- On families of categorial grammars of bounded value, their learnability and related complexity questions (Q714784) (← links)
- Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover (Q714786) (← links)
- Computing vertex-surjective homomorphisms to partially reflexive trees (Q714844) (← links)
- Average parameterization and partial kernelization for computing medians (Q716309) (← links)
- On the hardness of finding near-optimal multicuts in directed acyclic graphs (Q719273) (← links)
- Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems (Q719315) (← links)
- On the computational complexity of vertex integrity and component order connectivity (Q727981) (← links)
- The parameterized complexity of \(k\)-edge induced subgraphs (Q729817) (← links)
- Inclusion dependencies and their interaction with functional dependencies in SQL (Q730506) (← links)
- Resource restricted computability theoretic learning: Illustrative topics and problems (Q733738) (← links)
