Fix link.

README.md

@@ -1,8 +1,7 @@
 # Overview
 The connection-scan is a route search algorithm for transit networks. The 
 algorithm itself is described in various papers ([CSA](https://www.researchgate.net/publication/257361294_Intriguingly_Simple_and_Fast_Transit_Routing), [CSA Accelarated](https://www.researchgate.net/publication/286955308_Connection_Scan_Accelerated)).
-The implementation is developed at the [Institute for Transport Studies]
-(http://www.ifv.kit.edu) at the Karlsruhe Institute of Technology. The route search algorithm is part of our travel demand model [mobiTopp](http://www.ifv.kit.edu/359.php).
+The implementation is developed at the [Institute for Transport Studies](http://www.ifv.kit.edu) at the Karlsruhe Institute of Technology. The route search algorithm is part of our travel demand model [mobiTopp](http://www.ifv.kit.edu/359.php).
 
 # Usage
 To search routes via the connection scan, you have to initialise it with a transit network made up of stops and connections. During initialisation the algorithm will check the following prerequisites.