ALENEX22 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.

Shared-Memory n-level Hypergraph Partitioning
Lars Gottesbüren, Tobias Heuer, Peter Sanders and Sebastian Schlag

Distance Closures: Unifying Search- and Lookup-based Shortest Path Speedup Techniques
Daniel Bahrdt, Stefan Funke, Sokol Makolli and Claudius Proissl

Fast Multimodal Journey Planning for Three Criteria
Jonas Sauer and Moritz Potthoff

Load Balancing: The Long Road From Theory to Practice
Sebastian Berndt, Max Deppert, Klaus Jansen and Lars Rohwedder

Practical Fully Dynamic Minimum Cut Algorithms
Monika Henzinger, Alexander Noe and Christian Schulz

A SAT Approach to Twin-Width
Andre Schidler and Stefan Szeider

McSparse: Exact Solutions of Sparse Maximum Cut and Sparse Unconstrained Binary Quadratic Optimization Problems
Jonas Charfreitag, Michael Jünger, Sven Mallach and Petra Mutzel

Efficient Access History for Race Detection
Yifan Xu, Anchengcheng Zhou, Grace Q. Yin, Kunal Agrawal, I-Ting Angelina Lee and Tao B. Schardl

An Efficient Branch-and-Bound Solver for Hitting Set
Thomas Bläsius, Tobias Friedrich, David Stangl and Christopher Weyand

Towards the 5/6-Density Conjecture in Pinwheel Scheduling
Leszek Gąsieniec, Ben Smith and Sebastian Wild.

Parallel Nearest Neighbors in Low Dimensions with Batch Updates
Magdalen Dobson and Guy Blelloch

Approximating 1-Wasserstein Distance between Persistence Diagrams by Graph Sparsification
Tamal Dey and Simon Zhang

Effective Data Reduction for the Vertex Clique Cover Problem
Darren Strash and Louise Thompson

Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence
Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran and Nick Wormald

Computing Graph Hyperbolicity Using Dominating Sets
David Coudert, André Nusser and Laurent Viennot

Learning to Prune Instances of k-median and Related Problems
Dena Tayebi, Saurabh Ray and Deepak Ajwani

Perturbation Analysis of Practical Algorithms for the Maximum Scatter Travelling Salesman Problem
Emil Biju and Sundar Raman