CORR
2012
Springer
12 years 5 days ago
2012
Springer
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 ...
CCE
2011
12 years 8 months ago
2011
During the last 15 years, many mathematical models have been developed in order to solve process operation scheduling problems, using discrete or continuous time representations. ...