2007 US Open – Boys' Doubles

The 2007 US Open – Boys' Doubles was an event that was won by Jonathan Eysseric and Jerome Inzerillo.

Boys' Doubles
2007 US Open
Champion J Eysseric
J Inzerillo
Runner-up G Dimitrov
V Pospisil
Final score6–2, 6–4

Seeds

  1. Vladimir Ignatic / Roman Jebavý (Semifinals)
  2. Stephen Donald / Greg Jones (Semifinals)
  3. Henrique Cunha / Fernando Romboli (First Round)
  4. Daniel-Alejandro Lopez / Matteo Trevisan (Quarterfinals)
  5. Guillermo Rivera-Aránguiz / Ricardo Urzua-Rivera (First Round)
  6. Jonathan Eysseric / Jérôme Inzerillo (Champions)
  7. John-Patrick Smith / Andrew Thomas (First Round)
  8. Tomas Fabbiano / Andrei Karatchenia (Quarterfinals)

Draw

Key

Finals

Semifinals Final
          
1 Vladimir Ignatic
Roman Jebavý
62 4  
6 Jonathan Eysseric
Jérôme Inzerillo
77 6  
6 Jonathan Eysseric
Jérôme Inzerillo
6 6  
  Grigor Dimitrov
Vasek Pospisil
2 4  
  Grigor Dimitrov
Vasek Pospisil
4    
2 Stephen Donald
Greg Jones
0 r  

Top half

First Round Second Round Quarterfinals Semifinals
1 Vladimir Ignatic
Roman Jebavý
6 6  
  Frederic De Feys
Germain Gigounon
3 4   1 V Ignatic
R Jebavý
6 6  
  Giacomo Miccini
Mohamed Safwat
66 4   WC A Domijan
T Trombetta
3 4  
WC Alexander Domijan
Ty Trombetta
78 6   1 V Ignatic
R Jebavý
6 6  
  Jarmere Jenkins
Austin Krajicek
6 6     R Albot
E Donskoy
3 4  
  Jiří Košler
Cristóbal Saavedra
2 2     J Jenkins
A Krajicek
7 5 65
  Radu Albot
Evgeny Donskoy
6 6     R Albot
E Donskoy
5 7 77
7 John-Patrick Smith
Andrew Thomas
3 3   1 V Ignatic
R Jebavý
62 4  
4 Daniel-Alejandro Lopez
Matteo Trevisan
6 6   6 J Eysseric
J Inzerillo
77 6  
  Jaan Frederik Brunken
Daniel Cox
1 2   4 D-A Lopez
M Trevisan
6 3 6
  Jeff Dadamo
Johnny Hamui
3 1     D Evans
D Rice
3 6 4
  Daniel Evans
David Rice
6 6   4 D-A Lopez
M Trevisan
3 0  
WC Lawrence Formentera
Evan King
5 5   6 J Eysseric
J Inzerillo
6 6  
  Perrakiat Siriluethaiwarrana
Vladimir Zinyakov
7 7     P Siriluethaiwarrana
V Zinyakov
6 2 3
  Jerzy Janowicz
Borut Puc
611 2   6 J Eysseric
J Inzerillo
4 6 6
6 Jonathan Eysseric
Jérôme Inzerillo
713 6  

Bottom half

First Round Second Round Quarterfinals Semifinals
8 Thomas Fabbiano
Andrei Karatchenia
4 6 6
  Gastão Elias
César Ramírez
6 4 4 8 T Fabbiano
A Karatchenia
6 6  
WC Tennys Sandgren
James Bo Seal
6 6   WC T Sandgren
J B Seal
2 0  
  Bernard Tomic
Mark Verryth
2 4   8 T Fabbiano
A Karatchenia
5 6 1
  Soong-Jae Cho
Kittipong Wachiramanowong
3 4     G Dimitrov
V Pospisil
7 4 6
  Grigor Dimitrov
Vasek Pospisil
6 6     G Dimitrov
V Pospisil
6 6  
  Bradley Klahn
Dennis Nevolo
2 7 6   B Klahn
D Nevolo
2 3  
3 Henrique Cunha
Fernando Romboli
6 5 3   G Dimitrov
V Pospisil
4    
5 Guillermo Rivera-Aránguiz
Ricardo Urzua-Rivera
66 4   2 S Donald
G Jones
0 r  
  Adam El Mihdawy
Ryan Harrison
78 6     A E Mihdawy
R Harrison
2 6 1
  Devin Britton
Jared Easton
6 6     D Britton
J Easton
6 3 6
  Alejandro González
Roberto Maytin
4 4     D Britton
J Easton
0 3  
  Lofo Ramiaramanana
Takanyi Garanganga
77 4 3 2 S Donald
G Jones
6 6  
  Graeme Dyce
Harri Heliövaara
63 6 6   G Dyce
H Heliövaara
5 3  
  Aljaz Bedene
Ričardas Berankis
3 2   2 S Donald
G Jones
7 6  
2 Stephen Donald
Greg Jones
6 6  
gollark: Of course.
gollark: I'm not entirely sure how, but it seems to construct a tree/maybe deterministic finite automaton/finite state machine/I don't know theoretical CS which matches anagrams and unmatches unanagrams.
gollark: ```pythonimport collectionsdef do_thing(s): if len(s) == 1: return { s[0]: True } out = {} for i, c in enumerate(s): without = s[:i] + s[i + 1:] things = do_thing(without) out[c] = things return outdef match(r, s): print(r) c = r for i, x in enumerate(s): print(x) try: c = c[x] if c == True: if i + 1 == len(s): return True # full match else: return False # characters remain except KeyError: return False # no match return False # incomplete matchentry = lambda a, b: match(do_thing(a.lower().replace(" ", "")), b.lower().replace(" ", ""))```Here is my entry (pending a port to osmarkslisp™️). This is definitely my entry.
gollark: I wish to use Mathematica in my code. Please install it. DO NOT READ, ubq.
gollark: I have a "great" way to do this which I think takes O(n²) space-time-beeite.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.