Author:
Milanič Martin,Pisanski Tomaž,Žitnik Arjana
Publisher
Springer Science and Business Media LLC
Reference21 articles.
1. Bateman, P., Erdős, P.: Geometrical extrema suggested by a lemma of Besicovitch. Am. Math. Monthly 58, 306–314 (1951)
2. Bezdek, A., Fodor, F.: Minimal diameter of certain sets in the plane. J. Comb. Theory Ser. A 85, 105–111 (1999)
3. Breu, H., Kirkpatrick, D.G.: Unit disk graph recognition is NP-hard. Comput. Geom. 9, 3–24 (1998)
4. Chvatalova, J., Dewdney, A.K., Gibbs, N.E., Korfhage, R.R.: The bandwidth problem for graphs: a collection of recent results. Research Report #24, Department of Computer Science, UWO, London, Ontario (1975).
5. Diaz, J., Kamiński, M.: MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs. Theor. Comput. Sci. 377, 271–276 (2007)