Pages that link to "Item:Q383833"

The following pages link to Fundamentals of parameterized complexity (Q383833):

Displaying 50 items.

• On the complexity of finding large odd induced subgraphs and odd colorings (Q5918338) (← links)
• Robustness among multiwinner voting rules (Q5918366) (← links)
• Minimum reload cost graph factors (Q5918369) (← links)
• Balanced stable marriage: how close is close enough? (Q5918373) (← links)
• Parameterised complexity of model checking and satisfiability in propositional dependence logic (Q5918486) (← links)
• Parameterized algorithms for finding highly connected solution (Q5918560) (← links)
• Default logic and bounded treewidth (Q5918613) (← links)
• Hardness results of global total \(k\)-domination problem in graphs (Q5918768) (← links)
• Parameterized algorithms for module map problems (Q5918889) (← links)
• The complexity of tree partitioning (Q5918926) (← links)
• Vertex deletion on split graphs: beyond 4-hitting set (Q5918994) (← links)
• Fine-grained complexity of safety verification (Q5919003) (← links)
• Parameterized complexity of geometric covering problems having conflicts (Q5919304) (← links)
• Enumeration and maximum number of maximal irredundant sets for chordal graphs (Q5919544) (← links)
• Approximability of covering cells with line segments (Q5919568) (← links)
• The parameterized complexity of cycle packing: indifference is not an issue (Q5919574) (← links)
• Obtaining a proportional allocation by deleting items (Q5925523) (← links)
• Structural parameterizations of budgeted graph coloring (Q5925707) (← links)
• On the upward book thickness problem: combinatorial and complexity results (Q5925712) (← links)
• Computations by fly-automata beyond monadic second-order logic (Q5964015) (← links)
• Parameterized certificate dispersal and its variants (Q5964075) (← links)
• Finding large degree-anonymous subgraphs is hard (Q5964077) (← links)
• Parameterized algorithms for finding highly connected solution (Q5970787) (← links)
• Kernelization of arc disjoint cycle packing in \(\alpha\)-bounded digraphs (Q6038707) (← links)
• A polynomial kernel for 3-leaf power deletion (Q6046945) (← links)
• The parameterized complexity of \(s\)-club with triangle and seed constraints (Q6056631) (← links)
• Dynamic coloring on restricted graph classes (Q6057319) (← links)
• Perfect forests in graphs and their extensions (Q6057643) (← links)
• On the bond polytope (Q6060889) (← links)
• (Q6065417) (← links)
• Finding Temporal Paths Under Waiting Time Constraints. (Q6065432) (← links)
• Even more effort towards improved bounds and fixed-parameter tractability for multiwinner rules (Q6066767) (← links)
• Computing optimal hypertree decompositions with SAT (Q6067037) (← links)
• Hedonic diversity games: a complexity picture with more than two colors (Q6067039) (← links)
• Component order connectivity in directed graphs (Q6068236) (← links)
• Parameterized algorithms and data reduction for the short secluded <i>s</i>‐<i>t</i>‐path problem (Q6068532) (← links)
• A note on hardness of computing recursive teaching dimension (Q6072213) (← links)
• Order Reconfiguration under Width Constraints (Q6075707) (← links)
• Polynomial Kernel for Interval Vertex Deletion (Q6075746) (← links)
• Sequential model-based diagnosis by systematic search (Q6080651) (← links)
• On the Parameterized Approximability of Contraction to Classes of Chordal Graphs (Q6084414) (← links)
• Parameterized complexity of finding a spanning tree with minimum reload cost diameter (Q6087398) (← links)
• (Q6089654) (← links)
• Parameterized Complexity of Directed Spanner Problems. (Q6089656) (← links)
• A Polynomial Kernel for Funnel Arc Deletion Set. (Q6089658) (← links)
• (Q6089666) (← links)
• Parameterized complexity of minimum membership dominating set (Q6090540) (← links)
• On the complexity of coloring ‐graphs (Q6092550) (← links)
• Parameterized complexity of categorical clustering with size constraints (Q6098152) (← links)
• Controlling entity integrity with key sets (Q6098153) (← links)