ALENEX A

18 papers

YearTitle / Authors
2023A Closer Cut: Computing Near-Optimal Lawn Mowing Tours.
Sándor P. Fekete, Dominik Krupke, Michael Perk, Christian Rieck, Christian Scheffer
2023A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets.
Rafael Kiesel, André Schidler
2023A Uniform Sampling Procedure for Abstract Triangulations of Surfaces.
Rajan Shankar, Jonathan Spreer
2023Applying Skeletons to Speed Up the Arc-Flags Routing Algorithm.
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
2023Efficiently Computing Directed Minimum Spanning Trees.
Maximilian Böther, Otto Kißig, Christopher Weyand
2023Filtration-Domination in Bifiltered Graphs.
Ángel Javier Alonso, Michael Kerber, Siddharth Pritam
2023LZ77 via Prefix-Free Parsing.
Aaron Hong, Massimiliano Rossi, Christina Boucher
2023Local Motif Clustering via (Hyper)Graph Partitioning.
Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz
2023Lossy Reduction Rules for the Directed Feedback Vertex Set Problem.
Timon Behr, Sabine Storandt
2023Lower Bounds for Sorting 16, 17, and 18 Elements.
Florian Stober, Armin Weiß
2023Modified Iterative Quantum Amplitude Estimation is Asymptotically Optimal.
Shion Fukuzawa, Christopher Ho, Sandy Irani, Jasen Zion
2023Multiway Powersort.
William Cawley Gelling, Markus E. Nebel, Benjamin Smith, Sebastian Wild
2023Optimizing Search Layouts in Packed Memory Arrays.
Brian Wheatman, Randal C. Burns, Aydin Buluç, Helen Xu
2023PaCHash: Packed and Compressed Hash Tables.
Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders
2023Parallel and I/O-Efficient Algorithms for Non-Linear Preferential Attachment.
Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran
2023Proceedings of the 25th Symposium on Algorithm Engineering and Experiments, ALENEX 2023, Florence, Italy, January 22-23, 2023
Gonzalo Navarro, Julian Shun
2023SicHash - Small Irregular Cuckoo Tables for Perfect Hashing.
Hans-Peter Lehmann, Peter Sanders, Stefan Walzer
2023Tailored vertex ordering for faster triangle listing in large graphs.
Fabrice Lécuyer, Louis Jachiet, Clémence Magnien, Lionel Tabourier