Pages that link to "Item:Q3651529"

The following pages link to Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology (Q3651529):

Displaying 23 items.

• Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
• The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
• Incremental list coloring of graphs, parameterized by conservation (Q391091) (← links)
• Two-layer planarization parameterized by feedback edge set (Q391093) (← links)
• Aspects of a multivariate complexity analysis for rectangle tiling (Q408398) (← links)
• Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} (Q489714) (← links)
• Restricted and swap common superstring: a multivariate algorithmic perspective (Q494787) (← links)
• On making a distinguished vertex of minimum degree by vertex deletion (Q528861) (← links)
• Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring (Q533417) (← links)
• Vertex cover problem parameterized above and below tight bounds (Q633768) (← links)
• On families of categorial grammars of bounded value, their learnability and related complexity questions (Q714784) (← links)
• Average parameterization and partial kernelization for computing medians (Q716309) (← links)
• The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
• On bounded-degree vertex deletion parameterized by treewidth (Q765338) (← links)
• The complexity of probabilistic lobbying (Q1662102) (← links)
• Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications (Q1759678) (← links)
• Algorithmic meta-theorems for restrictions of treewidth (Q1759681) (← links)
• Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668) (← links)
• The effect of homogeneity on the computational complexity of combinatorial data anonymization (Q2435706) (← links)
• Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
• Studies in Computational Aspects of Voting (Q2908543) (← links)
• Efficient Algorithms for Eulerian Extension (Q3057616) (← links)
• Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs (Q3449507) (← links)