Pages that link to "Item:Q3113732"

The following pages link to Reflections on Multivariate Algorithmics and Problem Parameterization (Q3113732):

Displaying 50 items.

• \(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments (Q329039) (← links)
• 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)
• Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050) (← 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)
• Manipulation can be hard in tractable voting systems even for constant-sized coalitions (Q465694) (← links)
• Exploiting a hypergraph model for finding Golomb rulers (Q471187) (← links)
• Restricted and swap common superstring: a multivariate algorithmic perspective (Q494787) (← links)
• 1.5D terrain guarding problem parameterized by guard range (Q501659) (← links)
• Fixed-parameter algorithms for DAG partitioning (Q507587) (← 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)
• Parameterizing by the number of numbers (Q692894) (← 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)
• On bounded-degree vertex deletion parameterized by treewidth (Q765338) (← links)
• Refining the complexity of the sports elimination problem (Q896666) (← links)
• The complexity of degree anonymization by vertex addition (Q897957) (← links)
• The complexity of probabilistic lobbying (Q1662102) (← links)
• Multivariate complexity analysis of Swap Bribery (Q1759677) (← links)
• Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications (Q1759678) (← links)
• Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
• Towards a dichotomy for the possible winner problem in elections based on scoring rules (Q1959429) (← links)
• A multi-parameter analysis of hard problems on deterministic finite automata (Q2256724) (← links)
• On explaining integer vectors by few homogeneous segments (Q2256725) (← links)
• The parameterized complexity of the minimum shared edges problem (Q2323342) (← links)
• How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? (Q2324243) (← links)
• Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review (Q2327955) (← links)
• On structural parameterizations for the 2-club problem (Q2341718) (← links)
• Using patterns to form homogeneous teams (Q2346970) (← links)
• A refined complexity analysis of degree anonymization in graphs (Q2347809) (← links)
• A fixed-parameter algorithm for guarding 1.5D terrains (Q2354771) (← links)
• A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack (Q2400435) (← links)
• Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs (Q2402262) (← links)
• Knapsack problems: a parameterized point of view (Q2419116) (← links)
• The effect of homogeneity on the computational complexity of combinatorial data anonymization (Q2435706) (← links)
• Digraph width measures in parameterized algorithmics (Q2442211) (← links)
• Satisfying more than half of a system of linear equations over GF(2): a multivariate approach (Q2637641) (← links)
• A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion (Q2662677) (← links)
• Myhill-Nerode Methods for Hypergraphs (Q2872101) (← links)
• The Impact of Parameterized Complexity to Interdisciplinary Problem Solving (Q2908532) (← links)
• Kernelization – Preprocessing with a Guarantee (Q2908537) (← links)
• Studies in Computational Aspects of Voting (Q2908543) (← links)
• A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths (Q2947009) (← links)
• Efficient Algorithms for Eulerian Extension (Q3057616) (← links)
• Multivariate Complexity Analysis of Swap Bribery (Q3058696) (← links)
• Alternative Parameterizations for Cluster Editing (Q3075528) (← links)
• The Effect of Homogeneity on the Complexity of k-Anonymity (Q3088269) (← links)