1989 European Open – Singles

Barbara Paulus was the defending champion but lost in the semifinals to Conchita Martínez.

Singles
1989 European Open
1988 Champion Barbara Paulus
Champion Manuela Maleeva-Fragnière
Runner-up Conchita Martínez
Final score6–4, 6–0
Main article: 1989 European Open

Manuela Maleeva-Fragnière won in the final 6–4, 6–0 against Martínez.

Seeds

A champion seed is indicated in bold text while text in italics indicates the round in which that seed was eliminated.

  1. Chris Evert (Second Round)
  2. Natasha Zvereva (First Round)
  3. Manuela Maleeva-Fragnière (Champion)
  4. Conchita Martínez (Final)
  5. Claudia Kohde-Kilsch (First Round)
  6. Lori McNeil (First Round)
  7. Sandra Cecchini (First Round)
  8. Catarina Lindqvist (Second Round)

Draw

Key
First Round Second Round Quarterfinals Semifinals Final
1 C Evert 6 7  
Q S Hack 3 6   1 C Evert 4 1  
  D van Rensburg 2 1     B Paulus 6 6  
  B Paulus 6 6     B Paulus 6 5 6
  R Simpson 1 2     L Savchenko 1 7 4
  L Savchenko 6 6     L Savchenko 7 0 6
  M Strandlund 0 6 1 8 C Lindqvist 5 6 2
8 C Lindqvist 6 4 6   B Paulus 6 5 2
4 C Martínez 6 6   4 C Martínez 4 7 6
  C Caverzasio 2 1   4 C Martínez 6 6  
  K Adams 0 0     L Gildemeister 0 3  
  L Gildemeister 6 6   4 C Martínez w/o    
  B Cordwell 6 6     B Cordwell      
  J Byrne 1 3     B Cordwell 6 2 7
  C Benjamin 6 6     C Benjamin 2 6 6
5 C Kohde-Kilsch 2 2   4 Conchita Martínez 4 0  
6 L McNeil 4 6 3 3 Manuela Maleeva-Fragnière 6 6  
  C Cohen 6 2 6   C Cohen 4 5  
Q E Zardo 3 6 3   E Burgin 6 7  
  E Burgin 6 2 6   E Burgin 4 1  
  B Bowes 6 1 6 3 M Maleeva-Fragnière 6 6  
  A Kanellopoulou 2 6 4   B Bowes 1 0  
  L Meskhi 5 0   3 M Maleeva-Fragnière 6 6  
3 M Maleeva-Fragnière 7 6   3 M Maleeva-Fragnière 6 7  
7 S Cecchini 2 6 5   L Garrone 3 5  
  K Kschwendt 6 3 7   K Kschwendt 5 4  
  L Golarsa 0 5     L Lapi 7 6  
  L Lapi 6 7     L Lapi 6 2  
Q S Amiach 3 1     L Garrone 7 6  
  L Garrone 6 6     L Garrone 6 6  
Q S Stafford 6 7   Q S Stafford 0 3  
2 N Zvereva 3 6  
gollark: Indeed.
gollark: I didn't claim you did. This is a relevant point when discussing Turing-completeness.
gollark: No language functionally is due to memory limits, but quirks of the C spec directly limit addressable memory to a finite value while other language specs don't.
gollark: Technically, C is not Turing-complete.
gollark: They should also have ominous blinking lights on them and many graphs.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.