Pages that link to "Item:Q340549"

The following pages link to Polynomial kernels for weighted problems (Q340549):

Displaying 20 items.

• Problems on finite automata and the exponential time hypothesis (Q1662614) (← links)
• Change-making problems revisited: a parameterized point of view (Q1679517) (← links)
• Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
• Pattern matching and consensus problems on weighted sequences and profiles (Q2000001) (← links)
• Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
• Parameterized resiliency problems (Q2330129) (← links)
• Knapsack problems: a parameterized point of view (Q2419116) (← links)
• On the parameterized complexity of the connected flow and many visits TSP problem (Q2672424) (← links)
• Polynomial-time data reduction for weighted problems beyond additive goal functions (Q2685700) (← links)
• (Q2946400) (redirect page) (← links)
• The complexity of speedrunning video games (Q3301017) (← links)
• Kernelization of Graph Hamiltonicity: Proper $H$-Graphs (Q4986812) (← links)
• Parameterized Resiliency Problems via Integer Linear Programming (Q5283365) (← links)
• (Q5874519) (← links)
• Parameterized algorithms and data reduction for the short secluded <i>s</i>‐<i>t</i>‐path problem (Q6068532) (← links)
• A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics (Q6089980) (← links)
• On approximate data reduction for the Rural Postman Problem: Theory and experiments (Q6092640) (← links)
• Parameterized complexity for iterated type partitions and modular-width (Q6126724) (← links)
• Parameterized and approximation algorithms for the maximum bimodal subgraph problem (Q6618261) (← links)
• Serial batching to minimize the weighted number of tardy jobs (Q6657883) (← links)