The following pages link to Compression via Matroids (Q4962154):
Displaying 26 items.
- Edge bipartization faster than \(2^k\) (Q666655) (← links)
- Multi-budgeted directed cuts (Q786027) (← links)
- Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775) (← links)
- Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies (Q2119402) (← links)
- Towards constant-factor approximation for chordal/distance-hereditary vertex deletion (Q2149107) (← links)
- Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion} (Q2408559) (← links)
- A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion (Q2662677) (← links)
- On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal (Q2891343) (← links)
- Kernelization – Preprocessing with a Guarantee (Q2908537) (← links)
- Odd Multiway Cut in Directed Acyclic Graphs (Q3300762) (← links)
- Approximation and Kernelization for Chordal Vertex Deletion (Q4586151) (← links)
- Exploring the Kernelization Borders for Hitting Cycles (Q5009476) (← links)
- Multi-Budgeted Directed Cuts (Q5009480) (← links)
- Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices (Q5042455) (← links)
- Proximity Search for Maximal Subgraph Enumeration (Q5048293) (← links)
- A deterministic polynomial kernel for odd cycle transversal and vertex multiway cut in planar graphs (Q5090489) (← links)
- An Updated Experimental Evaluation of Graph Bipartization Methods (Q5102059) (← links)
- A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs (Q5163509) (← links)
- Tree Deletion Set Has a Polynomial Kernel but No $\text{OPT}^\mathcal{O}(1)$ Approximation) (Q5741082) (← links)
- Linear representation of transversal matroids and gammoids parameterized by rank (Q5918110) (← links)
- Your rugby mates don't need to know your colleagues: triadic closure with edge colors (Q5918315) (← links)
- (Q6065472) (← links)
- Parameterized algorithms and data reduction for the short secluded <i>s</i>‐<i>t</i>‐path problem (Q6068532) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- On Weighted Graph Separation Problems and Flow Augmentation (Q6187079) (← links)
- A constant-factor approximation for weighted bond cover (Q6671673) (← links)
