Counting 666-Cliques in O(n5.97)O(n^{5.97})O(n5.97) time and O(logn)O(\log n)O(logn) spacewith Afrouz Jabal Ameli, Jesper Nederlof1 versionW_4mbc8ygxv1 · current
Temporal Routing in Static Networks: The Schedule Completion ProblemMichelle Doring, Niklas Mohrin, George Skretas0 citations2604.27757v32026arXiv
Parameterized Complexity of Vehicle RoutingMichelle Doring, Jan Fehse, Tobias Friedrich et al.0 citations2509.10361v12025arXiv