scientific article; zbMATH DE number 7559128
From MaRDI portal
Publication:5090466
DOI10.4230/LIPIcs.STACS.2019.19MaRDI QIDQ5090466
Sumedha Uniyal, Andreas Schmid, Parinya Chalermsook
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1804.03485
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- An augmenting path algorithm for linear matroid parity
- The node-deletion problem for hereditary properties is NP-complete
- Matroid matching and some applications
- A new approximation algorithm for finding heavy planar subgraphs
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Maximum planar subgraphs and nice embeddings: Practical layout tools
- Maximum series-parallel subgraph
- Algebraic Algorithms for Linear Matroid Parity Problems
- Matroid Matching: The Power of Local Search
- Finding Triangles for Maximum Planar Subgraphs
- A Fast, Simpler Algorithm for the Matroid Parity Problem
- Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion
- A Better Approximation Algorithm for Finding Planar Subgraphs
- The approximation of maximum subgraph problems
- From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More
- The Factorization of Linear Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item