scientific article; zbMATH DE number 7651162
From MaRDI portal
Publication:5874491
DOI10.4230/LIPIcs.ESA.2020.23MaRDI QIDQ5874491
Édouard Bonnet, Xuan Thang Tran, Rémi Watrigant, Steéphan Thomassé
Publication date: 7 February 2023
Full work available at URL: https://arxiv.org/abs/2004.12166
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Parameterized inapproximability of independent set in \(H\)-free graphs ⋮ Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for maximum independent set of pseudo-disks
- Improved results on geometric hitting set problems
- Ramsey-type theorems
- Ramsey numbers and an approximation algorithm for the vertex cover problem
- On maximal independent sets of vertices in claw-free graphs
- A note on Ramsey numbers
- Computing independent sets in graphs with large girth
- Geometric algorithms and combinatorial optimization
- Some APX-completeness results for cubic graphs
- Maximum weight independent set for \(\ell\)claw-free graphs in polynomial time
- The Erdös-Hajnal Conjecture-A Survey
- Graph Theory and Probability. II
- Approximation algorithms for NP-complete problems on planar graphs
- On the size of a random maximal graph
- Polynomial-time approximation schemes for packing and piercing fat objects
- Bounding Ramsey numbers through large deviation inequalities
- The Ramsey number R(3, t) has order of magnitude t2/log t
- Polynomial algorithm for finding the largest independent sets in graphs without forks
- Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs
- Sparse graphs: Metrics and random models
- Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs
- Some remarks on the theory of graphs
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
This page was built for publication:
