1 citations · 2 across the 4 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.DS2024
An -Approximation Algorithm for Vertex Cover on String Graphs
Édouard Bonnet, Paweł Rzążewski
We present a 1.8334-approximation algorithm for Vertex Cover on string graphs given with a representation, which takes polynomial time in the size of the representation; the exact…
math.CO2024★ 1 cited
Polynomial-time recognition and maximum independent set in Burling graphs
Paweł Rzążewski, Bartosz Walczak
A Burling graph is an induced subgraph of some graph in Burling's construction of triangle-free high-chromatic graphs. Equivalently, a Burling graph is a graph that admits a so-cal…