.

Author: schulzchristian

index.html

@@ -100,7 +100,7 @@ <h2>Download</h2>
                                 <!--<li> <a href="http://algo2.iti.kit.edu/schulz/software_releases/KaHIP_1.00.tar.gz">KaHIP_1.00.tar.gz</a> (or available on GitHub <a href="https://github.com/schulzchristian/KaHIP/">here</a>) -->
                                 <li> <a href="https://github.com/KaHIP/KaHIP/archive/v3.10.tar.gz">KaHIP_3.10.tar.gz</a> (or available on GitHub <a href="https://github.com/KaHIP/">here</a>) 
                                 <li> <a href="https://github.com/KaHIP/KaHIP/raw/master/manual/kahip.pdf">User Guide to KaHIP v3.00</a> 
-                                <li> Note: this release does NOT contain natural cuts due to an US software patent. If you want to use specialized techniques for road networks, e.g. Buffoon, please send us an <a href="mailto:christian.schulz@univie.ac.at?subject=BuffoonRequest">email</a>. 
+                                <li> Note: this release does NOT contain natural cuts due to an US software patent. If you want to use specialized techniques for road networks, e.g. Buffoon, please send us an <a href="mailto:christian.schulz@informatik.uni-heidelberg.de?subject=BuffoonRequest">email</a>. 
                                 <li> Shared-memory parallel version Mt-KaHIP (due to Yaroslav Akhremtsev): <a href="https://github.com/KaHIP/mt-KaHIP/archive/v1.0.tar.gz">mt-KaHIP-v1.0.tar.gz</a>
 
 
@@ -109,7 +109,7 @@ <h2>Download</h2>
 
 			<h2>Support</h2>
                         <ul>
-                                <li> Write us an <a href="mailto:christian.schulz@univie.ac.at?subject=SupportRequest">email</a> if you need support!  
+                                <li> Write us an <a href="mailto:christian.schulz@informatik.uni-heidelberg.de?subject=SupportRequest">email</a> if you need support!  
                                 <li>We are glad for any comments and error reports (or even bug fixes or feature requests) that you send us. 
                                 <li>Graphs used in our papers will be provided to you on request!
                                 </ul>