Simon Meierhans
Orcid: 0000-0002-9736-4745
According to our database1,
Simon Meierhans
authored at least 10 papers
between 2019 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality.
CoRR, 2024
A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and Their Applications.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
2022
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022
2021
IEEE Trans. Parallel Distributed Syst., 2021
2019
Proceedings of the 27th Annual European Symposium on Algorithms, 2019
Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition Workshops, 2019