Mini-Workshop TCS at TuDo and RUB
O(1) worst-case time for the queries, where N is the total collection size [Gawrychowski et al., SODA 2018]. We present here a much simpler solution based on a forest of enhanced splay trees (FeST), where [...] size. based on joint work with Gabriele Kern-Isberner, Andreas Ecke, and Franz Baader MW 33, July 16, 2018 Nils Vortmeier: Reachability and Distances under Multiple Changes Abstract: Recently it was shown [...] number c. based on joint work with Samir Datta, Anish Mukherjee, and Thomas Zeume presented at ICALP 2018 Anish Mukherjee: Shortest k-Disjoint Paths via Determinants Abstract : The well-known $k$-disjoint …
