Pages that link to "Item:Q2912706"
From MaRDI portal
The following pages link to New Races in Parameterized Algorithmics (Q2912706):
Displaying 26 items.
- Win-win kernelization for degree sequence completion problems (Q295647) (← links)
- \(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments (Q329039) (← links)
- Prices matter for the parameterized complexity of shift bribery (Q342714) (← links)
- Complexity of rainbow vertex connectivity problems for restricted graph classes (Q505435) (← links)
- Fixed-parameter algorithms for DAG partitioning (Q507587) (← links)
- On making a distinguished vertex of minimum degree by vertex deletion (Q528861) (← links)
- Refining the complexity of the sports elimination problem (Q896666) (← links)
- Further hardness results on rainbow and strong rainbow connectivity (Q908308) (← links)
- Finding disjoint paths on edge-colored graphs: more tractability results (Q1631683) (← links)
- Parameterized complexity and approximation issues for the colorful components problems (Q1643155) (← links)
- Multivariate algorithmics for finding cohesive subnetworks (Q1736776) (← links)
- Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
- Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters (Q2105427) (← links)
- Constant thresholds can make target set selection tractable (Q2254488) (← links)
- On explaining integer vectors by few homogeneous segments (Q2256725) (← 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)
- A refined complexity analysis of degree anonymization in graphs (Q2347809) (← links)
- The graph motif problem parameterized by the structure of the input graph (Q2403795) (← links)
- Myhill-Nerode Methods for Hypergraphs (Q2872101) (← links)
- A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths (Q2947009) (← links)
- (Q3064527) (← links)
- A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths (Q4628044) (← links)
- The Power of Linear-Time Data Reduction for Maximum Matching (Q5111261) (← links)
- NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs (Q5891702) (← links)
- Algorithms and Data Structures (Q5900780) (← links)
