Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. Agarwal, P., Overmars, M., Sharir, M.: Computing maximally separated sets in the plane and independent sets in the intersection graph of unit graph. In: Proceedings of 15th ACM-SIAM symposium on discrete mathematics algorithms, pp. 509–518. ACM-SIAM (2004)
2. Agarwal, P., Procopiuc, C.M.: Exact and approximation algorithms for clustering. Algorithmica 33, 201–226 (2002)
3. Alber, J., Fernau, H., Niedermeier, R.: Graph separators: a parameterized view. In: Proceedings of 7th Internal computing and combinatorics conference, pp. 318–327 (2001)
4. Alber, J., Fernau, H., Niedermeier, R.: Parameterized complexity: exponential speed-up for planar graph problems. In: Proceedings of 28st international colloquium on automata, languages and programming, pp. 261–272 (2001)
5. Alber, J., Fiala, J.: Geometric separation and exact solution for parameterized independent set problem on disk graphs. Journal of Algorithms 52(2), 134–151 (2004)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献