Daniel Rutschmann

Orcid: 0009-0005-6838-2628

According to our database1, Daniel Rutschmann authored at least 12 papers between 2022 and 2026.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2026
Approximate selection with unreliable comparisons in sublinear time.
J. Comput. Syst. Sci., 2026

2025
Simple Universally Optimal Dijkstra.
CoRR, April, 2025

Simpler Optimal Sorting from a Directed Acyclic Graph.
Proceedings of the 2025 Symposium on Simplicity in Algorithms, 2025

A Combinatorial Proof of Universal Optimality for Computing a Planar Convex Hull.
Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

Simpler Universally Optimal Dijkstra.
Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

Instance-Optimal Imprecise Convex Hull.
Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

Efficient Greedy Discrete Subtrajectory Clustering.
Proceedings of the 41st International Symposium on Computational Geometry, 2025

2024
Triangulations Admit Dominating Sets of Size 2<i>n</i>/7.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Tight Bounds for Sorting Under Partial Information.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023
Triangulations Admit Dominating Sets of Size 2n/7.
CoRR, 2023

Approximate Selection with Unreliable Comparisons in Optimal Expected Time.
Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

2022
Chains, Koch Chains, and Point Sets with Many Triangulations.
Proceedings of the 38th International Symposium on Computational Geometry, 2022


  Loading...