Pages that link to "Item:Q2957896"
From MaRDI portal
The following pages link to Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem (Q2957896):
Displaying 18 items.
- Rural postman parameterized by the number of components of required edges (Q314816) (← links)
- Parameterized algorithms for list \(K\)-cycle (Q666679) (← links)
- Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials (Q1747489) (← links)
- On some FPT problems without polynomial Turing compressions (Q2072079) (← links)
- The Steiner cycle and path cover problem on interval graphs (Q2075469) (← links)
- Parameterized complexity of list coloring and max coloring (Q2097212) (← links)
- On the complexity landscape of connected \(f\)-factor problems (Q2414869) (← links)
- Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem (Q2689288) (← links)
- New Limits to Classical and Quantum Instance Compression (Q3449566) (← links)
- Aligned Drawings of Planar Graphs (Q4625095) (← links)
- Aligned Drawings of Planar Graphs (Q4961753) (← links)
- Compression via Matroids (Q4962154) (← links)
- Shortest Two Disjoint Paths in Polynomial Time (Q5244398) (← links)
- Tree Deletion Set Has a Polynomial Kernel but No $\text{OPT}^\mathcal{O}(1)$ Approximation) (Q5741082) (← links)
- Parameterized Pre-Coloring Extension and List Coloring Problems (Q5857010) (← links)
- On undirected two‐commodity integral flow, disjoint paths and strict terminal connection problems (Q6087136) (← links)
- Diverse collections in matroids and graphs (Q6201861) (← links)
- Computing paths of large rank in planar frameworks deterministically (Q6668350) (← links)
