2 papers
cs.DS2026
Warm-Starting All-Pairs Shortest Paths with Predictions
Adam Polak, Jonas Schmidt
One of the three key hypotheses of fine-grained complexity asserts that computing All-Pairs Shortest Paths (APSP) requires cubic time, up to subpolynomial factors, in the worst cas…
cs.CC2025
A Parameterized Study of Secluded Structures in Directed Graphs
Jonas Schmidt, Shaily Verma, Nadym Mallek
Given an undirected graph and an integer , the Secluded -Subgraph problem asks you to find a maximum size induced subgraph that satisfies a property and has at most…