We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...
Amit Chakrabarti, Alexander Jaffe, James R. Lee, J...
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich...
Abstract--NABBIT is a work-stealing library for execution of task graphs with arbitrary dependencies which is implemented as a library for the multithreaded programming language Ci...
This paper presents a novel method for efficient boundary based shapes matching and retrieval in presence of occlusion. In this method, the geometric and topological information o...
Spatial Pyramid Representation (SPR) is a widely used method for embedding both global and local spatial information into a feature, and it shows good performance in terms of gene...