Daniel Rutschmann

22 papers A* 4A 4Journal 13Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Approximate selection with unreliable comparisons in sublinear time. J. Comput. Syst. Sci. Shengyu Huang, Chih-Hung Liu, Daniel Rutschmann
2025	A	`conf`	A Combinatorial Proof of Universal Optimality for Computing a Planar Convex Hull. ESA Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann
2025	J	`jnl`	A Combinatorial Proof of Universal Optimality for Computing a Planar Convex Hull. CoRR Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann
2025	A*	`conf`	Efficient Greedy Discrete Subtrajectory Clustering. SoCG Ivor van der Hoog, Lara Ost, Eva Rotenberg, Daniel Rutschmann
2025	J	`jnl`	Efficient Greedy Discrete Subtrajectory Clustering. CoRR Ivor van der Hoog, Lara Ost, Eva Rotenberg, Daniel Rutschmann
2025	A	`conf`	Instance-Optimal Imprecise Convex Hull. ESA Sarita de Berg, Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann, Sampson Wong
2025	J	`jnl`	Instance-Optimal Imprecise Convex Hull. CoRR Sarita de Berg, Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann, Sampson Wong
2025	J	`jnl`	Simple Universally Optimal Dijkstra. CoRR Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann
2025	—	`conf`	Simpler Optimal Sorting from a Directed Acyclic Graph. SOSA Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann
2025	A	`conf`	Simpler Universally Optimal Dijkstra. ESA Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann
2025	J	`jnl`	Tight Better-Than-Worst-Case Bounds for Element Distinctness and Set Intersection. CoRR Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann
2025	J	`jnl`	Tight Universal Bounds for Partially Presorted Pareto Front and Convex Hull. CoRR Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann
2024	J	`jnl`	Simpler Optimal Sorting from a Directed Acyclic Graph. CoRR Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann
2024	A*	`conf`	Tight Bounds for Sorting Under Partial Information. FOCS Ivor van der Hoog, Daniel Rutschmann
2024	J	`jnl`	Tight Bounds for Sorting Under Partial Information. CoRR Ivor van der Hoog, Daniel Rutschmann
2024	A*	`conf`	Triangulations Admit Dominating Sets of Size 2 SODA Aleksander B. G. Christiansen, Eva Rotenberg, Daniel Rutschmann
2023	A	`conf`	Approximate Selection with Unreliable Comparisons in Optimal Expected Time. STACS Shengyu Huang, Chih-Hung Liu, Daniel Rutschmann
2023	J	`jnl`	Chains, Koch Chains, and Point Sets with Many Triangulations. J. ACM Daniel Rutschmann, Manuel Wettstein
2023	J	`jnl`	Triangulations Admit Dominating Sets of Size 2n/7. CoRR Aleksander B. G. Christiansen, Eva Rotenberg, Daniel Rutschmann
2022	J	`jnl`	Approximate Selection with Unreliable Comparisons in Optimal Expected Time. CoRR Shengyu Huang, Chih-Hung Liu, Daniel Rutschmann
2022	A*	`conf`	Chains, Koch Chains, and Point Sets with Many Triangulations. SoCG Daniel Rutschmann, Manuel Wettstein
2022	J	`jnl`	Chains, Koch Chains, and Point Sets with many Triangulations. CoRR Daniel Rutschmann, Manuel Wettstein