-
Computer Science
-
Research
-
Research Profile
Algorithmic and formal fundamentals
Woeginger: Fine-grained Complexity Analysis of Two Classic TSP Variants. ACM Trans. Algorithms 17(1): 5:1-5:29 (2021). DOI: 10.1145/3414845 Jonas Ellert, Johannes Fischer : Linear Time Runs Over General Ordered [...] Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick , Thomas Zeume: Reachability Is in DynFO. J. ACM 65(5): 33:1-33:24 (2018). DOI: 10.1145/3212685 Mark de Berg, Kevin Buchin , Bart M. P. Jansen, Gerhard J …