News

IEEE1mon
A deterministic near-linear time approximation scheme for geometric transportation - IEEE Xplore
Persistent Link: https://ieeexplore.ieee.org/servlet/opac?punumber=10353068 More » ...
World Scientific1mon
List 2-distance coloring of planar graphs without short cycles | Discrete Mathematics, Algorithms and Applications - World Scientific Publishing Co Pte Ltd
Discrete Mathematics, Algorithms and Applications Vol. 08, No. 01, 1650013 (2016) No Access ...
IEEE1mon
An O (n √ n log log n) average case algorithm for the maximum induced matching problem in permutation graphs - IEEE Xplore
Let G = (V, E) be an undirected graph, where V is the vertex set and E is the edge set. A subset M of E is an induced matching of G if M is a matching of G and no two edges in M are joined by an edge.