ALENEX A

20 papers

YearTitle / Authors
2018A Generic Framework for Engineering Graph Canonization Algorithms.
Jakob L. Andersen, Daniel Merkle
2018A Geometric Heuristic for Rectilinear Crossing Minimization.
Marcel Radermacher, Klara Reichard, Ignaz Rutter, Dorothea Wagner
2018A practical fpt algorithm for Flow Decomposition and transcript assembly.
Kyle Kloster, Philipp Kuinke, Michael P. O'Brien, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan, Andrew van der Poel
2018Adaptive Cuckoo Filters.
Michael Mitzenmacher, Salvatore Pontarelli, Pedro Reviriego
2018Area-Preserving Subdivision Simplification with Topology Constraints: Exactly and in Practice.
Thomas Mendel
2018Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study.
Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Nikos Parotsidis, Nilakantha Paudel
2018Computing Floods Caused by Non-Uniform Sea-Level Rise.
Lars Arge, Yujin Shin, Constantinos Tsirogiannis
2018Computing Top-
Patrick Bisenius, Elisabetta Bergamini, Eugenio Angriman, Henning Meyerhenke
2018Engineering a Delegatable and Error-Tolerant Algorithm for Counting Small Subgraphs.
Petteri Kaski
2018Faster Approximation Algorithm for the
Nirman Kumar, Stavros Sintos
2018Grid peeling and the affine curve-shortening flow.
David Eppstein, Sariel Har-Peled, Gabriel Nivasch
2018Hybrid Indexing Revisited.
Héctor Ferrada, Dominik Kempa, Simon J. Puglisi
2018Hyperbolic Embeddings for Near-Optimal Greedy Routing.
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer
2018Linear Time Canonicalization and Enumeration of Non-Isomorphic 1-Face Embeddings.
Marc Hellmuth, Anders S. Knudsen, Michal Kotrbcík, Daniel Merkle, Nikolai Nøjgaard
2018Practical Minimum Cut Algorithms.
Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash
2018Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, New Orleans, LA, USA, January 7-8, 2018.
Rasmus Pagh, Suresh Venkatasubramanian
2018Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data.
Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson
2018Scalable Kernelization for Maximum Independent Sets.
Demian Hespe, Christian Schulz, Darren Strash
2018Scaling up Group Closeness Maximization.
Elisabetta Bergamini, Tanya Gonser, Henning Meyerhenke
2018Simple, Fast and Lightweight Parallel Wavelet Tree Construction.
Johannes Fischer, Florian Kurpicz, Marvin Löbel