Sign in
ALENEX
1999
2007
2015
2023
1999
2023
Keyphrases
Publications
2023
Sándor P. Fekete
,
Dominik Krupke
,
Michael Perk
,
Christian Rieck
,
Christian Scheffer
A Closer Cut: Computing Near-Optimal Lawn Mowing Tours.
ALENEX
(2023)
Daniel Allendorf
,
Ulrich Meyer
,
Manuel Penschuck
,
Hung Tran
Parallel and I/O-Efficient Algorithms for Non-Linear Preferential Attachment.
ALENEX
(2023)
Florian Stober
,
Armin Weiß
Lower Bounds for Sorting 16, 17, and 18 Elements.
ALENEX
(2023)
William Cawley Gelling
,
Markus E. Nebel
,
Benjamin Smith
,
Sebastian Wild
Multiway Powersort.
ALENEX
(2023)
Aaron Hong
,
Massimiliano Rossi
,
Christina Boucher
LZ77 via Prefix-Free Parsing.
ALENEX
(2023)
Brian Wheatman
,
Randal C. Burns
,
Aydin Buluç
,
Helen Xu
Optimizing Search Layouts in Packed Memory Arrays.
ALENEX
(2023)
Rajan Shankar
,
Jonathan Spreer
A Uniform Sampling Procedure for Abstract Triangulations of Surfaces.
ALENEX
(2023)
Ángel Javier Alonso
,
Michael Kerber
,
Siddharth Pritam
Filtration-Domination in Bifiltered Graphs.
ALENEX
(2023)
Rafael Kiesel
,
André Schidler
A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets.
ALENEX
(2023)
Hans-Peter Lehmann
,
Peter Sanders
,
Stefan Walzer
SicHash - Small Irregular Cuckoo Tables for Perfect Hashing.
ALENEX
(2023)
Fabrice Lécuyer
,
Louis Jachiet
,
Clémence Magnien
,
Lionel Tabourier
Tailored vertex ordering for faster triangle listing in large graphs.
ALENEX
(2023)
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2023, Florence, Italy, January 22-23, 2023
ALENEX
(2023)
Ivan Khomutovskiy
,
Rebekka Dunker
,
Jessica Dierking
,
Julian Egbert
,
Christian Helms
,
Finn Schöllkopf
,
Katrin Casel
,
Philipp Fischbeck
,
Tobias Friedrich
,
Davis Issac
,
Simon Krogmann
,
Pascal Lenzner
Applying Skeletons to Speed Up the Arc-Flags Routing Algorithm.
ALENEX
(2023)
Shion Fukuzawa
,
Christopher Ho
,
Sandy Irani
,
Jasen Zion
Modified Iterative Quantum Amplitude Estimation is Asymptotically Optimal.
ALENEX
(2023)
Maximilian Böther
,
Otto Kißig
,
Christopher Weyand
Efficiently Computing Directed Minimum Spanning Trees.
ALENEX
(2023)
Timon Behr
,
Sabine Storandt
Lossy Reduction Rules for the Directed Feedback Vertex Set Problem.
ALENEX
(2023)
Adil Chhabra
,
Marcelo Fonseca Faraj
,
Christian Schulz
Local Motif Clustering via (Hyper)Graph Partitioning.
ALENEX
(2023)
Florian Kurpicz
,
Hans-Peter Lehmann
,
Peter Sanders
PaCHash: Packed and Compressed Hash Tables.
ALENEX
(2023)
2022
Jonas Charfreitag
,
Michael Jünger
,
Sven Mallach
,
Petra Mutzel
McSparse: Exact Solutions of Sparse Maximum Cut and Sparse Unconstrained Binary Quadratic Optimization Problems.
ALENEX
(2022)
Emil Biju
,
Sundar Raman P.
Perturbation Analysis of Practical Algorithms for the Maximum Scatter Travelling Salesman Problem.
ALENEX
(2022)
David Coudert
,
André Nusser
,
Laurent Viennot
Computing Graph Hyperbolicity Using Dominating Sets.
ALENEX
(2022)
Moritz Potthoff
,
Jonas Sauer
Fast Multimodal Journey Planning for Three Criteria.
ALENEX
(2022)
Daniel Bahrdt
,
Stefan Funke
,
Sokol Makolli
,
Claudius Proissl
Distance Closures: Unifying Search- and Lookup-based Shortest Path Speedup Techniques.
ALENEX
(2022)
Monika Henzinger
,
Alexander Noe
,
Christian Schulz
Practical Fully Dynamic Minimum Cut Algorithms.
ALENEX
(2022)
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2022, Alexandria, VA, USA, January 9-10, 2022
ALENEX
(2022)
Daniel Allendorf
,
Ulrich Meyer
,
Manuel Penschuck
,
Hung Tran
,
Nick Wormald
Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence.
ALENEX
(2022)
Guy E. Blelloch
,
Magdalen Dobson
Parallel Nearest Neighbors in Low Dimensions with Batch Updates.
ALENEX
(2022)
Tamal K. Dey
,
Simon Zhang
Approximating 1-Wasserstein Distance between Persistence Diagrams by Graph Sparsification.
ALENEX
(2022)
Sebastian Berndt
,
Max A. Deppert
,
Klaus Jansen
,
Lars Rohwedder
Load Balancing: The Long Road from Theory to Practice.
ALENEX
(2022)
André Schidler
,
Stefan Szeider
A SAT Approach to Twin-Width.
ALENEX
(2022)
Front Matter.
ALENEX
(2022)
Thomas Bläsius
,
Tobias Friedrich
,
David Stangl
,
Christopher Weyand
An Efficient Branch-and-Bound Solver for Hitting Set.
ALENEX
(2022)
Darren Strash
,
Louise Thompson
Effective Data Reduction for the Vertex Clique Cover Problem.
ALENEX
(2022)
Leszek Gasieniec
,
Benjamin Smith
,
Sebastian Wild
Towards the 5/6-Density Conjecture of Pinwheel Scheduling.
ALENEX
(2022)
Lars Gottesbüren
,
Tobias Heuer
,
Peter Sanders
,
Sebastian Schlag
Shared-Memory n-level Hypergraph Partitioning.
ALENEX
(2022)
Yifan Xu
,
Anchengcheng Zhou
,
Grace Q. Yin
,
Kunal Agrawal
,
I-Ting Angelina Lee
,
Tao B. Schardl
Efficient Access History for Race Detection.
ALENEX
(2022)
Dena Tayebi
,
Saurabh Ray
,
Deepak Ajwani
-median and Related Problems.
ALENEX
(2022)
2021
Loukas Georgiadis
,
Dionysios Kefallinos
,
Luigi Laura
,
Nikos Parotsidis
An Experimental Study of Algorithms for Computing the Edge Connectivity of a Directed Graph.
ALENEX
(2021)
Antonio Boffa
,
Paolo Ferragina
,
Giorgio Vinciguerra
A "Learned" Approach to Quicken and Compress Rank/Select Dictionaries.
ALENEX
(2021)
Markus Anders
,
Pascal Schweitzer
Engineering a Fast Probabilistic Isomorphism Test.
ALENEX
(2021)
Eugenio Angriman
,
Ruben Becker
,
Gianlorenzo D'Angelo
,
Hugo Gilbert
,
Alexander van der Grinten
,
Henning Meyerhenke
Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering.
ALENEX
(2021)
Gramoz Goranci
,
Monika Henzinger
,
Dariusz Leniowski
,
Christian Schulz
,
Alexander Svozil
-Center Clustering in Low Dimensional Metrics.
ALENEX
(2021)
Alexander Gellner
,
Sebastian Lamm
,
Christian Schulz
,
Darren Strash
,
Bogdán Zaválnij
Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations.
ALENEX
(2021)
Michael Kerber
,
Alexander Rolle
Fast Minimal Presentations of Bi-graded Persistence Modules.
ALENEX
(2021)
Clément Maria
,
Owen Rouillé
Computation of Large Asymptotics of 3-Manifold Quantum Invariants.
ALENEX
(2021)
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2021, Virtual Conference, January 10-11, 2021
ALENEX
(2021)
Brian Wheatman
,
Helen Xu
A Parallel Packed Memory Array to Store Dynamic Graphs.
ALENEX
(2021)
Lars Gottesbüren
,
Tobias Heuer
,
Peter Sanders
,
Sebastian Schlag
Scalable Shared-Memory Hypergraph Partitioning.
ALENEX
(2021)
Rick Plachetta
,
Alexander van der Grinten
SAT-and-Reduce for Vertex Cover: Accelerating Branch-and-Reduce by SAT Solving.
ALENEX
(2021)
Valentin Buchhold
,
Peter Sanders
,
Dorothea Wagner
Fast, Exact and Scalable Dynamic Ridesharing.
ALENEX
(2021)