Author:
Giannopoulos Panos,Knauer Christian,Rote Günter,Werner Daniel
Subject
Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications
Reference24 articles.
1. M. Bădoiu, S. Har-Peled, P. Indyk, Approximate clustering via core-sets, in: Proc. 34th Annual ACM Symposium on Theory of Computing, 2002, pp. 250–257.
2. S. Cabello, P. Giannopoulos, C. Knauer, On the parameterized complexity of d-dimensional point set pattern matching, in: Proc. of the 2nd Int. Workshop on Parameterized and Exact Computation (IWPEC), in: LNCS, vol. 4169, 2006, pp. 175–183.
3. S. Cabello, P. Giannopoulos, C. Knauer, D. Marx, G. Rote, Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension, ACM Transactions on Algorithms, 2011, in press.
4. S. Cabello, P. Giannopoulos, C. Knauer, G. Rote, Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension, in: Proc. 19th Ann. ACM–SIAM Sympos. Discrete Algorithms (SODA), 2008, pp. 836–843.
5. Separating points by axis-parallel lines;Calinescu;Int. J. Comput. Geom. Appl.,2005
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献