Simpler Optimal Sorting from a Directed Acyclic Graph.
- ,
- ,
- Daniel Rutschmann
- Technical University of Denmark
Research Output:
Conference Article in Proceeding or Book/Report chapter
Article in proceedings
Peer-review
Open access
Publication Information
Output type
Research Output:
Conference Article in Proceeding or Book/Report chapter
Article in proceedings
Peer-reviewOriginal language
EnglishPages from-to (Number of pages)
Pages 350-355 (6 pages)Publication milestones
- Published - 2025
Publication status
Published - 2025
Publisher
Society for Industrial and Applied Mathematics, United StatesISBN (Print)
9781611978315Publication IDs
- Scopus: 85217060260
Host publication title
8th SIAM Symposium on Simplicity of Algorithms, SOSA 2025Abstract
Fredman proposed in 1976 the following algorithmic problem: Given are a ground set X, some partial order P over X, and some comparison oracle OL that specifies a linear order L over X that extends P. A query to OL has as input distinct x,x‘ ϵ X and outputs whether x
Publication metrics
PlumX, opens in new tab
Captures
2
Citations
2
Funding Details
European Union’s Horizon 2020
Marie Sklodowska-Curie: 899987
Eva Rotenberg’s Carlsberg Foundation Young Researcher Fellowship: CF21-0302
Graph Algorithms with Geometric Applications
Access to documents
Related Event
Title
Symposium on Simplicity in Algorithms
Event type
SymposiumDegree of recognition
International eventDate
13/01/2025 - 14/01/2025Location
New orleansUnited States