default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Journal of Experimental Algorithmics, Volume 27
Volume 27, December 2022
- Marcelo Vaz Netto, Sahudy Montenegro González
:
SSLC: A Search Algorithm Based on Linear Collisions and Poisson Probability Distribution. 1.4:1-1.4:15 - Thomas Mueller Graf, Daniel Lemire:
Binary Fuse Filters: Fast and Smaller Than Xor Filters. 1.5:1-1.5:15
- Natanael Ramos, Raí C. de Jesus, Pedro J. de Rezende, Cid C. de Souza, Fábio Luiz Usberti:
Triangle-Based Heuristics for Area Optimal Polygonizations. 2.1:1-2.1:25 - Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard:
Greedy and Local Search Heuristics to Build Area-Optimal Polygons. 2.2:1-2.2:11 - Nir Goren, Efi Fogel, Dan Halperin:
Area Optimal Polygonization Using Simulated Annealing. 2.3:1-2.3:17 - Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Joseph S. B. Mitchell:
Area-Optimal Simple Polygonalizations: The CG Challenge 2019. 2.4:1-2.4:12 - Sándor P. Fekete, Andreas Haas, Phillip Keldenich, Michael Perk, Arne Schmidt:
Computing Area-Optimal Simple Polygonizations. 2.6:1-2.6:23 - Günther Eder, Martin Held, Steinþór Jasonarson, Philipp Mayer, Peter Palfrader:
2-Opt Moves and Flips for Area-optimal Polygonizations. 2.7:1-2.7:12 - Martin Grötschel, Michael Jünger, Gerhard Reinelt:
Comments on "An Exact Method for the Minimum Feedback Arc Set Problem". 1.3:1-1.3:4 - Eugenio Angriman, Michal Boron, Henning Meyerhenke:
A Batch-dynamic Suitor Algorithm for Approximating Maximum Weighted Matching. 1.6:1-1.6:41 - Alexander van der Grinten, Elisabetta Bergamini, Oded Green, David A. Bader, Henning Meyerhenke:
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs. 1.7:1-1.7:16 - Sujoy Bhore, Guangping Li, Martin Nöllenburg:
An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling. 1.8:1-1.8:36
- Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Joseph S. B. Mitchell:
Computing Coordinated Motion Plans for Robot Swarms: The CG: SHOP Challenge 2021. 3.1:1-3.1:12 - Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso:
Shadoks Approach to Low-Makespan Coordinated Motion Planning. 3.2:1-3.2:17 - Hyeyun Yang, Antoine Vigneron:
Coordinated Path Planning through Local Search and Simulated Annealing. 3.3:1-3.3:14 - Paul Liu, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng:
Coordinated Motion Planning Through Randomized k-Opt. 3.4:1-3.4:9 - Daniel Saad Nogueira Nunes, Felipe A. Louza, Simon Gog, Mauricio Ayala-Rincón, Gonzalo Navarro:
Grammar Compression by Induced Suffix Sorting. 1.1:1-1.1:33 - Abdurrahman Yasar, Muhammed Fatih Balin, Xiaojing An, Kaan Sancak, Ümit V. Çatalyürek:
On Symmetric Rectilinear Partitioning. 1.2:1-1.2:26 - Marcelo Fonseca Faraj, Christian Schulz:
Buffered Streaming Graph Partitioning. 1.10:1-1.10:26
- Jessica Shi, Louisa Ruixue Huang, Julian Shun:
Parallel Five-cycle Counting Algorithms. 4.1:1-4.1:23 - Kathrin Hanauer, Christian Schulz, Jonathan Trummer:
O'Reach: Even Faster Reachability in Large Graphs. 4.2:1-4.2:27 - Kathrin Hanauer, Monika Henzinger, Christian Schulz:
Recent Advances in Fully Dynamic Graph Algorithms - A Quick Reference Guide. 1.11:1-1.11:45 - Xu T. Liu, Andrew Lumsdaine, Mahantesh Halappanavar, Kevin J. Barker, Assefaw Hadish Gebremedhin:
Direction-optimizing Label Propagation Framework for Structure Detection in Graphs: Design, Implementation, and Experimental Analysis. 1.12:1-1.12:31 - Jules Bertrand, Fanny Dufossé, Somesh Singh, Bora Uçar:
Algorithms and Data Structures for Hyperedge Queries. 1.13:1-1.13:23 - Jan-Hendrik Lorenz, Florian Wörz:
Toward an Understanding of Long-tailed Runtimes of SLS Algorithms. 1.14:1-1.14:38 - David Coudert, André Nusser, Laurent Viennot:
Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation. 1.15:1-1.15:29 - Marco Calamai, Pierluigi Crescenzi, Andrea Marino:
On Computing the Diameter of (Weighted) Link Streams. 4.3:1-4.3:28 - Max Franck, Sorrachai Yingchareonthawornchai:
Engineering Nearly Linear-time Algorithms for Small Vertex Connectivity. 4.4:1-4.4:29 - Kevin Buchin, Alexander Hill, Sándor P. Fekete, Linda Kleist, Irina Kostitsyna, Dominik Krupke, Roel Lambers, Martijn Struijs:
Minimum Scan Cover and Variants: Theory and Experiments. 4.5:1-4.5:28 - Sebastian Schlag, Tobias Heuer, Lars Gottesbüren, Yaroslav Akhremtsev, Christian Schulz, Peter Sanders:
High-Quality Hypergraph Partitioning. 1.9:1-1.9:39 - Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus:
Incremental Updates of Generalized Hypertree Decompositions. 1.16:1-1.16:28 - Ben Strasser, Tim Zeitz:
Using Incremental Many-to-One Queries to Build a Fast and Tight Heuristic for A* in Road Networks. 1-28 - Julien Lepagnot, Laurent Moalic, Dominique Schmitt:
Optimal Area Polygonization by Triangulation and Visibility Search. 1-23
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 2026-05-18 00:10 CEST 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:
