CINXE.COM

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> <html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">  <head> <meta http-equiv="Content-Type" content="text/html; charset=UTF-8" />  <title>Homepage: Karl Bringmann (Max-Planck-Institut für Informatik)</title> <link rel="SHORTCUT ICON" href="/favicon.ico" /> <link rel="stylesheet" type="text/css" media="screen" href="/c/mpi-inf.css" /> <link rel="stylesheet" type="text/css" media="print" href="/c/print.css" /> <link rel="stylesheet" href="publist.css" type="text/css">  <style type="text/css" media="screen"> a#hp-index, a:link#hp-index, a:visited#hp-index {background: rgb(80%,85%,90%);}  </style>   <script language="JavaScript" type="text/javascript">  </script> </head> <body onload="init()"> <div id="head1o2"> <div id="mpiidotspacer"></div> <div id="mpiidot"></div> <ul id="nav1">  <li><a href="http://www.mpi-inf.mpg.de/departments/algorithms-complexity/" title="Department 1: Algorithms and Complexity">Department 1: Algorithms and Complexity</a></li> </ul> </div> <div id="head2o2"> <div id="deco"> <img src="/departments/d1/g/d1-decoration-homepage.jpg" alt="Decoration" width="178" height="100" /> </div> <div id="mpiitext">max planck institut informatik</div> <img id="mpiilogo" src="/g/mpii.jpg" alt="mpii" usemap="#Map" width="300" height="100"/> <map name="Map" id="Map"> <area shape="rect" coords="97,14,296,70" href="http://www.mpi-inf.mpg.de" alt="mpii logo" /> <area shape="circle" coords="41,49,40" href="http://www.mpg.de/" alt="Minerva of the Max Planck Society" /> </map> </div> <div id="headerspacer"></div> <div id="col2o2"> <div id="col2o2content"> <h1>Homepage</h1>  <img src="karl-bringmann.jpg" border="0" alt="Bringmann, Karl" width="383" height="273"/> <h2>Karl Bringmann</h2>  Max-Planck-Institut für Informatik  <a href="/departments/d1/index.html" title="Department 1: Algorithms and Complexity">Department 1: Algorithms and Complexity</a>  Email: <a href="javascript:var a='kbringma';var b='mpi-inf.mpg.de';location='m'+'ailt'+'o:'+a+'@'+b;" class="pub">kbringma<img style="border: 0px solid; float: none; margin:0em 0em -0.4em 0em;" src="icons/myat.png" width="17" height="17" >mpi-inf.mpg.de</a>   I am a professor at Saarland University, and affiliated to Max Planck Institute for Informatics. I am interested in theoretical computer science in general. More specifically, I study conditional lower bounds (e.g. based on the Strong Exponential Time Hypothesis) and algorithm design working mostly on optimization, strings, and computational geometry.    <hr class="clearpara"/> <h2><a name="awards">Awards and Grants</a></h2> <hr /> <a href="tipea.html">ERC Starting Grant 2019: Technology Transfer between Integer Programming and Efficient Algorithms (TIPEA) </a> <a href="http://eatcs.org/index.php/presburger">EATCS Presburger Award for Young Scientists 2019</a> <a href="http://www.dfg.de/gefoerderte_projekte/wissenschaftliche_preise/leibnitz-preis/2019/index.html">Heinz Maier-Leibnitz-Prize 2019</a> <a href="https://eatcs.org/index.php/dissertation-award">EATCS Distinguished Dissertation Award 2015</a> <a href="http://googleresearch.blogspot.de/2012/06/2012-google-phd-fellowships.html">Google European Doctoral Fellowship 2012-2014</a> <hr class="clearpara"/> <h2><a name="teaching">Recent Teaching</a></h2> <hr /> Summer 2024: <a href="https://cms.sic.saarland/finegrained24/"> Fine-Grained Complexity Theory </a> Summer 2024: <a href="https://cms.sic.saarland/cp24/"> Competitive Programming </a> Winter 2023/24: <a href="https://cms.sic.saarland/sublinear23/"> Sublinear Algorithms </a> Winter 2023/24: <a href="https://cms.sic.saarland/algodat23/"> Algorithms and Data Structure </a> Winter 2022/23: <a href="https://cms.sic.saarland/gralgodat22/"> Introduction to Algorithms and Data Structure </a> Summer 2022: <a href="https://cms.sic.saarland/strings22/"> Reading Group: String Algorithms </a> Summer 2022: <a href="https://cms.sic.saarland/cp22/"> Competitive Programming </a> Winter 2021/22: <a href="http://cms.sic.saarland/finegrained/"> Fine-Grained Complexity Theory </a> Winter 2021/22: <a href="http://cms.sic.saarland/algodat_21/"> Algorithms and Data Structures </a> Winter 2020/21: <a href="http://cms.sic.saarland/algodat_20/"> Algorithms and Data Structures </a> Summer 2020: <a href="http://cms.sic.saarland/cp20/"> Competitive Programming </a> Summer 2020: <a href="http://www.mpi-inf.mpg.de/departments/algorithms-complexity/teaching/summer20/sublinear-algorithms/"> Sublinear Algorithms </a> Summer 2020: <a href="http://www.mpi-inf.mpg.de/departments/algorithms-complexity/teaching/summer20/reading-group/"> Seminar Reading Group Algorithms </a> Winter 2019/20: <a href="http://tcs-lecture.cs.uni-saarland.de/ads19block/"> Algorithms and Data Structures </a> Summer 2019: <a href="http://www.mpi-inf.mpg.de/departments/algorithms-complexity/teaching/summer19/fine-complexity/"> Fine-Grained Complexity Theory </a> Winter 2018/19: <a href="http://www.mpi-inf.mpg.de/departments/algorithms-complexity/teaching/winter18/multvar-algo/"> Multivariate Algorithmics </a>  <hr class="clearpara"/> <h2><a name="pcwork">Program Committees</a></h2> <hr /> <a href="https://compose.ioc.ee/icalp2024/">ICALP'24 (Co-Chair)</a>, <a href="https://socg24.athenarc.gr/socg.html">SoCG'24</a>, <a href="https://icalp2023.cs.upb.de/">ICALP'23</a>, <a href="https://algo-conference.org/2023/waoa/">WAOA'23</a>, <a href="http://acm-stoc.org/stoc2022/">STOC'22</a>, <a href="https://www.siam.org/conferences/cm/conference/sosa22">SOSA'22 (Co-Chair)</a>, <a href="http://algo2021.tecnico.ulisboa.pt/IPEC2021/index.html">IPEC'21</a>, <a href="http://algo2020.di.unipi.it/ESA2020/index.html">ESA'20</a>, <a href="https://www.siam.org/conferences/cm/conference/sosa20">SOSA'20</a>, <a href="http://csr2020.sciencesconf.org/">CSR'20</a>, <a href="http://focs2019.cs.jhu.edu/">FOCS'19</a>, <a href="http://icalp2019.upatras.gr/">ICALP'19</a>, <a href="https://stacs2019.akt.tu-berlin.de/">STACS'19</a>, <a href="http://highlightsofalgorithms.org/">HALG'18</a>, <a href="https://www.renyi.hu//conferences/socg18/">SoCG’18</a>, <a href="http://projects.csail.mit.edu/itcs/">ITCS’18</a>, <a href="http://drops.dagstuhl.de/portals/extern/index.php?semnr=16038">ICALP’17</a>, <a href="http://drops.dagstuhl.de/opus/portals/lipics/index.php?semnr=16063">IPEC’17</a>, <a href="http://www.kurims.kyoto-u.ac.jp/icalp2015/">ICALP’15</a>, <a href="http://cs.au.dk/research/centers/madalgo/past-events/massive-2015/">MASSIVE’15</a>, <a href="http://www.sigevo.org/gecco-2012/">GECCO’12</a>+<a href="http://www.sigevo.org/gecco-2013/">’13</a>+<a href="http://www.sigevo.org/gecco-2014/">’14</a>+<a href="http://www.sigevo.org/gecco-2015/">’15</a>+<a href="http://gecco-2016.sigevo.org">’16</a>+<a href="http://gecco-2017.sigevo.org">’17</a> <hr class="clearpara"/> <h2><a name="publications">Selected Publications</a></h2> <hr />     For a complete list of publications look <a href="publications.html">here</a> or in <a href="http://dblp.org/pid/96/2643">DBLP</a> <table id="references" cellpadding="6"> <tr class="ref"> <td class="num"> [33] </td> <td class="data"> <a href="https://arxiv.org/abs/2404.04369" class="pub">"A Fine-grained Classification of Subquadratic Patterns for Subgraph Listing and Friends"</a> Karl Bringmann, Egor Gorbachev STOC'25: Proc. of the 57th ACM Symposium on the Theory of Computing </td> </td> </tr> <tr class="ref"> <td class="num"> [32] </td> <td class="data"> <a href="https://arxiv.org/abs/2410.21942" class="pub">"Beating Bellman's Algorithm for Subset Sum"</a> Karl Bringmann, Nick Fischer, Vasileios Nakos SODA'25: Proc. of the 36th Annual ACM-SIAM Symposium on Discrete Algorithms </td> </tr> <tr class="ref"> <td class="num"> [31] </td> <td class="data"> <a href="https://arxiv.org/abs/2308.03075" class="pub">"Knapsack with Small Items in Near-Quadratic Time"</a> Karl Bringmann STOC'24: Proc. of the 56th ACM Symposium on the Theory of Computing </td> </td> </tr> <tr class="ref"> <td class="num"> [30] </td> <td class="data"> <a href="https://arxiv.org/abs/2312.01759" class="pub">"Faster Sublinear-Time Edit Distance"</a> Karl Bringmann, Alejandro Cassis, Nick Fischer, Tomasz Kociumaka SODA'24: Proc. of the 35th Annual ACM-SIAM Symposium on Discrete Algorithms </td> </tr> <tr class="ref"> <td class="num"> [29] </td> <td class="data"> <a href="https://arxiv.org/abs/2310.07595" class="pub">"Approximating Subset Sum Ratio faster than Subset Sum"</a> Karl Bringmann SODA'24: Proc. of the 35th Annual ACM-SIAM Symposium on Discrete Algorithms </td> </tr> <tr class="ref"> <td class="num"> [28] </td> <td class="data"> <a href="https://arxiv.org/abs/2309.06317" class="pub">"The Time Complexity of Fully Sparse Matrix Multiplication"</a> Amir Abboud, Karl Bringmann, Nick Fischer, Marvin Künnemann SODA'24: Proc. of the 35th Annual ACM-SIAM Symposium on Discrete Algorithms </td> </tr> <tr class="ref"> <td class="num"> [27] </td> <td class="data"> <a href="https://arxiv.org/abs/2310.18128" class="pub">"Dynamic Dynamic Time Warping"</a> Karl Bringmann, Nick Fischer, Ivor van der Hoog, Evangelos Kipouridis, Tomasz Kociumaka, Eva Rotenberg SODA'24: Proc. of the 35th Annual ACM-SIAM Symposium on Discrete Algorithms </td> </tr> <tr class="ref"> <td class="num"> [26] </td> <td class="data"> <a href="https://arxiv.org/abs/2304.05279" class="pub">"Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!"</a> Karl Bringmann, Alejandro Cassis, Nick Fischer FOCS'23: Proc. of the 64th Annual IEEE Symposium on Foundations of Computer Science </td> </tr> <tr class="ref"> <td class="num"> [25] </td> <td class="data"> <a href="https://arxiv.org/abs/2211.07058" class="pub">"Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics"</a> Amir Abboud, Karl Bringmann, Nick Fischer STOC'23: Proc. of the 55th ACM Symposium on the Theory of Computing Invited to SICOMP special issue </td> </td> </tr> <tr class="ref"> <td class="num"> [24] </td> <td class="data"> <a href="https://arxiv.org/abs/2204.10465" class="pub">"Hardness of Approximation in P via Short Cycle Removal: Cycle Detection, Distance Oracles, and Beyond"</a> Amir Abboud, Karl Bringmann, Seri Khoury, Or Zamir STOC'22: Proc. of the 54th ACM Symposium on the Theory of Computing </td> </td> </tr> <tr class="ref"> <td class="num"> [23] </td> <td class="data"> <a href="https://arxiv.org/abs/2202.08066" class="pub">"Almost-Optimal Sublinear-Time Edit Distance in the Low Distance Regime"</a> Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos STOC'22: Proc. of the 54th ACM Symposium on the Theory of Computing </td> </td> </tr> <tr class="ref"> <td class="num"> [22] </td> <td class="data"> <a href="https://arxiv.org/abs/2107.07625" class="pub">"Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution"</a> Karl Bringmann, Nick Fischer, Vasileios Nakos SODA'22: Proc. of the 33rd Annual ACM-SIAM Symposium on Discrete Algorithms </td> </tr> <tr class="ref"> <td class="num"> [21] </td> <td class="data"> <a href="https://arxiv.org/abs/2107.07792" class="pub">"Tight Bounds for Approximate Near Neighbor Searching for Time Series under the Fréchet Distance"</a> Karl Bringmann, Anne Driemel, André Nusser, Ioannis Psarros SODA'22: Proc. of the 33rd Annual ACM-SIAM Symposium on Discrete Algorithms </td> </tr> <tr class="ref"> <td class="num"> [20] </td> <td class="data"> <a href="https://arxiv.org/abs/2105.05984" class="pub">"Sparse Nonnegative Convolution is Equivalent to Dense Nonnegative Convolution"</a> Karl Bringmann, Nick Fischer, Vasileios Nakos STOC'21: Proc. of the 53rd ACM Symposium on the Theory of Computing </td> </td> </tr> <tr class="ref"> <td class="num"> [19] </td> <td class="data"> <a href="https://arxiv.org/abs/1912.12529" class="pub">"A Fine-Grained Perspective on Approximating Subset Sum and Partition"</a> Karl Bringmann, Vasileios Nakos SODA'21: Proc. of the 32nd Annual ACM-SIAM Symposium on Discrete Algorithms </td> </tr> <tr class="ref"> <td class="num"> [18] </td> <td class="data"> <a href="https://arxiv.org/abs/2010.09096" class="pub">"On Near-Linear-Time Algorithms for Dense Subset Sum"</a> Karl Bringmann, Philip Wellnitz SODA'21: Proc. of the 32nd Annual ACM-SIAM Symposium on Discrete Algorithms </td> </tr> <tr class="ref"> <td class="num"> [17] </td> <td class="data"> <a href="https://arxiv.org/abs/2107.13206" class="pub">"Top-k-Convolution and the Quest for Near-linear Output-sensitive Subset Sum"</a> Karl Bringmann, Vasileios Nakos STOC'20: Proc. of the 52nd ACM Symposium on the Theory of Computing </td> </tr> <tr class="ref"> <td class="num"> [16] </td> <td class="data"> <a href="https://arxiv.org/abs/1907.11078" class="pub">"Approximating APSP without Scaling: Equivalence of Approximate Min-Plus and Exact Min-Max"</a> Karl Bringmann, Marvin Künnemann, Karol Węgrzycki STOC'19: Proc. of the 51st ACM Symposium on the Theory of Computing </td> </tr> <tr class="ref"> <td class="num"> [15] </td> <td class="data"> <a href="https://arxiv.org/abs/1810.10982" class="pub">"Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability"</a> Karl Bringmann, Marvin Künnemann, André Nusser SODA'19: Proc. of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms </td> </tr> <tr class="ref"> <td class="num"> [14] </td> <td class="data"> <a href="https://epubs.siam.org/doi/abs/10.1137/1.9781611975482.69" class="pub">"Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts"</a> Karl Bringmann, Marvin Künnemann, Philip Wellnitz SODA'19: Proc. of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms </td> </tr> <tr class="ref"> <td class="num"> [13] </td> <td class="data"> <a href="https://arxiv.org/abs/1704.04546" class="pub">"SETH-Based Lower Bounds for Subset Sum and Bicriteria Path"</a> Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay SODA'19: Proc. of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms Invited to HALG'20 and to TALG special issue </td> </tr> <tr class="ref"> <td class="num"> [12] </td> <td class="data"> <a href="https://arxiv.org/abs/1807.06101" class="pub">"A PTAS for l_p-Low Rank Approximation"</a> Frank Ban, Vijay Bhattiprolu, Karl Bringmann, Pavel Kolev, Euiwoong Lee, David Woodruff SODA'19: Proc. of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms </td> </tr> <tr class="ref"> <td class="num"> [11] </td> <td class="data"> <a href="https://arxiv.org/abs/1805.08554" class="pub">"More Consequences of Falsifying SETH and the Orthogonal Vectors Conjecture"</a> Amir Abboud, Karl Bringmann, Holger Dell, Jesper Nederlof STOC'18: Proc. of the 50th ACM Symposium on the Theory of Computing </td> </tr> <tr class="ref"> <td class="num"> [10] </td> <td class="data"> <a href="https://arxiv.org/abs/1804.00101" class="pub">"Fast Fencing"</a> Mikkel Abrahamsen, Anna Adamaszek, Karl Bringmann, Vincent Cohen-Addad, Mehran Mehr, Eva Rotenberg, Alan Roytman, Mikkel Thorup STOC'18: Proc. of the 50th ACM Symposium on the Theory of Computing </td> </tr> <tr class="ref"> <td class="num"> [9] </td> <td class="data"> <a href="https://arxiv.org/abs/1703.08940" class="pub">"Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can)"</a> Karl Bringmann, Paweł Gawrychowski, Shay Mozes, Oren Weimann SODA'18: Proc. of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms </td> </tr> <tr class="ref"> <td class="num"> [8] </td> <td class="data"> <a href="https://arxiv.org/abs/1803.00938" class="pub">"Multivariate Fine-Grained Complexity of Longest Common Subsequence"</a> Karl Bringmann, Marvin Künnemann SODA'18: Proc. of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms </td> </tr> <tr class="ref"> <td class="num"> [7] </td> <td class="data"> <a href="https://arxiv.org/abs/1803.00796" class="pub">"Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-And-Solve"</a> Amir Abboud, Arturs Backurs, Karl Bringmann, Marvin Künnemann FOCS'17: Proc. of the 58th Annual IEEE Symposium on Foundations of Computer Science </td> </tr> <tr class="ref"> <td class="num"> [6] </td> <td class="data"> <a href="https://arxiv.org/abs/1611.00918" class="pub">"A Dichotomy for Regular Expression Membership Testing"</a> Karl Bringmann, Allan Grønlund, Kasper Green Larsen FOCS'17: Proc. of the 58th Annual IEEE Symposium on Foundations of Computer Science </td> </tr> <tr class="ref"> <td class="num"> [5] </td> <td class="data"> <a href="http://arxiv.org/abs/1610.04712" class="pub">"A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum"</a> Karl Bringmann SODA'17: Proc. of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms </td> </tr> <tr class="ref"> <td class="num"> [4] </td> <td class="data"> <a href="https://arxiv.org/abs/1707.05095" class="pub">"Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product"</a> Karl Bringmann, Fabrizio Grandoni, Barna Saha, Virginia Vassilevska Williams FOCS'16: Proc. of the 57th Annual IEEE Symposium on Foundations of Computer Science Invited to HALG'17 and to SICOMP special issue </td> </tr> <tr class="ref"> <td class="num"> [3] </td> <td class="data"> <a href="https://arxiv.org/abs/1502.01063" class="pub">"Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping"</a> Karl Bringmann, Marvin Künnemann FOCS'15: Proc. of the 56th Annual IEEE Symposium on Foundations of Computer Science </td> </tr> <tr class="ref"> <td class="num"> [2] </td> <td class="data"> <a href="https://arxiv.org/abs/1404.1448" class="pub">"Why walking the dog takes time: Frechet distance has no strongly subquadratic algorithms unless SETH fails"</a> Karl Bringmann FOCS'14: Proc. of the 55th Annual IEEE Symposium on Foundations of Computer Science </td> </tr> <tr class="ref"> <td class="num"> [1] </td> <td class="data"> <a href="paper/2013STOC.pdf" class="pub">"Succinct Sampling from Discrete Distributions"</a> Karl Bringmann, Kasper Green Larsen STOC'13: Proc. of the 45th ACM Symposium on the Theory of Computing </td> </tr> </table>  <hr />  <h2><a name="education">Short CV</a></h2> <hr />  <ul> <li> Since November 2019: Professor at <a href="http://www.uni-saarland.de">Saarland University</a> </li> <li> January 2016 - October 2019: PostDoc and Senior Researcher (since 2017) at <a href="http://www.mpi-inf.mpg.de">Max Planck Institute for Informatics</a> </li> <li> August 2015 - December 2015: Research Fellow at the <a href="https://simons.berkeley.edu/">Simons Institute for the Theory of Computing, Berkeley</a>, participating in the program <a href="https://simons.berkeley.edu/programs/complexity2015">"Fine-Grained Complexity and Algorithm Design"</a> </li> <li> September 2014 - August 2015: PostDoc at <a href="http://www.cadmo.ethz.ch/as/people/index">ETH Zurich</a>, holding an <a href="http://ethz.ch/en/research/research-promotion/eth-fellowships.html">ETH Zurich Postdoctoral Fellowship</a> </li> <li> April 2011 - August 2014: Ph. D. student in <a href="http://www.cs.uni-saarland.de">Computer Science</a> at <a href="http://www.uni-saarland.de">Saarland University, Saarbrücken, Germany</a> and <a href="http://www.mpi-inf.mpg.de">Max Planck Institute for Informatics</a>, under supervision of <a href="https://people.mpi-inf.mpg.de/~mehlhorn/">Kurt Mehlhorn</a> Holding a <a href="http://googleresearch.blogspot.de/2012/06/2012-google-phd-fellowships.html">Google European Doctoral Fellowship</a> since 2012 Thesis won an <a href="https://eatcs.org/index.php/dissertation-award">EATCS Distinguished Dissertation Award</a> </li>  </ul>  <div id="footer">Copyright 2019 by <a href="http://www.mpi-inf.mpg.de/" title="Home Page of the Max-Planck-Institute Informatik">Max-Planck-Institut Informatik</a> | <a href="https://imprint.mpi-klsb.mpg.de/inf/people/kbringma">Imprint / Impressum</a> | <a href="https://data-protection.mpi-klsb.mpg.de/inf/people/kbringma">Data Protection / Datenschutzhinweis</a> page last modified Friday, 31 January 2025 - 23:22 </div> </div> </div> <div id="col1o2"> <div id="col1o2content">    <ul class="linklist"> <li><a href="index.html" accesskey="h" title="Karl Bringmann MPII Homepage" id="hp-index">Karl Bringmann:</a> <ul> <li><a href="index.html#research" accesskey="r" title="Research Interests" id="hp-research">Research Interests</a></li> <li><a href="publications.html" accesskey="p" title="Publications of Firstname Lastname" id="hp-publications">Publications</a></li>  <li><a href="index.html#education" accesskey="e" title="Education of Firstname Lastname" id="hp-education">Education</a></li>  </ul> </li>   </ul>  <ul class="linklist"> <li style="border-top: 1px solid rgb(67%,76%,84%);"><a href="//www.imprs-cs.de/" accesskey="i" title="The International Max Planck Research School for Computer Science (IMPRS-CS)" id="n2-imprs">Doctoral Research Program</a></li> <li><a href="//www.mpc-vcc.org/" accesskey="c" title="Max Planck Center for Visual Computing and Communication" id="n2-mpc">Max Planck Center</a></li> <li><a href="//www.mmci.uni-saarland.de/" accesskey="e" title="Cluster of Excellence: Multimodal Computing and Interaction" id="n2-mmci">Cluster of Excellence (MMCI)</a></li> <li><a href="//www.mpi-inf.mpg.de/computer-science-cluster" accesskey="o" title="Kaiserslautern-Saarbrücken Computer Science Cluster" id="n2-cluster">Computer Science Cluster</a></li> </ul>  </div> </div> </body> </html>