default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID27th ALENEX 2025: New Orleans, LA, USA
- Rezaul Chowdhury, Jonathan W. Berry, Kathrin Hanauer, Bin Ren:
Proceedings of the 27th Symposium on Algorithm Engineering and Experiments, ALENEX 2025, New Orleans, LA, USA, January 12-13, 2025. SIAM 2025, ISBN 978-1-61197-833-9 - Jannick Borowitz, Ernestine Großmann, Christian Schulz:
Optimal Neighborhood Exploration for Dynamic Independent Sets. 1-14 - Ernestine Großmann, Henrik Reinstädtler, Christian Schulz, Fabian Walliser:
Engineering Fully Dynamic Exact ∆-Orientation Algorithms. 15-28 - Arne Beines, Michael Kaibel, Philip Mayer, Petra Mutzel, Jonas Sauer:
A Simpler Approach for Monotone Parametric Minimum Cut: Finding the Breakpoints in Order. 29-41 - Letong Wang, Guy E. Blelloch, Yan Gu, Yihan Sun:
Parallel Cluster-BFS and Applications to Shortest Paths. 42-55 - Kenneth Langedal, Fredrik Manne:
Graph Neural Networks as Ordering Heuristics for Parallel Graph Coloring. 56-67 - Michael Etienne Van Huffel, Olympio Hacquard, Vadim Lebovici, Matteo Palo:
Discrete Transforms of Quantized Persistence Diagrams. 68-80 - Felix Hausberger, Marcelo Fonseca Faraj, Christian Schulz:
Scalable Multilevel and Memetic Signed Graph Clustering. 81-94 - Jarno N. Alanko, Elena Biagi, Joel Mackenzie, Simon J. Puglisi:
Batched k-Mer Lookup on the Spectral Burrows-Wheeler Transform. 95-106 - Cheng Huang, Alexander Mathiasen, Josef Dean, Johannes Langguth, Davide Mottin, Ira Assent:
RETRACTED: Linear Assignment on Tile-Centric Accelerators: Redesigning Hungarian Algorithm on IPUs. 107-119 - Aleksander Figiel, Darya Melnyk, André Nichterlein, Arash Pourdamghani, Stefan Schmid:
SpiderDAN: Matching Augmentation in Demand-Aware Networks. 120-132 - David Tench, Evan T. West, Kenny Zhang, Michael A. Bender, Daniel DeLayo, Martín Farach-Colton, Gilvir Gill, Tyler Seip, Victor Zhang:
Exploring the Landscape of Distributed Graph Sketching. 133-146 - Thomas Bläsius, Max Göttlicher, Sascha Gritzbach, Wendy Yi:
The Constrained Layer Tree Problem and Applications to Solar Farm Cabling. 147-159 - Katie Clinch, Matthew Drescher, Tony Huynh, Abdallah Saffidine:
Constructions, Bounds, and Algorithms for Peaceable Queens. 160-167 - Matthew Akram, Nikolai Maas, Peter Sanders, Dominik Schreiber:
Engineering Optimal Parallel Task Scheduling. 168-180 - Sébastien Balny, Claire Delaplace, Gilles Dequen:
Another L Makes It Better? Lagrange Meets LLL and May Improve BKZ Pre-Processing. 181-193 - Alejandro García-Castellanos, Aniss Aiman Medbouhi, Giovanni Luca Marchetti, Erik J. Bekkers, Danica Kragic:
HyperSteiner: Computing Heuristic Hyperbolic Steiner Minimal Trees. 194-208 - Mónika Csikós, Alexandre Louvet, Nabil H. Mustafa:
A Greedy Algorithm for Low-Crossing Partitions for General Set Systems. 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 2025-12-04 01:33 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:
