1. Computing Cartograms with Optimal Complexity
2. Enumerating architectural arrangements by generating their underlying graphs
3. A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph
4. A linear algorithm to find a rectangular dual of a planar triangulated graph
5. Yi-Jun Chang and Hsu-Chun Yen . 2014 . Rectilinear Duals Using Monotone Staircase Polygons. In In: Zhang Z., Wu L., Xu W., Du DZ. (eds) Combinatorial Optimization and Applications . COCOA 2014. Lecture Notes in Computer Science, Vol. 8881. Springer,Cham, 86–100. doi: 10.1007/978-3-319-12691-3_8. 10.1007/978-3-319-12691-3_8 Yi-Jun Chang and Hsu-Chun Yen. 2014. Rectilinear Duals Using Monotone Staircase Polygons. In In: Zhang Z., Wu L., Xu W., Du DZ. (eds) Combinatorial Optimization and Applications. COCOA 2014. Lecture Notes in Computer Science, Vol. 8881. Springer,Cham, 86–100. doi: 10.1007/978-3-319-12691-3_8.