The following pages link to (Q4503944):
Displaying 50 items.
- Scattered packings of cycles (Q306707) (← links)
- Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control (Q314421) (← links)
- The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
- Relativization makes contradictions harder for resolution (Q386151) (← links)
- Variants of constrained longest common subsequence (Q407588) (← links)
- Aspects of a multivariate complexity analysis for rectangle tiling (Q408398) (← links)
- On the parameterized complexity of the repetition free longest common subsequence problem (Q413298) (← links)
- On the model-checking of monadic second-order formulas with edge set quantifications (Q415286) (← links)
- Kernelization for cycle transversal problems (Q423937) (← links)
- New results for the longest haplotype reconstruction problem (Q423956) (← links)
- Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem (Q439653) (← links)
- Multicut in trees viewed through the eyes of vertex cover (Q440014) (← links)
- Parameterized proof complexity (Q451111) (← links)
- Book review of: Rolf Niedermeier, Invitation to fixed-parameter algorithms (Q458454) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Complexity of splits reconstruction for low-degree trees (Q476307) (← links)
- Approximation algorithms for intersection graphs (Q476425) (← links)
- The kernelization complexity of connected domination in graphs with (no) small cycles (Q476436) (← links)
- Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable (Q476442) (← links)
- Towards optimal and expressive kernelization for \(d\)-hitting set (Q486984) (← links)
- Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions (Q494805) (← links)
- Complexity of fixed-size bit-vector logics (Q504997) (← links)
- Incremental problems in the parameterized complexity setting (Q519883) (← links)
- Graph editing problems with extended regularity constraints (Q526874) (← links)
- On making a distinguished vertex of minimum degree by vertex deletion (Q528861) (← links)
- Fixed-parameter tractability of satisfying beyond the number of variables (Q528862) (← links)
- Improved deterministic algorithms for weighted matching and packing problems (Q534565) (← links)
- On the small cycle transversal of planar graphs (Q551170) (← links)
- Minimum vertex cover in rectangle graphs (Q551504) (← links)
- Infeasibility of instance compression and succinct PCPs for NP (Q619903) (← links)
- Fast evaluation of interlace polynomials on graphs of bounded treewidth (Q634679) (← links)
- Dominating set is fixed parameter tractable in claw-free graphs (Q650938) (← links)
- On the induced matching problem (Q657915) (← links)
- Improved upper bounds for vertex cover (Q708228) (← links)
- New results on optimizing rooted triplets consistency (Q708349) (← links)
- Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314) (← links)
- Boolean-width of graphs (Q719257) (← links)
- On the treewidth of dynamic graphs (Q744102) (← links)
- Complexity of abstract argumentation under a claim-centric view (Q785236) (← links)
- On miniaturized problems in parameterized complexity theory (Q820145) (← links)
- Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability (Q840834) (← links)
- On product covering in 3-tier supply chain models: natural complete problems for W[3] and W[4] (Q860874) (← links)
- Polynomial time approximation schemes and parameterized complexity (Q867860) (← links)
- An efficient fixed-parameter algorithm for 3-hitting set (Q876698) (← links)
- On the complexity of the regenerator location problem treewidth and other parameters (Q896670) (← links)
- Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules (Q898752) (← links)
- Seeing the trees and their branches in the network is hard (Q935159) (← links)
- Every minor-closed property of sparse graphs is testable (Q962147) (← links)
- An improved lower bound on approximation algorithms for the closest substring problem (Q963389) (← links)
- Linear delay enumeration and monadic second-order logic (Q967312) (← links)
