Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Daniel Rutschmann
Observed name:
Rutschmann, Daniel
Institutions:
Institute of Science and Technology Austria,
IT University of Copenhagen,
Technical University of Denmark
Observed institutions:
Institute of Science and Technology Austria,
Carlsberg Foundation,
ETH Zurich,
Villum Fonden,
IT University of Copenhagen,
Technical University of Denmark
show all 6
ORCID:
0009-0005-6838-2628
Observed ORCID:
0009-0005-6838-2628
OpenAlex ID:
A5021826063
Simpler Optimal Sorting from a Directed Acyclic Graph
2025
·
Ivor van der Hoog
, Eva Rotenberg
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
17
PDF
Chains, Koch Chains, and Point Sets with Many Triangulations
2023
·
Daniel Rutschmann
, Manuel Wettstein
·
Journal of the ACM
·
11
PDF
Tight Bounds for Sorting Under Partial Information
2024
·
Ivor Van Der Hoog
, Daniel Rutschmann
·
Annual Symposium on Foundations of Computer Science
·
8
PDF
Sorting under Partial Information with Optimal Preprocessing Time via Unified Bound Heaps
2026
·
Rutschmann, Daniel
·
arXiv (Cornell University)
·
6
PDF
Instance-Optimal Imprecise Convex Hull
2025
·
de Berg, Sarita
, van der Hoog, Ivor
, et al.
·
Research at the University of Copenhagen (University of Copenhagen)
·
6
Triangulations Admit Dominating Sets of Size 2 n /7.
2024
·
Aleksander B. G. Christiansen
, Eva Rotenberg
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
6
Approximate Selection with Unreliable Comparisons in Optimal Expected Time
2022
·
Huang, Shengyu
, Liu, Chih-Hung
, et al.
·
arXiv (Cornell University)
·
4
PDF
Disjoint Total Dominating Sets in Planar Graphs
2026
·
Eva Rotenberg
, Daniel Rutschmann
, et al.
·
Journal of Graph Theory
·
3
Triangulations Admit Dominating Sets of Size $2n/7$
2023
·
Christiansen, Aleksander B. G.
, Rotenberg, Eva
, et al.
·
arXiv (Cornell University)
·
3
PDF
Instance and Universally Optimal Bounds for Imprecise Pareto Fronts
2026
·
de Berg, Sarita
, Bække, Nynne Maria Foldager
, et al.
·
arXiv (Cornell University)
·
1
PDF
Near-Optimal Working-Set Heaps and Dijkstra on Pointer Machines
2026
·
van der Hoog, Ivor
, Iacono, John
, et al.
·
arXiv (Cornell University)
·
1
PDF
Tight Better-Than-Worst-Case Bounds for Element Distinctness and Set Intersection
2025
·
van der Hoog, Ivor
, Rotenberg, Eva
, et al.
·
arXiv (Cornell University)
·
1
PDF
Approximate selection with unreliable comparisons in sublinear time
2025
·
Shengyu Huang
, Chih-Hung Liu
, et al.
·
Journal of Computer and System Sciences
·
1
Small and Large Quasi-Kernels in General Digraphs
2026
·
Rutschmann, Daniel
·
arXiv (Cornell University)
PDF
Incremental Exact Vertex Connectivity
2026
·
Adena, Felix
, Henzinger, Monika
, et al.
·
arXiv (Cornell University)
PDF
Adaptive Sorting, also in the BST Model
2026
·
van der Hoog, Ivor
, Rotenberg, Eva
, et al.
·
arXiv (Cornell University)
PDF
Instance Optimal and Universally Optimal Bounds for Imprecise Pareto Fronts
2026
·
de Berg, Sarita
, Bække, Nynne Maria Foldager
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
PDF
Show more works
View as search
Works count:
19
Citation count:
94
H-index:
6
I10-index:
3
Year
Topic
Type