Author:
Chakraborty Dibyayan,Francis Mathew C.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference23 articles.
1. Adiga, A., Bhowmick, D., Chandran, L.S.: The hardness of approximating the boxicity, cubicity and threshold dimension of a graph. Discret. Appl. Math. 158 (16), 1719–1726 (2010)
2. Adiga, A., Chandran, L.S., Sivadasan, N.: Lower bounds for boxicity. Combinatorica 34(6), 631–655 (2014)
3. Agarwal, P.K., Van Kreveld, M., Suri, S.: Label placement by maximum independent set in rectangles. Comput. Geom. 11(3-4), 209–218 (1998)
4. Asplund, E., Grünbaum, B.: On a coloring problem. Mathematica Scandinavica 8(1), 181–188 (1960)
5. Babu, J., Basavaraju, M., Chandran, L.S., Rajendraprasad, D., Sivadasan, N.: Approximating the cubicity of trees. arXiv:
1402.6310
(2014)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献