ALENEX19 Accepted Papers | SIAM

Accepted Papers

Visualizer: Accepted Papers

Paper titles and author information appears as submitted.

Paper title and author changes will not be made to this page. The online program will reflect the most up-to-date presentation details, and is scheduled for posting in November.

Parallel Range, Segment and Rectangle Queries with Augmented Maps
Yihan Sun and Guy Blelloch

Worst-Case Efficient Sorting with QuickMergesort
Stefan Edelkamp and Armin Weiss

Faster Support Vector Machines
Sebastian Schlag, Matthias Schmitt and Christian Schulz

Lightweight Distributed Suffix Array Construction
Johannes Fischer and Florian Kurpicz

A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints
Adalat Jabrayilov and Petra Mutzel

Concatenated k-Path Covers
Moritz Beck, Kam-Yiu Lam, Joseph Kee Yin Ng, Sabine Storandt and Chun Jiang Zhu

Simple and Fast BlockQuicksort using Lomuto’s Partitioning Scheme
Martin Aumüller and Nikolaj Askjær Hass

Practical Methods for Computing Large Covering Tours and Cycle Covers with Turn Cost
Sándor Fekete and Dominik Krupke

Alternative Multicriteria Routes
Florian Barth, Stefan Funke and Sabine Storandt

SAT-Encodings for Treecut Width and Treedepth
Robert Ganian, Neha Lodha, Sebastian Ordyniak and Stefan Szeider

Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling
Thomas Bläsius, Tobias Friedrich, Julius Lischeid, Kitty Meeks and Martin Schirneck

Fast and Exact Public Transit Routing with Restricted Pareto Sets
Daniel Delling, Julian Dibbelt and Thomas Pajor

Batch-Parallel Euler Tour Trees
Thomas Tseng, Laxman Dhulipala and Guy Blelloch

Scalable Edge Partitioning
Sebastian Schlag, Christian Schulz, Daniel Seemaier and Darren Strash

A Practical Algorithm for Spatial Agglomerative Clustering
Thom Castermans, Bettina Speckmann and Kevin Verbeek

Approximation of trees by self-nested trees
Romain Azais, Jean-Baptiste Durand and Christophe Godin

Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs
Sebastian Lamm, Christian Schulz, Darren Strash, Robert Williger and Huashuo Zhang