Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. Agarwal, P.K., van Kreveld, M.J., Suri, S.: Label placement by maximum independent set in rectangles. Comput. Geom. 11(3-4), 209–218 (1998)
2. Lecture Notes in Computer Science;R. Ahlswede,2006
3. Asplund, E., Grunbaum, B.: On a coloring problem. Math. Scand. 8, 181–188 (1960)
4. Lecture Notes in Computer Science;R. Bar-Yehuda,2010
5. Berman, P., DasGupta, B., Muthukrishnan, S., Ramaswami, S.: Improved approximation algorithms for rectangle tiling and packing. In: SODA, pp. 427–436 (2001)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Approximating Maximum Independent Set for Rectangles in the Plane;SIAM Journal on Computing;2024-07-23
2. Grounded L-Graphs Are Polynomially $$\chi $$-Bounded;Discrete & Computational Geometry;2023-11-16
3. Improved Algorithms for Scheduling Unsplittable Flows on Paths;Algorithmica;2022-10-01
4. A PTAS for unsplittable flow on a path;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09
5. Approximating Maximum Independent Set for Rectangles in the Plane;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02