diff --git a/index.html b/index.html
index d81d28f57307a8d51c481f4ca8870cab908770f3..49b60f41c4ec7834591cdfe806d56665598d78be 100644
--- a/index.html
+++ b/index.html
@@ -1031,7 +1031,8 @@ In our first main result, we show that (mixed) ω-algebraic systems can be trans
 
 <tr style="background-color:#fafcff", valign="top">
 <td align="right"><a href="http://www.timeanddate.com/worldclock/fixedtime.html?iso=2021-11-05T16:20:00">17:20</a></td>
-<td align="left"><i ><u >Uli Fahrenberg</u>, Christian Johansen, Georg Struth, Krzysztof Ziemiański</i></td>
+<td align="left"><i ><u >Uli Fahrenberg</u>, Christian Johansen, Georg
+    Struth and Krzysztof Ziemiański</i></td>
 <td align="left", width="60%">
 <a href="javascript:toggleDiv('T43')">Languages of Higher-Dimensional Automata (short talk)</a>
 <div style="display:none", id="T43"><br /><br />We introduce languages of higher-dimensional automata (HDAs) and develop some of their properties.  To this end, we define a new category of precubical sets, uniquely naturally isomorphic to the standard one, and introduce a notion of event consistency.  HDAs are then finite, labeled, event-consistent precubical sets with distinguished subsets of initial and accepting cells.  Their languages are sets of interval orders closed under subsumption; as a major technical step we expose a bijection between interval orders and a subclass of HDAs.  We show that any finite subsumption-closed set of interval orders is the language of an HDA, that languages of HDAs are closed under binary unions and parallel composition, and that bisimilarity implies language equivalence.