default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDALENEX 2022: Virtual Conference / Alexandria, VA, USA
- Cynthia A. Phillips, Bettina Speckmann:
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2022, Alexandria, VA, USA, January 9-10, 2022. SIAM 2022, ISBN 978-1-61197-704-2 - Front Matter. i-iii
- Daniel Bahrdt, Stefan Funke, Sokol Makolli
, Claudius Proissl:
Distance Closures: Unifying Search- and Lookup-based Shortest Path Speedup Techniques. 1-12 - Monika Henzinger, Alexander Noe, Christian Schulz:
Practical Fully Dynamic Minimum Cut Algorithms. 13-26 - Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran, Nick Wormald:
Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence. 27-40 - Darren Strash, Louise Thompson:
Effective Data Reduction for the Vertex Clique Cover Problem. 41-53 - Jonas Charfreitag, Michael Jünger, Sven Mallach, Petra Mutzel:
McSparse: Exact Solutions of Sparse Maximum Cut and Sparse Unconstrained Binary Quadratic Optimization Problems. 54-66 - André Schidler, Stefan Szeider:
A SAT Approach to Twin-Width. 67-77 - David Coudert, André Nusser, Laurent Viennot:
Computing Graph Hyperbolicity Using Dominating Sets. 78-90 - Leszek Gasieniec, Benjamin Smith, Sebastian Wild:
Towards the 5/6-Density Conjecture of Pinwheel Scheduling. 91-103 - Sebastian Berndt, Max A. Deppert, Klaus Jansen, Lars Rohwedder:
Load Balancing: The Long Road from Theory to Practice. 104-116 - Yifan Xu, Anchengcheng Zhou, Grace Q. Yin, Kunal Agrawal, I-Ting Angelina Lee, Tao B. Schardl:
Efficient Access History for Race Detection. 117-130 - Lars Gottesbüren, Tobias Heuer, Peter Sanders, Sebastian Schlag:
Shared-Memory n-level Hypergraph Partitioning. 131-144 - Moritz Potthoff, Jonas Sauer:
Fast Multimodal Journey Planning for Three Criteria. 145-157 - Emil Biju, Sundar Raman P.:
Perturbation Analysis of Practical Algorithms for the Maximum Scatter Travelling Salesman Problem. 158-168 - Tamal K. Dey, Simon Zhang:
Approximating 1-Wasserstein Distance between Persistence Diagrams by Graph Sparsification. 169-183 - Dena Tayebi, Saurabh Ray, Deepak Ajwani:
Learning to Prune Instances of k-median and Related Problems. 184-194 - Guy E. Blelloch, Magdalen Dobson:
Parallel Nearest Neighbors in Low Dimensions with Batch Updates. 195-208 - Thomas Bläsius, Tobias Friedrich, David Stangl, Christopher Weyand:
An Efficient Branch-and-Bound Solver for Hitting Set. 209-220
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-08 20:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
