Pages that link to "Item:Q5232745"
From MaRDI portal
The following pages link to 2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) (Q5232745):
Displayed 17 items.
- Worst-Case Efficient Sorting with QuickMergesort (Q5232746) (← links)
- Simple and Fast BlockQuicksort using Lomuto's Partitioning Scheme (Q5232748) (← links)
- Lightweight Distributed Suffix Array Construction (Q5232749) (← links)
- Approximation of trees by self-nested trees (Q5232750) (← links)
- Fast and Exact Public Transit Routing with Restricted Pareto Sets (Q5232751) (← links)
- Alternative Multicriteria Routes (Q5232753) (← links)
- Concatenated <i>k</i>-Path Covers (Q5232754) (← links)
- Batch-Parallel Euler Tour Trees (Q5232756) (← links)
- A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints (Q5232757) (← links)
- SAT-Encodings for Treecut Width and Treedepth (Q5232758) (← links)
- Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling (Q5232759) (← links)
- Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs (Q5232762) (← links)
- Parallel Range, Segment and Rectangle Queries with Augmented Maps (Q5232763) (← links)
- A Practical Algorithm for Spatial Agglomerative Clustering (Q5232765) (← links)
- Practical Methods for Computing Large Covering Tours and Cycle Covers with Turn Cost (Q5232766) (← links)
- Faster Support Vector Machines (Q5232767) (← links)
- Scalable Edge Partitioning (Q5232768) (← links)