Pages that link to "Item:Q383833"

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

Displaying 20 items.

• Parameterized tractability of the maximum-duo preservation string mapping problem (Q306271) (← links)
• The complexity of finding effectors (Q519899) (← links)
• Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs (Q666662) (← links)
• Problems on finite automata and the exponential time hypothesis (Q1662614) (← links)
• Homothetic polygons and beyond: maximal cliques in intersection graphs (Q1671346) (← links)
• On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results (Q1693144) (← links)
• Backdoors for linear temporal logic (Q1725638) (← links)
• On the complexity of finding and counting solution-free sets of integers (Q1752464) (← links)
• On unrooted and root-uncertain variants of several well-known phylogenetic network problems (Q1755726) (← links)
• Scheduling meets \(n\)-fold integer programming (Q2317129) (← links)
• Polynomial kernels for vertex cover parameterized by small degree modulators (Q2322700) (← links)
• Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees (Q2403697) (← links)
• The complexity of degree anonymization by graph contractions (Q2407102) (← links)
• Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
• Parameterized and approximation algorithms for the load coloring problem (Q2408202) (← links)
• Line segment covering of cells in arrangements (Q2410576) (← links)
• A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter (Q3177162) (← links)
• Editing to Connected F-Degree Graph (Q5232130) (← links)
• Parameterized Resiliency Problems via Integer Linear Programming (Q5283365) (← links)
• Parameterized shifted combinatorial optimization (Q5915595) (← links)