Author:
Hartung Sepp,Niedermeier Rolf
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Basu, S., Davidson, I., Wagstaff, K.: Constrained Clustering: Advances in Algorithms, Theory, and Applications. Chapman & Hall, Boca Raton (2008)
2. Lecture Notes in Computer Science;H.-J. Böckenhauer,2008
3. Bodlaender, H.L., Thomasse, S., Yeo, A.: Analysis of data reduction: Transformations give evidence for non-existence of polynomial kernels. Technical report, UU-CS-2008-030, Institute of Information and Computing Sciences, Utrecht University, Netherlands (2008)
4. Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. System Sci. 75(8), 423–434 (2009)
5. Culberson, J.C., Luo, F.: Exploring the k-colorable landscape with iterated greedy. DIMACS Series in Discrete Math. and Theor. Comput. Sci., pp. 245–284 (1996)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献