Structure analysis of table form document is important because printed documents and also electronical documents only provide geometrical layout and lexical information explicitly...
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
Md. Jawaherul Alam, Therese C. Biedl, Stefan Felsn...
Double Patterning Lithography (DPL) is one of the few hopeful candidate solutions for the lithography for CMOS process beyond 45nm. DPL assigns the patterns less than a certain di...
A new method named Landmark Model Matching was recently proposed for fully automatic face recognition. It was inspired by Elastic Bunch Graph Matching and Active Shape Model. Landm...
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...