Pages that link to "Item:Q1933639"
From MaRDI portal
The following pages link to Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity (Q1933639):
Displaying 50 items.
- \(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments (Q329039) (← links)
- Kernelization using structural parameters on sparse graph classes (Q340583) (← links)
- Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050) (← links)
- Exploiting a hypergraph model for finding Golomb rulers (Q471187) (← links)
- Fixed-parameter algorithms for DAG partitioning (Q507587) (← links)
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization (Q722549) (← links)
- Meta-kernelization with structural parameters (Q896025) (← links)
- The complexity of degree anonymization by vertex addition (Q897957) (← links)
- Finding disjoint paths on edge-colored graphs: more tractability results (Q1631683) (← links)
- Bivariate complexity analysis of \textsc{Almost Forest Deletion} (Q1686068) (← links)
- Multivariate algorithmics for finding cohesive subnetworks (Q1736776) (← links)
- Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
- Structural parameterizations of Tracking Paths problem (Q2089072) (← links)
- Fine-grained parameterized complexity analysis of graph coloring problems (Q2112649) (← links)
- Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies (Q2119402) (← links)
- Structural parameterizations with modulator oblivion (Q2161010) (← links)
- A multi-parameter analysis of hard problems on deterministic finite automata (Q2256724) (← links)
- On explaining integer vectors by few homogeneous segments (Q2256725) (← links)
- Revisiting connected vertex cover: FPT algorithms and lossy kernels (Q2322693) (← links)
- Polynomial kernels for vertex cover parameterized by small degree modulators (Q2322700) (← links)
- The parameterized complexity of the minimum shared edges problem (Q2323342) (← links)
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review (Q2327955) (← links)
- Computing the chromatic number using graph decompositions via matrix rank (Q2330132) (← links)
- On structural parameterizations for the 2-club problem (Q2341718) (← links)
- On sparsification for computing treewidth (Q2343087) (← links)
- Using patterns to form homogeneous teams (Q2346970) (← links)
- A refined complexity analysis of degree anonymization in graphs (Q2347809) (← 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)
- On the complexity of various parameterizations of common induced subgraph isomorphism (Q2405897) (← links)
- Satisfying more than half of a system of linear equations over GF(2): a multivariate approach (Q2637641) (← links)
- The complexity of routing problems in forbidden-transition graphs and edge-colored graphs (Q2701383) (← links)
- FPT is characterized by useful obstruction sets (Q2828222) (← links)
- Myhill-Nerode Methods for Hypergraphs (Q2872101) (← links)
- Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q2946427) (← links)
- A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths (Q2947009) (← links)
- Bivariate Complexity Analysis of Almost Forest Deletion (Q3196379) (← links)
- Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q4588848) (← links)
- A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths (Q4628044) (← links)
- FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters (Q4632216) (← links)
- Computing the Chromatic Number Using Graph Decompositions via Matrix Rank (Q5009610) (← links)
- Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel (Q5048303) (← links)
- Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems (Q5283380) (← links)
- On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT (Q5890956) (← links)
- NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs (Q5891702) (← links)
- On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT (Q5892359) (← links)
- The parameterized complexity of cycle packing: indifference is not an issue (Q5919574) (← links)
- On the Parameterized Complexity of Clique Elimination Distance (Q6068235) (← links)
- Parameterized algorithms and data reduction for the short secluded <i>s</i>‐<i>t</i>‐path problem (Q6068532) (← links)
- (Q6089666) (← links)