André Göransson

André Göransson (born 30 April 1994) is a Swedish tennis player.

André Göransson
Country (sports) Sweden
ResidenceHöllviken, Sweden
Born (1994-04-30) 30 April 1994
Räng parish, Skåne County, Sweden
Height1.88 m (6 ft 2 in)
PlaysRight-handed (two-handed backhand)
CollegeCalifornia
Prize money$75,398
Singles
Career record0–0
Career titles0
0 Challenger, 0 Futures
Highest rankingNo. 773 (25 September 2017)
Doubles
Career record6–6
Career titles1
5 Challengers, 2 Futures
Highest rankingNo. 80 (17 February 2020)
Current rankingNo. 87 (16 March 2020)
Last updated on: 22 March 2020.

Göransson has a career high ATP singles ranking of 773 achieved on 25 September 2017. In doubles his career high ranking is 80, achieved on 17 February 2020.[1]

Göransson has won 5 ATP Challenger doubles titles between 2017 and 2019 and 2 Futures doubles titles in 2018.

Göransson played college tennis at the University of California, Berkeley.[2]

ATP career finals

Doubles: 1 (1 title)

Legend
Grand Slam tournaments (0–0)
ATP World Tour Finals (0–0)
ATP World Tour Masters 1000 (0–0)
ATP World Tour 500 Series (0–0)
ATP World Tour 250 Series (1–0)
Finals by surface
Hard (1–0)
Clay (0–0)
Grass (0–0)
Finals by setting
Outdoor (1–0)
Indoor (0–0)
Result W–L    Date    Tournament Tier Surface Partner Opponents Score
Win 1–0 Feb 2020 Maharashtra Open, India 250 Series Hard Christopher Rungkat Jonathan Erlich
Andrei Vasilevski
6–2, 3–6, [10–8]

Challenger and Futures finals

Singles: 1 (0–1)

Legend (Singles)
ATP Challenger Tour (0–0)
ITF Futures Tour (0–1)
Titles by Surface
Hard (0–1)
Clay (0–0)
Grass (0–0)
Result W–L    Date    Tournament Tier Surface Opponent Score
Loss 0–1 Oct 2016 USA F33, Berkeley Futures Hard Marcos Giron 7–5, 6–7(5–7), 4–6

Doubles: 16 (7–9)

Legend (Doubles)
ATP Challenger Tour (5–5)
ITF Futures Tour (2–4)
Titles by Surface
Hard (6–5)
Clay (1–4)
Grass (0–0)
Result W–L    Date    Tournament Tier Surface Partner Opponents Score
Loss 0–1 Oct 2016 USA F33, Berkeley Futures Hard Sem Verbeek Connor Smith
Rhyne Williams
4–6, 3–6
Loss 0–2 Jun 2017 Poland F2, Gdynia Futures Clay Fredrik Ask Boris Arias
Nick Chappell
1–6, 1–6
Win 1–2 Oct 2017 Tiburon, USA Challenger Hard Florian Lakat Marcelo Arévalo
Miguel Ángel Reyes-Varela
6–4, 6–4
Win 2–2 Mar 2018 USA F8, Calabasas Futures Hard Florian Lakat Bernardo Saraiva
Sem Verbeek
6–2, 7–6(7–3)
Win 3–2 Apr 2018 USA F9, Memphis Futures Hard Florian Lakat Scott Griekspoor
Yannick Mertens
2–6, 6–2, [10–7]
Loss 3–3 Jun 2018 Spain F14, Huelva Futures Clay Fred Simonsson Javier Barranco Cosano
Raul Brancaccio
7–5, 6–7(10–12), [5–10]
Loss 3–4 Jun 2018 Hungary F4, Gyula Futures Clay Fred Simonsson Dane Propoggia
Scott Puodziunas
4–6, 1–6
Win 4–4 Jul 2018 Tampere, Finland Challenger Clay Markus Eriksson Ivan Gakhov
Alexander Pavlioutchenkov
6–3, 3–6, [10–7]
Loss 4–5 Jan 2019 Nouméa, New Caledonia Challenger Hard Sem Verbeek Dustin Brown
Donald Young
5–7, 4–6
Loss 4–6 Jan 2019 Canberra, Australia Challenger Hard Sem Verbeek Marcelo Demoliner
Hugo Nys
6–3, 4–6, [3–10]
Win 5–6 Feb 2019 Cuernavaca, Mexico Challenger Hard Marc-Andrea Hüsler Gonzalo Escobar
Luis David Martínez
6–3, 3–6, [11–9]
Loss 5–7 Jun 2019 Shymkent, Uzbekistan Challenger Clay Marc-Andrea Hüsler Nikola Čačić
Yang Tsung-hua
4–6, 4–6
Win 6–7 Jul 2019 Granby, Canada Challenger Hard Sem Verbeek Li Zhe
Hugo Nys
6–2, 6–4
Win 7–7 Sep 2019 Cassis, France Challenger Hard Sem Verbeek Sander Arends
David Pel
7–6(8–6), 4–6, [11–9]
Loss 7–8 Oct 2019 Fairfield, USA Challenger Hard Sem Verbeek Peter Polansky
Darian King
4-6, 6-3, [10-12]
Loss 7–9 Nov 2019 Kobe, Japan Challenger Hard (i) Christopher Rungkat Purav Raja
Ramkumar Ramanathan
6-7(6-8), 3-6
gollark: Doing things in one line >> doing things in multiple lines.
gollark: You could hardcode one diagonal and two of the normal lines and rotate it I think.
gollark: Ask them to send you a 3080 to test on.
gollark: I guess that might work as a way to show the maximum possible value/overhead from sending data to the GPU.
gollark: Arguably true bogocalc would be picking results (according to some kind of weird random distribution which technically has a chance of picking any possible number) until they can be verified to be right.

References

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