Daniel Rutschmann

According to our database, Daniel Rutschmann authored at least 6 papers between 2023 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

Simpler Optimal Sorting from a Directed Acyclic Graph.

Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann

CoRR, 2024

Triangulations Admit Dominating Sets of Size 2<i>n</i>/7.

Aleksander B. G. Christiansen, Eva Rotenberg, Daniel Rutschmann

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Tight Bounds for Sorting Under Partial Information.

Ivor van der Hoog, Daniel Rutschmann

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023

Chains, Koch Chains, and Point Sets with Many Triangulations.

Daniel Rutschmann, Manuel Wettstein

J. ACM, June, 2023

Triangulations Admit Dominating Sets of Size 2n/7.

Aleksander B. G. Christiansen, Eva Rotenberg, Daniel Rutschmann

CoRR, 2023

Approximate Selection with Unreliable Comparisons in Optimal Expected Time.

Shengyu Huang, Chih-Hung Liu, Daniel Rutschmann

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023