The distance between two graphs is usually defined by means of the size of a largest common subgraph. This common subgraph may be an induced subgraph, obtained by removing nodes, ...
It is proved that, if G is a K4-minor-free graph with maximum degree 3, then G is totally 4-choosable; that is, if every element (vertex or edge) of G is assigned a list of 4 colo...
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
In this paper we present a new approximation algorithm for the Max Acyclic Subgraph problem. Given an instance where the maximum acyclic subgraph contains 1/2 + δ fraction of all...
Moses Charikar, Konstantin Makarychev, Yury Makary...