2012 Ethias Trophy – Doubles
Johan Brunström and Ken Skupski were the defending champions but decided not to participate together.
Brunström played alongside Raven Klaasen, while Skupski partnered up with Jamie Delgado.
Tomasz Bednarek and Jerzy Janowicz won the final 7–5, 4–6, [10–2] against Michaël Llodra and Édouard Roger-Vasselin.
Doubles | |
---|---|
2012 Ethias Trophy | |
Champions | |
Runners-up | |
Final score | 7–5, 4–6, [10–2] |
Seeds
Michaël Llodra / Édouard Roger-Vasselin (Final) Paul Hanley / Christopher Kas (First Round) Jamie Delgado / Ken Skupski (First Round) Johan Brunström / Raven Klaasen (First Round)
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 | 6 | 6 | |||||||||||||||||||||||||
4 | 3 | 1 | 6 | 7 | |||||||||||||||||||||||
4 | 4 | 4 | 5 | ||||||||||||||||||||||||
6 | 6 | 1 | 6 | 6 | |||||||||||||||||||||||
4 | 6 | 3 | [3] | 4 | 3 | ||||||||||||||||||||||
4 | 6 | [10] | 7 | 6 | |||||||||||||||||||||||
WC | 4 | 4 | WC | 5 | 1 | ||||||||||||||||||||||
WC | 6 | 6 | 1 | 5 | 6 | [2] | |||||||||||||||||||||
6 | 3 | [10] | 7 | 4 | [10] | ||||||||||||||||||||||
1 | 6 | [4] | 3 | 2 | |||||||||||||||||||||||
7 | 1 | [10] | 6 | 6 | |||||||||||||||||||||||
3 | 1 | 6 | [5] | 4 | 6 | [5] | |||||||||||||||||||||
7 | 6 | 6 | 4 | [10] | |||||||||||||||||||||||
WC | 5 | 2 | 6 | 6 | |||||||||||||||||||||||
6 | 4 | [10] | 4 | 1 | |||||||||||||||||||||||
2 | 4 | 6 | [6] |
gollark: Redstonet was slow enough. We used it for communication between the TSS Explorer and GSS It's Technically A Starship Okay.
gollark: I'm thinking one bit per second.
gollark: ToggleNet, as we could call it, could be just like Redstonet but even more glacially slow.
gollark: Except the maximum length is variable... aaaa.
gollark: SignNet could use code adapted from LabelNet, I guess.
References
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.