Author:
Alam Muhammad Jawaherul,Biedl Therese,Felsner Stefan,Kaufmann Michael,Kobourov Stephen G.
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Alam, M.J., Biedl, T., Felsner, S., Gerasch, A., Kaufmann, M., Kobourov, S.G., Ueckert, T.: Computing cartograms with optimal complexity (submitted, 2011)
2. Alam, M.J., Biedl, T., Felsner, S., Kaufmann, M., Kobourov, S.G.: Proportional contact representations of planar graphs. Technical Report CS-2011-11. University of Waterloo (2011)
3. Badent, M., Binucci, C., Giacomo, E.D., Didimo, W., Felsner, S., Giordano, F., Kratochvíl, J., Palladino, P., Patrignani, M., Trotta, F.: Homothetic triangle contact representations of planar graphs. In: CCCG 2007, pp. 233–236 (2007)
4. Buchsbaum, A.L., Gansner, E.R., Procopiuc, C.M., Venkatasubramanian, S.: Rectangular layouts and contact graphs. ACM Transactions on Algorithms 4(1) (2008)
5. de Fraysseix, H., de Mendez, P.O., Rosenstiehl, P.: On triangle contact graphs. Combinatorics, Probability and Computing 3, 233–246 (1994)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献