2015 UniCredit Czech Open – Singles

Jiří Veselý was the defending champion and successfully defended his title, defeating Laslo Djere in the final, 6–4, 6–2.

Singles
2015 UniCredit Czech Open
Champions Jiří Veselý
Runners-up Laslo Djere
Final score6–4, 6–2
Main article: 2015 UniCredit Czech Open

Seeds
  1. Martin Kližan (Second round)
  2. Jiří Veselý (Champion)
  3. Marcel Granollers (Quarterfinals)
  4. Pablo Carreño Busta (First round)
  5. Santiago Giraldo (Second round)
  6. Dušan Lajović (Quarterfinals)
  7. João Souza (Semifinals)
  8. Blaž Kavčič (First round)

Draw

Key

Finals
Semifinals Final
          
Laslo Djere 63 77 7
7 João Souza 77 64 5
Laslo Djere 4 2
2/WC Jiří Veselý 6 6
Q Uladzimir Ignatik 77 2 2
2/WC Jiří Veselý 61 6 6

Top Half
First Round Second Round Quarterfinals Semifinals
1/WC M Kližan 4 6 714
N Gombos 6 0 612 1/WC M Kližan 5 6 2
  L Djere 6 77 L Djere 7 2 6
Q H Laaksonen 4 64 L Djere 4 6 6
  J Hernych 6 6 6 D Lajović 6 4 2
  A Golubev 2 3 J Hernych 4 2
A Pavlásek 3 3 6 D Lajović 6 6
6 D Lajović 6 6 L Djere 63 77 7
3/WC M Granollers 6 6 7 J Souza 77 65 5
  R Berankis 2 4 3/WC M Granollers 6 6
A Nedovyesov 6 64 77 A Nedovyesov 3 1
Q N Mektić 4 77 63 3/WC M Granollers 6 4 4
  R Štěpánek 4 6 1 7 J Souza 3 6 6
  P-H Mathieu 6 4 6 P-H Mathieu 62 3
F Dustov 3 5 7 J Souza 77 6
7 J Souza 6 7

Bottom Half
First Round Second Round Quarterfinals Semifinals
8 B Kavčič 77 2 2
Q U Ignatik 64 6 6 Q U Ignatik 2 6 7
Alt A Šetkić 3 2 M Cecchinato 6 4 5
M Cecchinato 6 6 Q U Ignatik 77 6
J Mertl 3 2 A Ghem 65 4
  A Ghem 6 6 A Ghem 78 6
M Bachinger 6 1 6 M Bachinger 66 4
4 P Carreño Busta 3 6 3 Q U Ignatik 77 2 2
5/WC S Giraldo 77 6 2/WC J Veselý 61 6 6
  M Copil 64 2 5/WC S Giraldo 3 3
  L Vanni 61 2 F Krajinović 6 6
  F Krajinović 77 6 F Krajinović 4 4
  K Khachanov 6 4 62 2/WC J Veselý 6 6
Q A Michon 3 6 77 Q A Michon 66 5
  M Fucsovics 5 3 2/WC J Veselý 78 7
2/WC J Veselý 7 6
gollark: I was thinking something something bitset but this has scale issues.
gollark: Oh, this is a good idea, yes.
gollark: Do you need some OTHER data structure?
gollark: Can this actually be done whatsoever?!
gollark: i.e. imagine you have some documents which say "bee" lots, and some which say "apio" lots, and you want to look up ones with "apio" and "bee", *without* just retrieving all the documents for each and computing the intersection.

References
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.