The following pages link to (Q4393480):
Displaying 50 items.
- On making directed graphs transitive (Q414917) (← links)
- A structural/temporal query language for business processes (Q414923) (← links)
- Parameterized complexity of generalized domination problems (Q415279) (← links)
- A strengthened analysis of an algorithm for dominating set in planar graphs (Q415281) (← links)
- On graph contractions and induced minors (Q415282) (← links)
- Mod/Resc parsimony inference: theory and application (Q418168) (← links)
- Phylogeny- and parsimony-based haplotype inference with constraints (Q418170) (← links)
- Routing multi-class traffic flows in the plane (Q427052) (← links)
- A note on the parameterized complexity of unordered maximum tree orientation (Q427909) (← links)
- Influence of tree topology restrictions on the complexity of haplotyping with missing data (Q428852) (← links)
- Most probable explanations in Bayesian networks: complexity and tractability (Q433524) (← links)
- Parameterized Eulerian strong component arc deletion problem on tournaments (Q437687) (← links)
- Local search: is brute-force avoidable? (Q439931) (← links)
- Catalan structures and dynamic programming in \(H\)-minor-free graphs (Q440008) (← links)
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem (Q444386) (← links)
- Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number (Q450563) (← links)
- On the parameterized complexity of coloring graphs in the absence of a linear forest (Q450579) (← links)
- Graph-based data clustering with overlaps (Q456688) (← links)
- Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover (Q456689) (← links)
- Charge and reduce: A fixed-parameter algorithm for string-to-string correction (Q456695) (← links)
- Parameterized complexity and approximability of the longest compatible sequence problem (Q456697) (← links)
- FPT algorithms for path-transversal and cycle-transversal problems (Q456698) (← links)
- Treewidth governs the complexity of target set selection (Q456700) (← links)
- On the directed full degree spanning tree problem (Q456701) (← links)
- Lower bounds on kernelization (Q456702) (← links)
- Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (Q457253) (← links)
- Book review of: Rolf Niedermeier, Invitation to fixed-parameter algorithms (Q458454) (← links)
- Subexponential parameterized algorithms (Q458457) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning (Q460604) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Independent dominating set problem revisited (Q476836) (← links)
- Induced subgraph isomorphism on proper interval and bipartite permutation graphs (Q476868) (← links)
- Combinatorics for smaller kernels: the differential of a graph (Q476877) (← links)
- Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees (Q476897) (← links)
- A fixed-parameter algorithm for the vertex cover \(P_3\) problem (Q477591) (← links)
- Computing the pathwidth of directed graphs with small vertex cover (Q477674) (← links)
- \(k\)-attribute-anonymity is hard even for \(k=2\) (Q477690) (← links)
- Complexity of conflict-free colorings of graphs (Q484316) (← links)
- Consequence-based and fixed-parameter tractable reasoning in description logics (Q490523) (← links)
- Graphs with few \(P_4\)'s under the convexity of paths of order three (Q491593) (← links)
- Correcting gene tree by removal and modification: tractability and approximability (Q491623) (← links)
- A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization (Q494803) (← links)
- Parameterized complexity analysis for the closest string with wildcards problem (Q495996) (← links)
- Inapproximability results for graph convexity parameters (Q496002) (← links)
- On the max min vertex cover problem (Q499339) (← links)
- On finding optimal polytrees (Q500966) (← links)
- Parameterized complexity of strip packing and minimum volume packing (Q501656) (← links)
- On the complexity of computing the \(k\)-restricted edge-connectivity of a graph (Q501666) (← links)
- Improved kernel results for some FPT problems based on simple observations (Q507431) (← links)
