Login / Signup
ALENEX
1999
2009
2014
2024
1999
2024
Keyphrases
Publications
2024
Kathrin Hanauer
,
Martin P. Seybold
,
Julian Unterweger
Covering Rectilinear Polygons with Area-Weighted Rectangles.
ALENEX
(2024)
Benjamin Aram Berendsohn
Fast and simple unrooted dynamic forests.
ALENEX
(2024)
Nikolai Maas
,
Lars Gottesbüren
,
Daniel Seemaier
Parallel Unconstrained Local Search for Partitioning Irregular Graphs.
ALENEX
(2024)
Dominik Krupke
Near-Optimal Coverage Path Planning with Turn Costs.
ALENEX
(2024)
Emil Toftegaard Gæde
,
Inge Li Gørtz
,
Ivor van der Hoog
,
Christoffer Krogh
,
Eva Rotenberg
Simple and Robust Dynamic Two-Dimensional Convex Hull.
ALENEX
(2024)
Felix Weitbrecht
Interactive Exploration of the Temporal α-Shape.
ALENEX
(2024)
Loukas Georgiadis
,
Evangelos Kosinas
,
Daniel Tsokaktsis
2-Fault-Tolerant Strong Connectivity Oracles.
ALENEX
(2024)
Tobias Heuer
Way Hypergraph Partitioning Algorithm for Optimizing the Steiner Tree Metric.
ALENEX
(2024)
Monika Henzinger
,
David Saulpic
,
Leonhard Sidl
-Means via Coresets.
ALENEX
(2024)
Dominik Bez
,
Jonas Sauer
Fast and Delay-Robust Multimodal Journey Planning.
ALENEX
(2024)
Gill Barequet
,
Gil Ben-Shachar
Counting Polyominoes, Revisited.
ALENEX
(2024)
Hans-Peter Lehmann
,
Peter Sanders
,
Stefan Walzer
ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force.
ALENEX
(2024)
Pattara Sukprasert
,
Quanquan C. Liu
,
Laxman Dhulipala
,
Julian Shun
Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs.
ALENEX
(2024)
Daniel Allendorf
Maintaining Discrete Probability Distributions in Practice.
ALENEX
(2024)
Olivier Bernard
,
Pierre-Alain Fouque
,
Andrea Lesavourey
-th roots in number fields.
ALENEX
(2024)
Moritz Laupichler
,
Peter Sanders
Fast Many-to-Many Routing for Dynamic Taxi Sharing with Meeting Points.
ALENEX
(2024)
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2024, Alexandria, VA, USA, January 7-8, 2024
ALENEX
(2024)
Simon D. Fink
,
Ignaz Rutter
Constrained Planarity in Practice: Engineering the Synchronized Planarity Algorithm.
ALENEX
(2024)
2023
Shion Fukuzawa
,
Christopher Ho
,
Sandy Irani
,
Jasen Zion
Modified Iterative Quantum Amplitude Estimation is Asymptotically Optimal.
ALENEX
(2023)
Brian Wheatman
,
Randal C. Burns
,
Aydin Buluç
,
Helen Xu
Optimizing Search Layouts in Packed Memory Arrays.
ALENEX
(2023)
Daniel Allendorf
,
Ulrich Meyer
,
Manuel Penschuck
,
Hung Tran
Parallel and I/O-Efficient Algorithms for Non-Linear Preferential Attachment.
ALENEX
(2023)
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2023, Florence, Italy, January 22-23, 2023
ALENEX
(2023)
Florian Stober
,
Armin Weiß
Lower Bounds for Sorting 16, 17, and 18 Elements.
ALENEX
(2023)
Maximilian Böther
,
Otto Kißig
,
Christopher Weyand
Efficiently Computing Directed Minimum Spanning Trees.
ALENEX
(2023)
William Cawley Gelling
,
Markus E. Nebel
,
Benjamin Smith
,
Sebastian Wild
Multiway Powersort.
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)
Rajan Shankar
,
Jonathan Spreer
A Uniform Sampling Procedure for Abstract Triangulations of Surfaces.
ALENEX
(2023)
Sándor P. Fekete
,
Dominik Krupke
,
Michael Perk
,
Christian Rieck
,
Christian Scheffer
A Closer Cut: Computing Near-Optimal Lawn Mowing Tours.
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)
Fabrice Lécuyer
,
Louis Jachiet
,
Clémence Magnien
,
Lionel Tabourier
Tailored vertex ordering for faster triangle listing in large graphs.
ALENEX
(2023)
Hans-Peter Lehmann
,
Peter Sanders
,
Stefan Walzer
SicHash - Small Irregular Cuckoo Tables for Perfect Hashing.
ALENEX
(2023)
Aaron Hong
,
Massimiliano Rossi
,
Christina Boucher
LZ77 via Prefix-Free Parsing.
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)
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)
David Coudert
,
André Nusser
,
Laurent Viennot
Computing Graph Hyperbolicity Using Dominating Sets.
ALENEX
(2022)
Monika Henzinger
,
Alexander Noe
,
Christian Schulz
Practical Fully Dynamic Minimum Cut Algorithms.
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)
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)
Guy E. Blelloch
,
Magdalen Dobson
Parallel Nearest Neighbors in Low Dimensions with Batch Updates.
ALENEX
(2022)
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2022, Alexandria, VA, USA, January 9-10, 2022
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)