To decide whether a line graph (hence a claw-free graph) of maximum degree five admits a stable cutset has been proven to be an NP-complete problem. The same result has been known...
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Philip ...
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...
In this paper we study the problem of computing homothetic triangle contact representations of planar graphs. Since not all planar graphs admit such a representation, we concentra...
Melanie Badent, Carla Binucci, Emilio Di Giacomo, ...
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
Glencora Borradaile, James R. Lee, Anastasios Sidi...