2013 Slovak Open – Doubles
Lukáš Dlouhý and Michail Elgin were the defending champions but Dlouhy chose not to compete.
Elgin partnered with Michal Mertiňák and was defeated by losing finalist Gero Kretschmer and Jan-Lennard Struff, who in turn lost to Henri Kontinen and Andreas Siljeström.
Doubles | |
---|---|
2013 Slovak Open | |
Champion | ![]() ![]() |
Runner-up | ![]() ![]() |
Final score | 7–6(8–6), 6–2 |
Seeds
František Čermák / Łukasz Kubot (Quarterfinals) Filip Polášek / Lukáš Rosol (Quarterfinals) Michail Elgin / Michal Mertiňák (Semifinals) Ken Skupski / Neal Skupski (Semifinals)
Draw
Key
- Q = Qualifier
- WC = Wild Card
- LL = Lucky Loser
- Alt = Alternate
- SE = Special Exempt
- PR = Protected Ranking
- ITF = ITF entry
- JE = Junior Exempt
- w/o = Walkover
- r = Retired
- d = Defaulted
Draw
First Round | Quarterfinals | Semifinals | Final | ||||||||||||||||||||||||
1 | ![]() ![]() | 7 | 6 | ||||||||||||||||||||||||
WC | ![]() ![]() | 5 | 3 | 1 | ![]() ![]() | 7 | 4 | [8] | |||||||||||||||||||
![]() ![]() | 4 | 2 | ![]() ![]() | 5 | 6 | [10] | |||||||||||||||||||||
![]() ![]() | 6 | 6 | ![]() ![]() | 64 | 7 | [10] | |||||||||||||||||||||
3 | ![]() ![]() | 6 | 6 | 3 | ![]() ![]() | 77 | 5 | [6] | |||||||||||||||||||
![]() ![]() | 3 | 2 | 3 | ![]() ![]() | 6 | 6 | |||||||||||||||||||||
![]() ![]() | 67 | 77 | [8] | ![]() ![]() | 3 | 2 | |||||||||||||||||||||
![]() ![]() | 79 | 64 | [10] | ![]() ![]() | 66 | 2 | |||||||||||||||||||||
![]() ![]() | 6 | 6 | ![]() ![]() | 78 | 6 | ||||||||||||||||||||||
WC | ![]() ![]() | 3 | 3 | ![]() ![]() | 5 | 3 | |||||||||||||||||||||
WC | ![]() ![]() | 5 | 3 | 4 | ![]() ![]() | 7 | 6 | ||||||||||||||||||||
4 | ![]() ![]() | 7 | 6 | 4 | ![]() ![]() | 5 | 3 | ||||||||||||||||||||
![]() ![]() | 1 | 4 | ![]() ![]() | 7 | 6 | ||||||||||||||||||||||
![]() ![]() | 6 | 6 | ![]() ![]() | 3 | 7 | [10] | |||||||||||||||||||||
![]() ![]() | 6 | 4 | [7] | 2 | ![]() ![]() | 6 | 5 | [6] | |||||||||||||||||||
2 | ![]() ![]() | 4 | 6 | [10] |
gollark: I think you're wrong.
gollark: Did I now.
gollark: I'm sure you'd like to think so.
gollark: It's simple. The initial python bit detects strings which are UTTERLY spacious, and then (in an oddly obfuscated way) ensures that each character in one string exists at least once in the other. Then, it calls the C bit with - due to odd pythonous scoping - the string without the index where they were found to match. The C bit actually does the same thing, calling back into Python afterward. If there is ever an *unmatched* character, it returns false.
gollark: But I posted mine earlier. Four of them, even.
References
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.