Page
%P
![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
Approximating Minimum Dominating Set on String Graphs
A string graph is an intersection graph of simple curves on the plane. For \(k\ge 0\) ,
-
Chapter and Conference Paper
Cutting Barnette Graphs Perfectly is Hard
A perfect matching cut is a perfect matching that is also a cutset, or equivalently a perfect matching containing an even number of edges on every cycle. The corresponding algorithmic problem, Perfect Matching Cu...