default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Journal of Experimental Algorithmics, Volume 24
Volume 24, Number 1, December 2019
- Christos D. Zaroliagis
:
Editorial - ESA 2016 Special Issue. 1.1:1-1.1:2 - Michele Borassi, Emanuele Natale:
KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation. 1.2:1-1.2:35 - Juha Kärkkäinen, Dominik Kempa:
Better External Memory LCP Array Construction. 1.3:1-1.3:27 - Stefan Edelkamp, Armin Weiß:
BlockQuicksort: Avoiding Branch Mispredictions in Quicksort. 1.4:1-1.4:22 - Tamal K. Dey, Dayu Shi, Yusu Wang:
SimBa: An Efficient Tool for Approximating Rips-filtration Persistence via Simplicial Batch Collapse. 1.5:1-1.5:16
- Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni:
Fully Dynamic 2-Hop Cover Labeling. 1.6:1-1.6:36 - Stephan Beyer, Markus Chimani:
Strong Steiner Tree Approximations in Practice. 1.7:1-1.7:33 - Domenico Cantone, Simone Faro, Arianna Pavone:
Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition. 1.8:1-1.8:20 - Tuukka Korhonen, Jeremias Berg, Matti Järvisalo:
Solving Graph Problems via Potential Maximal Cliques: An Experimental Evaluation of the Bouchitté-Todinca Algorithm. 1.9:1-1.9:19 - Harry A. Levin, Sorelle A. Friedler:
Automated Congressional Redistricting. 1.10:1-1.10:24 - Andreas Björklund, Brajesh Gupt, Nicolás Quesada:
A Faster Hafnian Formula for Complex Matrices and Its Benchmarking on a Supercomputer. 1.11:1-1.11:17 - Marcel Radermacher, Klara Reichard, Ignaz Rutter, Dorothea Wagner:
Geometric Heuristics for Rectilinear Crossing Minimization. 1.12:1-1.12:21 - Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher:
Listing All Maximal k-Plexes in Temporal Graphs. 1.13:1-1.13:27 - Leonid Barenboim, Tzalik Maimon:
Fully Dynamic Graph Algorithms Inspired by Distributed Computing: Deterministic Maximal Matching and Edge Coloring in Sublinear Update-Time. 1.14:1-1.14:24 - Stoicho D. Stoichev:
New Exact and Heuristic Algorithms for Graph Automorphism Group and Graph Isomorphism. 1.15:1-1.15:27 - Demian Hespe, Christian Schulz, Darren Strash:
Scalable Kernelization for Maximum Independent Sets. 1.16:1-1.16:22 - Frédéric Cazals, Dorian Mazauric, Romain Tetley, Rémi Watrigant:
Comparing Two Clusterings Using Matchings between Clusters of Clusters. 1.17:1-1.17:41 - Moritz Baum, Valentin Buchhold, Julian Dibbelt, Dorothea Wagner:
Fast Exact Computation of Isocontours in Road Networks. 1.18:1-1.18:26
- Gianlorenzo D'Angelo:
Introduction to the Special Issue SEA 2018. 2.1e:1-2.1e:2 - Markus Chimani, Ivo Hedtke, Tilo Wiedera:
Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments. 2.1:1-2.1:21 - Katerina Altmanová, Dusan Knop, Martin Koutecký:
Evaluating and Tuning n-fold Integer Programming. 2.2:1-2.2:22 - Tobias Heuer, Peter Sanders, Sebastian Schlag:
Network Flow-Based Refinement for Multilevel Hypergraph Partitioning. 2.3:1-2.3:36 - Valentin Buchhold, Peter Sanders, Dorothea Wagner:
Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies. 2.4:1-2.4:28 - Abu Reyan Ahmed, Patrizio Angelini, Faryad Darabi Sahneh, Alon Efrat, David Glickenstein, Martin Gronemann, Niklas Heinsohn, Stephen G. Kobourov, Richard Spence, Joseph Watkins, Alexander Wolff:
Multi-level Steiner Trees. 2.5:1-2.5:22 - Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, Sebastian Siebertz:
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness. 2.6:1-2.6:34 - Michal Ziobro, Marcin Pilipczuk:
Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation. 2.7:1-2.7:18
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-01-06 23:21 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:
